/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix030_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 18:17:09,619 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 18:17:09,622 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 18:17:09,660 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 18:17:09,660 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 18:17:09,668 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 18:17:09,671 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 18:17:09,675 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 18:17:09,677 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 18:17:09,680 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 18:17:09,681 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 18:17:09,682 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 18:17:09,682 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 18:17:09,684 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 18:17:09,687 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 18:17:09,688 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 18:17:09,690 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 18:17:09,690 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 18:17:09,692 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 18:17:09,700 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 18:17:09,702 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 18:17:09,703 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 18:17:09,704 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 18:17:09,704 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 18:17:09,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 18:17:09,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 18:17:09,721 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 18:17:09,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 18:17:09,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 18:17:09,726 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 18:17:09,726 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 18:17:09,727 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 18:17:09,731 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 18:17:09,731 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 18:17:09,732 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 18:17:09,732 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 18:17:09,734 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 18:17:09,734 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 18:17:09,735 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 18:17:09,736 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 18:17:09,736 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 18:17:09,738 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-15 18:17:09,778 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 18:17:09,780 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 18:17:09,782 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 18:17:09,782 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 18:17:09,782 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 18:17:09,782 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 18:17:09,783 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 18:17:09,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 18:17:09,783 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 18:17:09,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 18:17:09,784 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 18:17:09,784 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 18:17:09,785 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 18:17:09,785 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 18:17:09,785 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 18:17:09,785 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 18:17:09,786 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 18:17:09,786 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 18:17:09,786 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 18:17:09,786 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 18:17:09,786 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 18:17:09,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 18:17:09,787 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 18:17:09,787 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 18:17:09,787 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 18:17:09,787 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 18:17:09,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 18:17:09,788 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 18:17:09,788 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-15 18:17:09,788 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 18:17:10,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 18:17:10,161 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 18:17:10,165 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 18:17:10,167 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 18:17:10,169 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 18:17:10,170 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_tso.oepc.i [2020-10-15 18:17:10,238 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/778808397/238ba74b138449dda18786433c593a18/FLAGd7e295c32 [2020-10-15 18:17:10,765 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 18:17:10,766 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_tso.oepc.i [2020-10-15 18:17:10,799 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/778808397/238ba74b138449dda18786433c593a18/FLAGd7e295c32 [2020-10-15 18:17:11,055 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/778808397/238ba74b138449dda18786433c593a18 [2020-10-15 18:17:11,064 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 18:17:11,066 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 18:17:11,067 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 18:17:11,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 18:17:11,072 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 18:17:11,073 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:17:11" (1/1) ... [2020-10-15 18:17:11,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4767bcde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:17:11, skipping insertion in model container [2020-10-15 18:17:11,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:17:11" (1/1) ... [2020-10-15 18:17:11,086 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 18:17:11,129 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 18:17:11,675 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:17:11,688 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 18:17:11,795 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:17:11,868 INFO L208 MainTranslator]: Completed translation [2020-10-15 18:17:11,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:17:11 WrapperNode [2020-10-15 18:17:11,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 18:17:11,870 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 18:17:11,870 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 18:17:11,870 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 18:17:11,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:17:11" (1/1) ... [2020-10-15 18:17:11,900 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:17:11" (1/1) ... [2020-10-15 18:17:11,943 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 18:17:11,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 18:17:11,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 18:17:11,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 18:17:11,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:17:11" (1/1) ... [2020-10-15 18:17:11,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:17:11" (1/1) ... [2020-10-15 18:17:11,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:17:11" (1/1) ... [2020-10-15 18:17:11,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:17:11" (1/1) ... [2020-10-15 18:17:11,978 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:17:11" (1/1) ... [2020-10-15 18:17:11,983 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:17:11" (1/1) ... [2020-10-15 18:17:11,988 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:17:11" (1/1) ... [2020-10-15 18:17:11,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 18:17:11,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 18:17:11,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 18:17:11,995 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 18:17:11,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:17:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 18:17:12,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 18:17:12,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-15 18:17:12,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 18:17:12,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 18:17:12,095 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-15 18:17:12,095 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-15 18:17:12,095 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-15 18:17:12,096 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-15 18:17:12,096 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-15 18:17:12,097 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-15 18:17:12,098 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-15 18:17:12,098 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-15 18:17:12,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-15 18:17:12,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 18:17:12,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 18:17:12,101 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-15 18:17:14,829 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 18:17:14,829 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-15 18:17:14,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:17:14 BoogieIcfgContainer [2020-10-15 18:17:14,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 18:17:14,834 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 18:17:14,834 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 18:17:14,838 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 18:17:14,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 06:17:11" (1/3) ... [2020-10-15 18:17:14,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1723b006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:17:14, skipping insertion in model container [2020-10-15 18:17:14,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:17:11" (2/3) ... [2020-10-15 18:17:14,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1723b006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:17:14, skipping insertion in model container [2020-10-15 18:17:14,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:17:14" (3/3) ... [2020-10-15 18:17:14,842 INFO L111 eAbstractionObserver]: Analyzing ICFG mix030_tso.oepc.i [2020-10-15 18:17:14,855 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 18:17:14,855 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 18:17:14,865 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-15 18:17:14,866 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 18:17:14,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,901 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,902 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,903 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,904 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,904 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,904 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,905 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,905 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,906 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,906 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,908 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,908 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,908 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,909 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,909 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,909 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,909 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,909 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,910 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,910 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,910 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,910 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,910 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,911 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,911 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,911 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,911 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,911 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,911 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,912 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,912 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,912 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,912 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,912 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,912 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,912 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,913 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,913 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,913 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,913 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,913 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,913 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,914 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,914 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,914 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,914 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,914 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,914 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,915 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,915 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,915 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,915 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,915 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,915 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,916 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,916 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,918 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,918 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,918 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,918 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,918 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,918 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,919 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,919 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,919 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,923 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,924 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,924 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,924 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,924 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,924 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,925 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,925 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,925 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,925 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,925 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,925 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,926 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,926 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,926 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,926 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,926 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,927 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,927 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,927 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,927 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,927 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,928 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,928 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,928 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,928 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,928 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,929 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,929 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,929 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,929 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,929 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,930 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,930 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,930 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,934 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,934 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,936 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,936 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,939 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,939 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:17:14,957 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-15 18:17:14,980 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 18:17:14,980 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 18:17:14,980 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 18:17:14,980 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 18:17:14,980 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 18:17:14,981 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 18:17:14,981 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 18:17:14,981 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 18:17:14,996 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 18:17:14,999 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 109 transitions, 238 flow [2020-10-15 18:17:15,001 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 109 transitions, 238 flow [2020-10-15 18:17:15,003 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 120 places, 109 transitions, 238 flow [2020-10-15 18:17:15,056 INFO L129 PetriNetUnfolder]: 2/105 cut-off events. [2020-10-15 18:17:15,056 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-15 18:17:15,062 INFO L80 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2020-10-15 18:17:15,066 INFO L117 LiptonReduction]: Number of co-enabled transitions 2446 [2020-10-15 18:17:15,539 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-15 18:17:15,896 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-15 18:17:16,025 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-15 18:17:16,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:17:16,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:16,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:17:16,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:16,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 18:17:16,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:16,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:17:16,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:17,289 WARN L193 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-10-15 18:17:17,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-10-15 18:17:17,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:17,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 18:17:17,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:18,178 WARN L193 SmtUtils]: Spent 863.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 128 [2020-10-15 18:17:18,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:18,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:18,294 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:17:18,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:17:18,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:17:18,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:17:18,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:17:18,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:17:18,315 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:17:18,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:18,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:17:18,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:18,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:17:18,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:18,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:17:18,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:17:18,445 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:17:18,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:18,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:18,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:18,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:18,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:18,563 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:18,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:18,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:18,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:18,587 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:18,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:18,589 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:18,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:18,593 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:18,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:18,596 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:18,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:18,625 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:18,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:18,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:18,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:18,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:18,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:18,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:18,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:18,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:18,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:18,649 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:18,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:18,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:18,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:18,654 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:18,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:18,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:18,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:18,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:18,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:18,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:18,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:18,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:18,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:18,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:18,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:18,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:18,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:18,791 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:18,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:18,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:18,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:18,885 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 18:17:18,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:19,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:17:19,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:17:19,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:17:19,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:19,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:19,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:19,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:17:19,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:17:19,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:17:19,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:17:19,197 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:17:19,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:17:19,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:17:19,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:19,200 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:17:19,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:19,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:17:19,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:19,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:19,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:19,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:17:19,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:17:19,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:17:19,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:17:19,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:17:19,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:17:19,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:17:19,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:19,589 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:17:19,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:19,591 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:17:19,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:19,694 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:17:19,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:17:19,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:17:19,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:19,898 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-15 18:17:20,013 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-15 18:17:20,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:17:20,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-15 18:17:20,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:17:20,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:20,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:20,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:20,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:17:20,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:17:20,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:17:20,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:17:20,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:17:20,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:17:20,374 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:17:20,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:20,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:17:20,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:20,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:17:20,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:21,198 WARN L193 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 110 [2020-10-15 18:17:21,502 WARN L193 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-15 18:17:21,516 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:21,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:21,517 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:21,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:21,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:21,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:21,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:21,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:21,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:21,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:21,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:21,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:21,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:21,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:21,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:21,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:21,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:21,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:21,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:21,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:21,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:21,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:21,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:21,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:21,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:21,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:21,596 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:21,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:21,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:21,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:21,601 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:21,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:21,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:21,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:21,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:21,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:21,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:21,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:21,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:21,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:21,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:21,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:21,649 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:21,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:21,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:21,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:21,654 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:21,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:21,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:21,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:21,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:17:21,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:17:21,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:17:21,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:17:21,725 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:17:21,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:17:21,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:17:21,729 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:21,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:17:21,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:21,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:17:21,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:21,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:17:21,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-15 18:17:21,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:17:21,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:21,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:21,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:21,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:21,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:21,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:21,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:21,813 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:21,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:17:21,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:21,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:21,835 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:21,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:17:21,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:17:21,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:21,839 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:17:21,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:17:22,945 WARN L193 SmtUtils]: Spent 840.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 132 [2020-10-15 18:17:23,279 WARN L193 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-15 18:17:24,545 WARN L193 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 137 DAG size of output: 136 [2020-10-15 18:17:25,050 WARN L193 SmtUtils]: Spent 502.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-15 18:17:25,317 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-10-15 18:17:25,450 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-15 18:17:25,568 INFO L132 LiptonReduction]: Checked pairs total: 7114 [2020-10-15 18:17:25,569 INFO L134 LiptonReduction]: Total number of compositions: 92 [2020-10-15 18:17:25,575 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow [2020-10-15 18:17:25,759 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3002 states. [2020-10-15 18:17:25,761 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states. [2020-10-15 18:17:25,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-15 18:17:25,770 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:25,771 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:17:25,771 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:25,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:25,777 INFO L82 PathProgramCache]: Analyzing trace with hash -137982902, now seen corresponding path program 1 times [2020-10-15 18:17:25,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:25,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132134622] [2020-10-15 18:17:25,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:26,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:26,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132134622] [2020-10-15 18:17:26,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:26,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:17:26,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149021632] [2020-10-15 18:17:26,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:17:26,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:26,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:17:26,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:17:26,121 INFO L87 Difference]: Start difference. First operand 3002 states. Second operand 3 states. [2020-10-15 18:17:26,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:26,268 INFO L93 Difference]: Finished difference Result 2602 states and 10064 transitions. [2020-10-15 18:17:26,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:17:26,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-15 18:17:26,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:26,311 INFO L225 Difference]: With dead ends: 2602 [2020-10-15 18:17:26,312 INFO L226 Difference]: Without dead ends: 2122 [2020-10-15 18:17:26,313 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:17:26,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2020-10-15 18:17:26,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2122. [2020-10-15 18:17:26,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2020-10-15 18:17:26,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 8080 transitions. [2020-10-15 18:17:26,475 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 8080 transitions. Word has length 9 [2020-10-15 18:17:26,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:26,477 INFO L481 AbstractCegarLoop]: Abstraction has 2122 states and 8080 transitions. [2020-10-15 18:17:26,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:17:26,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 8080 transitions. [2020-10-15 18:17:26,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-15 18:17:26,480 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:26,480 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:17:26,480 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 18:17:26,481 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:26,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:26,481 INFO L82 PathProgramCache]: Analyzing trace with hash 542442462, now seen corresponding path program 1 times [2020-10-15 18:17:26,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:26,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160862876] [2020-10-15 18:17:26,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:26,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:26,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160862876] [2020-10-15 18:17:26,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:26,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:17:26,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6064380] [2020-10-15 18:17:26,592 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:17:26,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:26,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:17:26,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:17:26,593 INFO L87 Difference]: Start difference. First operand 2122 states and 8080 transitions. Second operand 3 states. [2020-10-15 18:17:26,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:26,660 INFO L93 Difference]: Finished difference Result 2114 states and 8042 transitions. [2020-10-15 18:17:26,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:17:26,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-15 18:17:26,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:26,680 INFO L225 Difference]: With dead ends: 2114 [2020-10-15 18:17:26,681 INFO L226 Difference]: Without dead ends: 2114 [2020-10-15 18:17:26,682 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:17:26,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2020-10-15 18:17:26,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 2114. [2020-10-15 18:17:26,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2020-10-15 18:17:26,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 8042 transitions. [2020-10-15 18:17:26,774 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 8042 transitions. Word has length 11 [2020-10-15 18:17:26,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:26,774 INFO L481 AbstractCegarLoop]: Abstraction has 2114 states and 8042 transitions. [2020-10-15 18:17:26,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:17:26,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 8042 transitions. [2020-10-15 18:17:26,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 18:17:26,781 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:26,781 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:17:26,781 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 18:17:26,781 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:26,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:26,782 INFO L82 PathProgramCache]: Analyzing trace with hash -325702107, now seen corresponding path program 1 times [2020-10-15 18:17:26,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:26,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34663549] [2020-10-15 18:17:26,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:26,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:26,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34663549] [2020-10-15 18:17:26,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:26,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:17:26,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744585427] [2020-10-15 18:17:26,909 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:17:26,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:26,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:17:26,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:17:26,910 INFO L87 Difference]: Start difference. First operand 2114 states and 8042 transitions. Second operand 3 states. [2020-10-15 18:17:26,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:26,985 INFO L93 Difference]: Finished difference Result 2106 states and 8004 transitions. [2020-10-15 18:17:26,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:17:26,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-15 18:17:26,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:27,011 INFO L225 Difference]: With dead ends: 2106 [2020-10-15 18:17:27,012 INFO L226 Difference]: Without dead ends: 2106 [2020-10-15 18:17:27,012 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:17:27,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2020-10-15 18:17:27,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 2106. [2020-10-15 18:17:27,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2020-10-15 18:17:27,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 8004 transitions. [2020-10-15 18:17:27,104 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 8004 transitions. Word has length 12 [2020-10-15 18:17:27,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:27,104 INFO L481 AbstractCegarLoop]: Abstraction has 2106 states and 8004 transitions. [2020-10-15 18:17:27,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:17:27,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 8004 transitions. [2020-10-15 18:17:27,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 18:17:27,106 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:27,106 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:17:27,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 18:17:27,106 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:27,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:27,107 INFO L82 PathProgramCache]: Analyzing trace with hash -364206494, now seen corresponding path program 1 times [2020-10-15 18:17:27,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:27,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100939742] [2020-10-15 18:17:27,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:27,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:27,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:27,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100939742] [2020-10-15 18:17:27,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:27,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:17:27,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85360392] [2020-10-15 18:17:27,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:17:27,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:27,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:17:27,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:17:27,261 INFO L87 Difference]: Start difference. First operand 2106 states and 8004 transitions. Second operand 5 states. [2020-10-15 18:17:27,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:27,350 INFO L93 Difference]: Finished difference Result 2022 states and 7630 transitions. [2020-10-15 18:17:27,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:17:27,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-15 18:17:27,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:27,370 INFO L225 Difference]: With dead ends: 2022 [2020-10-15 18:17:27,370 INFO L226 Difference]: Without dead ends: 2022 [2020-10-15 18:17:27,370 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:17:27,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2020-10-15 18:17:27,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 2022. [2020-10-15 18:17:27,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2022 states. [2020-10-15 18:17:27,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 7630 transitions. [2020-10-15 18:17:27,461 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 7630 transitions. Word has length 12 [2020-10-15 18:17:27,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:27,461 INFO L481 AbstractCegarLoop]: Abstraction has 2022 states and 7630 transitions. [2020-10-15 18:17:27,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:17:27,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 7630 transitions. [2020-10-15 18:17:27,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 18:17:27,465 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:27,465 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:17:27,465 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 18:17:27,465 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:27,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:27,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1594416190, now seen corresponding path program 1 times [2020-10-15 18:17:27,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:27,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906635789] [2020-10-15 18:17:27,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:27,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:27,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906635789] [2020-10-15 18:17:27,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:27,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:17:27,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260617886] [2020-10-15 18:17:27,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:17:27,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:27,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:17:27,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:17:27,551 INFO L87 Difference]: Start difference. First operand 2022 states and 7630 transitions. Second operand 3 states. [2020-10-15 18:17:27,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:27,587 INFO L93 Difference]: Finished difference Result 1978 states and 7430 transitions. [2020-10-15 18:17:27,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:17:27,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-15 18:17:27,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:27,607 INFO L225 Difference]: With dead ends: 1978 [2020-10-15 18:17:27,607 INFO L226 Difference]: Without dead ends: 1978 [2020-10-15 18:17:27,608 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:17:27,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2020-10-15 18:17:27,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1978. [2020-10-15 18:17:27,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1978 states. [2020-10-15 18:17:27,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 7430 transitions. [2020-10-15 18:17:27,781 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 7430 transitions. Word has length 13 [2020-10-15 18:17:27,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:27,782 INFO L481 AbstractCegarLoop]: Abstraction has 1978 states and 7430 transitions. [2020-10-15 18:17:27,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:17:27,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 7430 transitions. [2020-10-15 18:17:27,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 18:17:27,784 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:27,784 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:17:27,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 18:17:27,785 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:27,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:27,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1828078141, now seen corresponding path program 1 times [2020-10-15 18:17:27,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:27,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15327639] [2020-10-15 18:17:27,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:27,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:27,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15327639] [2020-10-15 18:17:27,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:27,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:17:27,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317436426] [2020-10-15 18:17:27,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:17:27,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:27,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:17:27,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:17:27,861 INFO L87 Difference]: Start difference. First operand 1978 states and 7430 transitions. Second operand 3 states. [2020-10-15 18:17:27,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:27,887 INFO L93 Difference]: Finished difference Result 1954 states and 7324 transitions. [2020-10-15 18:17:27,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:17:27,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-10-15 18:17:27,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:27,914 INFO L225 Difference]: With dead ends: 1954 [2020-10-15 18:17:27,915 INFO L226 Difference]: Without dead ends: 1954 [2020-10-15 18:17:27,915 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:17:27,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2020-10-15 18:17:27,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1954. [2020-10-15 18:17:27,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2020-10-15 18:17:27,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 7324 transitions. [2020-10-15 18:17:27,986 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 7324 transitions. Word has length 14 [2020-10-15 18:17:27,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:27,987 INFO L481 AbstractCegarLoop]: Abstraction has 1954 states and 7324 transitions. [2020-10-15 18:17:27,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:17:27,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 7324 transitions. [2020-10-15 18:17:27,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 18:17:27,990 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:27,990 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:17:27,991 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 18:17:27,991 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:27,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:27,991 INFO L82 PathProgramCache]: Analyzing trace with hash 341810153, now seen corresponding path program 1 times [2020-10-15 18:17:27,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:27,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530568055] [2020-10-15 18:17:27,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:28,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:28,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530568055] [2020-10-15 18:17:28,063 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:28,063 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:17:28,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863518265] [2020-10-15 18:17:28,064 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:17:28,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:28,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:17:28,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:17:28,064 INFO L87 Difference]: Start difference. First operand 1954 states and 7324 transitions. Second operand 3 states. [2020-10-15 18:17:28,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:28,092 INFO L93 Difference]: Finished difference Result 2722 states and 9844 transitions. [2020-10-15 18:17:28,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:17:28,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-10-15 18:17:28,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:28,105 INFO L225 Difference]: With dead ends: 2722 [2020-10-15 18:17:28,105 INFO L226 Difference]: Without dead ends: 2082 [2020-10-15 18:17:28,106 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:17:28,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2020-10-15 18:17:28,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 1922. [2020-10-15 18:17:28,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1922 states. [2020-10-15 18:17:28,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 6876 transitions. [2020-10-15 18:17:28,167 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 6876 transitions. Word has length 15 [2020-10-15 18:17:28,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:28,168 INFO L481 AbstractCegarLoop]: Abstraction has 1922 states and 6876 transitions. [2020-10-15 18:17:28,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:17:28,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 6876 transitions. [2020-10-15 18:17:28,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 18:17:28,171 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:28,171 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:17:28,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 18:17:28,171 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:28,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:28,171 INFO L82 PathProgramCache]: Analyzing trace with hash -815273306, now seen corresponding path program 1 times [2020-10-15 18:17:28,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:28,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468521308] [2020-10-15 18:17:28,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:28,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:28,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468521308] [2020-10-15 18:17:28,329 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:28,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:17:28,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653721] [2020-10-15 18:17:28,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:17:28,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:28,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:17:28,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:17:28,332 INFO L87 Difference]: Start difference. First operand 1922 states and 6876 transitions. Second operand 4 states. [2020-10-15 18:17:28,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:28,379 INFO L93 Difference]: Finished difference Result 1965 states and 6369 transitions. [2020-10-15 18:17:28,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 18:17:28,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-15 18:17:28,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:28,397 INFO L225 Difference]: With dead ends: 1965 [2020-10-15 18:17:28,397 INFO L226 Difference]: Without dead ends: 1485 [2020-10-15 18:17:28,398 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:17:28,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2020-10-15 18:17:28,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1485. [2020-10-15 18:17:28,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1485 states. [2020-10-15 18:17:28,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 4781 transitions. [2020-10-15 18:17:28,440 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 4781 transitions. Word has length 15 [2020-10-15 18:17:28,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:28,441 INFO L481 AbstractCegarLoop]: Abstraction has 1485 states and 4781 transitions. [2020-10-15 18:17:28,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:17:28,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 4781 transitions. [2020-10-15 18:17:28,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 18:17:28,446 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:28,446 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:17:28,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 18:17:28,446 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:28,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:28,447 INFO L82 PathProgramCache]: Analyzing trace with hash -224620336, now seen corresponding path program 1 times [2020-10-15 18:17:28,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:28,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570386078] [2020-10-15 18:17:28,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:28,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:28,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570386078] [2020-10-15 18:17:28,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:28,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:17:28,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103640925] [2020-10-15 18:17:28,515 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:17:28,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:28,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:17:28,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:17:28,516 INFO L87 Difference]: Start difference. First operand 1485 states and 4781 transitions. Second operand 3 states. [2020-10-15 18:17:28,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:28,557 INFO L93 Difference]: Finished difference Result 1464 states and 4706 transitions. [2020-10-15 18:17:28,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:17:28,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-10-15 18:17:28,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:28,564 INFO L225 Difference]: With dead ends: 1464 [2020-10-15 18:17:28,564 INFO L226 Difference]: Without dead ends: 1464 [2020-10-15 18:17:28,565 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:17:28,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2020-10-15 18:17:28,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1464. [2020-10-15 18:17:28,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1464 states. [2020-10-15 18:17:28,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 4706 transitions. [2020-10-15 18:17:28,620 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 4706 transitions. Word has length 16 [2020-10-15 18:17:28,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:28,621 INFO L481 AbstractCegarLoop]: Abstraction has 1464 states and 4706 transitions. [2020-10-15 18:17:28,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:17:28,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 4706 transitions. [2020-10-15 18:17:28,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 18:17:28,624 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:28,624 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:17:28,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 18:17:28,624 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:28,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:28,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1961816001, now seen corresponding path program 1 times [2020-10-15 18:17:28,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:28,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445103272] [2020-10-15 18:17:28,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:28,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:28,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445103272] [2020-10-15 18:17:28,745 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:28,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:17:28,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311640598] [2020-10-15 18:17:28,746 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:17:28,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:28,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:17:28,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:17:28,747 INFO L87 Difference]: Start difference. First operand 1464 states and 4706 transitions. Second operand 5 states. [2020-10-15 18:17:28,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:28,803 INFO L93 Difference]: Finished difference Result 1253 states and 3674 transitions. [2020-10-15 18:17:28,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:17:28,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-15 18:17:28,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:28,808 INFO L225 Difference]: With dead ends: 1253 [2020-10-15 18:17:28,808 INFO L226 Difference]: Without dead ends: 953 [2020-10-15 18:17:28,808 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:17:28,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2020-10-15 18:17:28,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 953. [2020-10-15 18:17:28,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2020-10-15 18:17:28,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 2740 transitions. [2020-10-15 18:17:28,836 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 2740 transitions. Word has length 17 [2020-10-15 18:17:28,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:28,837 INFO L481 AbstractCegarLoop]: Abstraction has 953 states and 2740 transitions. [2020-10-15 18:17:28,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:17:28,837 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 2740 transitions. [2020-10-15 18:17:28,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-15 18:17:28,840 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:28,840 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:17:28,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 18:17:28,840 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:28,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:28,840 INFO L82 PathProgramCache]: Analyzing trace with hash -22390249, now seen corresponding path program 1 times [2020-10-15 18:17:28,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:28,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645404563] [2020-10-15 18:17:28,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:28,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:28,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645404563] [2020-10-15 18:17:28,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:28,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:17:28,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681023596] [2020-10-15 18:17:28,899 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:17:28,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:28,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:17:28,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:17:28,900 INFO L87 Difference]: Start difference. First operand 953 states and 2740 transitions. Second operand 4 states. [2020-10-15 18:17:28,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:28,961 INFO L93 Difference]: Finished difference Result 945 states and 2717 transitions. [2020-10-15 18:17:28,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 18:17:28,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-15 18:17:28,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:28,966 INFO L225 Difference]: With dead ends: 945 [2020-10-15 18:17:28,966 INFO L226 Difference]: Without dead ends: 945 [2020-10-15 18:17:28,967 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:17:28,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2020-10-15 18:17:28,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 945. [2020-10-15 18:17:28,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2020-10-15 18:17:28,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 2717 transitions. [2020-10-15 18:17:28,992 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 2717 transitions. Word has length 19 [2020-10-15 18:17:28,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:28,993 INFO L481 AbstractCegarLoop]: Abstraction has 945 states and 2717 transitions. [2020-10-15 18:17:28,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:17:28,993 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 2717 transitions. [2020-10-15 18:17:28,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-15 18:17:28,996 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:28,996 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-15 18:17:28,996 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 18:17:28,996 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:28,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:28,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1705642055, now seen corresponding path program 1 times [2020-10-15 18:17:28,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:28,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091022176] [2020-10-15 18:17:28,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:29,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:29,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091022176] [2020-10-15 18:17:29,049 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:29,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:17:29,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125354739] [2020-10-15 18:17:29,050 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:17:29,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:29,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:17:29,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:17:29,051 INFO L87 Difference]: Start difference. First operand 945 states and 2717 transitions. Second operand 3 states. [2020-10-15 18:17:29,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:29,066 INFO L93 Difference]: Finished difference Result 1331 states and 3687 transitions. [2020-10-15 18:17:29,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:17:29,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-10-15 18:17:29,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:29,070 INFO L225 Difference]: With dead ends: 1331 [2020-10-15 18:17:29,070 INFO L226 Difference]: Without dead ends: 955 [2020-10-15 18:17:29,071 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:17:29,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2020-10-15 18:17:29,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 937. [2020-10-15 18:17:29,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2020-10-15 18:17:29,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 2544 transitions. [2020-10-15 18:17:29,094 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 2544 transitions. Word has length 20 [2020-10-15 18:17:29,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:29,094 INFO L481 AbstractCegarLoop]: Abstraction has 937 states and 2544 transitions. [2020-10-15 18:17:29,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:17:29,094 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 2544 transitions. [2020-10-15 18:17:29,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-15 18:17:29,097 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:29,097 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-15 18:17:29,097 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-15 18:17:29,097 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:29,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:29,098 INFO L82 PathProgramCache]: Analyzing trace with hash -2021174683, now seen corresponding path program 1 times [2020-10-15 18:17:29,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:29,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108443148] [2020-10-15 18:17:29,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:29,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:29,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108443148] [2020-10-15 18:17:29,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:29,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:17:29,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529977696] [2020-10-15 18:17:29,200 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:17:29,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:29,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:17:29,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:17:29,201 INFO L87 Difference]: Start difference. First operand 937 states and 2544 transitions. Second operand 6 states. [2020-10-15 18:17:29,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:29,272 INFO L93 Difference]: Finished difference Result 825 states and 2195 transitions. [2020-10-15 18:17:29,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:17:29,273 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-15 18:17:29,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:29,275 INFO L225 Difference]: With dead ends: 825 [2020-10-15 18:17:29,275 INFO L226 Difference]: Without dead ends: 662 [2020-10-15 18:17:29,276 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-15 18:17:29,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-10-15 18:17:29,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2020-10-15 18:17:29,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2020-10-15 18:17:29,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1739 transitions. [2020-10-15 18:17:29,291 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1739 transitions. Word has length 20 [2020-10-15 18:17:29,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:29,292 INFO L481 AbstractCegarLoop]: Abstraction has 662 states and 1739 transitions. [2020-10-15 18:17:29,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:17:29,292 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1739 transitions. [2020-10-15 18:17:29,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-15 18:17:29,294 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:29,294 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] [2020-10-15 18:17:29,294 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-15 18:17:29,294 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:29,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:29,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1851400785, now seen corresponding path program 1 times [2020-10-15 18:17:29,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:29,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12406867] [2020-10-15 18:17:29,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:29,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:29,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12406867] [2020-10-15 18:17:29,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:29,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:17:29,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774408547] [2020-10-15 18:17:29,482 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:17:29,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:29,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:17:29,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:17:29,484 INFO L87 Difference]: Start difference. First operand 662 states and 1739 transitions. Second operand 6 states. [2020-10-15 18:17:29,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:29,560 INFO L93 Difference]: Finished difference Result 857 states and 2189 transitions. [2020-10-15 18:17:29,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 18:17:29,561 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-10-15 18:17:29,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:29,564 INFO L225 Difference]: With dead ends: 857 [2020-10-15 18:17:29,564 INFO L226 Difference]: Without dead ends: 721 [2020-10-15 18:17:29,564 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:17:29,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2020-10-15 18:17:29,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 658. [2020-10-15 18:17:29,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2020-10-15 18:17:29,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1691 transitions. [2020-10-15 18:17:29,589 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 1691 transitions. Word has length 23 [2020-10-15 18:17:29,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:29,589 INFO L481 AbstractCegarLoop]: Abstraction has 658 states and 1691 transitions. [2020-10-15 18:17:29,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:17:29,589 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1691 transitions. [2020-10-15 18:17:29,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-15 18:17:29,594 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:29,594 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] [2020-10-15 18:17:29,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-15 18:17:29,594 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:29,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:29,595 INFO L82 PathProgramCache]: Analyzing trace with hash 178250175, now seen corresponding path program 2 times [2020-10-15 18:17:29,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:29,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795761712] [2020-10-15 18:17:29,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:29,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:29,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795761712] [2020-10-15 18:17:29,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:29,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 18:17:29,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162050343] [2020-10-15 18:17:29,802 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 18:17:29,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:29,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 18:17:29,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:17:29,803 INFO L87 Difference]: Start difference. First operand 658 states and 1691 transitions. Second operand 7 states. [2020-10-15 18:17:29,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:29,892 INFO L93 Difference]: Finished difference Result 631 states and 1638 transitions. [2020-10-15 18:17:29,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:17:29,893 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-15 18:17:29,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:29,894 INFO L225 Difference]: With dead ends: 631 [2020-10-15 18:17:29,894 INFO L226 Difference]: Without dead ends: 237 [2020-10-15 18:17:29,895 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-10-15 18:17:29,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2020-10-15 18:17:29,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 213. [2020-10-15 18:17:29,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-10-15 18:17:29,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 521 transitions. [2020-10-15 18:17:29,902 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 521 transitions. Word has length 23 [2020-10-15 18:17:29,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:29,902 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 521 transitions. [2020-10-15 18:17:29,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 18:17:29,903 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 521 transitions. [2020-10-15 18:17:29,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-15 18:17:29,906 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:29,906 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] [2020-10-15 18:17:29,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-15 18:17:29,906 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:29,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:29,906 INFO L82 PathProgramCache]: Analyzing trace with hash 289203105, now seen corresponding path program 1 times [2020-10-15 18:17:29,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:29,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124843536] [2020-10-15 18:17:29,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:17:29,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:17:29,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124843536] [2020-10-15 18:17:29,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:17:29,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:17:29,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121294856] [2020-10-15 18:17:29,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:17:29,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:17:29,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:17:29,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:17:29,994 INFO L87 Difference]: Start difference. First operand 213 states and 521 transitions. Second operand 4 states. [2020-10-15 18:17:30,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:17:30,011 INFO L93 Difference]: Finished difference Result 264 states and 630 transitions. [2020-10-15 18:17:30,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 18:17:30,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-10-15 18:17:30,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:17:30,012 INFO L225 Difference]: With dead ends: 264 [2020-10-15 18:17:30,013 INFO L226 Difference]: Without dead ends: 64 [2020-10-15 18:17:30,013 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:17:30,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-10-15 18:17:30,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-10-15 18:17:30,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-15 18:17:30,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 122 transitions. [2020-10-15 18:17:30,015 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 122 transitions. Word has length 26 [2020-10-15 18:17:30,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:17:30,015 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 122 transitions. [2020-10-15 18:17:30,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:17:30,016 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 122 transitions. [2020-10-15 18:17:30,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-15 18:17:30,016 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:17:30,016 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] [2020-10-15 18:17:30,016 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-15 18:17:30,017 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:17:30,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:17:30,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1046291565, now seen corresponding path program 2 times [2020-10-15 18:17:30,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:17:30,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598615420] [2020-10-15 18:17:30,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:17:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:17:30,061 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:17:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:17:30,108 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:17:30,149 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 18:17:30,149 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 18:17:30,150 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-15 18:17:30,151 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-15 18:17:30,168 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1295] [1295] L851-->L859: Formula: (let ((.cse8 (= (mod ~z$w_buff1_used~0_In-1132947848 256) 0)) (.cse9 (= (mod ~z$r_buff1_thd0~0_In-1132947848 256) 0)) (.cse7 (= (mod ~z$r_buff0_thd0~0_In-1132947848 256) 0)) (.cse6 (= (mod ~z$w_buff0_used~0_In-1132947848 256) 0))) (let ((.cse1 (not .cse6)) (.cse2 (not .cse7)) (.cse5 (or .cse8 .cse9)) (.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse0 (or .cse6 .cse7))) (and (= (mod ~main$tmp_guard0~0_In-1132947848 256) |ULTIMATE.start_assume_abort_if_not_#in~cond_Out-1132947848|) (= ~z$r_buff0_thd0~0_Out-1132947848 ~z$r_buff0_thd0~0_In-1132947848) (or (and (= ~z$w_buff0_used~0_In-1132947848 ~z$w_buff0_used~0_Out-1132947848) .cse0) (and (= ~z$w_buff0_used~0_Out-1132947848 0) .cse1 .cse2)) (or (and .cse3 (= ~z$w_buff1_used~0_Out-1132947848 0) .cse4) (and (= ~z$w_buff1_used~0_Out-1132947848 ~z$w_buff1_used~0_In-1132947848) .cse5)) (= ~z$r_buff1_thd0~0_In-1132947848 ~z$r_buff1_thd0~0_Out-1132947848) (or (and (= ~z$w_buff0~0_In-1132947848 ~z~0_Out-1132947848) .cse1 .cse2) (and (or (and (= ~z~0_In-1132947848 ~z~0_Out-1132947848) .cse5) (and .cse3 (= ~z$w_buff1~0_In-1132947848 ~z~0_Out-1132947848) .cse4)) .cse0)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1132947848 0)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1132947848 |ULTIMATE.start_assume_abort_if_not_#in~cond_Out-1132947848|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1132947848, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1132947848, ~z$w_buff0~0=~z$w_buff0~0_In-1132947848, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1132947848, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1132947848, ~z$w_buff1~0=~z$w_buff1~0_In-1132947848, ~z~0=~z~0_In-1132947848, ~main$tmp_guard0~0=~main$tmp_guard0~0_In-1132947848} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-1132947848, ~z$w_buff0~0=~z$w_buff0~0_In-1132947848, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-1132947848, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1132947848|, ~z$w_buff1~0=~z$w_buff1~0_In-1132947848, ~main$tmp_guard0~0=~main$tmp_guard0~0_In-1132947848, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1132947848|, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1132947848|, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1132947848|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1132947848|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_Out-1132947848|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-1132947848, ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1132947848|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1132947848, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1132947848, ~z~0=~z~0_Out-1132947848} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_assume_abort_if_not_#in~cond, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_assume_abort_if_not_~cond, ~z$r_buff1_thd0~0, ~z~0] because there is no mapped edge [2020-10-15 18:17:30,175 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:30,176 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:30,176 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:30,177 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:30,177 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:30,177 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:30,177 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:30,177 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:30,178 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:30,178 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:30,178 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:30,178 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:30,178 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:30,178 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:30,179 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:30,179 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:30,179 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:30,179 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:30,179 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:30,179 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:30,180 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:30,180 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:30,180 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:30,180 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:30,182 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:30,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:30,182 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:30,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:30,183 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:30,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:30,183 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:30,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:30,183 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:30,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:30,184 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:30,184 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:30,184 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:30,185 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:30,185 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:30,185 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:30,185 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:30,185 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:30,185 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:30,186 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:30,186 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:30,186 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:30,186 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:30,187 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:30,187 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:30,187 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:30,187 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:30,187 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:30,188 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:30,188 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:30,188 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:30,188 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:30,188 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:30,188 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:30,189 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:30,189 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:30,189 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:30,189 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:30,189 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:17:30,189 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:17:30,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 06:17:30 BasicIcfg [2020-10-15 18:17:30,262 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 18:17:30,264 INFO L168 Benchmark]: Toolchain (without parser) took 19198.78 ms. Allocated memory was 250.6 MB in the beginning and 657.5 MB in the end (delta: 406.8 MB). Free memory was 206.6 MB in the beginning and 493.9 MB in the end (delta: -287.3 MB). Peak memory consumption was 119.6 MB. Max. memory is 14.2 GB. [2020-10-15 18:17:30,265 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 250.6 MB. Free memory is still 227.0 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 18:17:30,265 INFO L168 Benchmark]: CACSL2BoogieTranslator took 802.61 ms. Allocated memory was 250.6 MB in the beginning and 309.9 MB in the end (delta: 59.2 MB). Free memory was 206.6 MB in the beginning and 260.0 MB in the end (delta: -53.4 MB). Peak memory consumption was 33.2 MB. Max. memory is 14.2 GB. [2020-10-15 18:17:30,266 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.05 ms. Allocated memory is still 309.9 MB. Free memory was 260.0 MB in the beginning and 255.0 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. [2020-10-15 18:17:30,267 INFO L168 Benchmark]: Boogie Preprocessor took 51.44 ms. Allocated memory is still 309.9 MB. Free memory was 255.0 MB in the beginning and 252.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 18:17:30,267 INFO L168 Benchmark]: RCFGBuilder took 2837.69 ms. Allocated memory was 309.9 MB in the beginning and 366.5 MB in the end (delta: 56.6 MB). Free memory was 252.5 MB in the beginning and 289.3 MB in the end (delta: -36.9 MB). Peak memory consumption was 148.3 MB. Max. memory is 14.2 GB. [2020-10-15 18:17:30,268 INFO L168 Benchmark]: TraceAbstraction took 15428.51 ms. Allocated memory was 366.5 MB in the beginning and 657.5 MB in the end (delta: 291.0 MB). Free memory was 289.3 MB in the beginning and 493.9 MB in the end (delta: -204.5 MB). Peak memory consumption was 86.4 MB. Max. memory is 14.2 GB. [2020-10-15 18:17:30,272 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.46 ms. Allocated memory is still 250.6 MB. Free memory is still 227.0 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 802.61 ms. Allocated memory was 250.6 MB in the beginning and 309.9 MB in the end (delta: 59.2 MB). Free memory was 206.6 MB in the beginning and 260.0 MB in the end (delta: -53.4 MB). Peak memory consumption was 33.2 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 73.05 ms. Allocated memory is still 309.9 MB. Free memory was 260.0 MB in the beginning and 255.0 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 51.44 ms. Allocated memory is still 309.9 MB. Free memory was 255.0 MB in the beginning and 252.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2837.69 ms. Allocated memory was 309.9 MB in the beginning and 366.5 MB in the end (delta: 56.6 MB). Free memory was 252.5 MB in the beginning and 289.3 MB in the end (delta: -36.9 MB). Peak memory consumption was 148.3 MB. Max. memory is 14.2 GB. * TraceAbstraction took 15428.51 ms. Allocated memory was 366.5 MB in the beginning and 657.5 MB in the end (delta: 291.0 MB). Free memory was 289.3 MB in the beginning and 493.9 MB in the end (delta: -204.5 MB). Peak memory consumption was 86.4 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1643 VarBasedMoverChecksPositive, 100 VarBasedMoverChecksNegative, 34 SemBasedMoverChecksPositive, 66 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 233 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.5s, 120 PlacesBefore, 45 PlacesAfterwards, 109 TransitionsBefore, 33 TransitionsAfterwards, 2446 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 92 TotalNumberOfCompositions, 7114 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p3_EAX = 0; [L703] 0 int __unbuffered_p3_EBX = 0; [L705] 0 int a = 0; [L706] 0 _Bool main$tmp_guard0; [L707] 0 _Bool main$tmp_guard1; [L709] 0 int x = 0; [L711] 0 int y = 0; [L713] 0 int z = 0; [L714] 0 _Bool z$flush_delayed; [L715] 0 int z$mem_tmp; [L716] 0 _Bool z$r_buff0_thd0; [L717] 0 _Bool z$r_buff0_thd1; [L718] 0 _Bool z$r_buff0_thd2; [L719] 0 _Bool z$r_buff0_thd3; [L720] 0 _Bool z$r_buff0_thd4; [L721] 0 _Bool z$r_buff1_thd0; [L722] 0 _Bool z$r_buff1_thd1; [L723] 0 _Bool z$r_buff1_thd2; [L724] 0 _Bool z$r_buff1_thd3; [L725] 0 _Bool z$r_buff1_thd4; [L726] 0 _Bool z$read_delayed; [L727] 0 int *z$read_delayed_var; [L728] 0 int z$w_buff0; [L729] 0 _Bool z$w_buff0_used; [L730] 0 int z$w_buff1; [L731] 0 _Bool z$w_buff1_used; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L841] 0 pthread_t t825; [L842] FCALL, FORK 0 pthread_create(&t825, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 pthread_t t826; [L844] FCALL, FORK 0 pthread_create(&t826, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 pthread_t t827; [L846] FCALL, FORK 0 pthread_create(&t827, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 pthread_t t828; [L848] FCALL, FORK 0 pthread_create(&t828, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 4 z$w_buff1 = z$w_buff0 [L788] 4 z$w_buff0 = 2 [L789] 4 z$w_buff1_used = z$w_buff0_used [L790] 4 z$w_buff0_used = (_Bool)1 [L7] COND FALSE 4 !(!expression) [L792] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L793] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L794] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L795] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L796] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L797] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 4 z$flush_delayed = weak$$choice2 [L803] 4 z$mem_tmp = z [L804] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L804] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L805] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L805] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L806] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L806] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L807] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L807] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used) [L807] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L807] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used) [L807] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L807] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L808] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L808] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L809] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L809] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L810] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L810] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L810] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L810] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L811] 4 __unbuffered_p3_EAX = z [L812] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L812] 4 z = z$flush_delayed ? z$mem_tmp : z [L813] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=11, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=11, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L737] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=11, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=11, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L747] 1 return 0; [L752] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=11, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=11, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 2 return 0; [L767] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=11, weak$$choice2=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=11, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L819] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L820] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L820] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L821] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L821] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L823] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L823] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L826] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 4 return 0; [L773] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L773] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L774] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L774] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L775] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L776] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L776] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L777] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L777] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L780] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=11, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L861] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L862] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L863] 0 z$flush_delayed = weak$$choice2 [L864] 0 z$mem_tmp = z [L865] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L865] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L865] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L865] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L866] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L866] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L867] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L867] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L868] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L868] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L869] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L870] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L871] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L871] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L873] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L873] 0 z = z$flush_delayed ? z$mem_tmp : z [L874] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 108 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.1s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.7s, HoareTripleCheckerStatistics: 434 SDtfs, 577 SDslu, 446 SDs, 0 SdLazy, 186 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3002occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 265 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 249 ConstructedInterpolants, 0 QuantifiedInterpolants, 19418 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...