/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 11:14:44,702 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 11:14:44,705 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 11:14:44,748 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 11:14:44,748 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 11:14:44,758 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 11:14:44,760 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 11:14:44,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 11:14:44,767 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 11:14:44,770 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 11:14:44,771 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 11:14:44,772 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 11:14:44,772 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 11:14:44,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 11:14:44,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 11:14:44,781 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 11:14:44,782 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 11:14:44,783 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 11:14:44,785 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 11:14:44,794 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 11:14:44,798 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 11:14:44,799 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 11:14:44,800 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 11:14:44,801 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 11:14:44,804 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 11:14:44,804 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 11:14:44,805 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 11:14:44,806 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 11:14:44,809 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 11:14:44,810 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 11:14:44,811 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 11:14:44,814 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 11:14:44,815 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 11:14:44,815 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 11:14:44,816 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 11:14:44,819 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 11:14:44,820 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 11:14:44,820 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 11:14:44,821 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 11:14:44,821 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 11:14:44,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 11:14:44,824 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-16 11:14:44,866 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 11:14:44,866 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 11:14:44,868 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 11:14:44,869 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 11:14:44,869 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 11:14:44,869 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 11:14:44,870 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 11:14:44,870 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 11:14:44,870 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 11:14:44,870 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 11:14:44,871 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 11:14:44,871 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 11:14:44,872 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 11:14:44,872 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 11:14:44,872 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 11:14:44,873 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 11:14:44,873 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 11:14:44,873 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 11:14:44,873 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 11:14:44,873 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 11:14:44,874 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 11:14:44,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 11:14:44,874 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 11:14:44,874 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 11:14:44,874 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 11:14:44,875 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 11:14:44,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 11:14:44,875 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 11:14:44,875 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-16 11:14:44,875 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 11:14:45,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 11:14:45,243 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 11:14:45,247 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 11:14:45,248 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 11:14:45,249 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 11:14:45,250 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_rmo.opt.i [2020-10-16 11:14:45,319 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/abcdc2b7e/5743101f90854f9fb4c0f3f80f1ed31e/FLAG0d49e89a7 [2020-10-16 11:14:45,931 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 11:14:45,931 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix057_rmo.opt.i [2020-10-16 11:14:45,946 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/abcdc2b7e/5743101f90854f9fb4c0f3f80f1ed31e/FLAG0d49e89a7 [2020-10-16 11:14:46,146 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/abcdc2b7e/5743101f90854f9fb4c0f3f80f1ed31e [2020-10-16 11:14:46,158 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 11:14:46,160 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 11:14:46,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 11:14:46,161 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 11:14:46,165 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 11:14:46,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:14:46" (1/1) ... [2020-10-16 11:14:46,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ec1e5e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:14:46, skipping insertion in model container [2020-10-16 11:14:46,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:14:46" (1/1) ... [2020-10-16 11:14:46,179 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 11:14:46,224 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 11:14:46,840 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 11:14:46,863 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 11:14:46,921 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 11:14:47,006 INFO L208 MainTranslator]: Completed translation [2020-10-16 11:14:47,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:14:47 WrapperNode [2020-10-16 11:14:47,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 11:14:47,007 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 11:14:47,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 11:14:47,008 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 11:14:47,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:14:47" (1/1) ... [2020-10-16 11:14:47,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:14:47" (1/1) ... [2020-10-16 11:14:47,076 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 11:14:47,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 11:14:47,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 11:14:47,077 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 11:14:47,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:14:47" (1/1) ... [2020-10-16 11:14:47,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:14:47" (1/1) ... [2020-10-16 11:14:47,092 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:14:47" (1/1) ... [2020-10-16 11:14:47,093 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:14:47" (1/1) ... [2020-10-16 11:14:47,103 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:14:47" (1/1) ... [2020-10-16 11:14:47,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:14:47" (1/1) ... [2020-10-16 11:14:47,110 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:14:47" (1/1) ... [2020-10-16 11:14:47,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 11:14:47,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 11:14:47,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 11:14:47,118 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 11:14:47,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:14:47" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-16 11:14:47,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 11:14:47,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 11:14:47,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 11:14:47,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 11:14:47,192 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 11:14:47,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 11:14:47,192 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 11:14:47,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 11:14:47,193 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 11:14:47,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 11:14:47,193 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 11:14:47,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 11:14:47,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 11:14:47,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 11:14:47,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 11:14:47,196 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 11:14:49,235 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 11:14:49,235 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 11:14:49,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:14:49 BoogieIcfgContainer [2020-10-16 11:14:49,238 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 11:14:49,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 11:14:49,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 11:14:49,243 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 11:14:49,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:14:46" (1/3) ... [2020-10-16 11:14:49,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14196627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:14:49, skipping insertion in model container [2020-10-16 11:14:49,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:14:47" (2/3) ... [2020-10-16 11:14:49,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14196627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:14:49, skipping insertion in model container [2020-10-16 11:14:49,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:14:49" (3/3) ... [2020-10-16 11:14:49,247 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_rmo.opt.i [2020-10-16 11:14:49,259 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 11:14:49,260 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 11:14:49,268 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 11:14:49,269 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 11:14:49,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,301 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,301 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,303 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,303 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,304 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,304 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,304 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,304 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,304 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,305 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,305 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,305 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,305 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,305 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,305 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,306 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,306 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,307 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,307 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,307 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,308 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,308 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,308 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,311 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,311 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,315 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,315 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,315 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,317 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,319 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,320 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,320 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,320 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,320 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,320 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,321 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,321 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,321 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,321 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,322 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,323 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,324 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,324 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,324 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,326 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,326 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:14:49,328 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 11:14:49,342 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 11:14:49,363 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 11:14:49,363 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 11:14:49,363 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 11:14:49,363 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 11:14:49,364 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 11:14:49,364 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 11:14:49,364 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 11:14:49,364 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 11:14:49,378 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 11:14:49,381 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 107 transitions, 234 flow [2020-10-16 11:14:49,384 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 107 transitions, 234 flow [2020-10-16 11:14:49,386 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 107 transitions, 234 flow [2020-10-16 11:14:49,438 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2020-10-16 11:14:49,438 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 11:14:49,444 INFO L80 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2020-10-16 11:14:49,448 INFO L117 LiptonReduction]: Number of co-enabled transitions 2352 [2020-10-16 11:14:49,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:49,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:49,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:49,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:49,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:49,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:49,589 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:49,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:49,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:49,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:49,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:49,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:49,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:49,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:49,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:49,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:49,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 11:14:49,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:49,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 11:14:49,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:49,876 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 11:14:49,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:49,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 11:14:49,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:51,091 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-16 11:14:51,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-16 11:14:51,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:51,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 11:14:51,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:52,365 WARN L193 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-16 11:14:52,447 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 11:14:52,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:52,512 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:52,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:52,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:52,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:52,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:52,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:52,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:52,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:52,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:52,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:52,562 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:52,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:52,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:52,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:52,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:52,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:52,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:52,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:52,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:52,704 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:52,707 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:52,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:52,710 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:52,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:52,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:52,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:52,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:52,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:52,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:52,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:52,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:14:52,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:14:52,989 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-16 11:14:53,375 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 11:14:53,488 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 11:14:53,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 11:14:53,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:53,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 11:14:53,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:53,662 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:53,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:53,663 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:53,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:53,666 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 11:14:53,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:53,667 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 11:14:53,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:53,670 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 11:14:53,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:53,673 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 11:14:53,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:53,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 11:14:53,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:53,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 11:14:53,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:14:53,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 11:14:53,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:54,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 11:14:54,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:54,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 11:14:54,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:54,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:54,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:54,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:54,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:54,301 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 11:14:54,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:54,303 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 11:14:54,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:54,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 11:14:54,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:54,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 11:14:54,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:54,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 11:14:54,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:54,342 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 11:14:54,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:14:54,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 11:14:54,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:54,925 WARN L193 SmtUtils]: Spent 403.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-16 11:14:55,365 WARN L193 SmtUtils]: Spent 437.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-16 11:14:55,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 11:14:55,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:14:55,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 11:14:55,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:55,440 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 11:14:55,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:55,441 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 11:14:55,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:55,443 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:55,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:55,444 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:55,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:55,446 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 11:14:55,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:55,449 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 11:14:55,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:55,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 11:14:55,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:55,452 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 11:14:55,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:55,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 11:14:55,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:55,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 11:14:55,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:14:55,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 11:14:55,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:55,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 11:14:55,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:55,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 11:14:55,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:55,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:55,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:55,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:55,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:55,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 11:14:55,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:55,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 11:14:55,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:55,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 11:14:55,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:55,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 11:14:55,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:55,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 11:14:55,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:55,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 11:14:55,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:57,151 WARN L193 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 138 DAG size of output: 129 [2020-10-16 11:14:57,453 WARN L193 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-16 11:14:58,324 WARN L193 SmtUtils]: Spent 869.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2020-10-16 11:14:58,661 WARN L193 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-16 11:14:58,722 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 11:14:58,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:58,802 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 11:14:58,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:14:58,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 11:14:58,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:58,825 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 11:14:58,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:58,826 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 11:14:58,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:58,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:58,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:58,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:58,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:58,831 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 11:14:58,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:58,832 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 11:14:58,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:58,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 11:14:58,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:58,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 11:14:58,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:58,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 11:14:58,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:58,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 11:14:58,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:58,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 11:14:58,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:58,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:58,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:58,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:14:58,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:14:58,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 11:14:58,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:58,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 11:14:58,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:58,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 11:14:58,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:58,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 11:14:58,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:58,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 11:14:58,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:14:58,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 11:14:58,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:14:58,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 11:14:58,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:00,340 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 134 DAG size of output: 133 [2020-10-16 11:15:00,678 WARN L193 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2020-10-16 11:15:01,094 WARN L193 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2020-10-16 11:15:01,225 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-16 11:15:01,235 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:01,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:01,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:01,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:01,238 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:01,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:15:01,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:15:01,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:15:01,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:01,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:01,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:01,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:01,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:01,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:01,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:15:01,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:01,281 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:15:01,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:01,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:01,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:01,284 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:01,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:01,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:15:01,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:15:01,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:15:01,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:01,301 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:01,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:15:01,303 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:15:01,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:15:01,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:15:01,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:15:01,389 INFO L132 LiptonReduction]: Checked pairs total: 5626 [2020-10-16 11:15:01,389 INFO L134 LiptonReduction]: Total number of compositions: 86 [2020-10-16 11:15:01,397 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 31 transitions, 82 flow [2020-10-16 11:15:01,581 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2602 states. [2020-10-16 11:15:01,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states. [2020-10-16 11:15:01,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 11:15:01,593 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:01,594 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:15:01,595 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:01,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:01,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1680903237, now seen corresponding path program 1 times [2020-10-16 11:15:01,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:01,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87587309] [2020-10-16 11:15:01,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:01,890 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-16 11:15:01,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87587309] [2020-10-16 11:15:01,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:01,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 11:15:01,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731890205] [2020-10-16 11:15:01,899 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:15:01,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:01,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:15:01,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:15:01,920 INFO L87 Difference]: Start difference. First operand 2602 states. Second operand 3 states. [2020-10-16 11:15:02,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:02,073 INFO L93 Difference]: Finished difference Result 2202 states and 8424 transitions. [2020-10-16 11:15:02,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:15:02,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-16 11:15:02,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:02,112 INFO L225 Difference]: With dead ends: 2202 [2020-10-16 11:15:02,112 INFO L226 Difference]: Without dead ends: 1802 [2020-10-16 11:15:02,114 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:15:02,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2020-10-16 11:15:02,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2020-10-16 11:15:02,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2020-10-16 11:15:02,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 6784 transitions. [2020-10-16 11:15:02,264 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 6784 transitions. Word has length 9 [2020-10-16 11:15:02,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:02,265 INFO L481 AbstractCegarLoop]: Abstraction has 1802 states and 6784 transitions. [2020-10-16 11:15:02,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:15:02,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 6784 transitions. [2020-10-16 11:15:02,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 11:15:02,269 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:02,269 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:15:02,269 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 11:15:02,269 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:02,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:02,270 INFO L82 PathProgramCache]: Analyzing trace with hash 440307530, now seen corresponding path program 1 times [2020-10-16 11:15:02,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:02,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455308977] [2020-10-16 11:15:02,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:02,424 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-16 11:15:02,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455308977] [2020-10-16 11:15:02,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:02,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 11:15:02,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055587740] [2020-10-16 11:15:02,428 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:15:02,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:02,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:15:02,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:15:02,434 INFO L87 Difference]: Start difference. First operand 1802 states and 6784 transitions. Second operand 3 states. [2020-10-16 11:15:02,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:02,482 INFO L93 Difference]: Finished difference Result 1762 states and 6602 transitions. [2020-10-16 11:15:02,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:15:02,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-16 11:15:02,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:02,500 INFO L225 Difference]: With dead ends: 1762 [2020-10-16 11:15:02,500 INFO L226 Difference]: Without dead ends: 1762 [2020-10-16 11:15:02,501 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:15:02,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2020-10-16 11:15:02,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1762. [2020-10-16 11:15:02,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1762 states. [2020-10-16 11:15:02,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 6602 transitions. [2020-10-16 11:15:02,592 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 6602 transitions. Word has length 11 [2020-10-16 11:15:02,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:02,593 INFO L481 AbstractCegarLoop]: Abstraction has 1762 states and 6602 transitions. [2020-10-16 11:15:02,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:15:02,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 6602 transitions. [2020-10-16 11:15:02,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 11:15:02,601 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:02,601 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:15:02,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 11:15:02,601 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:02,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:02,602 INFO L82 PathProgramCache]: Analyzing trace with hash 249955351, now seen corresponding path program 1 times [2020-10-16 11:15:02,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:02,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597262911] [2020-10-16 11:15:02,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:02,747 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-16 11:15:02,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597262911] [2020-10-16 11:15:02,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:02,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 11:15:02,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756785380] [2020-10-16 11:15:02,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:15:02,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:02,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:15:02,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:15:02,756 INFO L87 Difference]: Start difference. First operand 1762 states and 6602 transitions. Second operand 3 states. [2020-10-16 11:15:02,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:02,796 INFO L93 Difference]: Finished difference Result 1722 states and 6420 transitions. [2020-10-16 11:15:02,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:15:02,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-16 11:15:02,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:02,876 INFO L225 Difference]: With dead ends: 1722 [2020-10-16 11:15:02,876 INFO L226 Difference]: Without dead ends: 1722 [2020-10-16 11:15:02,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:15:02,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2020-10-16 11:15:02,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1722. [2020-10-16 11:15:02,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1722 states. [2020-10-16 11:15:02,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 6420 transitions. [2020-10-16 11:15:02,964 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 6420 transitions. Word has length 12 [2020-10-16 11:15:02,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:02,964 INFO L481 AbstractCegarLoop]: Abstraction has 1722 states and 6420 transitions. [2020-10-16 11:15:02,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:15:02,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 6420 transitions. [2020-10-16 11:15:02,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 11:15:02,968 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:02,968 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:15:02,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 11:15:02,969 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:02,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:02,969 INFO L82 PathProgramCache]: Analyzing trace with hash -840938303, now seen corresponding path program 1 times [2020-10-16 11:15:02,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:02,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927372199] [2020-10-16 11:15:02,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:03,140 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-16 11:15:03,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927372199] [2020-10-16 11:15:03,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:03,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 11:15:03,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907721047] [2020-10-16 11:15:03,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:15:03,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:03,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:15:03,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:15:03,143 INFO L87 Difference]: Start difference. First operand 1722 states and 6420 transitions. Second operand 4 states. [2020-10-16 11:15:03,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:03,205 INFO L93 Difference]: Finished difference Result 1700 states and 6324 transitions. [2020-10-16 11:15:03,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:15:03,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-16 11:15:03,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:03,223 INFO L225 Difference]: With dead ends: 1700 [2020-10-16 11:15:03,223 INFO L226 Difference]: Without dead ends: 1700 [2020-10-16 11:15:03,224 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:15:03,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2020-10-16 11:15:03,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1700. [2020-10-16 11:15:03,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1700 states. [2020-10-16 11:15:03,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 6324 transitions. [2020-10-16 11:15:03,290 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 6324 transitions. Word has length 13 [2020-10-16 11:15:03,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:03,291 INFO L481 AbstractCegarLoop]: Abstraction has 1700 states and 6324 transitions. [2020-10-16 11:15:03,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:15:03,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 6324 transitions. [2020-10-16 11:15:03,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 11:15:03,293 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:03,293 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:15:03,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 11:15:03,293 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:03,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:03,294 INFO L82 PathProgramCache]: Analyzing trace with hash -333997007, now seen corresponding path program 1 times [2020-10-16 11:15:03,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:03,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553323731] [2020-10-16 11:15:03,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:03,439 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-16 11:15:03,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553323731] [2020-10-16 11:15:03,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:03,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:15:03,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31033025] [2020-10-16 11:15:03,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:15:03,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:03,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:15:03,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:15:03,442 INFO L87 Difference]: Start difference. First operand 1700 states and 6324 transitions. Second operand 5 states. [2020-10-16 11:15:03,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:03,551 INFO L93 Difference]: Finished difference Result 1686 states and 6262 transitions. [2020-10-16 11:15:03,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 11:15:03,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-16 11:15:03,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:03,567 INFO L225 Difference]: With dead ends: 1686 [2020-10-16 11:15:03,567 INFO L226 Difference]: Without dead ends: 1686 [2020-10-16 11:15:03,568 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:15:03,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2020-10-16 11:15:03,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1686. [2020-10-16 11:15:03,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1686 states. [2020-10-16 11:15:03,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 6262 transitions. [2020-10-16 11:15:03,645 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 6262 transitions. Word has length 14 [2020-10-16 11:15:03,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:03,645 INFO L481 AbstractCegarLoop]: Abstraction has 1686 states and 6262 transitions. [2020-10-16 11:15:03,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:15:03,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 6262 transitions. [2020-10-16 11:15:03,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 11:15:03,648 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:03,648 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:15:03,648 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 11:15:03,648 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:03,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:03,649 INFO L82 PathProgramCache]: Analyzing trace with hash -298426553, now seen corresponding path program 1 times [2020-10-16 11:15:03,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:03,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967131531] [2020-10-16 11:15:03,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:03,740 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-16 11:15:03,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967131531] [2020-10-16 11:15:03,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:03,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:15:03,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957121317] [2020-10-16 11:15:03,742 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:15:03,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:03,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:15:03,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:15:03,742 INFO L87 Difference]: Start difference. First operand 1686 states and 6262 transitions. Second operand 5 states. [2020-10-16 11:15:03,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:03,874 INFO L93 Difference]: Finished difference Result 1642 states and 6070 transitions. [2020-10-16 11:15:03,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 11:15:03,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-16 11:15:03,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:03,891 INFO L225 Difference]: With dead ends: 1642 [2020-10-16 11:15:03,891 INFO L226 Difference]: Without dead ends: 1642 [2020-10-16 11:15:03,892 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:15:03,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2020-10-16 11:15:03,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1642. [2020-10-16 11:15:03,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1642 states. [2020-10-16 11:15:03,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 6070 transitions. [2020-10-16 11:15:03,969 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 6070 transitions. Word has length 14 [2020-10-16 11:15:03,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:03,969 INFO L481 AbstractCegarLoop]: Abstraction has 1642 states and 6070 transitions. [2020-10-16 11:15:03,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:15:03,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 6070 transitions. [2020-10-16 11:15:03,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 11:15:03,973 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:03,973 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:15:03,973 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 11:15:03,973 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:03,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:03,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1797762494, now seen corresponding path program 1 times [2020-10-16 11:15:03,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:03,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738240550] [2020-10-16 11:15:03,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:04,137 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-16 11:15:04,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738240550] [2020-10-16 11:15:04,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:04,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:15:04,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114059766] [2020-10-16 11:15:04,138 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:15:04,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:04,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:15:04,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:15:04,139 INFO L87 Difference]: Start difference. First operand 1642 states and 6070 transitions. Second operand 6 states. [2020-10-16 11:15:04,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:04,267 INFO L93 Difference]: Finished difference Result 1778 states and 6540 transitions. [2020-10-16 11:15:04,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:15:04,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-16 11:15:04,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:04,285 INFO L225 Difference]: With dead ends: 1778 [2020-10-16 11:15:04,285 INFO L226 Difference]: Without dead ends: 1778 [2020-10-16 11:15:04,286 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:15:04,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2020-10-16 11:15:04,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1778. [2020-10-16 11:15:04,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1778 states. [2020-10-16 11:15:04,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 6540 transitions. [2020-10-16 11:15:04,358 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 6540 transitions. Word has length 15 [2020-10-16 11:15:04,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:04,358 INFO L481 AbstractCegarLoop]: Abstraction has 1778 states and 6540 transitions. [2020-10-16 11:15:04,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:15:04,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 6540 transitions. [2020-10-16 11:15:04,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 11:15:04,362 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:04,362 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:15:04,363 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 11:15:04,363 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:04,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:04,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1177270598, now seen corresponding path program 1 times [2020-10-16 11:15:04,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:04,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657846549] [2020-10-16 11:15:04,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:04,567 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-16 11:15:04,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657846549] [2020-10-16 11:15:04,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:04,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:15:04,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235680434] [2020-10-16 11:15:04,569 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 11:15:04,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:04,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 11:15:04,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:15:04,569 INFO L87 Difference]: Start difference. First operand 1778 states and 6540 transitions. Second operand 7 states. [2020-10-16 11:15:04,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:04,797 INFO L93 Difference]: Finished difference Result 2114 states and 7812 transitions. [2020-10-16 11:15:04,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:15:04,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-16 11:15:04,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:04,833 INFO L225 Difference]: With dead ends: 2114 [2020-10-16 11:15:04,833 INFO L226 Difference]: Without dead ends: 2114 [2020-10-16 11:15:04,834 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:15:04,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2020-10-16 11:15:04,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 1890. [2020-10-16 11:15:04,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1890 states. [2020-10-16 11:15:04,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 6996 transitions. [2020-10-16 11:15:04,900 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 6996 transitions. Word has length 16 [2020-10-16 11:15:04,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:04,901 INFO L481 AbstractCegarLoop]: Abstraction has 1890 states and 6996 transitions. [2020-10-16 11:15:04,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 11:15:04,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 6996 transitions. [2020-10-16 11:15:04,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 11:15:04,907 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:04,907 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:15:04,907 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 11:15:04,908 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:04,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:04,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1151409158, now seen corresponding path program 2 times [2020-10-16 11:15:04,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:04,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672245637] [2020-10-16 11:15:04,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:05,106 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-16 11:15:05,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672245637] [2020-10-16 11:15:05,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:05,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:15:05,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127891905] [2020-10-16 11:15:05,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 11:15:05,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:05,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 11:15:05,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:15:05,109 INFO L87 Difference]: Start difference. First operand 1890 states and 6996 transitions. Second operand 7 states. [2020-10-16 11:15:05,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:05,293 INFO L93 Difference]: Finished difference Result 1834 states and 6776 transitions. [2020-10-16 11:15:05,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:15:05,295 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-16 11:15:05,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:05,303 INFO L225 Difference]: With dead ends: 1834 [2020-10-16 11:15:05,303 INFO L226 Difference]: Without dead ends: 1834 [2020-10-16 11:15:05,304 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:15:05,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2020-10-16 11:15:05,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1530. [2020-10-16 11:15:05,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1530 states. [2020-10-16 11:15:05,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 5616 transitions. [2020-10-16 11:15:05,359 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 5616 transitions. Word has length 16 [2020-10-16 11:15:05,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:05,360 INFO L481 AbstractCegarLoop]: Abstraction has 1530 states and 5616 transitions. [2020-10-16 11:15:05,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 11:15:05,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 5616 transitions. [2020-10-16 11:15:05,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 11:15:05,364 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:05,364 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:15:05,364 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 11:15:05,364 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:05,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:05,365 INFO L82 PathProgramCache]: Analyzing trace with hash 974833126, now seen corresponding path program 1 times [2020-10-16 11:15:05,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:05,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970113544] [2020-10-16 11:15:05,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:05,417 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-16 11:15:05,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970113544] [2020-10-16 11:15:05,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:05,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:15:05,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515178206] [2020-10-16 11:15:05,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:15:05,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:05,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:15:05,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:15:05,419 INFO L87 Difference]: Start difference. First operand 1530 states and 5616 transitions. Second operand 4 states. [2020-10-16 11:15:05,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:05,462 INFO L93 Difference]: Finished difference Result 1618 states and 5440 transitions. [2020-10-16 11:15:05,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 11:15:05,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-16 11:15:05,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:05,469 INFO L225 Difference]: With dead ends: 1618 [2020-10-16 11:15:05,469 INFO L226 Difference]: Without dead ends: 1218 [2020-10-16 11:15:05,470 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:15:05,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-10-16 11:15:05,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1218. [2020-10-16 11:15:05,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2020-10-16 11:15:05,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 4056 transitions. [2020-10-16 11:15:05,510 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 4056 transitions. Word has length 16 [2020-10-16 11:15:05,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:05,510 INFO L481 AbstractCegarLoop]: Abstraction has 1218 states and 4056 transitions. [2020-10-16 11:15:05,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:15:05,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 4056 transitions. [2020-10-16 11:15:05,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 11:15:05,514 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:05,514 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:15:05,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 11:15:05,515 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:05,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:05,515 INFO L82 PathProgramCache]: Analyzing trace with hash -350364005, now seen corresponding path program 1 times [2020-10-16 11:15:05,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:05,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325693279] [2020-10-16 11:15:05,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:05,588 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-16 11:15:05,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325693279] [2020-10-16 11:15:05,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:05,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:15:05,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575382896] [2020-10-16 11:15:05,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:15:05,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:05,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:15:05,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:15:05,590 INFO L87 Difference]: Start difference. First operand 1218 states and 4056 transitions. Second operand 5 states. [2020-10-16 11:15:05,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:05,653 INFO L93 Difference]: Finished difference Result 1085 states and 3332 transitions. [2020-10-16 11:15:05,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:15:05,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-16 11:15:05,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:05,658 INFO L225 Difference]: With dead ends: 1085 [2020-10-16 11:15:05,659 INFO L226 Difference]: Without dead ends: 829 [2020-10-16 11:15:05,659 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:15:05,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2020-10-16 11:15:05,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 829. [2020-10-16 11:15:05,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2020-10-16 11:15:05,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 2500 transitions. [2020-10-16 11:15:05,686 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 2500 transitions. Word has length 17 [2020-10-16 11:15:05,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:05,687 INFO L481 AbstractCegarLoop]: Abstraction has 829 states and 2500 transitions. [2020-10-16 11:15:05,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:15:05,687 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 2500 transitions. [2020-10-16 11:15:05,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-16 11:15:05,689 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:05,689 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:15:05,690 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 11:15:05,690 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:05,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:05,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1278143232, now seen corresponding path program 1 times [2020-10-16 11:15:05,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:05,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518041902] [2020-10-16 11:15:05,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:05,730 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-16 11:15:05,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518041902] [2020-10-16 11:15:05,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:05,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 11:15:05,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714051526] [2020-10-16 11:15:05,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:15:05,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:05,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:15:05,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:15:05,732 INFO L87 Difference]: Start difference. First operand 829 states and 2500 transitions. Second operand 3 states. [2020-10-16 11:15:05,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:05,750 INFO L93 Difference]: Finished difference Result 1173 states and 3449 transitions. [2020-10-16 11:15:05,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:15:05,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-10-16 11:15:05,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:05,755 INFO L225 Difference]: With dead ends: 1173 [2020-10-16 11:15:05,755 INFO L226 Difference]: Without dead ends: 839 [2020-10-16 11:15:05,756 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:15:05,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2020-10-16 11:15:05,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 823. [2020-10-16 11:15:05,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2020-10-16 11:15:05,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 2349 transitions. [2020-10-16 11:15:05,780 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 2349 transitions. Word has length 18 [2020-10-16 11:15:05,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:05,780 INFO L481 AbstractCegarLoop]: Abstraction has 823 states and 2349 transitions. [2020-10-16 11:15:05,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:15:05,780 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 2349 transitions. [2020-10-16 11:15:05,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-16 11:15:05,783 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:05,783 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-16 11:15:05,783 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 11:15:05,783 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:05,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:05,784 INFO L82 PathProgramCache]: Analyzing trace with hash 125424893, now seen corresponding path program 1 times [2020-10-16 11:15:05,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:05,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325863699] [2020-10-16 11:15:05,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:05,829 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-16 11:15:05,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325863699] [2020-10-16 11:15:05,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:05,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:15:05,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510902164] [2020-10-16 11:15:05,830 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:15:05,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:05,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:15:05,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:15:05,831 INFO L87 Difference]: Start difference. First operand 823 states and 2349 transitions. Second operand 4 states. [2020-10-16 11:15:05,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:05,855 INFO L93 Difference]: Finished difference Result 1115 states and 3126 transitions. [2020-10-16 11:15:05,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 11:15:05,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-16 11:15:05,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:05,858 INFO L225 Difference]: With dead ends: 1115 [2020-10-16 11:15:05,859 INFO L226 Difference]: Without dead ends: 513 [2020-10-16 11:15:05,859 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:15:05,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2020-10-16 11:15:05,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2020-10-16 11:15:05,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2020-10-16 11:15:05,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 1351 transitions. [2020-10-16 11:15:05,874 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 1351 transitions. Word has length 19 [2020-10-16 11:15:05,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:05,874 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 1351 transitions. [2020-10-16 11:15:05,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:15:05,874 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 1351 transitions. [2020-10-16 11:15:05,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-16 11:15:05,876 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:05,876 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-16 11:15:05,876 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 11:15:05,876 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:05,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:05,877 INFO L82 PathProgramCache]: Analyzing trace with hash -900066335, now seen corresponding path program 2 times [2020-10-16 11:15:05,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:05,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598054532] [2020-10-16 11:15:05,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:05,917 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-16 11:15:05,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598054532] [2020-10-16 11:15:05,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:05,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 11:15:05,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129592176] [2020-10-16 11:15:05,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:15:05,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:05,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:15:05,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:15:05,919 INFO L87 Difference]: Start difference. First operand 513 states and 1351 transitions. Second operand 3 states. [2020-10-16 11:15:05,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:05,932 INFO L93 Difference]: Finished difference Result 687 states and 1758 transitions. [2020-10-16 11:15:05,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:15:05,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-10-16 11:15:05,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:05,935 INFO L225 Difference]: With dead ends: 687 [2020-10-16 11:15:05,935 INFO L226 Difference]: Without dead ends: 521 [2020-10-16 11:15:05,936 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:15:05,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-10-16 11:15:05,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 507. [2020-10-16 11:15:05,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2020-10-16 11:15:05,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 1271 transitions. [2020-10-16 11:15:05,949 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 1271 transitions. Word has length 19 [2020-10-16 11:15:05,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:05,949 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 1271 transitions. [2020-10-16 11:15:05,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:15:05,950 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 1271 transitions. [2020-10-16 11:15:05,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-16 11:15:05,951 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:05,951 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-16 11:15:05,951 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 11:15:05,951 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:05,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:05,952 INFO L82 PathProgramCache]: Analyzing trace with hash -2026188855, now seen corresponding path program 1 times [2020-10-16 11:15:05,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:05,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890104251] [2020-10-16 11:15:05,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:06,016 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-16 11:15:06,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890104251] [2020-10-16 11:15:06,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:06,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:15:06,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032779652] [2020-10-16 11:15:06,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:15:06,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:06,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:15:06,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:15:06,019 INFO L87 Difference]: Start difference. First operand 507 states and 1271 transitions. Second operand 6 states. [2020-10-16 11:15:06,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:06,090 INFO L93 Difference]: Finished difference Result 436 states and 1047 transitions. [2020-10-16 11:15:06,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:15:06,091 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-16 11:15:06,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:06,092 INFO L225 Difference]: With dead ends: 436 [2020-10-16 11:15:06,092 INFO L226 Difference]: Without dead ends: 328 [2020-10-16 11:15:06,093 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:15:06,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2020-10-16 11:15:06,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2020-10-16 11:15:06,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2020-10-16 11:15:06,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 766 transitions. [2020-10-16 11:15:06,101 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 766 transitions. Word has length 19 [2020-10-16 11:15:06,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:06,101 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 766 transitions. [2020-10-16 11:15:06,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:15:06,101 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 766 transitions. [2020-10-16 11:15:06,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 11:15:06,102 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:06,102 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-16 11:15:06,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 11:15:06,103 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:06,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:06,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1225847851, now seen corresponding path program 1 times [2020-10-16 11:15:06,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:06,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411873956] [2020-10-16 11:15:06,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:15:06,197 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-16 11:15:06,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411873956] [2020-10-16 11:15:06,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:15:06,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 11:15:06,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422787227] [2020-10-16 11:15:06,199 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 11:15:06,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:15:06,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 11:15:06,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:15:06,200 INFO L87 Difference]: Start difference. First operand 328 states and 766 transitions. Second operand 7 states. [2020-10-16 11:15:06,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:15:06,341 INFO L93 Difference]: Finished difference Result 308 states and 726 transitions. [2020-10-16 11:15:06,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:15:06,342 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-16 11:15:06,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:15:06,342 INFO L225 Difference]: With dead ends: 308 [2020-10-16 11:15:06,342 INFO L226 Difference]: Without dead ends: 91 [2020-10-16 11:15:06,343 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-10-16 11:15:06,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-10-16 11:15:06,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-10-16 11:15:06,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-10-16 11:15:06,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 197 transitions. [2020-10-16 11:15:06,346 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 197 transitions. Word has length 22 [2020-10-16 11:15:06,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:15:06,346 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 197 transitions. [2020-10-16 11:15:06,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 11:15:06,347 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 197 transitions. [2020-10-16 11:15:06,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-16 11:15:06,347 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:15:06,348 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, 1, 1, 1] [2020-10-16 11:15:06,348 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 11:15:06,348 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:15:06,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:15:06,348 INFO L82 PathProgramCache]: Analyzing trace with hash 358783119, now seen corresponding path program 1 times [2020-10-16 11:15:06,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:15:06,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619433702] [2020-10-16 11:15:06,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:15:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 11:15:06,384 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 11:15:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 11:15:06,414 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 11:15:06,472 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 11:15:06,472 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 11:15:06,472 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 11:15:06,474 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 11:15:06,487 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [954] [954] L3-->L841: Formula: (let ((.cse6 (= (mod ~z$w_buff1_used~0_In1025707759 256) 0)) (.cse7 (= (mod ~z$r_buff1_thd0~0_In1025707759 256) 0)) (.cse9 (= (mod ~z$r_buff0_thd0~0_In1025707759 256) 0)) (.cse8 (= 0 (mod ~z$w_buff0_used~0_In1025707759 256)))) (let ((.cse1 (not .cse8)) (.cse2 (not .cse9)) (.cse0 (or .cse8 .cse9)) (.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse3 (or .cse6 .cse7))) (and (or (and .cse0 (= ~z$w_buff0_used~0_In1025707759 ~z$w_buff0_used~0_Out1025707759)) (and (= ~z$w_buff0_used~0_Out1025707759 0) .cse1 .cse2)) (or (and .cse3 (= ~z$w_buff1_used~0_Out1025707759 ~z$w_buff1_used~0_In1025707759)) (and (= ~z$w_buff1_used~0_Out1025707759 0) .cse4 .cse5)) (= ~z$r_buff0_thd0~0_In1025707759 ~z$r_buff0_thd0~0_Out1025707759) (= ~z$r_buff1_thd0~0_In1025707759 ~z$r_buff1_thd0~0_Out1025707759) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In1025707759 0)) (or (and .cse1 .cse2 (= ~z~0_Out1025707759 ~z$w_buff0~0_In1025707759)) (and .cse0 (or (and .cse4 (= ~z$w_buff1~0_In1025707759 ~z~0_Out1025707759) .cse5) (and .cse3 (= ~z~0_In1025707759 ~z~0_Out1025707759)))))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1025707759, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1025707759, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1025707759, ~z$w_buff0~0=~z$w_buff0~0_In1025707759, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1025707759, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1025707759, ~z$w_buff1~0=~z$w_buff1~0_In1025707759, ~z~0=~z~0_In1025707759} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out1025707759, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1025707759|, ~z$w_buff0~0=~z$w_buff0~0_In1025707759, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1025707759|, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1025707759, ~z$w_buff1~0=~z$w_buff1~0_In1025707759, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1025707759|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1025707759|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1025707759|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1025707759|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out1025707759, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1025707759, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1025707759, ~z~0=~z~0_Out1025707759} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-16 11:15:06,494 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-16 11:15:06,494 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:15:06,496 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-16 11:15:06,497 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:15:06,497 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-16 11:15:06,497 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:15:06,497 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-16 11:15:06,497 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:15:06,497 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-16 11:15:06,498 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:15:06,498 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-16 11:15:06,498 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:15:06,499 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-16 11:15:06,499 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:15:06,499 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-16 11:15:06,499 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:15:06,499 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-16 11:15:06,500 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:15:06,500 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-16 11:15:06,500 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:15:06,500 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-16 11:15:06,500 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:15:06,500 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-16 11:15:06,501 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:15:06,501 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-16 11:15:06,501 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:15:06,502 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-16 11:15:06,502 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:15:06,502 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-16 11:15:06,502 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:15:06,502 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-16 11:15:06,503 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:15:06,503 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-16 11:15:06,503 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:15:06,503 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-16 11:15:06,503 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:15:06,503 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-16 11:15:06,504 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:15:06,504 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-16 11:15:06,504 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:15:06,504 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-16 11:15:06,504 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:15:06,505 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-16 11:15:06,505 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:15:06,505 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-16 11:15:06,505 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:15:06,505 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-16 11:15:06,505 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:15:06,505 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-16 11:15:06,506 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:15:06,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 11:15:06 BasicIcfg [2020-10-16 11:15:06,600 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 11:15:06,602 INFO L168 Benchmark]: Toolchain (without parser) took 20442.66 ms. Allocated memory was 149.4 MB in the beginning and 443.5 MB in the end (delta: 294.1 MB). Free memory was 103.5 MB in the beginning and 339.7 MB in the end (delta: -236.2 MB). Peak memory consumption was 57.9 MB. Max. memory is 7.1 GB. [2020-10-16 11:15:06,602 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 149.4 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-16 11:15:06,603 INFO L168 Benchmark]: CACSL2BoogieTranslator took 845.87 ms. Allocated memory was 149.4 MB in the beginning and 204.5 MB in the end (delta: 55.1 MB). Free memory was 103.1 MB in the beginning and 158.7 MB in the end (delta: -55.6 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. [2020-10-16 11:15:06,604 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.80 ms. Allocated memory is still 204.5 MB. Free memory was 158.7 MB in the beginning and 155.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2020-10-16 11:15:06,608 INFO L168 Benchmark]: Boogie Preprocessor took 40.71 ms. Allocated memory is still 204.5 MB. Free memory was 155.6 MB in the beginning and 153.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2020-10-16 11:15:06,609 INFO L168 Benchmark]: RCFGBuilder took 2120.36 ms. Allocated memory was 204.5 MB in the beginning and 243.8 MB in the end (delta: 39.3 MB). Free memory was 153.0 MB in the beginning and 173.6 MB in the end (delta: -20.6 MB). Peak memory consumption was 94.7 MB. Max. memory is 7.1 GB. [2020-10-16 11:15:06,610 INFO L168 Benchmark]: TraceAbstraction took 17360.83 ms. Allocated memory was 243.8 MB in the beginning and 443.5 MB in the end (delta: 199.8 MB). Free memory was 173.6 MB in the beginning and 339.7 MB in the end (delta: -166.1 MB). Peak memory consumption was 33.6 MB. Max. memory is 7.1 GB. [2020-10-16 11:15:06,619 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.24 ms. Allocated memory is still 149.4 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 845.87 ms. Allocated memory was 149.4 MB in the beginning and 204.5 MB in the end (delta: 55.1 MB). Free memory was 103.1 MB in the beginning and 158.7 MB in the end (delta: -55.6 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.80 ms. Allocated memory is still 204.5 MB. Free memory was 158.7 MB in the beginning and 155.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.71 ms. Allocated memory is still 204.5 MB. Free memory was 155.6 MB in the beginning and 153.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2120.36 ms. Allocated memory was 204.5 MB in the beginning and 243.8 MB in the end (delta: 39.3 MB). Free memory was 153.0 MB in the beginning and 173.6 MB in the end (delta: -20.6 MB). Peak memory consumption was 94.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17360.83 ms. Allocated memory was 243.8 MB in the beginning and 443.5 MB in the end (delta: 199.8 MB). Free memory was 173.6 MB in the beginning and 339.7 MB in the end (delta: -166.1 MB). Peak memory consumption was 33.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1636 VarBasedMoverChecksPositive, 100 VarBasedMoverChecksNegative, 31 SemBasedMoverChecksPositive, 69 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 186 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 12.0s, 118 PlacesBefore, 44 PlacesAfterwards, 107 TransitionsBefore, 31 TransitionsAfterwards, 2352 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 86 TotalNumberOfCompositions, 5626 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p3_EAX = 0; [L703] 0 int a = 0; [L704] 0 _Bool main$tmp_guard0; [L705] 0 _Bool main$tmp_guard1; [L707] 0 int x = 0; [L709] 0 int y = 0; [L711] 0 int z = 0; [L712] 0 _Bool z$flush_delayed; [L713] 0 int z$mem_tmp; [L714] 0 _Bool z$r_buff0_thd0; [L715] 0 _Bool z$r_buff0_thd1; [L716] 0 _Bool z$r_buff0_thd2; [L717] 0 _Bool z$r_buff0_thd3; [L718] 0 _Bool z$r_buff0_thd4; [L719] 0 _Bool z$r_buff1_thd0; [L720] 0 _Bool z$r_buff1_thd1; [L721] 0 _Bool z$r_buff1_thd2; [L722] 0 _Bool z$r_buff1_thd3; [L723] 0 _Bool z$r_buff1_thd4; [L724] 0 _Bool z$read_delayed; [L725] 0 int *z$read_delayed_var; [L726] 0 int z$w_buff0; [L727] 0 _Bool z$w_buff0_used; [L728] 0 int z$w_buff1; [L729] 0 _Bool z$w_buff1_used; [L730] 0 _Bool weak$$choice0; [L731] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1533; [L824] FCALL, FORK 0 pthread_create(&t1533, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0: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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L825] 0 pthread_t t1534; [L826] FCALL, FORK 0 pthread_create(&t1534, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0: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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L827] 0 pthread_t t1535; [L828] FCALL, FORK 0 pthread_create(&t1535, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L829] 0 pthread_t t1536; [L830] FCALL, FORK 0 pthread_create(&t1536, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L785] 4 z$w_buff1 = z$w_buff0 [L786] 4 z$w_buff0 = 2 [L787] 4 z$w_buff1_used = z$w_buff0_used [L788] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L790] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L791] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L792] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L793] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L794] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L795] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L798] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L735] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L738] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L745] 1 return 0; [L750] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L753] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0: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=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L765] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L768] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L771] 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) [L771] 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) [L772] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L772] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L773] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L773] 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 [L774] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L774] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L775] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L775] 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 [L778] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 3 return 0; [L758] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 2 return 0; [L801] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L801] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L801] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L801] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L802] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L802] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L803] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L803] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L804] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L804] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L805] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L805] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L808] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 4 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 z$flush_delayed = weak$$choice2 [L846] 0 z$mem_tmp = z [L847] 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) [L847] 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) [L848] 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)) [L848] 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)) [L849] 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)) [L849] 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)) [L850] 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)) [L850] EXPR 0 !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) [L850] 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)) [L850] 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)) [L851] 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)) [L851] 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)) [L852] 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)) [L852] 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) [L852] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 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) [L852] 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)) [L852] 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)) [L853] 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)) [L853] EXPR 0 !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) [L853] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L853] EXPR 0 !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) [L853] 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)) [L853] 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)) [L854] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L855] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L855] 0 z = z$flush_delayed ? z$mem_tmp : z [L856] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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 5 procedures, 106 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.1s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.2s, HoareTripleCheckerStatistics: 452 SDtfs, 644 SDslu, 637 SDs, 0 SdLazy, 272 SolverSat, 130 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2602occurred 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.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 558 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 275 NumberOfCodeBlocks, 275 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 234 ConstructedInterpolants, 0 QuantifiedInterpolants, 20712 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...