/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi003_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 12:54:24,794 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 12:54:24,796 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 12:54:24,815 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 12:54:24,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 12:54:24,818 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 12:54:24,820 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 12:54:24,830 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 12:54:24,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 12:54:24,836 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 12:54:24,838 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 12:54:24,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 12:54:24,840 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 12:54:24,842 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 12:54:24,844 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 12:54:24,846 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 12:54:24,847 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 12:54:24,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 12:54:24,850 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 12:54:24,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 12:54:24,859 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 12:54:24,864 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 12:54:24,865 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 12:54:24,865 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 12:54:24,868 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 12:54:24,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 12:54:24,868 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 12:54:24,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 12:54:24,871 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 12:54:24,872 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 12:54:24,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 12:54:24,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 12:54:24,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 12:54:24,875 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 12:54:24,876 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 12:54:24,876 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 12:54:24,877 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 12:54:24,877 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 12:54:24,877 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 12:54:24,878 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 12:54:24,879 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 12:54:24,880 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-27 12:54:24,895 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 12:54:24,895 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 12:54:24,896 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 12:54:24,896 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 12:54:24,897 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 12:54:24,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 12:54:24,897 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 12:54:24,897 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 12:54:24,897 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 12:54:24,898 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 12:54:24,898 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 12:54:24,898 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 12:54:24,898 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 12:54:24,898 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 12:54:24,899 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 12:54:24,899 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 12:54:24,899 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 12:54:24,899 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 12:54:24,899 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 12:54:24,900 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 12:54:24,900 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 12:54:24,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 12:54:24,900 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 12:54:24,900 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 12:54:24,901 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 12:54:24,901 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 12:54:24,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 12:54:24,901 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 12:54:24,901 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 12:54:24,902 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 12:54:25,175 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 12:54:25,187 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 12:54:25,192 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 12:54:25,193 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 12:54:25,194 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 12:54:25,195 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_rmo.oepc.i [2019-12-27 12:54:25,273 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe447815a/54e8fea3e8284d7aa9c62f5116c9782c/FLAGd1c644f4a [2019-12-27 12:54:25,919 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 12:54:25,920 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_rmo.oepc.i [2019-12-27 12:54:25,946 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe447815a/54e8fea3e8284d7aa9c62f5116c9782c/FLAGd1c644f4a [2019-12-27 12:54:26,102 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe447815a/54e8fea3e8284d7aa9c62f5116c9782c [2019-12-27 12:54:26,113 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 12:54:26,117 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 12:54:26,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 12:54:26,121 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 12:54:26,124 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 12:54:26,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:54:26" (1/1) ... [2019-12-27 12:54:26,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27fb2686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:54:26, skipping insertion in model container [2019-12-27 12:54:26,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:54:26" (1/1) ... [2019-12-27 12:54:26,137 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 12:54:26,200 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 12:54:26,696 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 12:54:26,713 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 12:54:26,800 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 12:54:26,873 INFO L208 MainTranslator]: Completed translation [2019-12-27 12:54:26,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:54:26 WrapperNode [2019-12-27 12:54:26,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 12:54:26,874 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 12:54:26,874 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 12:54:26,874 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 12:54:26,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:54:26" (1/1) ... [2019-12-27 12:54:26,902 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:54:26" (1/1) ... [2019-12-27 12:54:26,933 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 12:54:26,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 12:54:26,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 12:54:26,933 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 12:54:26,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:54:26" (1/1) ... [2019-12-27 12:54:26,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:54:26" (1/1) ... [2019-12-27 12:54:26,946 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:54:26" (1/1) ... [2019-12-27 12:54:26,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:54:26" (1/1) ... [2019-12-27 12:54:26,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:54:26" (1/1) ... [2019-12-27 12:54:26,960 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:54:26" (1/1) ... [2019-12-27 12:54:26,963 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:54:26" (1/1) ... [2019-12-27 12:54:26,968 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 12:54:26,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 12:54:26,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 12:54:26,969 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 12:54:26,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:54:26" (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 [2019-12-27 12:54:27,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 12:54:27,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 12:54:27,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 12:54:27,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 12:54:27,045 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 12:54:27,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 12:54:27,045 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 12:54:27,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 12:54:27,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 12:54:27,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 12:54:27,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 12:54:27,050 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 12:54:27,739 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 12:54:27,739 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 12:54:27,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:54:27 BoogieIcfgContainer [2019-12-27 12:54:27,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 12:54:27,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 12:54:27,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 12:54:27,747 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 12:54:27,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 12:54:26" (1/3) ... [2019-12-27 12:54:27,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@677f1487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:54:27, skipping insertion in model container [2019-12-27 12:54:27,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:54:26" (2/3) ... [2019-12-27 12:54:27,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@677f1487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:54:27, skipping insertion in model container [2019-12-27 12:54:27,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:54:27" (3/3) ... [2019-12-27 12:54:27,755 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_rmo.oepc.i [2019-12-27 12:54:27,766 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 12:54:27,766 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 12:54:27,779 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 12:54:27,780 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 12:54:27,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,840 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,841 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,863 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,863 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,864 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,864 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,864 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,875 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,875 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,875 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,881 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,882 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:54:27,902 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 12:54:27,918 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 12:54:27,919 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 12:54:27,919 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 12:54:27,919 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 12:54:27,919 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 12:54:27,919 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 12:54:27,919 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 12:54:27,920 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 12:54:27,934 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 136 places, 164 transitions [2019-12-27 12:54:29,627 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25976 states. [2019-12-27 12:54:29,629 INFO L276 IsEmpty]: Start isEmpty. Operand 25976 states. [2019-12-27 12:54:29,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 12:54:29,638 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:54:29,639 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:54:29,639 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:54:29,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:54:29,645 INFO L82 PathProgramCache]: Analyzing trace with hash 2111627556, now seen corresponding path program 1 times [2019-12-27 12:54:29,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:54:29,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807508515] [2019-12-27 12:54:29,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:54:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:54:29,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:54:29,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807508515] [2019-12-27 12:54:29,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:54:29,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:54:29,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412995345] [2019-12-27 12:54:29,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:54:29,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:54:29,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:54:29,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:54:29,991 INFO L87 Difference]: Start difference. First operand 25976 states. Second operand 4 states. [2019-12-27 12:54:31,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:54:31,361 INFO L93 Difference]: Finished difference Result 26616 states and 102121 transitions. [2019-12-27 12:54:31,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 12:54:31,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 12:54:31,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:54:31,585 INFO L225 Difference]: With dead ends: 26616 [2019-12-27 12:54:31,585 INFO L226 Difference]: Without dead ends: 20360 [2019-12-27 12:54:31,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:54:31,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20360 states. [2019-12-27 12:54:32,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20360 to 20360. [2019-12-27 12:54:32,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20360 states. [2019-12-27 12:54:32,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20360 states to 20360 states and 78425 transitions. [2019-12-27 12:54:32,692 INFO L78 Accepts]: Start accepts. Automaton has 20360 states and 78425 transitions. Word has length 39 [2019-12-27 12:54:32,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:54:32,694 INFO L462 AbstractCegarLoop]: Abstraction has 20360 states and 78425 transitions. [2019-12-27 12:54:32,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:54:32,695 INFO L276 IsEmpty]: Start isEmpty. Operand 20360 states and 78425 transitions. [2019-12-27 12:54:32,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 12:54:32,711 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:54:32,711 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:54:32,712 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:54:32,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:54:32,713 INFO L82 PathProgramCache]: Analyzing trace with hash 341542856, now seen corresponding path program 1 times [2019-12-27 12:54:32,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:54:32,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260262507] [2019-12-27 12:54:32,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:54:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:54:32,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:54:32,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260262507] [2019-12-27 12:54:32,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:54:32,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:54:32,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774839845] [2019-12-27 12:54:32,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:54:32,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:54:32,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:54:32,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:54:32,903 INFO L87 Difference]: Start difference. First operand 20360 states and 78425 transitions. Second operand 5 states. [2019-12-27 12:54:33,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:54:33,886 INFO L93 Difference]: Finished difference Result 31838 states and 116042 transitions. [2019-12-27 12:54:33,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:54:33,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-27 12:54:33,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:54:34,042 INFO L225 Difference]: With dead ends: 31838 [2019-12-27 12:54:34,042 INFO L226 Difference]: Without dead ends: 31286 [2019-12-27 12:54:34,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 12:54:35,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31286 states. [2019-12-27 12:54:35,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31286 to 29705. [2019-12-27 12:54:35,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29705 states. [2019-12-27 12:54:36,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29705 states to 29705 states and 109519 transitions. [2019-12-27 12:54:36,179 INFO L78 Accepts]: Start accepts. Automaton has 29705 states and 109519 transitions. Word has length 47 [2019-12-27 12:54:36,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:54:36,181 INFO L462 AbstractCegarLoop]: Abstraction has 29705 states and 109519 transitions. [2019-12-27 12:54:36,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:54:36,181 INFO L276 IsEmpty]: Start isEmpty. Operand 29705 states and 109519 transitions. [2019-12-27 12:54:36,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 12:54:36,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:54:36,187 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:54:36,187 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:54:36,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:54:36,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1959299271, now seen corresponding path program 1 times [2019-12-27 12:54:36,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:54:36,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557721129] [2019-12-27 12:54:36,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:54:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:54:36,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:54:36,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557721129] [2019-12-27 12:54:36,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:54:36,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:54:36,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57010026] [2019-12-27 12:54:36,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:54:36,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:54:36,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:54:36,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:54:36,314 INFO L87 Difference]: Start difference. First operand 29705 states and 109519 transitions. Second operand 5 states. [2019-12-27 12:54:36,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:54:36,888 INFO L93 Difference]: Finished difference Result 38696 states and 139691 transitions. [2019-12-27 12:54:36,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:54:36,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-27 12:54:36,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:54:37,050 INFO L225 Difference]: With dead ends: 38696 [2019-12-27 12:54:37,050 INFO L226 Difference]: Without dead ends: 38248 [2019-12-27 12:54:37,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 12:54:37,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38248 states. [2019-12-27 12:54:38,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38248 to 32951. [2019-12-27 12:54:38,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32951 states. [2019-12-27 12:54:38,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32951 states to 32951 states and 120528 transitions. [2019-12-27 12:54:38,291 INFO L78 Accepts]: Start accepts. Automaton has 32951 states and 120528 transitions. Word has length 48 [2019-12-27 12:54:38,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:54:38,292 INFO L462 AbstractCegarLoop]: Abstraction has 32951 states and 120528 transitions. [2019-12-27 12:54:38,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:54:38,292 INFO L276 IsEmpty]: Start isEmpty. Operand 32951 states and 120528 transitions. [2019-12-27 12:54:39,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 12:54:39,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:54:39,601 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:54:39,601 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:54:39,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:54:39,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1720517523, now seen corresponding path program 1 times [2019-12-27 12:54:39,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:54:39,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896313559] [2019-12-27 12:54:39,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:54:39,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:54:39,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:54:39,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896313559] [2019-12-27 12:54:39,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:54:39,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 12:54:39,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969507472] [2019-12-27 12:54:39,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 12:54:39,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:54:39,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 12:54:39,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:54:39,661 INFO L87 Difference]: Start difference. First operand 32951 states and 120528 transitions. Second operand 3 states. [2019-12-27 12:54:39,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:54:39,938 INFO L93 Difference]: Finished difference Result 42412 states and 152019 transitions. [2019-12-27 12:54:39,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 12:54:39,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-27 12:54:39,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:54:40,064 INFO L225 Difference]: With dead ends: 42412 [2019-12-27 12:54:40,065 INFO L226 Difference]: Without dead ends: 42412 [2019-12-27 12:54:40,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:54:40,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42412 states. [2019-12-27 12:54:41,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42412 to 37665. [2019-12-27 12:54:41,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37665 states. [2019-12-27 12:54:41,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37665 states to 37665 states and 136332 transitions. [2019-12-27 12:54:41,244 INFO L78 Accepts]: Start accepts. Automaton has 37665 states and 136332 transitions. Word has length 50 [2019-12-27 12:54:41,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:54:41,244 INFO L462 AbstractCegarLoop]: Abstraction has 37665 states and 136332 transitions. [2019-12-27 12:54:41,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 12:54:41,244 INFO L276 IsEmpty]: Start isEmpty. Operand 37665 states and 136332 transitions. [2019-12-27 12:54:41,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 12:54:41,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:54:41,262 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2019-12-27 12:54:41,262 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:54:41,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:54:41,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1662860822, now seen corresponding path program 1 times [2019-12-27 12:54:41,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:54:41,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986263397] [2019-12-27 12:54:41,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:54:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:54:41,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:54:41,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986263397] [2019-12-27 12:54:41,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:54:41,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:54:41,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37704366] [2019-12-27 12:54:41,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:54:41,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:54:41,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:54:41,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:54:41,366 INFO L87 Difference]: Start difference. First operand 37665 states and 136332 transitions. Second operand 6 states. [2019-12-27 12:54:42,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:54:42,092 INFO L93 Difference]: Finished difference Result 48756 states and 172981 transitions. [2019-12-27 12:54:42,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 12:54:42,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 12:54:42,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:54:42,573 INFO L225 Difference]: With dead ends: 48756 [2019-12-27 12:54:42,573 INFO L226 Difference]: Without dead ends: 48236 [2019-12-27 12:54:42,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-27 12:54:42,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48236 states. [2019-12-27 12:54:43,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48236 to 38229. [2019-12-27 12:54:43,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38229 states. [2019-12-27 12:54:45,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38229 states to 38229 states and 138495 transitions. [2019-12-27 12:54:45,396 INFO L78 Accepts]: Start accepts. Automaton has 38229 states and 138495 transitions. Word has length 54 [2019-12-27 12:54:45,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:54:45,397 INFO L462 AbstractCegarLoop]: Abstraction has 38229 states and 138495 transitions. [2019-12-27 12:54:45,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:54:45,397 INFO L276 IsEmpty]: Start isEmpty. Operand 38229 states and 138495 transitions. [2019-12-27 12:54:45,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 12:54:45,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:54:45,414 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2019-12-27 12:54:45,414 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:54:45,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:54:45,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1119592545, now seen corresponding path program 1 times [2019-12-27 12:54:45,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:54:45,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151108102] [2019-12-27 12:54:45,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:54:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:54:45,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:54:45,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151108102] [2019-12-27 12:54:45,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:54:45,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 12:54:45,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683254400] [2019-12-27 12:54:45,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 12:54:45,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:54:45,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 12:54:45,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:54:45,483 INFO L87 Difference]: Start difference. First operand 38229 states and 138495 transitions. Second operand 3 states. [2019-12-27 12:54:45,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:54:45,824 INFO L93 Difference]: Finished difference Result 42347 states and 153425 transitions. [2019-12-27 12:54:45,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 12:54:45,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 12:54:45,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:54:45,912 INFO L225 Difference]: With dead ends: 42347 [2019-12-27 12:54:45,912 INFO L226 Difference]: Without dead ends: 42347 [2019-12-27 12:54:45,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:54:46,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42347 states. [2019-12-27 12:54:46,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42347 to 40235. [2019-12-27 12:54:46,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40235 states. [2019-12-27 12:54:46,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40235 states to 40235 states and 145783 transitions. [2019-12-27 12:54:46,949 INFO L78 Accepts]: Start accepts. Automaton has 40235 states and 145783 transitions. Word has length 54 [2019-12-27 12:54:46,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:54:46,949 INFO L462 AbstractCegarLoop]: Abstraction has 40235 states and 145783 transitions. [2019-12-27 12:54:46,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 12:54:46,949 INFO L276 IsEmpty]: Start isEmpty. Operand 40235 states and 145783 transitions. [2019-12-27 12:54:46,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 12:54:46,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:54:46,961 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2019-12-27 12:54:46,961 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:54:46,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:54:46,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1661323295, now seen corresponding path program 1 times [2019-12-27 12:54:46,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:54:46,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742364941] [2019-12-27 12:54:46,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:54:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:54:47,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:54:47,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742364941] [2019-12-27 12:54:47,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:54:47,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:54:47,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640431564] [2019-12-27 12:54:47,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:54:47,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:54:47,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:54:47,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:54:47,086 INFO L87 Difference]: Start difference. First operand 40235 states and 145783 transitions. Second operand 6 states. [2019-12-27 12:54:47,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:54:47,881 INFO L93 Difference]: Finished difference Result 54445 states and 194725 transitions. [2019-12-27 12:54:47,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:54:47,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 12:54:47,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:54:47,995 INFO L225 Difference]: With dead ends: 54445 [2019-12-27 12:54:47,995 INFO L226 Difference]: Without dead ends: 53469 [2019-12-27 12:54:47,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 12:54:48,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53469 states. [2019-12-27 12:54:49,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53469 to 48782. [2019-12-27 12:54:49,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48782 states. [2019-12-27 12:54:49,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48782 states to 48782 states and 175226 transitions. [2019-12-27 12:54:49,361 INFO L78 Accepts]: Start accepts. Automaton has 48782 states and 175226 transitions. Word has length 54 [2019-12-27 12:54:49,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:54:49,361 INFO L462 AbstractCegarLoop]: Abstraction has 48782 states and 175226 transitions. [2019-12-27 12:54:49,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:54:49,361 INFO L276 IsEmpty]: Start isEmpty. Operand 48782 states and 175226 transitions. [2019-12-27 12:54:49,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 12:54:49,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:54:49,375 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2019-12-27 12:54:49,375 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:54:49,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:54:49,376 INFO L82 PathProgramCache]: Analyzing trace with hash -135628064, now seen corresponding path program 1 times [2019-12-27 12:54:49,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:54:49,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379556076] [2019-12-27 12:54:49,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:54:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:54:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:54:49,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379556076] [2019-12-27 12:54:49,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:54:49,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 12:54:49,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658283412] [2019-12-27 12:54:49,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 12:54:49,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:54:49,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 12:54:49,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:54:49,494 INFO L87 Difference]: Start difference. First operand 48782 states and 175226 transitions. Second operand 7 states. [2019-12-27 12:54:51,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:54:51,007 INFO L93 Difference]: Finished difference Result 70897 states and 244523 transitions. [2019-12-27 12:54:51,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 12:54:51,007 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 12:54:51,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:54:51,164 INFO L225 Difference]: With dead ends: 70897 [2019-12-27 12:54:51,165 INFO L226 Difference]: Without dead ends: 70897 [2019-12-27 12:54:51,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 12:54:51,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70897 states. [2019-12-27 12:54:54,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70897 to 57890. [2019-12-27 12:54:54,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57890 states. [2019-12-27 12:54:54,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57890 states to 57890 states and 203150 transitions. [2019-12-27 12:54:54,582 INFO L78 Accepts]: Start accepts. Automaton has 57890 states and 203150 transitions. Word has length 54 [2019-12-27 12:54:54,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:54:54,582 INFO L462 AbstractCegarLoop]: Abstraction has 57890 states and 203150 transitions. [2019-12-27 12:54:54,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 12:54:54,583 INFO L276 IsEmpty]: Start isEmpty. Operand 57890 states and 203150 transitions. [2019-12-27 12:54:54,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 12:54:54,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:54:54,595 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2019-12-27 12:54:54,596 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:54:54,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:54:54,596 INFO L82 PathProgramCache]: Analyzing trace with hash 751875617, now seen corresponding path program 1 times [2019-12-27 12:54:54,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:54:54,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325871999] [2019-12-27 12:54:54,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:54:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:54:54,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:54:54,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325871999] [2019-12-27 12:54:54,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:54:54,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 12:54:54,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048054076] [2019-12-27 12:54:54,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 12:54:54,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:54:54,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 12:54:54,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:54:54,676 INFO L87 Difference]: Start difference. First operand 57890 states and 203150 transitions. Second operand 3 states. [2019-12-27 12:54:54,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:54:54,844 INFO L93 Difference]: Finished difference Result 43856 states and 152833 transitions. [2019-12-27 12:54:54,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 12:54:54,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 12:54:54,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:54:54,931 INFO L225 Difference]: With dead ends: 43856 [2019-12-27 12:54:54,931 INFO L226 Difference]: Without dead ends: 43352 [2019-12-27 12:54:54,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:54:55,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43352 states. [2019-12-27 12:54:55,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43352 to 41886. [2019-12-27 12:54:55,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41886 states. [2019-12-27 12:54:56,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41886 states to 41886 states and 146704 transitions. [2019-12-27 12:54:56,208 INFO L78 Accepts]: Start accepts. Automaton has 41886 states and 146704 transitions. Word has length 54 [2019-12-27 12:54:56,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:54:56,208 INFO L462 AbstractCegarLoop]: Abstraction has 41886 states and 146704 transitions. [2019-12-27 12:54:56,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 12:54:56,209 INFO L276 IsEmpty]: Start isEmpty. Operand 41886 states and 146704 transitions. [2019-12-27 12:54:56,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 12:54:56,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:54:56,220 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:54:56,220 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:54:56,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:54:56,220 INFO L82 PathProgramCache]: Analyzing trace with hash 807428207, now seen corresponding path program 1 times [2019-12-27 12:54:56,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:54:56,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90884954] [2019-12-27 12:54:56,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:54:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:54:56,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:54:56,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90884954] [2019-12-27 12:54:56,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:54:56,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:54:56,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467310314] [2019-12-27 12:54:56,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:54:56,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:54:56,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:54:56,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:54:56,357 INFO L87 Difference]: Start difference. First operand 41886 states and 146704 transitions. Second operand 6 states. [2019-12-27 12:54:57,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:54:57,087 INFO L93 Difference]: Finished difference Result 54549 states and 184834 transitions. [2019-12-27 12:54:57,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:54:57,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 12:54:57,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:54:57,195 INFO L225 Difference]: With dead ends: 54549 [2019-12-27 12:54:57,196 INFO L226 Difference]: Without dead ends: 54549 [2019-12-27 12:54:57,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-27 12:54:57,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54549 states. [2019-12-27 12:54:57,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54549 to 45861. [2019-12-27 12:54:57,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45861 states. [2019-12-27 12:55:00,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45861 states to 45861 states and 158167 transitions. [2019-12-27 12:55:00,582 INFO L78 Accepts]: Start accepts. Automaton has 45861 states and 158167 transitions. Word has length 55 [2019-12-27 12:55:00,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:00,582 INFO L462 AbstractCegarLoop]: Abstraction has 45861 states and 158167 transitions. [2019-12-27 12:55:00,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:55:00,582 INFO L276 IsEmpty]: Start isEmpty. Operand 45861 states and 158167 transitions. [2019-12-27 12:55:00,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 12:55:00,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:00,593 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:55:00,593 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:00,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:00,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1694931888, now seen corresponding path program 1 times [2019-12-27 12:55:00,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:00,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665688045] [2019-12-27 12:55:00,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:00,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:55:00,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665688045] [2019-12-27 12:55:00,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:00,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:55:00,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935745840] [2019-12-27 12:55:00,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:55:00,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:00,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:55:00,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:55:00,647 INFO L87 Difference]: Start difference. First operand 45861 states and 158167 transitions. Second operand 4 states. [2019-12-27 12:55:00,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:00,697 INFO L93 Difference]: Finished difference Result 8163 states and 24871 transitions. [2019-12-27 12:55:00,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 12:55:00,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-27 12:55:00,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:00,711 INFO L225 Difference]: With dead ends: 8163 [2019-12-27 12:55:00,711 INFO L226 Difference]: Without dead ends: 6754 [2019-12-27 12:55:00,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:55:00,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6754 states. [2019-12-27 12:55:00,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6754 to 6706. [2019-12-27 12:55:00,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6706 states. [2019-12-27 12:55:00,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6706 states to 6706 states and 20040 transitions. [2019-12-27 12:55:00,813 INFO L78 Accepts]: Start accepts. Automaton has 6706 states and 20040 transitions. Word has length 55 [2019-12-27 12:55:00,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:00,813 INFO L462 AbstractCegarLoop]: Abstraction has 6706 states and 20040 transitions. [2019-12-27 12:55:00,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:55:00,813 INFO L276 IsEmpty]: Start isEmpty. Operand 6706 states and 20040 transitions. [2019-12-27 12:55:00,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 12:55:00,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:00,818 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:55:00,818 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:00,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:00,818 INFO L82 PathProgramCache]: Analyzing trace with hash -2058299368, now seen corresponding path program 1 times [2019-12-27 12:55:00,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:00,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685032204] [2019-12-27 12:55:00,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:00,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:55:00,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685032204] [2019-12-27 12:55:00,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:00,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:55:00,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326953262] [2019-12-27 12:55:00,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:55:00,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:00,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:55:00,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:55:00,875 INFO L87 Difference]: Start difference. First operand 6706 states and 20040 transitions. Second operand 4 states. [2019-12-27 12:55:01,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:01,006 INFO L93 Difference]: Finished difference Result 7891 states and 23389 transitions. [2019-12-27 12:55:01,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 12:55:01,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-27 12:55:01,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:01,021 INFO L225 Difference]: With dead ends: 7891 [2019-12-27 12:55:01,022 INFO L226 Difference]: Without dead ends: 7891 [2019-12-27 12:55:01,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:55:01,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7891 states. [2019-12-27 12:55:01,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7891 to 7213. [2019-12-27 12:55:01,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7213 states. [2019-12-27 12:55:01,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7213 states to 7213 states and 21446 transitions. [2019-12-27 12:55:01,140 INFO L78 Accepts]: Start accepts. Automaton has 7213 states and 21446 transitions. Word has length 64 [2019-12-27 12:55:01,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:01,140 INFO L462 AbstractCegarLoop]: Abstraction has 7213 states and 21446 transitions. [2019-12-27 12:55:01,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:55:01,140 INFO L276 IsEmpty]: Start isEmpty. Operand 7213 states and 21446 transitions. [2019-12-27 12:55:01,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 12:55:01,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:01,145 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:55:01,145 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:01,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:01,145 INFO L82 PathProgramCache]: Analyzing trace with hash -315489033, now seen corresponding path program 1 times [2019-12-27 12:55:01,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:01,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977129567] [2019-12-27 12:55:01,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:01,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:55:01,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977129567] [2019-12-27 12:55:01,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:01,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:55:01,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248507420] [2019-12-27 12:55:01,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:55:01,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:01,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:55:01,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:55:01,220 INFO L87 Difference]: Start difference. First operand 7213 states and 21446 transitions. Second operand 6 states. [2019-12-27 12:55:01,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:01,605 INFO L93 Difference]: Finished difference Result 9268 states and 27195 transitions. [2019-12-27 12:55:01,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 12:55:01,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-27 12:55:01,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:01,625 INFO L225 Difference]: With dead ends: 9268 [2019-12-27 12:55:01,625 INFO L226 Difference]: Without dead ends: 9220 [2019-12-27 12:55:01,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 12:55:01,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9220 states. [2019-12-27 12:55:01,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9220 to 8052. [2019-12-27 12:55:01,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8052 states. [2019-12-27 12:55:01,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8052 states to 8052 states and 23826 transitions. [2019-12-27 12:55:01,789 INFO L78 Accepts]: Start accepts. Automaton has 8052 states and 23826 transitions. Word has length 64 [2019-12-27 12:55:01,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:01,789 INFO L462 AbstractCegarLoop]: Abstraction has 8052 states and 23826 transitions. [2019-12-27 12:55:01,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:55:01,790 INFO L276 IsEmpty]: Start isEmpty. Operand 8052 states and 23826 transitions. [2019-12-27 12:55:01,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 12:55:01,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:01,799 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:55:01,799 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:01,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:01,799 INFO L82 PathProgramCache]: Analyzing trace with hash 502763189, now seen corresponding path program 1 times [2019-12-27 12:55:01,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:01,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770968470] [2019-12-27 12:55:01,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:01,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:55:01,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770968470] [2019-12-27 12:55:01,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:01,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:55:01,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206876813] [2019-12-27 12:55:01,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:55:01,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:01,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:55:01,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:55:01,886 INFO L87 Difference]: Start difference. First operand 8052 states and 23826 transitions. Second operand 4 states. [2019-12-27 12:55:02,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:02,135 INFO L93 Difference]: Finished difference Result 10665 states and 31175 transitions. [2019-12-27 12:55:02,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 12:55:02,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-27 12:55:02,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:02,162 INFO L225 Difference]: With dead ends: 10665 [2019-12-27 12:55:02,162 INFO L226 Difference]: Without dead ends: 10665 [2019-12-27 12:55:02,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:55:02,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10665 states. [2019-12-27 12:55:02,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10665 to 9075. [2019-12-27 12:55:02,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9075 states. [2019-12-27 12:55:02,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9075 states to 9075 states and 26645 transitions. [2019-12-27 12:55:02,375 INFO L78 Accepts]: Start accepts. Automaton has 9075 states and 26645 transitions. Word has length 68 [2019-12-27 12:55:02,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:02,375 INFO L462 AbstractCegarLoop]: Abstraction has 9075 states and 26645 transitions. [2019-12-27 12:55:02,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:55:02,376 INFO L276 IsEmpty]: Start isEmpty. Operand 9075 states and 26645 transitions. [2019-12-27 12:55:02,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 12:55:02,386 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:02,386 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:55:02,386 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:02,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:02,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1747527670, now seen corresponding path program 1 times [2019-12-27 12:55:02,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:02,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921561462] [2019-12-27 12:55:02,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:02,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:55:02,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921561462] [2019-12-27 12:55:02,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:02,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:55:02,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913640589] [2019-12-27 12:55:02,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:55:02,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:02,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:55:02,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:55:02,516 INFO L87 Difference]: Start difference. First operand 9075 states and 26645 transitions. Second operand 6 states. [2019-12-27 12:55:02,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:02,909 INFO L93 Difference]: Finished difference Result 10385 states and 29896 transitions. [2019-12-27 12:55:02,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:55:02,909 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 12:55:02,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:02,923 INFO L225 Difference]: With dead ends: 10385 [2019-12-27 12:55:02,923 INFO L226 Difference]: Without dead ends: 10385 [2019-12-27 12:55:02,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 12:55:02,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10385 states. [2019-12-27 12:55:03,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10385 to 10082. [2019-12-27 12:55:03,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10082 states. [2019-12-27 12:55:03,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10082 states to 10082 states and 29119 transitions. [2019-12-27 12:55:03,052 INFO L78 Accepts]: Start accepts. Automaton has 10082 states and 29119 transitions. Word has length 68 [2019-12-27 12:55:03,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:03,053 INFO L462 AbstractCegarLoop]: Abstraction has 10082 states and 29119 transitions. [2019-12-27 12:55:03,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:55:03,053 INFO L276 IsEmpty]: Start isEmpty. Operand 10082 states and 29119 transitions. [2019-12-27 12:55:03,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 12:55:03,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:03,062 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:55:03,062 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:03,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:03,063 INFO L82 PathProgramCache]: Analyzing trace with hash -329681673, now seen corresponding path program 1 times [2019-12-27 12:55:03,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:03,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586441885] [2019-12-27 12:55:03,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:03,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:55:03,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586441885] [2019-12-27 12:55:03,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:03,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:55:03,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247714529] [2019-12-27 12:55:03,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:55:03,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:03,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:55:03,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:55:03,174 INFO L87 Difference]: Start difference. First operand 10082 states and 29119 transitions. Second operand 6 states. [2019-12-27 12:55:03,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:03,551 INFO L93 Difference]: Finished difference Result 11999 states and 33626 transitions. [2019-12-27 12:55:03,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 12:55:03,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 12:55:03,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:03,567 INFO L225 Difference]: With dead ends: 11999 [2019-12-27 12:55:03,567 INFO L226 Difference]: Without dead ends: 11999 [2019-12-27 12:55:03,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-27 12:55:03,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11999 states. [2019-12-27 12:55:03,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11999 to 10301. [2019-12-27 12:55:03,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10301 states. [2019-12-27 12:55:03,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10301 states to 10301 states and 29171 transitions. [2019-12-27 12:55:03,842 INFO L78 Accepts]: Start accepts. Automaton has 10301 states and 29171 transitions. Word has length 68 [2019-12-27 12:55:03,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:03,843 INFO L462 AbstractCegarLoop]: Abstraction has 10301 states and 29171 transitions. [2019-12-27 12:55:03,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:55:03,843 INFO L276 IsEmpty]: Start isEmpty. Operand 10301 states and 29171 transitions. [2019-12-27 12:55:03,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 12:55:03,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:03,850 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:55:03,850 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:03,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:03,850 INFO L82 PathProgramCache]: Analyzing trace with hash -118330760, now seen corresponding path program 1 times [2019-12-27 12:55:03,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:03,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415422702] [2019-12-27 12:55:03,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:03,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:55:03,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415422702] [2019-12-27 12:55:03,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:03,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:55:03,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479025543] [2019-12-27 12:55:03,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:55:03,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:03,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:55:03,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:55:03,938 INFO L87 Difference]: Start difference. First operand 10301 states and 29171 transitions. Second operand 5 states. [2019-12-27 12:55:04,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:04,227 INFO L93 Difference]: Finished difference Result 12576 states and 35464 transitions. [2019-12-27 12:55:04,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 12:55:04,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-27 12:55:04,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:04,248 INFO L225 Difference]: With dead ends: 12576 [2019-12-27 12:55:04,248 INFO L226 Difference]: Without dead ends: 12576 [2019-12-27 12:55:04,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:55:04,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12576 states. [2019-12-27 12:55:04,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12576 to 11076. [2019-12-27 12:55:04,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11076 states. [2019-12-27 12:55:04,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11076 states to 11076 states and 31105 transitions. [2019-12-27 12:55:04,396 INFO L78 Accepts]: Start accepts. Automaton has 11076 states and 31105 transitions. Word has length 68 [2019-12-27 12:55:04,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:04,396 INFO L462 AbstractCegarLoop]: Abstraction has 11076 states and 31105 transitions. [2019-12-27 12:55:04,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:55:04,396 INFO L276 IsEmpty]: Start isEmpty. Operand 11076 states and 31105 transitions. [2019-12-27 12:55:04,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 12:55:04,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:04,404 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:55:04,404 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:04,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:04,405 INFO L82 PathProgramCache]: Analyzing trace with hash -628864937, now seen corresponding path program 1 times [2019-12-27 12:55:04,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:04,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103335876] [2019-12-27 12:55:04,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:04,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:55:04,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103335876] [2019-12-27 12:55:04,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:04,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:55:04,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796663575] [2019-12-27 12:55:04,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:55:04,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:04,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:55:04,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:55:04,484 INFO L87 Difference]: Start difference. First operand 11076 states and 31105 transitions. Second operand 6 states. [2019-12-27 12:55:05,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:05,323 INFO L93 Difference]: Finished difference Result 17070 states and 47866 transitions. [2019-12-27 12:55:05,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:55:05,324 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 12:55:05,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:05,347 INFO L225 Difference]: With dead ends: 17070 [2019-12-27 12:55:05,347 INFO L226 Difference]: Without dead ends: 17070 [2019-12-27 12:55:05,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 12:55:05,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17070 states. [2019-12-27 12:55:05,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17070 to 14148. [2019-12-27 12:55:05,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14148 states. [2019-12-27 12:55:05,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14148 states to 14148 states and 39930 transitions. [2019-12-27 12:55:05,552 INFO L78 Accepts]: Start accepts. Automaton has 14148 states and 39930 transitions. Word has length 68 [2019-12-27 12:55:05,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:05,553 INFO L462 AbstractCegarLoop]: Abstraction has 14148 states and 39930 transitions. [2019-12-27 12:55:05,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:55:05,553 INFO L276 IsEmpty]: Start isEmpty. Operand 14148 states and 39930 transitions. [2019-12-27 12:55:05,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 12:55:05,561 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:05,561 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:55:05,562 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:05,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:05,562 INFO L82 PathProgramCache]: Analyzing trace with hash 258638744, now seen corresponding path program 1 times [2019-12-27 12:55:05,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:05,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206806931] [2019-12-27 12:55:05,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:05,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:55:05,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206806931] [2019-12-27 12:55:05,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:05,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:55:05,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342108985] [2019-12-27 12:55:05,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:55:05,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:05,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:55:05,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:55:05,618 INFO L87 Difference]: Start difference. First operand 14148 states and 39930 transitions. Second operand 4 states. [2019-12-27 12:55:06,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:06,088 INFO L93 Difference]: Finished difference Result 14460 states and 40606 transitions. [2019-12-27 12:55:06,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 12:55:06,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-27 12:55:06,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:06,112 INFO L225 Difference]: With dead ends: 14460 [2019-12-27 12:55:06,112 INFO L226 Difference]: Without dead ends: 13986 [2019-12-27 12:55:06,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:55:06,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13986 states. [2019-12-27 12:55:06,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13986 to 13425. [2019-12-27 12:55:06,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13425 states. [2019-12-27 12:55:06,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13425 states to 13425 states and 37675 transitions. [2019-12-27 12:55:06,290 INFO L78 Accepts]: Start accepts. Automaton has 13425 states and 37675 transitions. Word has length 68 [2019-12-27 12:55:06,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:06,291 INFO L462 AbstractCegarLoop]: Abstraction has 13425 states and 37675 transitions. [2019-12-27 12:55:06,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:55:06,291 INFO L276 IsEmpty]: Start isEmpty. Operand 13425 states and 37675 transitions. [2019-12-27 12:55:06,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 12:55:06,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:06,299 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:55:06,299 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:06,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:06,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1869151000, now seen corresponding path program 1 times [2019-12-27 12:55:06,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:06,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576841832] [2019-12-27 12:55:06,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:06,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:55:06,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576841832] [2019-12-27 12:55:06,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:06,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 12:55:06,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529364042] [2019-12-27 12:55:06,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 12:55:06,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:06,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 12:55:06,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 12:55:06,416 INFO L87 Difference]: Start difference. First operand 13425 states and 37675 transitions. Second operand 9 states. [2019-12-27 12:55:07,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:07,097 INFO L93 Difference]: Finished difference Result 19154 states and 53543 transitions. [2019-12-27 12:55:07,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 12:55:07,097 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-12-27 12:55:07,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:07,123 INFO L225 Difference]: With dead ends: 19154 [2019-12-27 12:55:07,123 INFO L226 Difference]: Without dead ends: 19154 [2019-12-27 12:55:07,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-27 12:55:07,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19154 states. [2019-12-27 12:55:07,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19154 to 15590. [2019-12-27 12:55:07,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15590 states. [2019-12-27 12:55:07,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15590 states to 15590 states and 43630 transitions. [2019-12-27 12:55:07,468 INFO L78 Accepts]: Start accepts. Automaton has 15590 states and 43630 transitions. Word has length 68 [2019-12-27 12:55:07,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:07,469 INFO L462 AbstractCegarLoop]: Abstraction has 15590 states and 43630 transitions. [2019-12-27 12:55:07,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 12:55:07,469 INFO L276 IsEmpty]: Start isEmpty. Operand 15590 states and 43630 transitions. [2019-12-27 12:55:07,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 12:55:07,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:07,478 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:55:07,478 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:07,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:07,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1538312615, now seen corresponding path program 1 times [2019-12-27 12:55:07,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:07,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673422490] [2019-12-27 12:55:07,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:07,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:07,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:55:07,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673422490] [2019-12-27 12:55:07,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:07,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:55:07,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908033615] [2019-12-27 12:55:07,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:55:07,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:07,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:55:07,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:55:07,578 INFO L87 Difference]: Start difference. First operand 15590 states and 43630 transitions. Second operand 5 states. [2019-12-27 12:55:07,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:07,640 INFO L93 Difference]: Finished difference Result 4904 states and 11471 transitions. [2019-12-27 12:55:07,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 12:55:07,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-27 12:55:07,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:07,645 INFO L225 Difference]: With dead ends: 4904 [2019-12-27 12:55:07,645 INFO L226 Difference]: Without dead ends: 4032 [2019-12-27 12:55:07,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:55:07,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4032 states. [2019-12-27 12:55:07,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4032 to 3409. [2019-12-27 12:55:07,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3409 states. [2019-12-27 12:55:07,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 7848 transitions. [2019-12-27 12:55:07,683 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 7848 transitions. Word has length 68 [2019-12-27 12:55:07,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:07,684 INFO L462 AbstractCegarLoop]: Abstraction has 3409 states and 7848 transitions. [2019-12-27 12:55:07,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:55:07,684 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 7848 transitions. [2019-12-27 12:55:07,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 12:55:07,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:07,689 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:55:07,689 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:07,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:07,690 INFO L82 PathProgramCache]: Analyzing trace with hash 814821392, now seen corresponding path program 1 times [2019-12-27 12:55:07,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:07,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049006386] [2019-12-27 12:55:07,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:07,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:55:07,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049006386] [2019-12-27 12:55:07,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:07,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:55:07,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791823696] [2019-12-27 12:55:07,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:55:07,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:07,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:55:07,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:55:07,744 INFO L87 Difference]: Start difference. First operand 3409 states and 7848 transitions. Second operand 4 states. [2019-12-27 12:55:07,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:07,777 INFO L93 Difference]: Finished difference Result 3364 states and 7725 transitions. [2019-12-27 12:55:07,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 12:55:07,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-12-27 12:55:07,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:07,783 INFO L225 Difference]: With dead ends: 3364 [2019-12-27 12:55:07,783 INFO L226 Difference]: Without dead ends: 3364 [2019-12-27 12:55:07,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:55:07,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3364 states. [2019-12-27 12:55:07,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3364 to 2982. [2019-12-27 12:55:07,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2982 states. [2019-12-27 12:55:07,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2982 states to 2982 states and 6852 transitions. [2019-12-27 12:55:07,830 INFO L78 Accepts]: Start accepts. Automaton has 2982 states and 6852 transitions. Word has length 85 [2019-12-27 12:55:07,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:07,831 INFO L462 AbstractCegarLoop]: Abstraction has 2982 states and 6852 transitions. [2019-12-27 12:55:07,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:55:07,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2982 states and 6852 transitions. [2019-12-27 12:55:07,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 12:55:07,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:07,835 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:55:07,836 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:07,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:07,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1492664144, now seen corresponding path program 1 times [2019-12-27 12:55:07,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:07,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256099405] [2019-12-27 12:55:07,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:07,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:55:07,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256099405] [2019-12-27 12:55:07,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:07,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 12:55:07,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530682303] [2019-12-27 12:55:07,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 12:55:07,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:07,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 12:55:07,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 12:55:07,976 INFO L87 Difference]: Start difference. First operand 2982 states and 6852 transitions. Second operand 8 states. [2019-12-27 12:55:08,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:08,390 INFO L93 Difference]: Finished difference Result 3633 states and 8221 transitions. [2019-12-27 12:55:08,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 12:55:08,391 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-12-27 12:55:08,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:08,396 INFO L225 Difference]: With dead ends: 3633 [2019-12-27 12:55:08,396 INFO L226 Difference]: Without dead ends: 3611 [2019-12-27 12:55:08,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-12-27 12:55:08,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3611 states. [2019-12-27 12:55:08,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3611 to 3165. [2019-12-27 12:55:08,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3165 states. [2019-12-27 12:55:08,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3165 states to 3165 states and 7225 transitions. [2019-12-27 12:55:08,431 INFO L78 Accepts]: Start accepts. Automaton has 3165 states and 7225 transitions. Word has length 85 [2019-12-27 12:55:08,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:08,432 INFO L462 AbstractCegarLoop]: Abstraction has 3165 states and 7225 transitions. [2019-12-27 12:55:08,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 12:55:08,432 INFO L276 IsEmpty]: Start isEmpty. Operand 3165 states and 7225 transitions. [2019-12-27 12:55:08,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 12:55:08,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:08,435 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:55:08,435 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:08,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:08,436 INFO L82 PathProgramCache]: Analyzing trace with hash -605160463, now seen corresponding path program 1 times [2019-12-27 12:55:08,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:08,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506051866] [2019-12-27 12:55:08,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:08,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:55:08,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506051866] [2019-12-27 12:55:08,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:08,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 12:55:08,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900328286] [2019-12-27 12:55:08,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 12:55:08,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:08,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 12:55:08,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-27 12:55:08,570 INFO L87 Difference]: Start difference. First operand 3165 states and 7225 transitions. Second operand 9 states. [2019-12-27 12:55:09,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:09,145 INFO L93 Difference]: Finished difference Result 11435 states and 26306 transitions. [2019-12-27 12:55:09,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 12:55:09,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-12-27 12:55:09,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:09,155 INFO L225 Difference]: With dead ends: 11435 [2019-12-27 12:55:09,155 INFO L226 Difference]: Without dead ends: 7337 [2019-12-27 12:55:09,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-12-27 12:55:09,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7337 states. [2019-12-27 12:55:09,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7337 to 3288. [2019-12-27 12:55:09,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3288 states. [2019-12-27 12:55:09,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 3288 states and 7466 transitions. [2019-12-27 12:55:09,206 INFO L78 Accepts]: Start accepts. Automaton has 3288 states and 7466 transitions. Word has length 85 [2019-12-27 12:55:09,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:09,206 INFO L462 AbstractCegarLoop]: Abstraction has 3288 states and 7466 transitions. [2019-12-27 12:55:09,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 12:55:09,206 INFO L276 IsEmpty]: Start isEmpty. Operand 3288 states and 7466 transitions. [2019-12-27 12:55:09,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 12:55:09,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:09,211 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:55:09,211 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:09,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:09,211 INFO L82 PathProgramCache]: Analyzing trace with hash -779070116, now seen corresponding path program 1 times [2019-12-27 12:55:09,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:09,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477804992] [2019-12-27 12:55:09,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:09,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:55:09,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477804992] [2019-12-27 12:55:09,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:09,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:55:09,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465214202] [2019-12-27 12:55:09,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:55:09,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:09,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:55:09,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:55:09,335 INFO L87 Difference]: Start difference. First operand 3288 states and 7466 transitions. Second operand 6 states. [2019-12-27 12:55:09,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:09,575 INFO L93 Difference]: Finished difference Result 3693 states and 8318 transitions. [2019-12-27 12:55:09,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 12:55:09,575 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-12-27 12:55:09,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:09,579 INFO L225 Difference]: With dead ends: 3693 [2019-12-27 12:55:09,580 INFO L226 Difference]: Without dead ends: 3621 [2019-12-27 12:55:09,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:55:09,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3621 states. [2019-12-27 12:55:09,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3621 to 3182. [2019-12-27 12:55:09,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3182 states. [2019-12-27 12:55:09,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3182 states to 3182 states and 7161 transitions. [2019-12-27 12:55:09,614 INFO L78 Accepts]: Start accepts. Automaton has 3182 states and 7161 transitions. Word has length 85 [2019-12-27 12:55:09,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:09,614 INFO L462 AbstractCegarLoop]: Abstraction has 3182 states and 7161 transitions. [2019-12-27 12:55:09,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:55:09,614 INFO L276 IsEmpty]: Start isEmpty. Operand 3182 states and 7161 transitions. [2019-12-27 12:55:09,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 12:55:09,617 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:09,617 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:55:09,617 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:09,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:09,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1438687837, now seen corresponding path program 2 times [2019-12-27 12:55:09,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:09,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768752915] [2019-12-27 12:55:09,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:09,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:55:09,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768752915] [2019-12-27 12:55:09,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:09,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 12:55:09,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426265876] [2019-12-27 12:55:09,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 12:55:09,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:09,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 12:55:09,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:55:09,739 INFO L87 Difference]: Start difference. First operand 3182 states and 7161 transitions. Second operand 7 states. [2019-12-27 12:55:09,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:09,825 INFO L93 Difference]: Finished difference Result 5397 states and 12204 transitions. [2019-12-27 12:55:09,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 12:55:09,826 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-12-27 12:55:09,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:09,829 INFO L225 Difference]: With dead ends: 5397 [2019-12-27 12:55:09,829 INFO L226 Difference]: Without dead ends: 2304 [2019-12-27 12:55:09,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 12:55:09,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2019-12-27 12:55:09,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 2304. [2019-12-27 12:55:09,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2304 states. [2019-12-27 12:55:09,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 2304 states and 5189 transitions. [2019-12-27 12:55:09,850 INFO L78 Accepts]: Start accepts. Automaton has 2304 states and 5189 transitions. Word has length 85 [2019-12-27 12:55:09,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:09,850 INFO L462 AbstractCegarLoop]: Abstraction has 2304 states and 5189 transitions. [2019-12-27 12:55:09,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 12:55:09,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2304 states and 5189 transitions. [2019-12-27 12:55:09,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 12:55:09,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:09,852 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:55:09,852 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:09,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:09,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1677225695, now seen corresponding path program 3 times [2019-12-27 12:55:09,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:09,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897710900] [2019-12-27 12:55:09,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:09,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:55:09,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897710900] [2019-12-27 12:55:09,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:09,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:55:09,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218391030] [2019-12-27 12:55:09,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:55:09,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:09,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:55:09,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:55:09,938 INFO L87 Difference]: Start difference. First operand 2304 states and 5189 transitions. Second operand 5 states. [2019-12-27 12:55:09,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:09,983 INFO L93 Difference]: Finished difference Result 2429 states and 5444 transitions. [2019-12-27 12:55:09,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 12:55:09,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-12-27 12:55:09,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:09,987 INFO L225 Difference]: With dead ends: 2429 [2019-12-27 12:55:09,987 INFO L226 Difference]: Without dead ends: 2429 [2019-12-27 12:55:09,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:55:09,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2429 states. [2019-12-27 12:55:10,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2429 to 2388. [2019-12-27 12:55:10,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2388 states. [2019-12-27 12:55:10,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 5359 transitions. [2019-12-27 12:55:10,019 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 5359 transitions. Word has length 85 [2019-12-27 12:55:10,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:10,019 INFO L462 AbstractCegarLoop]: Abstraction has 2388 states and 5359 transitions. [2019-12-27 12:55:10,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:55:10,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 5359 transitions. [2019-12-27 12:55:10,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 12:55:10,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:10,022 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:55:10,023 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:10,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:10,024 INFO L82 PathProgramCache]: Analyzing trace with hash -641388152, now seen corresponding path program 1 times [2019-12-27 12:55:10,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:10,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700909303] [2019-12-27 12:55:10,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 12:55:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 12:55:10,140 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 12:55:10,140 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 12:55:10,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 12:55:10 BasicIcfg [2019-12-27 12:55:10,351 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 12:55:10,353 INFO L168 Benchmark]: Toolchain (without parser) took 44238.04 ms. Allocated memory was 145.2 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 101.5 MB in the beginning and 1.0 GB in the end (delta: -915.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 12:55:10,354 INFO L168 Benchmark]: CDTParser took 1.59 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 12:55:10,357 INFO L168 Benchmark]: CACSL2BoogieTranslator took 753.25 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 101.1 MB in the beginning and 158.6 MB in the end (delta: -57.5 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-27 12:55:10,361 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.80 ms. Allocated memory is still 203.4 MB. Free memory was 158.6 MB in the beginning and 155.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 12:55:10,361 INFO L168 Benchmark]: Boogie Preprocessor took 35.04 ms. Allocated memory is still 203.4 MB. Free memory was 155.8 MB in the beginning and 153.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 12:55:10,361 INFO L168 Benchmark]: RCFGBuilder took 773.35 ms. Allocated memory is still 203.4 MB. Free memory was 153.8 MB in the beginning and 112.4 MB in the end (delta: 41.5 MB). Peak memory consumption was 41.5 MB. Max. memory is 7.1 GB. [2019-12-27 12:55:10,363 INFO L168 Benchmark]: TraceAbstraction took 42608.27 ms. Allocated memory was 203.4 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 112.4 MB in the beginning and 1.0 GB in the end (delta: -904.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 12:55:10,365 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.59 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 753.25 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 101.1 MB in the beginning and 158.6 MB in the end (delta: -57.5 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.80 ms. Allocated memory is still 203.4 MB. Free memory was 158.6 MB in the beginning and 155.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.04 ms. Allocated memory is still 203.4 MB. Free memory was 155.8 MB in the beginning and 153.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 773.35 ms. Allocated memory is still 203.4 MB. Free memory was 153.8 MB in the beginning and 112.4 MB in the end (delta: 41.5 MB). Peak memory consumption was 41.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 42608.27 ms. Allocated memory was 203.4 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 112.4 MB in the beginning and 1.0 GB in the end (delta: -904.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L707] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L708] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L709] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L710] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L711] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L712] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L713] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L714] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L715] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L716] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L717] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L718] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L719] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L723] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L799] 0 pthread_t t1641; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L800] FCALL, FORK 0 pthread_create(&t1641, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L801] 0 pthread_t t1642; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] FCALL, FORK 0 pthread_create(&t1642, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L762] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L763] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L764] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L765] 2 x$r_buff0_thd2 = (_Bool)1 [L768] 2 y = 1 [L771] 2 __unbuffered_p1_EAX = y [L774] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L727] 1 y = 2 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L737] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L739] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L741] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L742] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L780] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x = x$flush_delayed ? x$mem_tmp : x [L745] 1 x$flush_delayed = (_Bool)0 [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L804] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L810] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L811] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L812] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L815] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 130 locations, 2 error locations. Result: UNSAFE, OverallTime: 42.2s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 14.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7173 SDtfs, 8336 SDslu, 16031 SDs, 0 SdLazy, 5796 SolverSat, 438 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 73 SyntacticMatches, 12 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57890occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 21.0s AutomataMinimizationTime, 27 MinimizatonAttempts, 71604 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1831 NumberOfCodeBlocks, 1831 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1719 ConstructedInterpolants, 0 QuantifiedInterpolants, 350736 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...