/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 11:11:43,693 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 11:11:43,697 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 11:11:43,739 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 11:11:43,740 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 11:11:43,748 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 11:11:43,751 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 11:11:43,755 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 11:11:43,758 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 11:11:43,761 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 11:11:43,763 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 11:11:43,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 11:11:43,764 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 11:11:43,766 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 11:11:43,767 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 11:11:43,768 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 11:11:43,769 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 11:11:43,770 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 11:11:43,771 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 11:11:43,773 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 11:11:43,774 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 11:11:43,775 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 11:11:43,776 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 11:11:43,777 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 11:11:43,779 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 11:11:43,779 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 11:11:43,780 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 11:11:43,780 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 11:11:43,781 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 11:11:43,782 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 11:11:43,782 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 11:11:43,783 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 11:11:43,783 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 11:11:43,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 11:11:43,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 11:11:43,785 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 11:11:43,786 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 11:11:43,786 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 11:11:43,786 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 11:11:43,787 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 11:11:43,788 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 11:11:43,789 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-16 11:11:43,810 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 11:11:43,811 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 11:11:43,812 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 11:11:43,812 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 11:11:43,812 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 11:11:43,813 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 11:11:43,813 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 11:11:43,813 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 11:11:43,813 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 11:11:43,813 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 11:11:43,814 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 11:11:43,814 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 11:11:43,814 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 11:11:43,814 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 11:11:43,814 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 11:11:43,814 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 11:11:43,815 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 11:11:43,815 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 11:11:43,815 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 11:11:43,815 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 11:11:43,815 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 11:11:43,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 11:11:43,816 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 11:11:43,816 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 11:11:43,816 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 11:11:43,816 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 11:11:43,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 11:11:43,817 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 11:11:43,817 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-16 11:11:43,817 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 11:11:44,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 11:11:44,102 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 11:11:44,107 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 11:11:44,110 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 11:11:44,111 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 11:11:44,112 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i [2020-10-16 11:11:44,190 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9dba571bd/ecaf74c7d1914edf9c96782685a806a4/FLAGd0c3a000a [2020-10-16 11:11:44,776 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 11:11:44,777 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i [2020-10-16 11:11:44,805 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9dba571bd/ecaf74c7d1914edf9c96782685a806a4/FLAGd0c3a000a [2020-10-16 11:11:45,013 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9dba571bd/ecaf74c7d1914edf9c96782685a806a4 [2020-10-16 11:11:45,023 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 11:11:45,025 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 11:11:45,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 11:11:45,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 11:11:45,030 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 11:11:45,031 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:11:45" (1/1) ... [2020-10-16 11:11:45,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@106f3b95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:45, skipping insertion in model container [2020-10-16 11:11:45,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:11:45" (1/1) ... [2020-10-16 11:11:45,042 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 11:11:45,084 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 11:11:45,705 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 11:11:45,732 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 11:11:45,793 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 11:11:45,868 INFO L208 MainTranslator]: Completed translation [2020-10-16 11:11:45,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:45 WrapperNode [2020-10-16 11:11:45,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 11:11:45,870 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 11:11:45,870 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 11:11:45,870 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 11:11:45,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:45" (1/1) ... [2020-10-16 11:11:45,900 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:45" (1/1) ... [2020-10-16 11:11:45,939 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 11:11:45,939 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 11:11:45,939 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 11:11:45,939 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 11:11:45,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:45" (1/1) ... [2020-10-16 11:11:45,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:45" (1/1) ... [2020-10-16 11:11:45,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:45" (1/1) ... [2020-10-16 11:11:45,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:45" (1/1) ... [2020-10-16 11:11:45,967 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:45" (1/1) ... [2020-10-16 11:11:45,972 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:45" (1/1) ... [2020-10-16 11:11:45,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:45" (1/1) ... [2020-10-16 11:11:45,982 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 11:11:45,982 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 11:11:45,983 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 11:11:45,983 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 11:11:45,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:45" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 11:11:46,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 11:11:46,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 11:11:46,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 11:11:46,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 11:11:46,059 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 11:11:46,060 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 11:11:46,060 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 11:11:46,061 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 11:11:46,062 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 11:11:46,063 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 11:11:46,063 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 11:11:46,063 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 11:11:46,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 11:11:46,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 11:11:46,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 11:11:46,066 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 11:11:48,482 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 11:11:48,482 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 11:11:48,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:11:48 BoogieIcfgContainer [2020-10-16 11:11:48,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 11:11:48,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 11:11:48,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 11:11:48,489 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 11:11:48,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:11:45" (1/3) ... [2020-10-16 11:11:48,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b7da060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:11:48, skipping insertion in model container [2020-10-16 11:11:48,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:45" (2/3) ... [2020-10-16 11:11:48,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b7da060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:11:48, skipping insertion in model container [2020-10-16 11:11:48,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:11:48" (3/3) ... [2020-10-16 11:11:48,493 INFO L111 eAbstractionObserver]: Analyzing ICFG mix037_tso.oepc.i [2020-10-16 11:11:48,504 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 11:11:48,504 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 11:11:48,513 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 11:11:48,514 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 11:11:48,544 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,545 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,545 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,545 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,545 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,546 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,546 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,546 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,546 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,546 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,546 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,548 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,548 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,548 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,548 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,548 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,549 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,551 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,551 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,551 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,552 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,552 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,552 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,552 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,552 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,552 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,553 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,553 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,553 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,553 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,554 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,554 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,554 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,554 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,555 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,555 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,555 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,555 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,555 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,557 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,557 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,560 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,561 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,561 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,561 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,561 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,562 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,562 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,562 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,562 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,562 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,568 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,568 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,571 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,572 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,572 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,572 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,572 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,572 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,575 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,575 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,575 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,575 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,576 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,576 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,576 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,576 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,576 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:48,578 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 11:11:48,591 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 11:11:48,611 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 11:11:48,611 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 11:11:48,612 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 11:11:48,612 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 11:11:48,612 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 11:11:48,612 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 11:11:48,612 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 11:11:48,612 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 11:11:48,626 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 11:11:48,629 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 115 transitions, 250 flow [2020-10-16 11:11:48,631 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 115 transitions, 250 flow [2020-10-16 11:11:48,633 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 126 places, 115 transitions, 250 flow [2020-10-16 11:11:48,684 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2020-10-16 11:11:48,684 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 11:11:48,690 INFO L80 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2020-10-16 11:11:48,694 INFO L117 LiptonReduction]: Number of co-enabled transitions 2806 [2020-10-16 11:11:48,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:48,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:48,814 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:48,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:48,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:48,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:48,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:48,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:48,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:48,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:48,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:48,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:48,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:48,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:48,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:48,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:48,953 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:48,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:48,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:48,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:48,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:48,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:48,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:48,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:48,981 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:48,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:48,983 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:48,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:48,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:48,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:48,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:48,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:49,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:49,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:49,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:49,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:49,021 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:49,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:49,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:49,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:49,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:49,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:49,044 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:49,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:49,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:49,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:49,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:49,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:49,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:49,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:49,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:49,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:49,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:49,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:49,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:49,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:49,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:49,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:49,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:49,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:49,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:49,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:49,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:49,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:49,377 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:49,377 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:49,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:49,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:49,381 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:49,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:49,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:49,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:49,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:49,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:49,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:49,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:49,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:49,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:49,409 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:49,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:49,464 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:49,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:49,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:49,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:49,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:49,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:49,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:49,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:49,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:49,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:49,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:49,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:49,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:49,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:49,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:49,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:49,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 11:11:49,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:49,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 11:11:49,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:49,562 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 11:11:49,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:49,563 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 11:11:49,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:49,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 11:11:49,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:49,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:49,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:49,673 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:49,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:49,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:49,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:49,682 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:49,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:49,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:49,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:49,701 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:49,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:49,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:49,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:49,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:49,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:49,984 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-16 11:11:50,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term [2020-10-16 11:11:50,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:50,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term [2020-10-16 11:11:50,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:50,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 11:11:50,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:50,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 11:11:50,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:51,400 WARN L193 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-10-16 11:11:51,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-10-16 11:11:51,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:51,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 11:11:51,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:52,684 WARN L193 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 148 DAG size of output: 127 [2020-10-16 11:11:52,791 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:52,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:52,814 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:52,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:52,816 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:52,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:52,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:52,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:52,833 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:52,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:52,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:52,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:52,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:52,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:52,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:52,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:53,263 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 11:11:53,377 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 11:11:53,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 11:11:53,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:53,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:53,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:53,777 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:53,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:53,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:53,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:53,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:53,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:53,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:53,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:53,798 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:53,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:53,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:53,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:53,802 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:53,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:53,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:53,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:53,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:53,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:53,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:53,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:53,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:53,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:53,867 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:53,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:53,869 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:53,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:53,871 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:53,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:53,873 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:53,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:53,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:53,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:53,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:53,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:53,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:53,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:53,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:53,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:53,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:53,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:53,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:53,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:53,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:53,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:53,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:53,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:53,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:53,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:53,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:53,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:53,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:53,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:53,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:53,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:53,997 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:53,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:53,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:53,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:54,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:54,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:54,003 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:54,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:54,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:54,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:54,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:54,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:54,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:54,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:54,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:54,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:54,044 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:54,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:54,045 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:54,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:54,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:54,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:54,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:54,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:54,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:54,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:54,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:54,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:54,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:54,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:54,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:54,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:54,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:54,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:54,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:54,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:54,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:54,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:54,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:54,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:54,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:54,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:54,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:54,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:54,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:54,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:54,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:54,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:54,353 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:54,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:54,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:54,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:54,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:54,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:54,358 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:54,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:54,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:54,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:54,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:54,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:54,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:54,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:54,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:54,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:54,426 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:54,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:54,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:54,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:54,429 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:54,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:54,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:54,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:54,874 WARN L193 SmtUtils]: Spent 399.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-16 11:11:55,277 WARN L193 SmtUtils]: Spent 400.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-16 11:11:55,976 WARN L193 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 112 [2020-10-16 11:11:56,293 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-10-16 11:11:57,761 WARN L193 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 142 DAG size of output: 133 [2020-10-16 11:11:58,185 WARN L193 SmtUtils]: Spent 421.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-10-16 11:11:59,093 WARN L193 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-10-16 11:11:59,466 WARN L193 SmtUtils]: Spent 370.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-16 11:11:59,802 WARN L193 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2020-10-16 11:11:59,943 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-16 11:11:59,974 INFO L132 LiptonReduction]: Checked pairs total: 7756 [2020-10-16 11:11:59,975 INFO L134 LiptonReduction]: Total number of compositions: 92 [2020-10-16 11:11:59,981 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 34 transitions, 88 flow [2020-10-16 11:12:00,290 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4872 states. [2020-10-16 11:12:00,292 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states. [2020-10-16 11:12:00,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-16 11:12:00,301 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:12:00,302 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 11:12:00,303 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:12:00,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:12:00,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1157549879, now seen corresponding path program 1 times [2020-10-16 11:12:00,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:12:00,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724012964] [2020-10-16 11:12:00,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:12:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:12:00,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:12:00,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724012964] [2020-10-16 11:12:00,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:12:00,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 11:12:00,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630348496] [2020-10-16 11:12:00,630 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:12:00,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:12:00,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:12:00,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:12:00,648 INFO L87 Difference]: Start difference. First operand 4872 states. Second operand 3 states. [2020-10-16 11:12:00,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:12:00,812 INFO L93 Difference]: Finished difference Result 4062 states and 16125 transitions. [2020-10-16 11:12:00,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:12:00,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-16 11:12:00,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:12:00,868 INFO L225 Difference]: With dead ends: 4062 [2020-10-16 11:12:00,868 INFO L226 Difference]: Without dead ends: 3312 [2020-10-16 11:12:00,869 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:12:00,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3312 states. [2020-10-16 11:12:01,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3312 to 3312. [2020-10-16 11:12:01,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3312 states. [2020-10-16 11:12:01,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 12950 transitions. [2020-10-16 11:12:01,090 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 12950 transitions. Word has length 5 [2020-10-16 11:12:01,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:12:01,090 INFO L481 AbstractCegarLoop]: Abstraction has 3312 states and 12950 transitions. [2020-10-16 11:12:01,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:12:01,091 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 12950 transitions. [2020-10-16 11:12:01,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 11:12:01,094 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:12:01,094 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:12:01,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 11:12:01,095 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:12:01,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:12:01,095 INFO L82 PathProgramCache]: Analyzing trace with hash 2037466768, now seen corresponding path program 1 times [2020-10-16 11:12:01,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:12:01,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386740781] [2020-10-16 11:12:01,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:12:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:12:01,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:12:01,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386740781] [2020-10-16 11:12:01,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:12:01,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 11:12:01,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973769461] [2020-10-16 11:12:01,223 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:12:01,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:12:01,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:12:01,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:12:01,230 INFO L87 Difference]: Start difference. First operand 3312 states and 12950 transitions. Second operand 3 states. [2020-10-16 11:12:01,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:12:01,306 INFO L93 Difference]: Finished difference Result 3262 states and 12720 transitions. [2020-10-16 11:12:01,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:12:01,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-16 11:12:01,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:12:01,335 INFO L225 Difference]: With dead ends: 3262 [2020-10-16 11:12:01,335 INFO L226 Difference]: Without dead ends: 3262 [2020-10-16 11:12:01,336 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:12:01,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2020-10-16 11:12:01,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 3262. [2020-10-16 11:12:01,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3262 states. [2020-10-16 11:12:01,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 12720 transitions. [2020-10-16 11:12:01,474 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 12720 transitions. Word has length 11 [2020-10-16 11:12:01,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:12:01,476 INFO L481 AbstractCegarLoop]: Abstraction has 3262 states and 12720 transitions. [2020-10-16 11:12:01,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:12:01,476 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 12720 transitions. [2020-10-16 11:12:01,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 11:12:01,479 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:12:01,479 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:12:01,480 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 11:12:01,480 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:12:01,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:12:01,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1809190828, now seen corresponding path program 1 times [2020-10-16 11:12:01,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:12:01,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313153033] [2020-10-16 11:12:01,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:12:01,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:12:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:12:01,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313153033] [2020-10-16 11:12:01,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:12:01,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 11:12:01,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815622263] [2020-10-16 11:12:01,569 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:12:01,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:12:01,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:12:01,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:12:01,570 INFO L87 Difference]: Start difference. First operand 3262 states and 12720 transitions. Second operand 3 states. [2020-10-16 11:12:01,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:12:01,627 INFO L93 Difference]: Finished difference Result 3062 states and 11850 transitions. [2020-10-16 11:12:01,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:12:01,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-16 11:12:01,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:12:01,655 INFO L225 Difference]: With dead ends: 3062 [2020-10-16 11:12:01,656 INFO L226 Difference]: Without dead ends: 3062 [2020-10-16 11:12:01,657 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:12:01,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2020-10-16 11:12:01,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 3062. [2020-10-16 11:12:01,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3062 states. [2020-10-16 11:12:01,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 11850 transitions. [2020-10-16 11:12:01,782 INFO L78 Accepts]: Start accepts. Automaton has 3062 states and 11850 transitions. Word has length 12 [2020-10-16 11:12:01,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:12:01,783 INFO L481 AbstractCegarLoop]: Abstraction has 3062 states and 11850 transitions. [2020-10-16 11:12:01,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:12:01,783 INFO L276 IsEmpty]: Start isEmpty. Operand 3062 states and 11850 transitions. [2020-10-16 11:12:01,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 11:12:01,788 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:12:01,788 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:12:01,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 11:12:01,788 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:12:01,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:12:01,789 INFO L82 PathProgramCache]: Analyzing trace with hash -499637443, now seen corresponding path program 1 times [2020-10-16 11:12:01,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:12:01,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590300097] [2020-10-16 11:12:01,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:12:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:12:01,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:12:01,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590300097] [2020-10-16 11:12:01,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:12:01,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 11:12:01,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989439472] [2020-10-16 11:12:01,938 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:12:01,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:12:01,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:12:01,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:12:01,939 INFO L87 Difference]: Start difference. First operand 3062 states and 11850 transitions. Second operand 4 states. [2020-10-16 11:12:02,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:12:02,108 INFO L93 Difference]: Finished difference Result 3022 states and 11668 transitions. [2020-10-16 11:12:02,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 11:12:02,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-16 11:12:02,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:12:02,190 INFO L225 Difference]: With dead ends: 3022 [2020-10-16 11:12:02,190 INFO L226 Difference]: Without dead ends: 3022 [2020-10-16 11:12:02,191 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:12:02,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2020-10-16 11:12:02,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 3022. [2020-10-16 11:12:02,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3022 states. [2020-10-16 11:12:02,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 11668 transitions. [2020-10-16 11:12:02,291 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 11668 transitions. Word has length 13 [2020-10-16 11:12:02,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:12:02,292 INFO L481 AbstractCegarLoop]: Abstraction has 3022 states and 11668 transitions. [2020-10-16 11:12:02,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:12:02,292 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 11668 transitions. [2020-10-16 11:12:02,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 11:12:02,295 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:12:02,295 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:12:02,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 11:12:02,296 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:12:02,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:12:02,296 INFO L82 PathProgramCache]: Analyzing trace with hash 829254657, now seen corresponding path program 1 times [2020-10-16 11:12:02,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:12:02,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660679627] [2020-10-16 11:12:02,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:12:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:12:02,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:12:02,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660679627] [2020-10-16 11:12:02,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:12:02,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:12:02,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841737721] [2020-10-16 11:12:02,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:12:02,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:12:02,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:12:02,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:12:02,465 INFO L87 Difference]: Start difference. First operand 3022 states and 11668 transitions. Second operand 5 states. [2020-10-16 11:12:02,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:12:02,534 INFO L93 Difference]: Finished difference Result 2998 states and 11548 transitions. [2020-10-16 11:12:02,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:12:02,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-16 11:12:02,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:12:02,549 INFO L225 Difference]: With dead ends: 2998 [2020-10-16 11:12:02,549 INFO L226 Difference]: Without dead ends: 2998 [2020-10-16 11:12:02,549 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:12:02,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2020-10-16 11:12:02,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 2998. [2020-10-16 11:12:02,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2998 states. [2020-10-16 11:12:02,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2998 states to 2998 states and 11548 transitions. [2020-10-16 11:12:02,644 INFO L78 Accepts]: Start accepts. Automaton has 2998 states and 11548 transitions. Word has length 14 [2020-10-16 11:12:02,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:12:02,644 INFO L481 AbstractCegarLoop]: Abstraction has 2998 states and 11548 transitions. [2020-10-16 11:12:02,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:12:02,644 INFO L276 IsEmpty]: Start isEmpty. Operand 2998 states and 11548 transitions. [2020-10-16 11:12:02,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 11:12:02,647 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:12:02,648 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:12:02,648 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 11:12:02,648 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:12:02,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:12:02,648 INFO L82 PathProgramCache]: Analyzing trace with hash 243137123, now seen corresponding path program 1 times [2020-10-16 11:12:02,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:12:02,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017737934] [2020-10-16 11:12:02,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:12:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:12:02,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:12:02,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017737934] [2020-10-16 11:12:02,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:12:02,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:12:02,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005890691] [2020-10-16 11:12:02,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:12:02,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:12:02,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:12:02,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:12:02,737 INFO L87 Difference]: Start difference. First operand 2998 states and 11548 transitions. Second operand 5 states. [2020-10-16 11:12:02,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:12:02,842 INFO L93 Difference]: Finished difference Result 3008 states and 11576 transitions. [2020-10-16 11:12:02,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 11:12:02,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-16 11:12:02,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:12:02,855 INFO L225 Difference]: With dead ends: 3008 [2020-10-16 11:12:02,855 INFO L226 Difference]: Without dead ends: 3008 [2020-10-16 11:12:02,856 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:12:02,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2020-10-16 11:12:02,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 2938. [2020-10-16 11:12:02,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2938 states. [2020-10-16 11:12:02,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2938 states to 2938 states and 11295 transitions. [2020-10-16 11:12:02,950 INFO L78 Accepts]: Start accepts. Automaton has 2938 states and 11295 transitions. Word has length 15 [2020-10-16 11:12:02,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:12:02,950 INFO L481 AbstractCegarLoop]: Abstraction has 2938 states and 11295 transitions. [2020-10-16 11:12:02,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:12:02,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2938 states and 11295 transitions. [2020-10-16 11:12:02,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 11:12:02,955 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:12:02,955 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:12:02,955 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 11:12:02,955 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:12:02,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:12:02,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1914537573, now seen corresponding path program 1 times [2020-10-16 11:12:02,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:12:02,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804651330] [2020-10-16 11:12:02,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:12:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:12:03,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:12:03,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804651330] [2020-10-16 11:12:03,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:12:03,041 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:12:03,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049559944] [2020-10-16 11:12:03,042 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:12:03,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:12:03,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:12:03,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:12:03,043 INFO L87 Difference]: Start difference. First operand 2938 states and 11295 transitions. Second operand 5 states. [2020-10-16 11:12:03,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:12:03,199 INFO L93 Difference]: Finished difference Result 3212 states and 12438 transitions. [2020-10-16 11:12:03,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:12:03,201 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-16 11:12:03,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:12:03,214 INFO L225 Difference]: With dead ends: 3212 [2020-10-16 11:12:03,215 INFO L226 Difference]: Without dead ends: 3212 [2020-10-16 11:12:03,215 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:12:03,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3212 states. [2020-10-16 11:12:03,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3212 to 3212. [2020-10-16 11:12:03,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3212 states. [2020-10-16 11:12:03,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 12438 transitions. [2020-10-16 11:12:03,326 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 12438 transitions. Word has length 16 [2020-10-16 11:12:03,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:12:03,327 INFO L481 AbstractCegarLoop]: Abstraction has 3212 states and 12438 transitions. [2020-10-16 11:12:03,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:12:03,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 12438 transitions. [2020-10-16 11:12:03,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 11:12:03,332 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:12:03,332 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:12:03,332 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 11:12:03,332 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:12:03,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:12:03,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1052683873, now seen corresponding path program 2 times [2020-10-16 11:12:03,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:12:03,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998856502] [2020-10-16 11:12:03,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:12:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:12:03,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:12:03,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998856502] [2020-10-16 11:12:03,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:12:03,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:12:03,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844558016] [2020-10-16 11:12:03,563 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:12:03,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:12:03,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:12:03,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:12:03,563 INFO L87 Difference]: Start difference. First operand 3212 states and 12438 transitions. Second operand 6 states. [2020-10-16 11:12:03,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:12:03,778 INFO L93 Difference]: Finished difference Result 3974 states and 15357 transitions. [2020-10-16 11:12:03,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:12:03,779 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-16 11:12:03,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:12:03,798 INFO L225 Difference]: With dead ends: 3974 [2020-10-16 11:12:03,798 INFO L226 Difference]: Without dead ends: 3974 [2020-10-16 11:12:03,800 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:12:03,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3974 states. [2020-10-16 11:12:03,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3974 to 3682. [2020-10-16 11:12:03,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3682 states. [2020-10-16 11:12:03,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3682 states and 14153 transitions. [2020-10-16 11:12:03,930 INFO L78 Accepts]: Start accepts. Automaton has 3682 states and 14153 transitions. Word has length 16 [2020-10-16 11:12:03,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:12:03,930 INFO L481 AbstractCegarLoop]: Abstraction has 3682 states and 14153 transitions. [2020-10-16 11:12:03,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:12:03,931 INFO L276 IsEmpty]: Start isEmpty. Operand 3682 states and 14153 transitions. [2020-10-16 11:12:03,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 11:12:03,936 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:12:03,936 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:12:03,936 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 11:12:03,937 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:12:03,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:12:03,937 INFO L82 PathProgramCache]: Analyzing trace with hash -473924990, now seen corresponding path program 1 times [2020-10-16 11:12:03,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:12:03,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780797173] [2020-10-16 11:12:03,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:12:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:12:04,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:12:04,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780797173] [2020-10-16 11:12:04,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:12:04,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:12:04,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329432874] [2020-10-16 11:12:04,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:12:04,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:12:04,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:12:04,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:12:04,005 INFO L87 Difference]: Start difference. First operand 3682 states and 14153 transitions. Second operand 4 states. [2020-10-16 11:12:04,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:12:04,070 INFO L93 Difference]: Finished difference Result 3736 states and 13108 transitions. [2020-10-16 11:12:04,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:12:04,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-16 11:12:04,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:12:04,081 INFO L225 Difference]: With dead ends: 3736 [2020-10-16 11:12:04,081 INFO L226 Difference]: Without dead ends: 2758 [2020-10-16 11:12:04,082 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:12:04,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2020-10-16 11:12:04,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 2758. [2020-10-16 11:12:04,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2758 states. [2020-10-16 11:12:04,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2758 states to 2758 states and 9533 transitions. [2020-10-16 11:12:04,159 INFO L78 Accepts]: Start accepts. Automaton has 2758 states and 9533 transitions. Word has length 16 [2020-10-16 11:12:04,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:12:04,160 INFO L481 AbstractCegarLoop]: Abstraction has 2758 states and 9533 transitions. [2020-10-16 11:12:04,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:12:04,160 INFO L276 IsEmpty]: Start isEmpty. Operand 2758 states and 9533 transitions. [2020-10-16 11:12:04,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 11:12:04,165 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:12:04,165 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:12:04,165 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 11:12:04,166 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:12:04,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:12:04,166 INFO L82 PathProgramCache]: Analyzing trace with hash 559313562, now seen corresponding path program 1 times [2020-10-16 11:12:04,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:12:04,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952371187] [2020-10-16 11:12:04,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:12:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:12:04,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:12:04,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952371187] [2020-10-16 11:12:04,228 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:12:04,228 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:12:04,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717389687] [2020-10-16 11:12:04,229 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:12:04,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:12:04,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:12:04,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:12:04,230 INFO L87 Difference]: Start difference. First operand 2758 states and 9533 transitions. Second operand 5 states. [2020-10-16 11:12:04,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:12:04,296 INFO L93 Difference]: Finished difference Result 2328 states and 7484 transitions. [2020-10-16 11:12:04,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:12:04,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-16 11:12:04,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:12:04,304 INFO L225 Difference]: With dead ends: 2328 [2020-10-16 11:12:04,304 INFO L226 Difference]: Without dead ends: 1758 [2020-10-16 11:12:04,305 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-16 11:12:04,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2020-10-16 11:12:04,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1570. [2020-10-16 11:12:04,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-10-16 11:12:04,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 4883 transitions. [2020-10-16 11:12:04,346 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 4883 transitions. Word has length 17 [2020-10-16 11:12:04,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:12:04,346 INFO L481 AbstractCegarLoop]: Abstraction has 1570 states and 4883 transitions. [2020-10-16 11:12:04,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:12:04,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 4883 transitions. [2020-10-16 11:12:04,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 11:12:04,350 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:12:04,351 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:12:04,351 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 11:12:04,351 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:12:04,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:12:04,351 INFO L82 PathProgramCache]: Analyzing trace with hash -419348928, now seen corresponding path program 1 times [2020-10-16 11:12:04,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:12:04,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253653764] [2020-10-16 11:12:04,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:12:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:12:04,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:12:04,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253653764] [2020-10-16 11:12:04,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:12:04,435 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:12:04,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156164414] [2020-10-16 11:12:04,435 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:12:04,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:12:04,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:12:04,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:12:04,436 INFO L87 Difference]: Start difference. First operand 1570 states and 4883 transitions. Second operand 6 states. [2020-10-16 11:12:04,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:12:04,512 INFO L93 Difference]: Finished difference Result 1383 states and 4281 transitions. [2020-10-16 11:12:04,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:12:04,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-16 11:12:04,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:12:04,517 INFO L225 Difference]: With dead ends: 1383 [2020-10-16 11:12:04,518 INFO L226 Difference]: Without dead ends: 1229 [2020-10-16 11:12:04,518 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-16 11:12:04,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2020-10-16 11:12:04,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1133. [2020-10-16 11:12:04,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2020-10-16 11:12:04,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 3572 transitions. [2020-10-16 11:12:04,546 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 3572 transitions. Word has length 20 [2020-10-16 11:12:04,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:12:04,547 INFO L481 AbstractCegarLoop]: Abstraction has 1133 states and 3572 transitions. [2020-10-16 11:12:04,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:12:04,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 3572 transitions. [2020-10-16 11:12:04,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-16 11:12:04,550 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:12:04,550 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-16 11:12:04,550 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 11:12:04,551 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:12:04,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:12:04,551 INFO L82 PathProgramCache]: Analyzing trace with hash -782976564, now seen corresponding path program 1 times [2020-10-16 11:12:04,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:12:04,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924580618] [2020-10-16 11:12:04,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:12:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:12:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:12:04,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924580618] [2020-10-16 11:12:04,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:12:04,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:12:04,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466825497] [2020-10-16 11:12:04,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:12:04,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:12:04,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:12:04,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:12:04,608 INFO L87 Difference]: Start difference. First operand 1133 states and 3572 transitions. Second operand 4 states. [2020-10-16 11:12:04,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:12:04,633 INFO L93 Difference]: Finished difference Result 1484 states and 4581 transitions. [2020-10-16 11:12:04,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 11:12:04,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-16 11:12:04,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:12:04,638 INFO L225 Difference]: With dead ends: 1484 [2020-10-16 11:12:04,638 INFO L226 Difference]: Without dead ends: 1136 [2020-10-16 11:12:04,638 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:12:04,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2020-10-16 11:12:04,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1133. [2020-10-16 11:12:04,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2020-10-16 11:12:04,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 3470 transitions. [2020-10-16 11:12:04,664 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 3470 transitions. Word has length 24 [2020-10-16 11:12:04,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:12:04,664 INFO L481 AbstractCegarLoop]: Abstraction has 1133 states and 3470 transitions. [2020-10-16 11:12:04,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:12:04,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 3470 transitions. [2020-10-16 11:12:04,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-16 11:12:04,668 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:12:04,668 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-16 11:12:04,668 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 11:12:04,669 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:12:04,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:12:04,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1113578270, now seen corresponding path program 1 times [2020-10-16 11:12:04,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:12:04,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003425532] [2020-10-16 11:12:04,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:12:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:12:04,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:12:04,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003425532] [2020-10-16 11:12:04,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:12:04,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:12:04,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367925443] [2020-10-16 11:12:04,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:12:04,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:12:04,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:12:04,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:12:04,726 INFO L87 Difference]: Start difference. First operand 1133 states and 3470 transitions. Second operand 4 states. [2020-10-16 11:12:04,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:12:04,749 INFO L93 Difference]: Finished difference Result 1646 states and 4964 transitions. [2020-10-16 11:12:04,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 11:12:04,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-16 11:12:04,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:12:04,753 INFO L225 Difference]: With dead ends: 1646 [2020-10-16 11:12:04,753 INFO L226 Difference]: Without dead ends: 946 [2020-10-16 11:12:04,754 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:12:04,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2020-10-16 11:12:04,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 943. [2020-10-16 11:12:04,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2020-10-16 11:12:04,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 2696 transitions. [2020-10-16 11:12:04,773 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 2696 transitions. Word has length 24 [2020-10-16 11:12:04,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:12:04,774 INFO L481 AbstractCegarLoop]: Abstraction has 943 states and 2696 transitions. [2020-10-16 11:12:04,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:12:04,774 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 2696 transitions. [2020-10-16 11:12:04,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-16 11:12:04,777 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:12:04,777 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-16 11:12:04,777 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 11:12:04,777 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:12:04,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:12:04,778 INFO L82 PathProgramCache]: Analyzing trace with hash 2122831838, now seen corresponding path program 2 times [2020-10-16 11:12:04,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:12:04,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764192571] [2020-10-16 11:12:04,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:12:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:12:04,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:12:04,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764192571] [2020-10-16 11:12:04,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:12:04,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 11:12:04,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3099599] [2020-10-16 11:12:04,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 11:12:04,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:12:04,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 11:12:04,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:12:04,889 INFO L87 Difference]: Start difference. First operand 943 states and 2696 transitions. Second operand 7 states. [2020-10-16 11:12:05,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:12:05,000 INFO L93 Difference]: Finished difference Result 914 states and 2638 transitions. [2020-10-16 11:12:05,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 11:12:05,001 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-16 11:12:05,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:12:05,003 INFO L225 Difference]: With dead ends: 914 [2020-10-16 11:12:05,003 INFO L226 Difference]: Without dead ends: 357 [2020-10-16 11:12:05,004 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-16 11:12:05,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2020-10-16 11:12:05,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2020-10-16 11:12:05,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2020-10-16 11:12:05,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 964 transitions. [2020-10-16 11:12:05,013 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 964 transitions. Word has length 24 [2020-10-16 11:12:05,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:12:05,014 INFO L481 AbstractCegarLoop]: Abstraction has 357 states and 964 transitions. [2020-10-16 11:12:05,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 11:12:05,014 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 964 transitions. [2020-10-16 11:12:05,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-16 11:12:05,017 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:12:05,017 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, 1] [2020-10-16 11:12:05,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 11:12:05,017 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:12:05,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:12:05,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1759507118, now seen corresponding path program 1 times [2020-10-16 11:12:05,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:12:05,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972130877] [2020-10-16 11:12:05,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:12:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:12:05,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:12:05,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972130877] [2020-10-16 11:12:05,319 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:12:05,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:12:05,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722491982] [2020-10-16 11:12:05,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 11:12:05,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:12:05,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 11:12:05,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:12:05,320 INFO L87 Difference]: Start difference. First operand 357 states and 964 transitions. Second operand 7 states. [2020-10-16 11:12:05,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:12:05,530 INFO L93 Difference]: Finished difference Result 501 states and 1353 transitions. [2020-10-16 11:12:05,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:12:05,531 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-10-16 11:12:05,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:12:05,533 INFO L225 Difference]: With dead ends: 501 [2020-10-16 11:12:05,533 INFO L226 Difference]: Without dead ends: 411 [2020-10-16 11:12:05,534 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2020-10-16 11:12:05,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2020-10-16 11:12:05,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 313. [2020-10-16 11:12:05,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2020-10-16 11:12:05,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 816 transitions. [2020-10-16 11:12:05,544 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 816 transitions. Word has length 28 [2020-10-16 11:12:05,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:12:05,544 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 816 transitions. [2020-10-16 11:12:05,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 11:12:05,544 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 816 transitions. [2020-10-16 11:12:05,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-16 11:12:05,546 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:12:05,547 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, 1] [2020-10-16 11:12:05,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 11:12:05,547 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:12:05,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:12:05,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1471447744, now seen corresponding path program 2 times [2020-10-16 11:12:05,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:12:05,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787622505] [2020-10-16 11:12:05,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:12:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 11:12:05,622 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 11:12:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 11:12:05,688 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 11:12:05,752 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 11:12:05,754 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 11:12:05,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 11:12:05,756 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 11:12:05,776 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1166] [1166] L2-->L865: Formula: (let ((.cse7 (= (mod ~x$w_buff0_used~0_In-1065439500 256) 0)) (.cse6 (= 0 (mod ~x$r_buff0_thd0~0_In-1065439500 256))) (.cse9 (= (mod ~x$w_buff1_used~0_In-1065439500 256) 0)) (.cse8 (= (mod ~x$r_buff1_thd0~0_In-1065439500 256) 0))) (let ((.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse4 (not .cse6)) (.cse5 (not .cse7)) (.cse3 (or .cse6 .cse7))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1065439500 0)) (or (and .cse0 (= ~x$w_buff1_used~0_Out-1065439500 0) .cse1) (and .cse2 (= ~x$w_buff1_used~0_Out-1065439500 ~x$w_buff1_used~0_In-1065439500))) (or (and (or (and .cse0 (= ~x~0_Out-1065439500 ~x$w_buff1~0_In-1065439500) .cse1) (and .cse2 (= ~x~0_In-1065439500 ~x~0_Out-1065439500))) .cse3) (and .cse4 (= ~x$w_buff0~0_In-1065439500 ~x~0_Out-1065439500) .cse5)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1065439500| ULTIMATE.start_assume_abort_if_not_~cond_Out-1065439500) (= ~x$r_buff1_thd0~0_In-1065439500 ~x$r_buff1_thd0~0_Out-1065439500) (or (and .cse4 .cse5 (= ~x$w_buff0_used~0_Out-1065439500 0)) (and (= ~x$w_buff0_used~0_In-1065439500 ~x$w_buff0_used~0_Out-1065439500) .cse3)) (= ~x$r_buff0_thd0~0_Out-1065439500 ~x$r_buff0_thd0~0_In-1065439500)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1065439500, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1065439500, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1065439500|, ~x$w_buff1~0=~x$w_buff1~0_In-1065439500, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1065439500, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1065439500, ~x~0=~x~0_In-1065439500, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1065439500} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1065439500, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-1065439500, ~x$w_buff1~0=~x$w_buff1~0_In-1065439500, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1065439500|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1065439500, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1065439500, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-1065439500|, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-1065439500|, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out-1065439500|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1065439500, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-1065439500|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1065439500|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-1065439500|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1065439500, ~x~0=~x~0_Out-1065439500} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32, ~x~0, ULTIMATE.start_main_#t~ite33, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2020-10-16 11:12:05,787 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,788 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,791 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,791 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,791 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,791 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,791 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,792 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,792 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,792 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,792 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,792 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,795 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,795 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,796 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,796 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,796 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,796 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,796 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,796 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,796 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,797 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,797 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,797 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,797 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,797 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,798 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,798 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,798 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,798 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,798 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,798 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,799 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,799 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,799 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,799 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,804 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,804 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,804 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,804 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,804 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,805 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,805 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,805 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,806 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,806 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,806 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,807 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,807 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,807 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,807 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,807 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,807 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,807 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,808 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,808 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,808 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,808 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,808 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,808 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,808 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,808 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,809 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,809 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,809 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,809 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,809 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:12:05,809 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:12:05,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 11:12:05 BasicIcfg [2020-10-16 11:12:05,903 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 11:12:05,905 INFO L168 Benchmark]: Toolchain (without parser) took 20879.93 ms. Allocated memory was 140.5 MB in the beginning and 508.0 MB in the end (delta: 367.5 MB). Free memory was 102.3 MB in the beginning and 310.9 MB in the end (delta: -208.6 MB). Peak memory consumption was 158.9 MB. Max. memory is 7.1 GB. [2020-10-16 11:12:05,905 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 11:12:05,906 INFO L168 Benchmark]: CACSL2BoogieTranslator took 842.99 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 101.9 MB in the beginning and 157.2 MB in the end (delta: -55.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. [2020-10-16 11:12:05,907 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.88 ms. Allocated memory is still 203.9 MB. Free memory was 157.2 MB in the beginning and 153.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-16 11:12:05,907 INFO L168 Benchmark]: Boogie Preprocessor took 43.03 ms. Allocated memory is still 203.9 MB. Free memory was 153.9 MB in the beginning and 151.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-16 11:12:05,908 INFO L168 Benchmark]: RCFGBuilder took 2502.23 ms. Allocated memory was 203.9 MB in the beginning and 248.0 MB in the end (delta: 44.0 MB). Free memory was 151.3 MB in the beginning and 141.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 102.6 MB. Max. memory is 7.1 GB. [2020-10-16 11:12:05,909 INFO L168 Benchmark]: TraceAbstraction took 17417.09 ms. Allocated memory was 248.0 MB in the beginning and 508.0 MB in the end (delta: 260.0 MB). Free memory was 141.7 MB in the beginning and 310.9 MB in the end (delta: -169.2 MB). Peak memory consumption was 90.8 MB. Max. memory is 7.1 GB. [2020-10-16 11:12:05,912 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 842.99 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 101.9 MB in the beginning and 157.2 MB in the end (delta: -55.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.88 ms. Allocated memory is still 203.9 MB. Free memory was 157.2 MB in the beginning and 153.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.03 ms. Allocated memory is still 203.9 MB. Free memory was 153.9 MB in the beginning and 151.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2502.23 ms. Allocated memory was 203.9 MB in the beginning and 248.0 MB in the end (delta: 44.0 MB). Free memory was 151.3 MB in the beginning and 141.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 102.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17417.09 ms. Allocated memory was 248.0 MB in the beginning and 508.0 MB in the end (delta: 260.0 MB). Free memory was 141.7 MB in the beginning and 310.9 MB in the end (delta: -169.2 MB). Peak memory consumption was 90.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1922 VarBasedMoverChecksPositive, 99 VarBasedMoverChecksNegative, 24 SemBasedMoverChecksPositive, 75 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 278 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 11.3s, 126 PlacesBefore, 47 PlacesAfterwards, 115 TransitionsBefore, 34 TransitionsAfterwards, 2806 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 92 TotalNumberOfCompositions, 7756 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_p1_EAX = 0; [L703] 0 int __unbuffered_p2_EAX = 0; [L705] 0 int __unbuffered_p3_EAX = 0; [L707] 0 int __unbuffered_p3_EBX = 0; [L709] 0 int a = 0; [L711] 0 int b = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff0_thd3; [L722] 0 _Bool x$r_buff0_thd4; [L723] 0 _Bool x$r_buff1_thd0; [L724] 0 _Bool x$r_buff1_thd1; [L725] 0 _Bool x$r_buff1_thd2; [L726] 0 _Bool x$r_buff1_thd3; [L727] 0 _Bool x$r_buff1_thd4; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L847] 0 pthread_t t993; [L848] FCALL, FORK 0 pthread_create(&t993, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L849] 0 pthread_t t994; [L850] FCALL, FORK 0 pthread_create(&t994, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L7] COND FALSE 2 !(!expression) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L773] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L851] 0 pthread_t t995; [L852] FCALL, FORK 0 pthread_create(&t995, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L853] 0 pthread_t t996; [L854] FCALL, FORK 0 pthread_create(&t996, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L776] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L793] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L796] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L799] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L801] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L801] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L802] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L803] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L803] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 3 return 0; [L813] 4 z = 1 [L816] 4 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L819] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L822] 4 __unbuffered_p3_EBX = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 1 b = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L749] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L783] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 2 return 0; [L825] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L825] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L826] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L826] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L827] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L827] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L828] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L828] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L829] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L832] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L834] 4 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L873] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1 [L873] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L873] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L876] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L879] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 114 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.1s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.6s, HoareTripleCheckerStatistics: 529 SDtfs, 662 SDslu, 849 SDs, 0 SdLazy, 378 SolverSat, 124 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4872occurred 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.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 750 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 283 NumberOfCodeBlocks, 283 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 29318 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...