/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix030_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 18:16:57,508 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 18:16:57,511 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 18:16:57,551 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 18:16:57,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 18:16:57,561 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 18:16:57,564 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 18:16:57,568 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 18:16:57,570 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 18:16:57,573 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 18:16:57,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 18:16:57,575 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 18:16:57,576 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 18:16:57,579 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 18:16:57,581 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 18:16:57,583 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 18:16:57,584 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 18:16:57,586 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 18:16:57,587 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 18:16:57,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 18:16:57,598 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 18:16:57,599 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 18:16:57,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 18:16:57,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 18:16:57,614 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 18:16:57,619 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 18:16:57,619 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 18:16:57,620 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 18:16:57,621 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 18:16:57,625 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 18:16:57,625 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 18:16:57,626 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 18:16:57,627 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 18:16:57,628 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 18:16:57,629 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 18:16:57,629 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 18:16:57,632 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 18:16:57,632 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 18:16:57,632 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 18:16:57,633 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 18:16:57,635 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 18:16:57,635 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-15 18:16:57,673 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 18:16:57,674 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 18:16:57,676 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 18:16:57,676 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 18:16:57,676 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 18:16:57,676 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 18:16:57,676 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 18:16:57,677 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 18:16:57,677 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 18:16:57,677 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 18:16:57,678 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 18:16:57,678 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 18:16:57,678 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 18:16:57,679 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 18:16:57,679 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 18:16:57,679 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 18:16:57,679 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 18:16:57,680 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 18:16:57,680 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 18:16:57,680 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 18:16:57,680 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 18:16:57,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 18:16:57,681 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 18:16:57,681 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 18:16:57,681 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 18:16:57,681 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 18:16:57,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 18:16:57,682 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 18:16:57,682 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-15 18:16:57,682 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 18:16:57,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 18:16:58,000 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 18:16:58,003 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 18:16:58,005 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 18:16:58,005 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 18:16:58,006 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_power.opt.i [2020-10-15 18:16:58,058 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30c968db9/46ad3cb5a37740e0a13920bf67235b7a/FLAGedf007e77 [2020-10-15 18:16:58,595 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 18:16:58,596 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_power.opt.i [2020-10-15 18:16:58,616 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30c968db9/46ad3cb5a37740e0a13920bf67235b7a/FLAGedf007e77 [2020-10-15 18:16:58,893 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30c968db9/46ad3cb5a37740e0a13920bf67235b7a [2020-10-15 18:16:58,903 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 18:16:58,905 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 18:16:58,908 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 18:16:58,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 18:16:58,912 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 18:16:58,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:16:58" (1/1) ... [2020-10-15 18:16:58,916 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aeaf3d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:58, skipping insertion in model container [2020-10-15 18:16:58,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:16:58" (1/1) ... [2020-10-15 18:16:58,923 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 18:16:58,991 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 18:16:59,564 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:16:59,576 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 18:16:59,637 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:16:59,733 INFO L208 MainTranslator]: Completed translation [2020-10-15 18:16:59,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:59 WrapperNode [2020-10-15 18:16:59,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 18:16:59,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 18:16:59,737 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 18:16:59,737 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 18:16:59,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:59" (1/1) ... [2020-10-15 18:16:59,774 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:59" (1/1) ... [2020-10-15 18:16:59,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 18:16:59,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 18:16:59,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 18:16:59,808 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 18:16:59,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:59" (1/1) ... [2020-10-15 18:16:59,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:59" (1/1) ... [2020-10-15 18:16:59,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:59" (1/1) ... [2020-10-15 18:16:59,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:59" (1/1) ... [2020-10-15 18:16:59,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:59" (1/1) ... [2020-10-15 18:16:59,838 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:59" (1/1) ... [2020-10-15 18:16:59,841 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:59" (1/1) ... [2020-10-15 18:16:59,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 18:16:59,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 18:16:59,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 18:16:59,849 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 18:16:59,850 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 18:16:59,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 18:16:59,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-15 18:16:59,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 18:16:59,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 18:16:59,948 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-15 18:16:59,949 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-15 18:16:59,949 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-15 18:16:59,950 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-15 18:16:59,950 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-15 18:16:59,951 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-15 18:16:59,951 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-15 18:16:59,952 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-15 18:16:59,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-15 18:16:59,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 18:16:59,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 18:16:59,955 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-15 18:17:02,238 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 18:17:02,238 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-15 18:17:02,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:17:02 BoogieIcfgContainer [2020-10-15 18:17:02,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 18:17:02,243 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 18:17:02,243 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 18:17:02,246 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 18:17:02,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 06:16:58" (1/3) ... [2020-10-15 18:17:02,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694b10d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:17:02, skipping insertion in model container [2020-10-15 18:17:02,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:59" (2/3) ... [2020-10-15 18:17:02,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694b10d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:17:02, skipping insertion in model container [2020-10-15 18:17:02,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:17:02" (3/3) ... [2020-10-15 18:17:02,250 INFO L111 eAbstractionObserver]: Analyzing ICFG mix030_power.opt.i [2020-10-15 18:17:02,262 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 18:17:02,263 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 18:17:02,271 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-15 18:17:02,272 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 18:17:02,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,306 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,306 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,306 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,308 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,308 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,311 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,312 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,312 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,312 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,312 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,313 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,313 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,313 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,313 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,314 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,314 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,314 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,314 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,314 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,315 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,315 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,315 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,316 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,316 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,316 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,317 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,317 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,317 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,317 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,323 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,324 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,324 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,324 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,324 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,325 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,325 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,325 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,329 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,329 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,329 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,329 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,335 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,336 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,337 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,337 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,337 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,337 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,341 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,341 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,341 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:02,358 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-15 18:17:02,380 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 18:17:02,381 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 18:17:02,415 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 18:17:02,415 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 18:17:02,415 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 18:17:02,415 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 18:17:02,416 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 18:17:02,416 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 18:17:02,431 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 18:17:02,434 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 110 transitions, 240 flow [2020-10-15 18:17:02,437 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 110 transitions, 240 flow [2020-10-15 18:17:02,439 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 121 places, 110 transitions, 240 flow [2020-10-15 18:17:02,493 INFO L129 PetriNetUnfolder]: 2/106 cut-off events. [2020-10-15 18:17:02,493 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-15 18:17:02,499 INFO L80 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-15 18:17:02,504 INFO L117 LiptonReduction]: Number of co-enabled transitions 2572 [2020-10-15 18:17:02,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 18:17:02,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:02,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:17:02,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:02,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:17:02,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:02,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:17:02,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:02,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:17:02,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:04,032 WARN L193 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-10-15 18:17:04,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-10-15 18:17:04,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:04,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:17:04,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:04,949 WARN L193 SmtUtils]: Spent 891.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 127 [2020-10-15 18:17:05,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:05,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:05,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:05,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:05,045 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:05,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:05,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:05,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:05,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:05,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:05,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:05,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:05,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:05,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:05,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:05,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:05,299 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-15 18:17:05,720 WARN L193 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-15 18:17:05,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:05,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:05,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:05,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:05,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:05,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:05,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:05,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:05,996 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:05,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:05,997 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:05,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:06,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:06,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:06,003 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:06,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:06,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:06,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:06,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:06,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:06,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:06,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:06,120 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:06,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:06,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:06,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:06,140 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:06,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:06,143 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:06,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:06,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:06,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:06,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:06,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:06,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:06,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:06,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:06,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:06,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:06,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:06,259 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:06,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:06,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:06,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:06,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:06,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:06,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:06,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:06,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 18:17:06,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:06,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:06,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:06,676 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:06,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:06,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:06,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:06,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:06,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:06,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:06,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:06,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:06,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:06,706 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:06,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:06,713 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:06,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:07,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:07,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:07,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:07,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:07,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,175 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:07,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:07,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:07,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:07,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,289 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,291 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:07,293 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:07,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:07,307 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:07,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:07,317 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:07,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:07,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:07,374 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:07,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:07,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:07,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:07,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:07,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:07,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:07,438 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:07,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:07,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:07,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,456 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:07,460 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:07,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:07,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:07,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,489 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:07,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:07,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:07,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:07,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:07,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:07,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:07,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:07,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:07,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:07,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:07,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:07,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:07,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:07,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:07,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:07,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,713 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,715 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:07,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:07,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:07,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,730 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,731 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:07,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:07,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:07,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:07,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:07,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:07,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,798 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,802 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:07,804 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:07,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:07,826 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:07,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:07,831 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:07,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:07,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:07,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:07,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:07,867 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:07,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:07,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:07,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:07,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:07,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:07,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:07,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:08,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:08,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:08,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:08,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:08,116 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:08,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:08,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:08,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:08,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:08,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:08,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:08,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:08,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:08,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:08,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:08,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:08,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:08,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:08,167 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:08,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:08,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:08,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:08,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:08,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:08,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:08,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:08,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:08,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:08,185 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:08,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:08,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:08,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:08,900 WARN L193 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 111 [2020-10-15 18:17:09,219 WARN L193 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-15 18:17:09,938 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-10-15 18:17:10,062 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-15 18:17:10,748 WARN L193 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 137 [2020-10-15 18:17:11,070 WARN L193 SmtUtils]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-15 18:17:11,196 INFO L132 LiptonReduction]: Checked pairs total: 7693 [2020-10-15 18:17:11,197 INFO L134 LiptonReduction]: Total number of compositions: 90 [2020-10-15 18:17:11,205 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2020-10-15 18:17:11,469 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3890 states. [2020-10-15 18:17:11,472 INFO L276 IsEmpty]: Start isEmpty. Operand 3890 states. [2020-10-15 18:17:11,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-15 18:17:11,479 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:11,480 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:17:11,481 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:11,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:11,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1030616479, now seen corresponding path program 1 times [2020-10-15 18:17:11,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:11,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710283821] [2020-10-15 18:17:11,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:11,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:11,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710283821] [2020-10-15 18:17:11,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:11,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:17:11,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835659078] [2020-10-15 18:17:11,754 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:17:11,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:11,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:17:11,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:17:11,773 INFO L87 Difference]: Start difference. First operand 3890 states. Second operand 3 states. [2020-10-15 18:17:11,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:11,940 INFO L93 Difference]: Finished difference Result 3250 states and 12738 transitions. [2020-10-15 18:17:11,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:17:11,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-15 18:17:11,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:11,988 INFO L225 Difference]: With dead ends: 3250 [2020-10-15 18:17:11,988 INFO L226 Difference]: Without dead ends: 2650 [2020-10-15 18:17:11,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:17:12,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2020-10-15 18:17:12,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650. [2020-10-15 18:17:12,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2650 states. [2020-10-15 18:17:12,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 10228 transitions. [2020-10-15 18:17:12,202 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 10228 transitions. Word has length 7 [2020-10-15 18:17:12,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:12,205 INFO L481 AbstractCegarLoop]: Abstraction has 2650 states and 10228 transitions. [2020-10-15 18:17:12,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:17:12,205 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 10228 transitions. [2020-10-15 18:17:12,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-15 18:17:12,210 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:12,210 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:17:12,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 18:17:12,210 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:12,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:12,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1072761819, now seen corresponding path program 1 times [2020-10-15 18:17:12,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:12,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973359767] [2020-10-15 18:17:12,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:12,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:12,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973359767] [2020-10-15 18:17:12,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:12,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:17:12,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960372515] [2020-10-15 18:17:12,347 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:17:12,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:12,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:17:12,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:17:12,347 INFO L87 Difference]: Start difference. First operand 2650 states and 10228 transitions. Second operand 3 states. [2020-10-15 18:17:12,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:12,421 INFO L93 Difference]: Finished difference Result 2630 states and 10137 transitions. [2020-10-15 18:17:12,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:17:12,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-15 18:17:12,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:12,444 INFO L225 Difference]: With dead ends: 2630 [2020-10-15 18:17:12,444 INFO L226 Difference]: Without dead ends: 2630 [2020-10-15 18:17:12,445 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:17:12,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2020-10-15 18:17:12,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2630. [2020-10-15 18:17:12,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2020-10-15 18:17:12,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 10137 transitions. [2020-10-15 18:17:12,542 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 10137 transitions. Word has length 11 [2020-10-15 18:17:12,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:12,542 INFO L481 AbstractCegarLoop]: Abstraction has 2630 states and 10137 transitions. [2020-10-15 18:17:12,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:17:12,542 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 10137 transitions. [2020-10-15 18:17:12,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 18:17:12,545 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:12,546 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:17:12,546 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 18:17:12,546 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:12,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:12,546 INFO L82 PathProgramCache]: Analyzing trace with hash -121033002, now seen corresponding path program 1 times [2020-10-15 18:17:12,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:12,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490356998] [2020-10-15 18:17:12,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:12,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:12,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490356998] [2020-10-15 18:17:12,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:12,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:17:12,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855653719] [2020-10-15 18:17:12,630 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:17:12,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:12,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:17:12,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:17:12,631 INFO L87 Difference]: Start difference. First operand 2630 states and 10137 transitions. Second operand 4 states. [2020-10-15 18:17:12,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:12,758 INFO L93 Difference]: Finished difference Result 2610 states and 10046 transitions. [2020-10-15 18:17:12,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 18:17:12,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-15 18:17:12,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:12,783 INFO L225 Difference]: With dead ends: 2610 [2020-10-15 18:17:12,783 INFO L226 Difference]: Without dead ends: 2610 [2020-10-15 18:17:12,784 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:17:12,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2020-10-15 18:17:12,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2610. [2020-10-15 18:17:12,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2610 states. [2020-10-15 18:17:12,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 10046 transitions. [2020-10-15 18:17:12,883 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 10046 transitions. Word has length 12 [2020-10-15 18:17:12,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:12,884 INFO L481 AbstractCegarLoop]: Abstraction has 2610 states and 10046 transitions. [2020-10-15 18:17:12,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:17:12,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 10046 transitions. [2020-10-15 18:17:12,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 18:17:12,886 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:12,886 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:17:12,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 18:17:12,886 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:12,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:12,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1104121036, now seen corresponding path program 1 times [2020-10-15 18:17:12,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:12,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850922856] [2020-10-15 18:17:12,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:12,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:12,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850922856] [2020-10-15 18:17:12,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:12,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:17:12,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410397728] [2020-10-15 18:17:12,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:17:12,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:12,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:17:12,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:17:12,941 INFO L87 Difference]: Start difference. First operand 2610 states and 10046 transitions. Second operand 3 states. [2020-10-15 18:17:13,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:13,003 INFO L93 Difference]: Finished difference Result 2600 states and 9998 transitions. [2020-10-15 18:17:13,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:17:13,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-15 18:17:13,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:13,026 INFO L225 Difference]: With dead ends: 2600 [2020-10-15 18:17:13,026 INFO L226 Difference]: Without dead ends: 2600 [2020-10-15 18:17:13,026 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:17:13,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2600 states. [2020-10-15 18:17:13,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2600 to 2600. [2020-10-15 18:17:13,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2600 states. [2020-10-15 18:17:13,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2600 states to 2600 states and 9998 transitions. [2020-10-15 18:17:13,149 INFO L78 Accepts]: Start accepts. Automaton has 2600 states and 9998 transitions. Word has length 12 [2020-10-15 18:17:13,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:13,150 INFO L481 AbstractCegarLoop]: Abstraction has 2600 states and 9998 transitions. [2020-10-15 18:17:13,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:17:13,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2600 states and 9998 transitions. [2020-10-15 18:17:13,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 18:17:13,153 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:13,153 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:17:13,153 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 18:17:13,154 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:13,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:13,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1604945034, now seen corresponding path program 1 times [2020-10-15 18:17:13,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:13,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167253406] [2020-10-15 18:17:13,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:13,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:13,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167253406] [2020-10-15 18:17:13,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:13,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:17:13,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468315580] [2020-10-15 18:17:13,220 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:17:13,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:13,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:17:13,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:17:13,220 INFO L87 Difference]: Start difference. First operand 2600 states and 9998 transitions. Second operand 3 states. [2020-10-15 18:17:13,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:13,316 INFO L93 Difference]: Finished difference Result 2582 states and 9917 transitions. [2020-10-15 18:17:13,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:17:13,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-15 18:17:13,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:13,376 INFO L225 Difference]: With dead ends: 2582 [2020-10-15 18:17:13,379 INFO L226 Difference]: Without dead ends: 2582 [2020-10-15 18:17:13,379 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:17:13,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2582 states. [2020-10-15 18:17:13,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2582 to 2582. [2020-10-15 18:17:13,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2582 states. [2020-10-15 18:17:13,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2582 states to 2582 states and 9917 transitions. [2020-10-15 18:17:13,633 INFO L78 Accepts]: Start accepts. Automaton has 2582 states and 9917 transitions. Word has length 13 [2020-10-15 18:17:13,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:13,633 INFO L481 AbstractCegarLoop]: Abstraction has 2582 states and 9917 transitions. [2020-10-15 18:17:13,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:17:13,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2582 states and 9917 transitions. [2020-10-15 18:17:13,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 18:17:13,636 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:13,636 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:17:13,636 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 18:17:13,636 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:13,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:13,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1798747636, now seen corresponding path program 1 times [2020-10-15 18:17:13,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:13,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653223620] [2020-10-15 18:17:13,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:13,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:13,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653223620] [2020-10-15 18:17:13,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:13,708 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:17:13,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450887147] [2020-10-15 18:17:13,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:17:13,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:13,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:17:13,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:17:13,709 INFO L87 Difference]: Start difference. First operand 2582 states and 9917 transitions. Second operand 5 states. [2020-10-15 18:17:13,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:13,802 INFO L93 Difference]: Finished difference Result 3514 states and 12936 transitions. [2020-10-15 18:17:13,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:17:13,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-15 18:17:13,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:13,815 INFO L225 Difference]: With dead ends: 3514 [2020-10-15 18:17:13,815 INFO L226 Difference]: Without dead ends: 2698 [2020-10-15 18:17:13,816 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:17:13,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2020-10-15 18:17:13,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2482. [2020-10-15 18:17:13,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2482 states. [2020-10-15 18:17:13,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2482 states and 9078 transitions. [2020-10-15 18:17:13,907 INFO L78 Accepts]: Start accepts. Automaton has 2482 states and 9078 transitions. Word has length 13 [2020-10-15 18:17:13,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:13,908 INFO L481 AbstractCegarLoop]: Abstraction has 2482 states and 9078 transitions. [2020-10-15 18:17:13,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:17:13,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 9078 transitions. [2020-10-15 18:17:13,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 18:17:13,912 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:13,912 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:17:13,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 18:17:13,912 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:13,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:13,913 INFO L82 PathProgramCache]: Analyzing trace with hash 841894414, now seen corresponding path program 1 times [2020-10-15 18:17:13,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:13,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968293608] [2020-10-15 18:17:13,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:13,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:13,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968293608] [2020-10-15 18:17:13,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:13,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:17:13,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198250840] [2020-10-15 18:17:13,956 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:17:13,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:13,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:17:13,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:17:13,956 INFO L87 Difference]: Start difference. First operand 2482 states and 9078 transitions. Second operand 3 states. [2020-10-15 18:17:13,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:13,996 INFO L93 Difference]: Finished difference Result 2370 states and 8606 transitions. [2020-10-15 18:17:13,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:17:13,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-10-15 18:17:13,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:14,007 INFO L225 Difference]: With dead ends: 2370 [2020-10-15 18:17:14,008 INFO L226 Difference]: Without dead ends: 2370 [2020-10-15 18:17:14,008 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:17:14,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2370 states. [2020-10-15 18:17:14,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2370 to 2370. [2020-10-15 18:17:14,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2370 states. [2020-10-15 18:17:14,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 8606 transitions. [2020-10-15 18:17:14,111 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 8606 transitions. Word has length 14 [2020-10-15 18:17:14,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:14,112 INFO L481 AbstractCegarLoop]: Abstraction has 2370 states and 8606 transitions. [2020-10-15 18:17:14,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:17:14,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 8606 transitions. [2020-10-15 18:17:14,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 18:17:14,115 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:14,115 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:17:14,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 18:17:14,115 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:14,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:14,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1786313371, now seen corresponding path program 1 times [2020-10-15 18:17:14,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:14,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859043459] [2020-10-15 18:17:14,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:14,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:14,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859043459] [2020-10-15 18:17:14,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:14,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:17:14,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589877695] [2020-10-15 18:17:14,176 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:17:14,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:14,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:17:14,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:17:14,177 INFO L87 Difference]: Start difference. First operand 2370 states and 8606 transitions. Second operand 3 states. [2020-10-15 18:17:14,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:14,228 INFO L93 Difference]: Finished difference Result 2354 states and 8534 transitions. [2020-10-15 18:17:14,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:17:14,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-10-15 18:17:14,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:14,239 INFO L225 Difference]: With dead ends: 2354 [2020-10-15 18:17:14,240 INFO L226 Difference]: Without dead ends: 2354 [2020-10-15 18:17:14,240 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:17:14,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2354 states. [2020-10-15 18:17:14,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2354 to 2354. [2020-10-15 18:17:14,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2354 states. [2020-10-15 18:17:14,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2354 states to 2354 states and 8534 transitions. [2020-10-15 18:17:14,320 INFO L78 Accepts]: Start accepts. Automaton has 2354 states and 8534 transitions. Word has length 14 [2020-10-15 18:17:14,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:14,320 INFO L481 AbstractCegarLoop]: Abstraction has 2354 states and 8534 transitions. [2020-10-15 18:17:14,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:17:14,321 INFO L276 IsEmpty]: Start isEmpty. Operand 2354 states and 8534 transitions. [2020-10-15 18:17:14,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 18:17:14,324 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:14,324 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:17:14,324 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 18:17:14,324 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:14,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:14,325 INFO L82 PathProgramCache]: Analyzing trace with hash 222355305, now seen corresponding path program 1 times [2020-10-15 18:17:14,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:14,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252240046] [2020-10-15 18:17:14,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:14,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:14,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252240046] [2020-10-15 18:17:14,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:14,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:17:14,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301130152] [2020-10-15 18:17:14,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:17:14,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:14,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:17:14,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:17:14,409 INFO L87 Difference]: Start difference. First operand 2354 states and 8534 transitions. Second operand 5 states. [2020-10-15 18:17:14,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:14,557 INFO L93 Difference]: Finished difference Result 2346 states and 8478 transitions. [2020-10-15 18:17:14,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 18:17:14,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-15 18:17:14,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:14,570 INFO L225 Difference]: With dead ends: 2346 [2020-10-15 18:17:14,570 INFO L226 Difference]: Without dead ends: 2346 [2020-10-15 18:17:14,571 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:17:14,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2020-10-15 18:17:14,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 2306. [2020-10-15 18:17:14,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2306 states. [2020-10-15 18:17:14,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 8334 transitions. [2020-10-15 18:17:14,656 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 8334 transitions. Word has length 15 [2020-10-15 18:17:14,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:14,656 INFO L481 AbstractCegarLoop]: Abstraction has 2306 states and 8334 transitions. [2020-10-15 18:17:14,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:17:14,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 8334 transitions. [2020-10-15 18:17:14,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 18:17:14,660 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:14,660 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:17:14,660 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 18:17:14,660 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:14,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:14,661 INFO L82 PathProgramCache]: Analyzing trace with hash -93104110, now seen corresponding path program 1 times [2020-10-15 18:17:14,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:14,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284309505] [2020-10-15 18:17:14,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:14,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:14,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284309505] [2020-10-15 18:17:14,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:14,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:17:14,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110073118] [2020-10-15 18:17:14,754 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:17:14,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:14,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:17:14,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:17:14,755 INFO L87 Difference]: Start difference. First operand 2306 states and 8334 transitions. Second operand 5 states. [2020-10-15 18:17:14,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:14,883 INFO L93 Difference]: Finished difference Result 2522 states and 9160 transitions. [2020-10-15 18:17:14,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:17:14,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-15 18:17:14,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:14,895 INFO L225 Difference]: With dead ends: 2522 [2020-10-15 18:17:14,896 INFO L226 Difference]: Without dead ends: 2522 [2020-10-15 18:17:14,896 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:17:14,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2522 states. [2020-10-15 18:17:14,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2522 to 2482. [2020-10-15 18:17:14,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2482 states. [2020-10-15 18:17:14,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2482 states and 9022 transitions. [2020-10-15 18:17:14,980 INFO L78 Accepts]: Start accepts. Automaton has 2482 states and 9022 transitions. Word has length 15 [2020-10-15 18:17:14,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:14,980 INFO L481 AbstractCegarLoop]: Abstraction has 2482 states and 9022 transitions. [2020-10-15 18:17:14,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:17:14,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 9022 transitions. [2020-10-15 18:17:14,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 18:17:14,984 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:14,984 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:17:14,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 18:17:14,984 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:14,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:14,985 INFO L82 PathProgramCache]: Analyzing trace with hash 458946886, now seen corresponding path program 2 times [2020-10-15 18:17:14,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:14,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010733013] [2020-10-15 18:17:14,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:15,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:15,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010733013] [2020-10-15 18:17:15,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:15,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:17:15,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668414937] [2020-10-15 18:17:15,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:17:15,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:15,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:17:15,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:17:15,107 INFO L87 Difference]: Start difference. First operand 2482 states and 9022 transitions. Second operand 5 states. [2020-10-15 18:17:15,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:15,270 INFO L93 Difference]: Finished difference Result 2562 states and 9310 transitions. [2020-10-15 18:17:15,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 18:17:15,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-15 18:17:15,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:15,280 INFO L225 Difference]: With dead ends: 2562 [2020-10-15 18:17:15,281 INFO L226 Difference]: Without dead ends: 2562 [2020-10-15 18:17:15,281 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:17:15,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2020-10-15 18:17:15,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2562. [2020-10-15 18:17:15,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2562 states. [2020-10-15 18:17:15,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 9310 transitions. [2020-10-15 18:17:15,355 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 9310 transitions. Word has length 15 [2020-10-15 18:17:15,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:15,356 INFO L481 AbstractCegarLoop]: Abstraction has 2562 states and 9310 transitions. [2020-10-15 18:17:15,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:17:15,356 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 9310 transitions. [2020-10-15 18:17:15,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 18:17:15,360 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:15,360 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:17:15,360 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 18:17:15,361 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:15,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:15,361 INFO L82 PathProgramCache]: Analyzing trace with hash 2046082702, now seen corresponding path program 1 times [2020-10-15 18:17:15,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:15,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800108944] [2020-10-15 18:17:15,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:15,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:15,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800108944] [2020-10-15 18:17:15,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:15,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:17:15,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752603771] [2020-10-15 18:17:15,437 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:17:15,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:15,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:17:15,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:17:15,438 INFO L87 Difference]: Start difference. First operand 2562 states and 9310 transitions. Second operand 6 states. [2020-10-15 18:17:15,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:15,514 INFO L93 Difference]: Finished difference Result 3002 states and 10906 transitions. [2020-10-15 18:17:15,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:17:15,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-15 18:17:15,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:15,525 INFO L225 Difference]: With dead ends: 3002 [2020-10-15 18:17:15,525 INFO L226 Difference]: Without dead ends: 3002 [2020-10-15 18:17:15,526 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:17:15,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3002 states. [2020-10-15 18:17:15,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3002 to 2570. [2020-10-15 18:17:15,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2570 states. [2020-10-15 18:17:15,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 9286 transitions. [2020-10-15 18:17:15,605 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 9286 transitions. Word has length 16 [2020-10-15 18:17:15,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:15,605 INFO L481 AbstractCegarLoop]: Abstraction has 2570 states and 9286 transitions. [2020-10-15 18:17:15,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:17:15,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 9286 transitions. [2020-10-15 18:17:15,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 18:17:15,610 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:15,610 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:17:15,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-15 18:17:15,610 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:15,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:15,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1696833598, now seen corresponding path program 2 times [2020-10-15 18:17:15,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:15,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322853788] [2020-10-15 18:17:15,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:15,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:15,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:15,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322853788] [2020-10-15 18:17:15,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:15,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:17:15,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371587979] [2020-10-15 18:17:15,686 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:17:15,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:15,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:17:15,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:17:15,686 INFO L87 Difference]: Start difference. First operand 2570 states and 9286 transitions. Second operand 6 states. [2020-10-15 18:17:15,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:15,815 INFO L93 Difference]: Finished difference Result 2978 states and 10726 transitions. [2020-10-15 18:17:15,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:17:15,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-15 18:17:15,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:15,828 INFO L225 Difference]: With dead ends: 2978 [2020-10-15 18:17:15,829 INFO L226 Difference]: Without dead ends: 2978 [2020-10-15 18:17:15,829 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:17:15,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2020-10-15 18:17:15,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2602. [2020-10-15 18:17:15,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2602 states. [2020-10-15 18:17:15,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 9362 transitions. [2020-10-15 18:17:15,913 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 9362 transitions. Word has length 16 [2020-10-15 18:17:15,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:15,914 INFO L481 AbstractCegarLoop]: Abstraction has 2602 states and 9362 transitions. [2020-10-15 18:17:15,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:17:15,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 9362 transitions. [2020-10-15 18:17:15,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 18:17:15,921 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:15,921 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:17:15,922 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-15 18:17:15,922 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:15,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:15,922 INFO L82 PathProgramCache]: Analyzing trace with hash -555116367, now seen corresponding path program 1 times [2020-10-15 18:17:15,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:15,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555151768] [2020-10-15 18:17:15,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:16,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:16,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555151768] [2020-10-15 18:17:16,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:16,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:17:16,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404292987] [2020-10-15 18:17:16,097 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 18:17:16,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:16,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 18:17:16,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:17:16,098 INFO L87 Difference]: Start difference. First operand 2602 states and 9362 transitions. Second operand 7 states. [2020-10-15 18:17:16,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:16,267 INFO L93 Difference]: Finished difference Result 3186 states and 11426 transitions. [2020-10-15 18:17:16,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:17:16,268 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-15 18:17:16,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:16,283 INFO L225 Difference]: With dead ends: 3186 [2020-10-15 18:17:16,283 INFO L226 Difference]: Without dead ends: 3186 [2020-10-15 18:17:16,284 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:17:16,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3186 states. [2020-10-15 18:17:16,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3186 to 3026. [2020-10-15 18:17:16,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3026 states. [2020-10-15 18:17:16,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3026 states to 3026 states and 10794 transitions. [2020-10-15 18:17:16,365 INFO L78 Accepts]: Start accepts. Automaton has 3026 states and 10794 transitions. Word has length 17 [2020-10-15 18:17:16,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:16,366 INFO L481 AbstractCegarLoop]: Abstraction has 3026 states and 10794 transitions. [2020-10-15 18:17:16,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 18:17:16,366 INFO L276 IsEmpty]: Start isEmpty. Operand 3026 states and 10794 transitions. [2020-10-15 18:17:16,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 18:17:16,372 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:16,372 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:17:16,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-15 18:17:16,372 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:16,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:16,372 INFO L82 PathProgramCache]: Analyzing trace with hash -3065371, now seen corresponding path program 2 times [2020-10-15 18:17:16,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:16,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081090183] [2020-10-15 18:17:16,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:16,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:16,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081090183] [2020-10-15 18:17:16,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:16,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:17:16,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720320675] [2020-10-15 18:17:16,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 18:17:16,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:16,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 18:17:16,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:17:16,625 INFO L87 Difference]: Start difference. First operand 3026 states and 10794 transitions. Second operand 7 states. [2020-10-15 18:17:16,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:16,809 INFO L93 Difference]: Finished difference Result 3282 states and 11642 transitions. [2020-10-15 18:17:16,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:17:16,810 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-15 18:17:16,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:16,820 INFO L225 Difference]: With dead ends: 3282 [2020-10-15 18:17:16,820 INFO L226 Difference]: Without dead ends: 3282 [2020-10-15 18:17:16,822 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-15 18:17:16,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3282 states. [2020-10-15 18:17:16,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3282 to 2898. [2020-10-15 18:17:16,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2898 states. [2020-10-15 18:17:16,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 10378 transitions. [2020-10-15 18:17:16,901 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 10378 transitions. Word has length 17 [2020-10-15 18:17:16,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:16,902 INFO L481 AbstractCegarLoop]: Abstraction has 2898 states and 10378 transitions. [2020-10-15 18:17:16,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 18:17:16,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 10378 transitions. [2020-10-15 18:17:16,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 18:17:16,908 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:16,908 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:17:16,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-15 18:17:16,908 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:16,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:16,908 INFO L82 PathProgramCache]: Analyzing trace with hash -112806921, now seen corresponding path program 3 times [2020-10-15 18:17:16,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:16,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732116174] [2020-10-15 18:17:16,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:17,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:17,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732116174] [2020-10-15 18:17:17,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:17,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:17:17,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281745318] [2020-10-15 18:17:17,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 18:17:17,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:17,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 18:17:17,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:17:17,080 INFO L87 Difference]: Start difference. First operand 2898 states and 10378 transitions. Second operand 7 states. [2020-10-15 18:17:17,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:17,237 INFO L93 Difference]: Finished difference Result 3418 states and 12258 transitions. [2020-10-15 18:17:17,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:17:17,239 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-15 18:17:17,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:17,248 INFO L225 Difference]: With dead ends: 3418 [2020-10-15 18:17:17,248 INFO L226 Difference]: Without dead ends: 3418 [2020-10-15 18:17:17,249 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:17:17,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3418 states. [2020-10-15 18:17:17,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3418 to 3098. [2020-10-15 18:17:17,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2020-10-15 18:17:17,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 11154 transitions. [2020-10-15 18:17:17,396 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 11154 transitions. Word has length 17 [2020-10-15 18:17:17,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:17,397 INFO L481 AbstractCegarLoop]: Abstraction has 3098 states and 11154 transitions. [2020-10-15 18:17:17,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 18:17:17,397 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 11154 transitions. [2020-10-15 18:17:17,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 18:17:17,403 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:17,403 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:17:17,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-15 18:17:17,403 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:17,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:17,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1063517833, now seen corresponding path program 4 times [2020-10-15 18:17:17,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:17,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319889413] [2020-10-15 18:17:17,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:17,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:17,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319889413] [2020-10-15 18:17:17,553 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:17,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:17:17,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434277418] [2020-10-15 18:17:17,554 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 18:17:17,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:17,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 18:17:17,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:17:17,555 INFO L87 Difference]: Start difference. First operand 3098 states and 11154 transitions. Second operand 7 states. [2020-10-15 18:17:17,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:17,748 INFO L93 Difference]: Finished difference Result 3266 states and 11674 transitions. [2020-10-15 18:17:17,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:17:17,749 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-15 18:17:17,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:17,755 INFO L225 Difference]: With dead ends: 3266 [2020-10-15 18:17:17,755 INFO L226 Difference]: Without dead ends: 3266 [2020-10-15 18:17:17,760 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-15 18:17:17,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2020-10-15 18:17:17,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 2690. [2020-10-15 18:17:17,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2690 states. [2020-10-15 18:17:17,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2690 states to 2690 states and 9618 transitions. [2020-10-15 18:17:17,830 INFO L78 Accepts]: Start accepts. Automaton has 2690 states and 9618 transitions. Word has length 17 [2020-10-15 18:17:17,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:17,831 INFO L481 AbstractCegarLoop]: Abstraction has 2690 states and 9618 transitions. [2020-10-15 18:17:17,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 18:17:17,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2690 states and 9618 transitions. [2020-10-15 18:17:17,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 18:17:17,841 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:17,841 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:17:17,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-15 18:17:17,842 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:17,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:17,842 INFO L82 PathProgramCache]: Analyzing trace with hash 207234097, now seen corresponding path program 1 times [2020-10-15 18:17:17,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:17,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568234303] [2020-10-15 18:17:17,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:17,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:17,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568234303] [2020-10-15 18:17:17,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:17,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:17:17,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025324982] [2020-10-15 18:17:17,913 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:17:17,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:17,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:17:17,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:17:17,913 INFO L87 Difference]: Start difference. First operand 2690 states and 9618 transitions. Second operand 4 states. [2020-10-15 18:17:17,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:17,962 INFO L93 Difference]: Finished difference Result 2819 states and 9176 transitions. [2020-10-15 18:17:17,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:17:17,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-15 18:17:17,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:17,967 INFO L225 Difference]: With dead ends: 2819 [2020-10-15 18:17:17,967 INFO L226 Difference]: Without dead ends: 2075 [2020-10-15 18:17:17,968 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:17:17,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2075 states. [2020-10-15 18:17:18,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2075 to 2075. [2020-10-15 18:17:18,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2075 states. [2020-10-15 18:17:18,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 2075 states and 6689 transitions. [2020-10-15 18:17:18,012 INFO L78 Accepts]: Start accepts. Automaton has 2075 states and 6689 transitions. Word has length 17 [2020-10-15 18:17:18,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:18,013 INFO L481 AbstractCegarLoop]: Abstraction has 2075 states and 6689 transitions. [2020-10-15 18:17:18,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:17:18,013 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 6689 transitions. [2020-10-15 18:17:18,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 18:17:18,016 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:18,017 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:17:18,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-15 18:17:18,017 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:18,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:18,017 INFO L82 PathProgramCache]: Analyzing trace with hash -791241669, now seen corresponding path program 1 times [2020-10-15 18:17:18,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:18,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378763807] [2020-10-15 18:17:18,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:18,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:18,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378763807] [2020-10-15 18:17:18,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:18,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:17:18,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848101747] [2020-10-15 18:17:18,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:17:18,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:18,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:17:18,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:17:18,090 INFO L87 Difference]: Start difference. First operand 2075 states and 6689 transitions. Second operand 5 states. [2020-10-15 18:17:18,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:18,148 INFO L93 Difference]: Finished difference Result 1816 states and 5395 transitions. [2020-10-15 18:17:18,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:17:18,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-10-15 18:17:18,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:18,151 INFO L225 Difference]: With dead ends: 1816 [2020-10-15 18:17:18,151 INFO L226 Difference]: Without dead ends: 1357 [2020-10-15 18:17:18,151 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:17:18,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2020-10-15 18:17:18,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1325. [2020-10-15 18:17:18,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1325 states. [2020-10-15 18:17:18,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 3847 transitions. [2020-10-15 18:17:18,178 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 3847 transitions. Word has length 18 [2020-10-15 18:17:18,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:18,179 INFO L481 AbstractCegarLoop]: Abstraction has 1325 states and 3847 transitions. [2020-10-15 18:17:18,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:17:18,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 3847 transitions. [2020-10-15 18:17:18,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-15 18:17:18,182 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:18,182 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] [2020-10-15 18:17:18,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-15 18:17:18,182 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:18,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:18,182 INFO L82 PathProgramCache]: Analyzing trace with hash -905674660, now seen corresponding path program 1 times [2020-10-15 18:17:18,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:18,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840981623] [2020-10-15 18:17:18,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:18,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:18,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840981623] [2020-10-15 18:17:18,260 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:18,260 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:17:18,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449588786] [2020-10-15 18:17:18,261 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:17:18,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:18,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:17:18,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:17:18,262 INFO L87 Difference]: Start difference. First operand 1325 states and 3847 transitions. Second operand 6 states. [2020-10-15 18:17:18,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:18,330 INFO L93 Difference]: Finished difference Result 1173 states and 3364 transitions. [2020-10-15 18:17:18,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:17:18,331 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-15 18:17:18,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:18,333 INFO L225 Difference]: With dead ends: 1173 [2020-10-15 18:17:18,334 INFO L226 Difference]: Without dead ends: 1031 [2020-10-15 18:17:18,334 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:17:18,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2020-10-15 18:17:18,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 959. [2020-10-15 18:17:18,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2020-10-15 18:17:18,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 2791 transitions. [2020-10-15 18:17:18,354 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 2791 transitions. Word has length 21 [2020-10-15 18:17:18,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:18,354 INFO L481 AbstractCegarLoop]: Abstraction has 959 states and 2791 transitions. [2020-10-15 18:17:18,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:17:18,354 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 2791 transitions. [2020-10-15 18:17:18,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-15 18:17:18,357 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:18,357 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] [2020-10-15 18:17:18,357 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-15 18:17:18,357 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:18,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:18,357 INFO L82 PathProgramCache]: Analyzing trace with hash -730235590, now seen corresponding path program 1 times [2020-10-15 18:17:18,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:18,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045446449] [2020-10-15 18:17:18,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:18,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:18,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:18,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045446449] [2020-10-15 18:17:18,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:18,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 18:17:18,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28823938] [2020-10-15 18:17:18,447 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 18:17:18,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:18,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 18:17:18,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:17:18,448 INFO L87 Difference]: Start difference. First operand 959 states and 2791 transitions. Second operand 7 states. [2020-10-15 18:17:18,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:18,522 INFO L93 Difference]: Finished difference Result 929 states and 2730 transitions. [2020-10-15 18:17:18,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 18:17:18,523 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-15 18:17:18,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:18,524 INFO L225 Difference]: With dead ends: 929 [2020-10-15 18:17:18,524 INFO L226 Difference]: Without dead ends: 573 [2020-10-15 18:17:18,524 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:17:18,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-10-15 18:17:18,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 517. [2020-10-15 18:17:18,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2020-10-15 18:17:18,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1477 transitions. [2020-10-15 18:17:18,533 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 1477 transitions. Word has length 24 [2020-10-15 18:17:18,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:18,533 INFO L481 AbstractCegarLoop]: Abstraction has 517 states and 1477 transitions. [2020-10-15 18:17:18,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 18:17:18,534 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 1477 transitions. [2020-10-15 18:17:18,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-15 18:17:18,535 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:18,535 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, 1, 1] [2020-10-15 18:17:18,535 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-15 18:17:18,535 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:18,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:18,536 INFO L82 PathProgramCache]: Analyzing trace with hash -126296697, now seen corresponding path program 1 times [2020-10-15 18:17:18,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:18,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132231506] [2020-10-15 18:17:18,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:18,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:18,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132231506] [2020-10-15 18:17:18,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:18,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:17:18,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184146366] [2020-10-15 18:17:18,587 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:17:18,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:18,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:17:18,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:17:18,588 INFO L87 Difference]: Start difference. First operand 517 states and 1477 transitions. Second operand 4 states. [2020-10-15 18:17:18,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:18,605 INFO L93 Difference]: Finished difference Result 684 states and 1931 transitions. [2020-10-15 18:17:18,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 18:17:18,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-10-15 18:17:18,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:18,606 INFO L225 Difference]: With dead ends: 684 [2020-10-15 18:17:18,606 INFO L226 Difference]: Without dead ends: 214 [2020-10-15 18:17:18,607 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:17:18,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-10-15 18:17:18,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2020-10-15 18:17:18,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-10-15 18:17:18,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 543 transitions. [2020-10-15 18:17:18,610 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 543 transitions. Word has length 27 [2020-10-15 18:17:18,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:18,611 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 543 transitions. [2020-10-15 18:17:18,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:17:18,611 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 543 transitions. [2020-10-15 18:17:18,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-15 18:17:18,612 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:18,612 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, 1, 1] [2020-10-15 18:17:18,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-15 18:17:18,612 INFO L429 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:18,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:18,612 INFO L82 PathProgramCache]: Analyzing trace with hash -666194943, now seen corresponding path program 2 times [2020-10-15 18:17:18,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:18,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574624875] [2020-10-15 18:17:18,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:18,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-15 18:17:18,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574624875] [2020-10-15 18:17:18,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:18,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 18:17:18,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833710489] [2020-10-15 18:17:18,891 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 18:17:18,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:18,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 18:17:18,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-15 18:17:18,892 INFO L87 Difference]: Start difference. First operand 214 states and 543 transitions. Second operand 9 states. [2020-10-15 18:17:19,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:19,161 INFO L93 Difference]: Finished difference Result 303 states and 748 transitions. [2020-10-15 18:17:19,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:17:19,162 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-10-15 18:17:19,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:19,162 INFO L225 Difference]: With dead ends: 303 [2020-10-15 18:17:19,162 INFO L226 Difference]: Without dead ends: 219 [2020-10-15 18:17:19,163 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:17:19,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-10-15 18:17:19,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 168. [2020-10-15 18:17:19,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-10-15 18:17:19,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 415 transitions. [2020-10-15 18:17:19,166 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 415 transitions. Word has length 27 [2020-10-15 18:17:19,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:19,167 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 415 transitions. [2020-10-15 18:17:19,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 18:17:19,167 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 415 transitions. [2020-10-15 18:17:19,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-15 18:17:19,167 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:19,168 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, 1, 1] [2020-10-15 18:17:19,168 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-15 18:17:19,168 INFO L429 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:19,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:19,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1540373759, now seen corresponding path program 3 times [2020-10-15 18:17:19,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:19,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993857448] [2020-10-15 18:17:19,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:17:19,206 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:17:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:17:19,328 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:17:19,368 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 18:17:19,368 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 18:17:19,368 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-15 18:17:19,369 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-15 18:17:19,384 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1065] [1065] L2-->L851: Formula: (let ((.cse6 (= (mod ~y$r_buff1_thd0~0_In1667393920 256) 0)) (.cse7 (= (mod ~y$w_buff1_used~0_In1667393920 256) 0)) (.cse9 (= (mod ~y$r_buff0_thd0~0_In1667393920 256) 0)) (.cse8 (= (mod ~y$w_buff0_used~0_In1667393920 256) 0))) (let ((.cse2 (or .cse9 .cse8)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse3 (or .cse6 .cse7))) (and (or (and .cse0 (= ~y$w_buff0_used~0_Out1667393920 0) .cse1) (and .cse2 (= ~y$w_buff0_used~0_Out1667393920 ~y$w_buff0_used~0_In1667393920))) (or (and .cse2 (or (and (= ~y~0_Out1667393920 ~y~0_In1667393920) .cse3) (and .cse4 .cse5 (= ~y~0_Out1667393920 ~y$w_buff1~0_In1667393920)))) (and .cse0 (= ~y~0_Out1667393920 ~y$w_buff0~0_In1667393920) .cse1)) (= ~y$r_buff1_thd0~0_Out1667393920 ~y$r_buff1_thd0~0_In1667393920) (= ~y$r_buff0_thd0~0_In1667393920 ~y$r_buff0_thd0~0_Out1667393920) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1667393920 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1667393920|) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1667393920 0)) (or (and .cse4 (= ~y$w_buff1_used~0_Out1667393920 0) .cse5) (and (= ~y$w_buff1_used~0_In1667393920 ~y$w_buff1_used~0_Out1667393920) .cse3))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1667393920|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1667393920, ~y$w_buff1~0=~y$w_buff1~0_In1667393920, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1667393920, ~y$w_buff0~0=~y$w_buff0~0_In1667393920, ~y~0=~y~0_In1667393920, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1667393920, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1667393920} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out1667393920, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1667393920|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1667393920|, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1667393920|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1667393920|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1667393920|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1667393920|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1667393920|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1667393920, ~y$w_buff1~0=~y$w_buff1~0_In1667393920, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out1667393920, ~y$w_buff0~0=~y$w_buff0~0_In1667393920, ~y~0=~y~0_Out1667393920, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1667393920, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out1667393920} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-15 18:17:19,390 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:19,390 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:19,392 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:19,392 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:19,392 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:19,393 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:19,393 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:19,393 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:19,393 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:19,393 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:19,393 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:19,394 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:19,394 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:19,394 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:19,395 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:19,395 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:19,395 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:19,396 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:19,396 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:19,396 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:19,396 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:19,396 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:19,396 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:19,397 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:19,397 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:19,397 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:19,397 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:19,397 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:19,398 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:19,398 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:19,398 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:19,398 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:19,398 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:19,398 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:19,399 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:19,399 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:19,400 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:19,400 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:19,400 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:19,400 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:19,400 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:19,401 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:19,401 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:19,401 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:19,401 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:19,401 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:19,401 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:19,402 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:19,402 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:19,402 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:19,402 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:19,402 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:19,402 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:19,403 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:19,403 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:19,403 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:19,403 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:19,403 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:19,403 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:19,404 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:19,404 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:19,404 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:19,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 06:17:19 BasicIcfg [2020-10-15 18:17:19,491 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 18:17:19,492 INFO L168 Benchmark]: Toolchain (without parser) took 20587.93 ms. Allocated memory was 253.8 MB in the beginning and 756.0 MB in the end (delta: 502.3 MB). Free memory was 208.9 MB in the beginning and 651.4 MB in the end (delta: -442.5 MB). Peak memory consumption was 470.2 MB. Max. memory is 14.2 GB. [2020-10-15 18:17:19,493 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 253.8 MB. Free memory is still 230.1 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 18:17:19,493 INFO L168 Benchmark]: CACSL2BoogieTranslator took 827.55 ms. Allocated memory was 253.8 MB in the beginning and 321.9 MB in the end (delta: 68.2 MB). Free memory was 208.9 MB in the beginning and 269.9 MB in the end (delta: -61.0 MB). Peak memory consumption was 32.1 MB. Max. memory is 14.2 GB. [2020-10-15 18:17:19,494 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.98 ms. Allocated memory is still 321.9 MB. Free memory was 269.9 MB in the beginning and 267.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 18:17:19,494 INFO L168 Benchmark]: Boogie Preprocessor took 40.74 ms. Allocated memory is still 321.9 MB. Free memory was 267.4 MB in the beginning and 264.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 18:17:19,495 INFO L168 Benchmark]: RCFGBuilder took 2392.84 ms. Allocated memory was 321.9 MB in the beginning and 361.8 MB in the end (delta: 39.8 MB). Free memory was 264.9 MB in the beginning and 179.8 MB in the end (delta: 85.1 MB). Peak memory consumption was 125.0 MB. Max. memory is 14.2 GB. [2020-10-15 18:17:19,496 INFO L168 Benchmark]: TraceAbstraction took 17248.16 ms. Allocated memory was 361.8 MB in the beginning and 756.0 MB in the end (delta: 394.3 MB). Free memory was 179.8 MB in the beginning and 651.4 MB in the end (delta: -471.7 MB). Peak memory consumption was 333.1 MB. Max. memory is 14.2 GB. [2020-10-15 18:17:19,499 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.21 ms. Allocated memory is still 253.8 MB. Free memory is still 230.1 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 827.55 ms. Allocated memory was 253.8 MB in the beginning and 321.9 MB in the end (delta: 68.2 MB). Free memory was 208.9 MB in the beginning and 269.9 MB in the end (delta: -61.0 MB). Peak memory consumption was 32.1 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 69.98 ms. Allocated memory is still 321.9 MB. Free memory was 269.9 MB in the beginning and 267.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 40.74 ms. Allocated memory is still 321.9 MB. Free memory was 267.4 MB in the beginning and 264.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2392.84 ms. Allocated memory was 321.9 MB in the beginning and 361.8 MB in the end (delta: 39.8 MB). Free memory was 264.9 MB in the beginning and 179.8 MB in the end (delta: 85.1 MB). Peak memory consumption was 125.0 MB. Max. memory is 14.2 GB. * TraceAbstraction took 17248.16 ms. Allocated memory was 361.8 MB in the beginning and 756.0 MB in the end (delta: 394.3 MB). Free memory was 179.8 MB in the beginning and 651.4 MB in the end (delta: -471.7 MB). Peak memory consumption was 333.1 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1880 VarBasedMoverChecksPositive, 110 VarBasedMoverChecksNegative, 39 SemBasedMoverChecksPositive, 71 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 254 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.7s, 121 PlacesBefore, 46 PlacesAfterwards, 110 TransitionsBefore, 34 TransitionsAfterwards, 2572 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 90 TotalNumberOfCompositions, 7693 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 __unbuffered_p3_EBX = 0; [L705] 0 int a = 0; [L706] 0 _Bool main$tmp_guard0; [L707] 0 _Bool main$tmp_guard1; [L709] 0 int x = 0; [L711] 0 int y = 0; [L712] 0 _Bool y$flush_delayed; [L713] 0 int y$mem_tmp; [L714] 0 _Bool y$r_buff0_thd0; [L715] 0 _Bool y$r_buff0_thd1; [L716] 0 _Bool y$r_buff0_thd2; [L717] 0 _Bool y$r_buff0_thd3; [L718] 0 _Bool y$r_buff0_thd4; [L719] 0 _Bool y$r_buff1_thd0; [L720] 0 _Bool y$r_buff1_thd1; [L721] 0 _Bool y$r_buff1_thd2; [L722] 0 _Bool y$r_buff1_thd3; [L723] 0 _Bool y$r_buff1_thd4; [L724] 0 _Bool y$read_delayed; [L725] 0 int *y$read_delayed_var; [L726] 0 int y$w_buff0; [L727] 0 _Bool y$w_buff0_used; [L728] 0 int y$w_buff1; [L729] 0 _Bool y$w_buff1_used; [L731] 0 int z = 0; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L833] 0 pthread_t t805; [L834] FCALL, FORK 0 pthread_create(&t805, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L835] 0 pthread_t t806; [L836] FCALL, FORK 0 pthread_create(&t806, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L837] 0 pthread_t t807; [L838] FCALL, FORK 0 pthread_create(&t807, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L772] 3 y$w_buff1 = y$w_buff0 [L773] 3 y$w_buff0 = 2 [L774] 3 y$w_buff1_used = y$w_buff0_used [L775] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L777] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L778] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L779] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L780] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L781] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L782] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L785] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L839] 0 pthread_t t808; [L840] FCALL, FORK 0 pthread_create(&t808, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L802] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L805] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L811] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L811] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L811] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L811] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L812] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L812] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L813] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L813] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L814] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L814] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L815] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L815] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L818] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 4 return 0; [L737] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L740] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L758] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L758] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L760] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L761] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L762] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L788] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L788] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L789] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L790] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L791] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L792] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L765] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 2 return 0; [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L747] 1 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 y$flush_delayed = weak$$choice2 [L856] 0 y$mem_tmp = y [L857] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L857] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L858] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L858] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0 [L858] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L858] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L858] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L859] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L859] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L860] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L860] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L860] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L860] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L860] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L861] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L862] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L863] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L863] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L865] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L865] 0 y = y$flush_delayed ? y$mem_tmp : y [L866] 0 y$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=2, __unbuffered_p3_EBX=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=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 109 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.9s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.0s, HoareTripleCheckerStatistics: 778 SDtfs, 912 SDslu, 1386 SDs, 0 SdLazy, 691 SolverSat, 170 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3890occurred 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: 1.9s AutomataMinimizationTime, 23 MinimizatonAttempts, 2755 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 402 NumberOfCodeBlocks, 402 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 352 ConstructedInterpolants, 0 QuantifiedInterpolants, 55329 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...