/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/mix038_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 11:26:43,813 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 11:26:43,816 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 11:26:43,833 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 11:26:43,834 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 11:26:43,835 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 11:26:43,836 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 11:26:43,838 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 11:26:43,840 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 11:26:43,841 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 11:26:43,842 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 11:26:43,843 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 11:26:43,843 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 11:26:43,844 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 11:26:43,845 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 11:26:43,846 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 11:26:43,847 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 11:26:43,848 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 11:26:43,849 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 11:26:43,851 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 11:26:43,853 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 11:26:43,854 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 11:26:43,855 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 11:26:43,856 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 11:26:43,858 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 11:26:43,858 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 11:26:43,858 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 11:26:43,859 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 11:26:43,860 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 11:26:43,861 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 11:26:43,861 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 11:26:43,861 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 11:26:43,862 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 11:26:43,863 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 11:26:43,864 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 11:26:43,864 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 11:26:43,865 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 11:26:43,865 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 11:26:43,865 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 11:26:43,866 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 11:26:43,867 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 11:26:43,867 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 11:26:43,882 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 11:26:43,882 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 11:26:43,883 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 11:26:43,883 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 11:26:43,884 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 11:26:43,884 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 11:26:43,884 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 11:26:43,884 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 11:26:43,884 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 11:26:43,885 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 11:26:43,885 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 11:26:43,885 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 11:26:43,885 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 11:26:43,885 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 11:26:43,886 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 11:26:43,886 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 11:26:43,886 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 11:26:43,886 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 11:26:43,886 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 11:26:43,887 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 11:26:43,887 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 11:26:43,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 11:26:43,887 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 11:26:43,887 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 11:26:43,888 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 11:26:43,888 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 11:26:43,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 11:26:43,888 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 11:26:43,888 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 11:26:43,888 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 11:26:44,190 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 11:26:44,208 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 11:26:44,211 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 11:26:44,213 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 11:26:44,213 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 11:26:44,214 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_power.opt.i [2019-12-27 11:26:44,291 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf44ced45/c926c9fe1e0c49359d42485f8f4d721b/FLAGa22524c07 [2019-12-27 11:26:44,884 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 11:26:44,885 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_power.opt.i [2019-12-27 11:26:44,908 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf44ced45/c926c9fe1e0c49359d42485f8f4d721b/FLAGa22524c07 [2019-12-27 11:26:45,121 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf44ced45/c926c9fe1e0c49359d42485f8f4d721b [2019-12-27 11:26:45,132 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 11:26:45,134 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 11:26:45,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 11:26:45,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 11:26:45,141 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 11:26:45,142 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:26:45" (1/1) ... [2019-12-27 11:26:45,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eb8f213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:26:45, skipping insertion in model container [2019-12-27 11:26:45,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:26:45" (1/1) ... [2019-12-27 11:26:45,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 11:26:45,217 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 11:26:45,705 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 11:26:45,718 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 11:26:45,824 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 11:26:45,897 INFO L208 MainTranslator]: Completed translation [2019-12-27 11:26:45,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:26:45 WrapperNode [2019-12-27 11:26:45,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 11:26:45,899 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 11:26:45,899 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 11:26:45,899 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 11:26:45,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:26:45" (1/1) ... [2019-12-27 11:26:45,947 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:26:45" (1/1) ... [2019-12-27 11:26:45,986 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 11:26:45,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 11:26:45,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 11:26:45,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 11:26:45,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:26:45" (1/1) ... [2019-12-27 11:26:45,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:26:45" (1/1) ... [2019-12-27 11:26:46,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:26:45" (1/1) ... [2019-12-27 11:26:46,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:26:45" (1/1) ... [2019-12-27 11:26:46,011 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:26:45" (1/1) ... [2019-12-27 11:26:46,015 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:26:45" (1/1) ... [2019-12-27 11:26:46,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:26:45" (1/1) ... [2019-12-27 11:26:46,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 11:26:46,033 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 11:26:46,033 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 11:26:46,033 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 11:26:46,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:26:45" (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 11:26:46,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 11:26:46,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 11:26:46,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 11:26:46,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 11:26:46,106 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 11:26:46,107 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 11:26:46,107 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 11:26:46,107 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 11:26:46,107 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 11:26:46,107 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 11:26:46,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 11:26:46,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 11:26:46,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 11:26:46,109 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 11:26:46,835 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 11:26:46,836 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 11:26:46,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:26:46 BoogieIcfgContainer [2019-12-27 11:26:46,837 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 11:26:46,840 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 11:26:46,840 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 11:26:46,845 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 11:26:46,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:26:45" (1/3) ... [2019-12-27 11:26:46,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5939fd2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:26:46, skipping insertion in model container [2019-12-27 11:26:46,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:26:45" (2/3) ... [2019-12-27 11:26:46,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5939fd2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:26:46, skipping insertion in model container [2019-12-27 11:26:46,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:26:46" (3/3) ... [2019-12-27 11:26:46,851 INFO L109 eAbstractionObserver]: Analyzing ICFG mix038_power.opt.i [2019-12-27 11:26:46,861 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 11:26:46,861 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 11:26:46,871 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 11:26:46,872 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 11:26:46,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,910 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,911 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,913 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,914 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,937 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,938 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,938 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,938 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,939 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,950 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,950 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,955 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,958 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,978 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,979 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,979 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:26:46,998 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 11:26:47,014 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 11:26:47,014 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 11:26:47,014 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 11:26:47,015 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 11:26:47,015 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 11:26:47,015 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 11:26:47,015 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 11:26:47,015 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 11:26:47,036 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 153 places, 178 transitions [2019-12-27 11:27:06,059 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111188 states. [2019-12-27 11:27:06,061 INFO L276 IsEmpty]: Start isEmpty. Operand 111188 states. [2019-12-27 11:27:06,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 11:27:06,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:27:06,077 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 11:27:06,078 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:27:06,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:27:06,083 INFO L82 PathProgramCache]: Analyzing trace with hash -734288522, now seen corresponding path program 1 times [2019-12-27 11:27:06,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:27:06,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887279293] [2019-12-27 11:27:06,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:27:06,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:27:06,403 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 11:27:06,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887279293] [2019-12-27 11:27:06,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:27:06,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 11:27:06,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053148079] [2019-12-27 11:27:06,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 11:27:06,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:27:06,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 11:27:06,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 11:27:06,429 INFO L87 Difference]: Start difference. First operand 111188 states. Second operand 4 states. [2019-12-27 11:27:10,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:27:10,462 INFO L93 Difference]: Finished difference Result 114116 states and 522352 transitions. [2019-12-27 11:27:10,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 11:27:10,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-27 11:27:10,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:27:11,155 INFO L225 Difference]: With dead ends: 114116 [2019-12-27 11:27:11,155 INFO L226 Difference]: Without dead ends: 82836 [2019-12-27 11:27:11,160 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 11:27:12,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82836 states. [2019-12-27 11:27:14,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82836 to 82836. [2019-12-27 11:27:14,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82836 states. [2019-12-27 11:27:18,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82836 states to 82836 states and 380412 transitions. [2019-12-27 11:27:18,380 INFO L78 Accepts]: Start accepts. Automaton has 82836 states and 380412 transitions. Word has length 47 [2019-12-27 11:27:18,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:27:18,381 INFO L462 AbstractCegarLoop]: Abstraction has 82836 states and 380412 transitions. [2019-12-27 11:27:18,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 11:27:18,381 INFO L276 IsEmpty]: Start isEmpty. Operand 82836 states and 380412 transitions. [2019-12-27 11:27:18,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 11:27:18,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:27:18,399 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 11:27:18,400 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:27:18,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:27:18,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1401449056, now seen corresponding path program 1 times [2019-12-27 11:27:18,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:27:18,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805972741] [2019-12-27 11:27:18,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:27:18,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:27:18,592 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 11:27:18,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805972741] [2019-12-27 11:27:18,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:27:18,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 11:27:18,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359370359] [2019-12-27 11:27:18,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 11:27:18,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:27:18,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 11:27:18,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 11:27:18,596 INFO L87 Difference]: Start difference. First operand 82836 states and 380412 transitions. Second operand 5 states. [2019-12-27 11:27:23,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:27:23,914 INFO L93 Difference]: Finished difference Result 129236 states and 566704 transitions. [2019-12-27 11:27:23,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 11:27:23,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-27 11:27:23,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:27:24,546 INFO L225 Difference]: With dead ends: 129236 [2019-12-27 11:27:24,546 INFO L226 Difference]: Without dead ends: 126476 [2019-12-27 11:27:24,547 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 11:27:25,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126476 states. [2019-12-27 11:27:28,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126476 to 119960. [2019-12-27 11:27:28,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119960 states. [2019-12-27 11:27:28,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119960 states to 119960 states and 531551 transitions. [2019-12-27 11:27:28,928 INFO L78 Accepts]: Start accepts. Automaton has 119960 states and 531551 transitions. Word has length 55 [2019-12-27 11:27:28,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:27:28,928 INFO L462 AbstractCegarLoop]: Abstraction has 119960 states and 531551 transitions. [2019-12-27 11:27:28,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 11:27:28,929 INFO L276 IsEmpty]: Start isEmpty. Operand 119960 states and 531551 transitions. [2019-12-27 11:27:28,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 11:27:28,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:27:28,945 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] [2019-12-27 11:27:28,946 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:27:28,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:27:28,946 INFO L82 PathProgramCache]: Analyzing trace with hash -861827498, now seen corresponding path program 1 times [2019-12-27 11:27:28,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:27:28,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674232599] [2019-12-27 11:27:28,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:27:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:27:29,054 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 11:27:29,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674232599] [2019-12-27 11:27:29,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:27:29,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 11:27:29,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299223815] [2019-12-27 11:27:29,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 11:27:29,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:27:29,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 11:27:29,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 11:27:29,057 INFO L87 Difference]: Start difference. First operand 119960 states and 531551 transitions. Second operand 5 states. [2019-12-27 11:27:35,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:27:35,149 INFO L93 Difference]: Finished difference Result 156372 states and 680700 transitions. [2019-12-27 11:27:35,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 11:27:35,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-27 11:27:35,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:27:35,681 INFO L225 Difference]: With dead ends: 156372 [2019-12-27 11:27:35,682 INFO L226 Difference]: Without dead ends: 154132 [2019-12-27 11:27:35,682 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 11:27:36,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154132 states. [2019-12-27 11:27:39,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154132 to 132944. [2019-12-27 11:27:39,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132944 states. [2019-12-27 11:27:40,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132944 states to 132944 states and 585325 transitions. [2019-12-27 11:27:40,752 INFO L78 Accepts]: Start accepts. Automaton has 132944 states and 585325 transitions. Word has length 56 [2019-12-27 11:27:40,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:27:40,753 INFO L462 AbstractCegarLoop]: Abstraction has 132944 states and 585325 transitions. [2019-12-27 11:27:40,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 11:27:40,753 INFO L276 IsEmpty]: Start isEmpty. Operand 132944 states and 585325 transitions. [2019-12-27 11:27:40,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 11:27:40,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:27:40,779 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] [2019-12-27 11:27:40,779 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:27:40,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:27:40,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1595989468, now seen corresponding path program 1 times [2019-12-27 11:27:40,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:27:40,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152543595] [2019-12-27 11:27:40,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:27:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:27:40,837 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 11:27:40,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152543595] [2019-12-27 11:27:40,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:27:40,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 11:27:40,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108944620] [2019-12-27 11:27:40,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 11:27:40,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:27:40,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 11:27:40,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 11:27:40,839 INFO L87 Difference]: Start difference. First operand 132944 states and 585325 transitions. Second operand 3 states. [2019-12-27 11:27:41,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:27:41,752 INFO L93 Difference]: Finished difference Result 171276 states and 741342 transitions. [2019-12-27 11:27:41,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 11:27:41,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 11:27:41,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:27:48,681 INFO L225 Difference]: With dead ends: 171276 [2019-12-27 11:27:48,681 INFO L226 Difference]: Without dead ends: 171276 [2019-12-27 11:27:48,682 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 11:27:49,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171276 states. [2019-12-27 11:27:52,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171276 to 152000. [2019-12-27 11:27:52,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152000 states. [2019-12-27 11:27:52,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152000 states to 152000 states and 663353 transitions. [2019-12-27 11:27:52,853 INFO L78 Accepts]: Start accepts. Automaton has 152000 states and 663353 transitions. Word has length 58 [2019-12-27 11:27:52,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:27:52,854 INFO L462 AbstractCegarLoop]: Abstraction has 152000 states and 663353 transitions. [2019-12-27 11:27:52,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 11:27:52,854 INFO L276 IsEmpty]: Start isEmpty. Operand 152000 states and 663353 transitions. [2019-12-27 11:27:52,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 11:27:52,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:27:52,896 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] [2019-12-27 11:27:52,896 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:27:52,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:27:52,897 INFO L82 PathProgramCache]: Analyzing trace with hash 690675031, now seen corresponding path program 1 times [2019-12-27 11:27:52,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:27:52,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171309942] [2019-12-27 11:27:52,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:27:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:27:53,003 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 11:27:53,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171309942] [2019-12-27 11:27:53,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:27:53,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 11:27:53,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854015793] [2019-12-27 11:27:53,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 11:27:53,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:27:53,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 11:27:53,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 11:27:53,007 INFO L87 Difference]: Start difference. First operand 152000 states and 663353 transitions. Second operand 6 states. [2019-12-27 11:27:55,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:27:55,622 INFO L93 Difference]: Finished difference Result 196524 states and 843638 transitions. [2019-12-27 11:27:55,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 11:27:55,622 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-27 11:27:55,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:28:03,218 INFO L225 Difference]: With dead ends: 196524 [2019-12-27 11:28:03,218 INFO L226 Difference]: Without dead ends: 193924 [2019-12-27 11:28:03,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-27 11:28:04,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193924 states. [2019-12-27 11:28:07,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193924 to 153896. [2019-12-27 11:28:07,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153896 states. [2019-12-27 11:28:07,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153896 states to 153896 states and 672395 transitions. [2019-12-27 11:28:07,577 INFO L78 Accepts]: Start accepts. Automaton has 153896 states and 672395 transitions. Word has length 62 [2019-12-27 11:28:07,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:28:07,578 INFO L462 AbstractCegarLoop]: Abstraction has 153896 states and 672395 transitions. [2019-12-27 11:28:07,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 11:28:07,578 INFO L276 IsEmpty]: Start isEmpty. Operand 153896 states and 672395 transitions. [2019-12-27 11:28:07,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 11:28:07,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:28:07,633 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] [2019-12-27 11:28:07,633 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:28:07,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:28:07,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1587793502, now seen corresponding path program 1 times [2019-12-27 11:28:07,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:28:07,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170344584] [2019-12-27 11:28:07,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:28:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:28:07,772 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 11:28:07,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170344584] [2019-12-27 11:28:07,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:28:07,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 11:28:07,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880720116] [2019-12-27 11:28:07,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 11:28:07,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:28:07,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 11:28:07,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 11:28:07,774 INFO L87 Difference]: Start difference. First operand 153896 states and 672395 transitions. Second operand 6 states. [2019-12-27 11:28:10,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:28:10,514 INFO L93 Difference]: Finished difference Result 213000 states and 921027 transitions. [2019-12-27 11:28:10,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 11:28:10,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-27 11:28:10,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:28:18,445 INFO L225 Difference]: With dead ends: 213000 [2019-12-27 11:28:18,446 INFO L226 Difference]: Without dead ends: 209096 [2019-12-27 11:28:18,446 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 11:28:19,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209096 states. [2019-12-27 11:28:22,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209096 to 196108. [2019-12-27 11:28:22,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196108 states. [2019-12-27 11:28:24,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196108 states to 196108 states and 850978 transitions. [2019-12-27 11:28:24,361 INFO L78 Accepts]: Start accepts. Automaton has 196108 states and 850978 transitions. Word has length 62 [2019-12-27 11:28:24,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:28:24,362 INFO L462 AbstractCegarLoop]: Abstraction has 196108 states and 850978 transitions. [2019-12-27 11:28:24,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 11:28:24,362 INFO L276 IsEmpty]: Start isEmpty. Operand 196108 states and 850978 transitions. [2019-12-27 11:28:24,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 11:28:24,417 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:28:24,417 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] [2019-12-27 11:28:24,418 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:28:24,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:28:24,418 INFO L82 PathProgramCache]: Analyzing trace with hash 910222435, now seen corresponding path program 1 times [2019-12-27 11:28:24,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:28:24,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864682828] [2019-12-27 11:28:24,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:28:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:28:24,518 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 11:28:24,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864682828] [2019-12-27 11:28:24,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:28:24,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 11:28:24,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964708698] [2019-12-27 11:28:24,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 11:28:24,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:28:24,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 11:28:24,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 11:28:24,520 INFO L87 Difference]: Start difference. First operand 196108 states and 850978 transitions. Second operand 7 states. [2019-12-27 11:28:33,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:28:33,119 INFO L93 Difference]: Finished difference Result 284568 states and 1194511 transitions. [2019-12-27 11:28:33,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 11:28:33,119 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-12-27 11:28:33,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:28:34,888 INFO L225 Difference]: With dead ends: 284568 [2019-12-27 11:28:34,888 INFO L226 Difference]: Without dead ends: 284568 [2019-12-27 11:28:34,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 11:28:36,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284568 states. [2019-12-27 11:28:46,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284568 to 232540. [2019-12-27 11:28:46,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232540 states. [2019-12-27 11:28:48,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232540 states to 232540 states and 989998 transitions. [2019-12-27 11:28:48,218 INFO L78 Accepts]: Start accepts. Automaton has 232540 states and 989998 transitions. Word has length 62 [2019-12-27 11:28:48,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:28:48,218 INFO L462 AbstractCegarLoop]: Abstraction has 232540 states and 989998 transitions. [2019-12-27 11:28:48,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 11:28:48,219 INFO L276 IsEmpty]: Start isEmpty. Operand 232540 states and 989998 transitions. [2019-12-27 11:28:48,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 11:28:48,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:28:48,269 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] [2019-12-27 11:28:48,269 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:28:48,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:28:48,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1797726116, now seen corresponding path program 1 times [2019-12-27 11:28:48,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:28:48,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493998714] [2019-12-27 11:28:48,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:28:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:28:48,360 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 11:28:48,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493998714] [2019-12-27 11:28:48,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:28:48,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 11:28:48,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879230038] [2019-12-27 11:28:48,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 11:28:48,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:28:48,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 11:28:48,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 11:28:48,363 INFO L87 Difference]: Start difference. First operand 232540 states and 989998 transitions. Second operand 4 states. [2019-12-27 11:28:57,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:28:57,537 INFO L93 Difference]: Finished difference Result 189767 states and 786508 transitions. [2019-12-27 11:28:57,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 11:28:57,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-27 11:28:57,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:28:58,149 INFO L225 Difference]: With dead ends: 189767 [2019-12-27 11:28:58,149 INFO L226 Difference]: Without dead ends: 183771 [2019-12-27 11:28:58,149 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 11:28:59,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183771 states. [2019-12-27 11:29:02,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183771 to 183771. [2019-12-27 11:29:02,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183771 states. [2019-12-27 11:29:03,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183771 states to 183771 states and 765838 transitions. [2019-12-27 11:29:03,738 INFO L78 Accepts]: Start accepts. Automaton has 183771 states and 765838 transitions. Word has length 62 [2019-12-27 11:29:03,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:29:03,739 INFO L462 AbstractCegarLoop]: Abstraction has 183771 states and 765838 transitions. [2019-12-27 11:29:03,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 11:29:03,739 INFO L276 IsEmpty]: Start isEmpty. Operand 183771 states and 765838 transitions. [2019-12-27 11:29:03,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 11:29:03,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:29:03,783 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] [2019-12-27 11:29:03,783 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:29:03,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:29:03,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1299870988, now seen corresponding path program 1 times [2019-12-27 11:29:03,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:29:03,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944906575] [2019-12-27 11:29:03,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:29:03,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:29:03,874 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 11:29:03,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944906575] [2019-12-27 11:29:03,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:29:03,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 11:29:03,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109459179] [2019-12-27 11:29:03,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 11:29:03,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:29:03,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 11:29:03,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 11:29:03,877 INFO L87 Difference]: Start difference. First operand 183771 states and 765838 transitions. Second operand 5 states. [2019-12-27 11:29:04,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:29:04,096 INFO L93 Difference]: Finished difference Result 34884 states and 130108 transitions. [2019-12-27 11:29:04,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 11:29:04,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-12-27 11:29:04,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:29:04,158 INFO L225 Difference]: With dead ends: 34884 [2019-12-27 11:29:04,158 INFO L226 Difference]: Without dead ends: 30057 [2019-12-27 11:29:04,159 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 11:29:04,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30057 states. [2019-12-27 11:29:04,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30057 to 29865. [2019-12-27 11:29:04,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29865 states. [2019-12-27 11:29:04,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29865 states to 29865 states and 110398 transitions. [2019-12-27 11:29:04,643 INFO L78 Accepts]: Start accepts. Automaton has 29865 states and 110398 transitions. Word has length 63 [2019-12-27 11:29:04,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:29:04,643 INFO L462 AbstractCegarLoop]: Abstraction has 29865 states and 110398 transitions. [2019-12-27 11:29:04,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 11:29:04,643 INFO L276 IsEmpty]: Start isEmpty. Operand 29865 states and 110398 transitions. [2019-12-27 11:29:04,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 11:29:04,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:29:04,660 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] [2019-12-27 11:29:04,660 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:29:04,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:29:04,661 INFO L82 PathProgramCache]: Analyzing trace with hash -315278724, now seen corresponding path program 1 times [2019-12-27 11:29:04,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:29:04,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170950847] [2019-12-27 11:29:04,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:29:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:29:04,740 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 11:29:04,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170950847] [2019-12-27 11:29:04,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:29:04,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 11:29:04,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202960086] [2019-12-27 11:29:04,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 11:29:04,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:29:04,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 11:29:04,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 11:29:04,742 INFO L87 Difference]: Start difference. First operand 29865 states and 110398 transitions. Second operand 4 states. [2019-12-27 11:29:04,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:29:04,982 INFO L93 Difference]: Finished difference Result 34926 states and 128760 transitions. [2019-12-27 11:29:04,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 11:29:04,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-27 11:29:04,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:29:05,058 INFO L225 Difference]: With dead ends: 34926 [2019-12-27 11:29:05,059 INFO L226 Difference]: Without dead ends: 34926 [2019-12-27 11:29:05,059 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 11:29:07,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34926 states. [2019-12-27 11:29:07,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34926 to 31803. [2019-12-27 11:29:07,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31803 states. [2019-12-27 11:29:07,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31803 states to 31803 states and 117324 transitions. [2019-12-27 11:29:07,997 INFO L78 Accepts]: Start accepts. Automaton has 31803 states and 117324 transitions. Word has length 73 [2019-12-27 11:29:07,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:29:07,998 INFO L462 AbstractCegarLoop]: Abstraction has 31803 states and 117324 transitions. [2019-12-27 11:29:07,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 11:29:07,998 INFO L276 IsEmpty]: Start isEmpty. Operand 31803 states and 117324 transitions. [2019-12-27 11:29:08,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 11:29:08,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:29:08,014 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] [2019-12-27 11:29:08,014 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:29:08,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:29:08,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1427531611, now seen corresponding path program 1 times [2019-12-27 11:29:08,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:29:08,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395110022] [2019-12-27 11:29:08,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:29:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:29:08,095 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 11:29:08,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395110022] [2019-12-27 11:29:08,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:29:08,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 11:29:08,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914136661] [2019-12-27 11:29:08,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 11:29:08,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:29:08,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 11:29:08,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 11:29:08,097 INFO L87 Difference]: Start difference. First operand 31803 states and 117324 transitions. Second operand 6 states. [2019-12-27 11:29:08,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:29:08,741 INFO L93 Difference]: Finished difference Result 40979 states and 149243 transitions. [2019-12-27 11:29:08,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 11:29:08,742 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-12-27 11:29:08,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:29:08,824 INFO L225 Difference]: With dead ends: 40979 [2019-12-27 11:29:08,824 INFO L226 Difference]: Without dead ends: 40799 [2019-12-27 11:29:08,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-12-27 11:29:08,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40799 states. [2019-12-27 11:29:09,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40799 to 34294. [2019-12-27 11:29:09,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34294 states. [2019-12-27 11:29:09,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34294 states to 34294 states and 125838 transitions. [2019-12-27 11:29:09,772 INFO L78 Accepts]: Start accepts. Automaton has 34294 states and 125838 transitions. Word has length 73 [2019-12-27 11:29:09,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:29:09,772 INFO L462 AbstractCegarLoop]: Abstraction has 34294 states and 125838 transitions. [2019-12-27 11:29:09,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 11:29:09,772 INFO L276 IsEmpty]: Start isEmpty. Operand 34294 states and 125838 transitions. [2019-12-27 11:29:09,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-27 11:29:09,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:29:09,791 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] [2019-12-27 11:29:09,792 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:29:09,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:29:09,792 INFO L82 PathProgramCache]: Analyzing trace with hash -671007420, now seen corresponding path program 1 times [2019-12-27 11:29:09,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:29:09,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608222173] [2019-12-27 11:29:09,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:29:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:29:09,865 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 11:29:09,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608222173] [2019-12-27 11:29:09,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:29:09,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 11:29:09,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142259308] [2019-12-27 11:29:09,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 11:29:09,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:29:09,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 11:29:09,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 11:29:09,867 INFO L87 Difference]: Start difference. First operand 34294 states and 125838 transitions. Second operand 4 states. [2019-12-27 11:29:10,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:29:10,224 INFO L93 Difference]: Finished difference Result 43212 states and 156687 transitions. [2019-12-27 11:29:10,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 11:29:10,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-27 11:29:10,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:29:10,308 INFO L225 Difference]: With dead ends: 43212 [2019-12-27 11:29:10,309 INFO L226 Difference]: Without dead ends: 43212 [2019-12-27 11:29:10,309 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 11:29:10,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43212 states. [2019-12-27 11:29:10,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43212 to 39522. [2019-12-27 11:29:10,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39522 states. [2019-12-27 11:29:10,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39522 states to 39522 states and 143619 transitions. [2019-12-27 11:29:10,944 INFO L78 Accepts]: Start accepts. Automaton has 39522 states and 143619 transitions. Word has length 75 [2019-12-27 11:29:10,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:29:10,944 INFO L462 AbstractCegarLoop]: Abstraction has 39522 states and 143619 transitions. [2019-12-27 11:29:10,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 11:29:10,945 INFO L276 IsEmpty]: Start isEmpty. Operand 39522 states and 143619 transitions. [2019-12-27 11:29:11,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-27 11:29:11,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:29:11,505 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] [2019-12-27 11:29:11,505 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:29:11,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:29:11,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1546750533, now seen corresponding path program 1 times [2019-12-27 11:29:11,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:29:11,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218789217] [2019-12-27 11:29:11,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:29:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:29:11,539 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 11:29:11,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218789217] [2019-12-27 11:29:11,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:29:11,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 11:29:11,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895211006] [2019-12-27 11:29:11,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 11:29:11,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:29:11,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 11:29:11,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 11:29:11,541 INFO L87 Difference]: Start difference. First operand 39522 states and 143619 transitions. Second operand 3 states. [2019-12-27 11:29:12,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:29:12,003 INFO L93 Difference]: Finished difference Result 41335 states and 149660 transitions. [2019-12-27 11:29:12,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 11:29:12,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-12-27 11:29:12,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:29:12,122 INFO L225 Difference]: With dead ends: 41335 [2019-12-27 11:29:12,123 INFO L226 Difference]: Without dead ends: 41335 [2019-12-27 11:29:12,123 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 11:29:12,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41335 states. [2019-12-27 11:29:12,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41335 to 40524. [2019-12-27 11:29:12,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40524 states. [2019-12-27 11:29:12,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40524 states to 40524 states and 146941 transitions. [2019-12-27 11:29:12,795 INFO L78 Accepts]: Start accepts. Automaton has 40524 states and 146941 transitions. Word has length 75 [2019-12-27 11:29:12,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:29:12,795 INFO L462 AbstractCegarLoop]: Abstraction has 40524 states and 146941 transitions. [2019-12-27 11:29:12,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 11:29:12,795 INFO L276 IsEmpty]: Start isEmpty. Operand 40524 states and 146941 transitions. [2019-12-27 11:29:12,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-27 11:29:12,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:29:12,828 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] [2019-12-27 11:29:12,828 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:29:12,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:29:12,829 INFO L82 PathProgramCache]: Analyzing trace with hash 935220688, now seen corresponding path program 1 times [2019-12-27 11:29:12,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:29:12,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945796237] [2019-12-27 11:29:12,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:29:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:29:12,949 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 11:29:12,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945796237] [2019-12-27 11:29:12,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:29:12,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 11:29:12,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371438715] [2019-12-27 11:29:12,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 11:29:12,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:29:12,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 11:29:12,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 11:29:12,951 INFO L87 Difference]: Start difference. First operand 40524 states and 146941 transitions. Second operand 6 states. [2019-12-27 11:29:13,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:29:13,930 INFO L93 Difference]: Finished difference Result 45113 states and 161733 transitions. [2019-12-27 11:29:13,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 11:29:13,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2019-12-27 11:29:13,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:29:14,021 INFO L225 Difference]: With dead ends: 45113 [2019-12-27 11:29:14,021 INFO L226 Difference]: Without dead ends: 45113 [2019-12-27 11:29:14,021 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 11:29:14,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45113 states. [2019-12-27 11:29:14,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45113 to 43400. [2019-12-27 11:29:14,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43400 states. [2019-12-27 11:29:14,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43400 states to 43400 states and 156064 transitions. [2019-12-27 11:29:14,714 INFO L78 Accepts]: Start accepts. Automaton has 43400 states and 156064 transitions. Word has length 77 [2019-12-27 11:29:14,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:29:14,714 INFO L462 AbstractCegarLoop]: Abstraction has 43400 states and 156064 transitions. [2019-12-27 11:29:14,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 11:29:14,714 INFO L276 IsEmpty]: Start isEmpty. Operand 43400 states and 156064 transitions. [2019-12-27 11:29:14,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-27 11:29:14,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:29:14,750 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] [2019-12-27 11:29:14,750 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:29:14,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:29:14,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1141988655, now seen corresponding path program 1 times [2019-12-27 11:29:14,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:29:14,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723559068] [2019-12-27 11:29:14,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:29:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:29:14,853 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 11:29:14,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723559068] [2019-12-27 11:29:14,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:29:14,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 11:29:14,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078597803] [2019-12-27 11:29:14,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 11:29:14,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:29:14,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 11:29:14,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 11:29:14,856 INFO L87 Difference]: Start difference. First operand 43400 states and 156064 transitions. Second operand 6 states. [2019-12-27 11:29:15,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:29:15,527 INFO L93 Difference]: Finished difference Result 51189 states and 179499 transitions. [2019-12-27 11:29:15,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 11:29:15,528 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2019-12-27 11:29:15,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:29:15,645 INFO L225 Difference]: With dead ends: 51189 [2019-12-27 11:29:15,645 INFO L226 Difference]: Without dead ends: 51189 [2019-12-27 11:29:15,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-27 11:29:16,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51189 states. [2019-12-27 11:29:16,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51189 to 45432. [2019-12-27 11:29:16,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45432 states. [2019-12-27 11:29:16,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45432 states to 45432 states and 160428 transitions. [2019-12-27 11:29:16,809 INFO L78 Accepts]: Start accepts. Automaton has 45432 states and 160428 transitions. Word has length 77 [2019-12-27 11:29:16,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:29:16,810 INFO L462 AbstractCegarLoop]: Abstraction has 45432 states and 160428 transitions. [2019-12-27 11:29:16,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 11:29:16,810 INFO L276 IsEmpty]: Start isEmpty. Operand 45432 states and 160428 transitions. [2019-12-27 11:29:16,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-27 11:29:16,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:29:16,848 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] [2019-12-27 11:29:16,849 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:29:16,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:29:16,849 INFO L82 PathProgramCache]: Analyzing trace with hash -930637742, now seen corresponding path program 1 times [2019-12-27 11:29:16,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:29:16,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507941236] [2019-12-27 11:29:16,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:29:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:29:16,910 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 11:29:16,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507941236] [2019-12-27 11:29:16,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:29:16,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 11:29:16,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835406509] [2019-12-27 11:29:16,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 11:29:16,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:29:16,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 11:29:16,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 11:29:16,913 INFO L87 Difference]: Start difference. First operand 45432 states and 160428 transitions. Second operand 5 states. [2019-12-27 11:29:17,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:29:17,535 INFO L93 Difference]: Finished difference Result 57021 states and 200693 transitions. [2019-12-27 11:29:17,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 11:29:17,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-12-27 11:29:17,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:29:17,659 INFO L225 Difference]: With dead ends: 57021 [2019-12-27 11:29:17,660 INFO L226 Difference]: Without dead ends: 57021 [2019-12-27 11:29:17,660 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 11:29:17,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57021 states. [2019-12-27 11:29:18,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57021 to 49071. [2019-12-27 11:29:18,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49071 states. [2019-12-27 11:29:18,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49071 states to 49071 states and 172039 transitions. [2019-12-27 11:29:18,921 INFO L78 Accepts]: Start accepts. Automaton has 49071 states and 172039 transitions. Word has length 77 [2019-12-27 11:29:18,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:29:18,921 INFO L462 AbstractCegarLoop]: Abstraction has 49071 states and 172039 transitions. [2019-12-27 11:29:18,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 11:29:18,922 INFO L276 IsEmpty]: Start isEmpty. Operand 49071 states and 172039 transitions. [2019-12-27 11:29:18,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-27 11:29:18,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:29:18,963 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] [2019-12-27 11:29:18,963 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:29:18,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:29:18,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1441171919, now seen corresponding path program 1 times [2019-12-27 11:29:18,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:29:18,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397067999] [2019-12-27 11:29:18,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:29:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:29:19,027 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 11:29:19,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397067999] [2019-12-27 11:29:19,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:29:19,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 11:29:19,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276902732] [2019-12-27 11:29:19,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 11:29:19,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:29:19,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 11:29:19,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 11:29:19,030 INFO L87 Difference]: Start difference. First operand 49071 states and 172039 transitions. Second operand 5 states. [2019-12-27 11:29:19,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:29:19,650 INFO L93 Difference]: Finished difference Result 64395 states and 225638 transitions. [2019-12-27 11:29:19,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 11:29:19,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-12-27 11:29:19,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:29:19,783 INFO L225 Difference]: With dead ends: 64395 [2019-12-27 11:29:19,783 INFO L226 Difference]: Without dead ends: 64395 [2019-12-27 11:29:19,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 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 11:29:19,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64395 states. [2019-12-27 11:29:21,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64395 to 51959. [2019-12-27 11:29:21,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51959 states. [2019-12-27 11:29:21,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51959 states to 51959 states and 182153 transitions. [2019-12-27 11:29:21,187 INFO L78 Accepts]: Start accepts. Automaton has 51959 states and 182153 transitions. Word has length 77 [2019-12-27 11:29:21,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:29:21,187 INFO L462 AbstractCegarLoop]: Abstraction has 51959 states and 182153 transitions. [2019-12-27 11:29:21,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 11:29:21,187 INFO L276 IsEmpty]: Start isEmpty. Operand 51959 states and 182153 transitions. [2019-12-27 11:29:21,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-27 11:29:21,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:29:21,227 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] [2019-12-27 11:29:21,227 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:29:21,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:29:21,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1046340914, now seen corresponding path program 1 times [2019-12-27 11:29:21,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:29:21,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273308094] [2019-12-27 11:29:21,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:29:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:29:21,298 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 11:29:21,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273308094] [2019-12-27 11:29:21,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:29:21,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 11:29:21,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909395356] [2019-12-27 11:29:21,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 11:29:21,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:29:21,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 11:29:21,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 11:29:21,300 INFO L87 Difference]: Start difference. First operand 51959 states and 182153 transitions. Second operand 6 states. [2019-12-27 11:29:21,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:29:21,431 INFO L93 Difference]: Finished difference Result 21143 states and 64322 transitions. [2019-12-27 11:29:21,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 11:29:21,432 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2019-12-27 11:29:21,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:29:21,457 INFO L225 Difference]: With dead ends: 21143 [2019-12-27 11:29:21,457 INFO L226 Difference]: Without dead ends: 17694 [2019-12-27 11:29:21,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 11:29:21,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17694 states. [2019-12-27 11:29:21,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17694 to 15290. [2019-12-27 11:29:21,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15290 states. [2019-12-27 11:29:21,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15290 states to 15290 states and 46304 transitions. [2019-12-27 11:29:21,668 INFO L78 Accepts]: Start accepts. Automaton has 15290 states and 46304 transitions. Word has length 77 [2019-12-27 11:29:21,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:29:21,668 INFO L462 AbstractCegarLoop]: Abstraction has 15290 states and 46304 transitions. [2019-12-27 11:29:21,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 11:29:21,668 INFO L276 IsEmpty]: Start isEmpty. Operand 15290 states and 46304 transitions. [2019-12-27 11:29:21,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 11:29:21,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:29:21,685 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 11:29:21,685 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:29:21,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:29:21,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1323973914, now seen corresponding path program 1 times [2019-12-27 11:29:21,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:29:21,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986713537] [2019-12-27 11:29:21,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:29:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:29:21,744 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 11:29:21,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986713537] [2019-12-27 11:29:21,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:29:21,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 11:29:21,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87139895] [2019-12-27 11:29:21,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 11:29:21,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:29:21,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 11:29:21,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 11:29:21,746 INFO L87 Difference]: Start difference. First operand 15290 states and 46304 transitions. Second operand 5 states. [2019-12-27 11:29:22,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:29:22,090 INFO L93 Difference]: Finished difference Result 17631 states and 52777 transitions. [2019-12-27 11:29:22,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 11:29:22,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-12-27 11:29:22,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:29:22,123 INFO L225 Difference]: With dead ends: 17631 [2019-12-27 11:29:22,123 INFO L226 Difference]: Without dead ends: 17507 [2019-12-27 11:29:22,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 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 11:29:22,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17507 states. [2019-12-27 11:29:22,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17507 to 15846. [2019-12-27 11:29:22,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15846 states. [2019-12-27 11:29:22,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15846 states to 15846 states and 47813 transitions. [2019-12-27 11:29:22,347 INFO L78 Accepts]: Start accepts. Automaton has 15846 states and 47813 transitions. Word has length 92 [2019-12-27 11:29:22,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:29:22,347 INFO L462 AbstractCegarLoop]: Abstraction has 15846 states and 47813 transitions. [2019-12-27 11:29:22,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 11:29:22,347 INFO L276 IsEmpty]: Start isEmpty. Operand 15846 states and 47813 transitions. [2019-12-27 11:29:22,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 11:29:22,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:29:22,368 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 11:29:22,368 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:29:22,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:29:22,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1945910238, now seen corresponding path program 2 times [2019-12-27 11:29:22,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:29:22,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446327344] [2019-12-27 11:29:22,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:29:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:29:22,689 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 11:29:22,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446327344] [2019-12-27 11:29:22,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:29:22,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 11:29:22,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300477896] [2019-12-27 11:29:22,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 11:29:22,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:29:22,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 11:29:22,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 11:29:22,692 INFO L87 Difference]: Start difference. First operand 15846 states and 47813 transitions. Second operand 7 states. [2019-12-27 11:29:23,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:29:23,255 INFO L93 Difference]: Finished difference Result 22406 states and 67119 transitions. [2019-12-27 11:29:23,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 11:29:23,256 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-27 11:29:23,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:29:23,287 INFO L225 Difference]: With dead ends: 22406 [2019-12-27 11:29:23,287 INFO L226 Difference]: Without dead ends: 22352 [2019-12-27 11:29:23,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 11:29:23,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22352 states. [2019-12-27 11:29:23,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22352 to 20008. [2019-12-27 11:29:23,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20008 states. [2019-12-27 11:29:23,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20008 states to 20008 states and 60256 transitions. [2019-12-27 11:29:23,575 INFO L78 Accepts]: Start accepts. Automaton has 20008 states and 60256 transitions. Word has length 92 [2019-12-27 11:29:23,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:29:23,576 INFO L462 AbstractCegarLoop]: Abstraction has 20008 states and 60256 transitions. [2019-12-27 11:29:23,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 11:29:23,576 INFO L276 IsEmpty]: Start isEmpty. Operand 20008 states and 60256 transitions. [2019-12-27 11:29:23,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 11:29:23,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:29:23,600 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 11:29:23,600 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:29:23,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:29:23,600 INFO L82 PathProgramCache]: Analyzing trace with hash 148958879, now seen corresponding path program 1 times [2019-12-27 11:29:23,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:29:23,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79844583] [2019-12-27 11:29:23,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:29:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:29:23,700 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 11:29:23,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79844583] [2019-12-27 11:29:23,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:29:23,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 11:29:23,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934118008] [2019-12-27 11:29:23,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 11:29:23,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:29:23,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 11:29:23,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 11:29:23,702 INFO L87 Difference]: Start difference. First operand 20008 states and 60256 transitions. Second operand 7 states. [2019-12-27 11:29:24,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:29:24,256 INFO L93 Difference]: Finished difference Result 28101 states and 84633 transitions. [2019-12-27 11:29:24,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 11:29:24,257 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-27 11:29:24,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:29:24,297 INFO L225 Difference]: With dead ends: 28101 [2019-12-27 11:29:24,297 INFO L226 Difference]: Without dead ends: 28101 [2019-12-27 11:29:24,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-27 11:29:24,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28101 states. [2019-12-27 11:29:24,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28101 to 21921. [2019-12-27 11:29:24,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21921 states. [2019-12-27 11:29:24,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21921 states to 21921 states and 66201 transitions. [2019-12-27 11:29:24,650 INFO L78 Accepts]: Start accepts. Automaton has 21921 states and 66201 transitions. Word has length 92 [2019-12-27 11:29:24,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:29:24,651 INFO L462 AbstractCegarLoop]: Abstraction has 21921 states and 66201 transitions. [2019-12-27 11:29:24,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 11:29:24,651 INFO L276 IsEmpty]: Start isEmpty. Operand 21921 states and 66201 transitions. [2019-12-27 11:29:24,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 11:29:24,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:29:24,678 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 11:29:24,678 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:29:24,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:29:24,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1036462560, now seen corresponding path program 1 times [2019-12-27 11:29:24,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:29:24,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568097354] [2019-12-27 11:29:24,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:29:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:29:24,772 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 11:29:24,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568097354] [2019-12-27 11:29:24,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:29:24,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 11:29:24,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539118219] [2019-12-27 11:29:24,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 11:29:24,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:29:24,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 11:29:24,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 11:29:24,775 INFO L87 Difference]: Start difference. First operand 21921 states and 66201 transitions. Second operand 6 states. [2019-12-27 11:29:25,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:29:25,150 INFO L93 Difference]: Finished difference Result 23956 states and 72004 transitions. [2019-12-27 11:29:25,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 11:29:25,151 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-27 11:29:25,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:29:25,184 INFO L225 Difference]: With dead ends: 23956 [2019-12-27 11:29:25,184 INFO L226 Difference]: Without dead ends: 23956 [2019-12-27 11:29:25,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 11:29:25,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23956 states. [2019-12-27 11:29:25,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23956 to 21633. [2019-12-27 11:29:25,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21633 states. [2019-12-27 11:29:25,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21633 states to 21633 states and 65389 transitions. [2019-12-27 11:29:25,676 INFO L78 Accepts]: Start accepts. Automaton has 21633 states and 65389 transitions. Word has length 92 [2019-12-27 11:29:25,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:29:25,677 INFO L462 AbstractCegarLoop]: Abstraction has 21633 states and 65389 transitions. [2019-12-27 11:29:25,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 11:29:25,677 INFO L276 IsEmpty]: Start isEmpty. Operand 21633 states and 65389 transitions. [2019-12-27 11:29:25,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 11:29:25,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:29:25,703 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 11:29:25,703 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:29:25,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:29:25,704 INFO L82 PathProgramCache]: Analyzing trace with hash -605612705, now seen corresponding path program 1 times [2019-12-27 11:29:25,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:29:25,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965979229] [2019-12-27 11:29:25,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:29:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:29:25,826 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 11:29:25,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965979229] [2019-12-27 11:29:25,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:29:25,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 11:29:25,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402330272] [2019-12-27 11:29:25,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 11:29:25,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:29:25,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 11:29:25,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 11:29:25,828 INFO L87 Difference]: Start difference. First operand 21633 states and 65389 transitions. Second operand 6 states. [2019-12-27 11:29:26,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:29:26,014 INFO L93 Difference]: Finished difference Result 21174 states and 63499 transitions. [2019-12-27 11:29:26,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 11:29:26,015 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-27 11:29:26,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:29:26,045 INFO L225 Difference]: With dead ends: 21174 [2019-12-27 11:29:26,045 INFO L226 Difference]: Without dead ends: 21174 [2019-12-27 11:29:26,046 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 11:29:26,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21174 states. [2019-12-27 11:29:26,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21174 to 10945. [2019-12-27 11:29:26,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10945 states. [2019-12-27 11:29:26,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10945 states to 10945 states and 33331 transitions. [2019-12-27 11:29:26,250 INFO L78 Accepts]: Start accepts. Automaton has 10945 states and 33331 transitions. Word has length 92 [2019-12-27 11:29:26,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:29:26,250 INFO L462 AbstractCegarLoop]: Abstraction has 10945 states and 33331 transitions. [2019-12-27 11:29:26,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 11:29:26,250 INFO L276 IsEmpty]: Start isEmpty. Operand 10945 states and 33331 transitions. [2019-12-27 11:29:26,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 11:29:26,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:29:26,263 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 11:29:26,263 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:29:26,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:29:26,263 INFO L82 PathProgramCache]: Analyzing trace with hash -247317723, now seen corresponding path program 1 times [2019-12-27 11:29:26,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:29:26,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373609211] [2019-12-27 11:29:26,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:29:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:29:26,421 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 11:29:26,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373609211] [2019-12-27 11:29:26,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:29:26,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 11:29:26,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052036178] [2019-12-27 11:29:26,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 11:29:26,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:29:26,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 11:29:26,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 11:29:26,423 INFO L87 Difference]: Start difference. First operand 10945 states and 33331 transitions. Second operand 8 states. [2019-12-27 11:29:26,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:29:26,813 INFO L93 Difference]: Finished difference Result 12844 states and 38748 transitions. [2019-12-27 11:29:26,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 11:29:26,814 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-12-27 11:29:26,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:29:26,831 INFO L225 Difference]: With dead ends: 12844 [2019-12-27 11:29:26,832 INFO L226 Difference]: Without dead ends: 12844 [2019-12-27 11:29:26,832 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 11:29:26,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12844 states. [2019-12-27 11:29:26,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12844 to 12305. [2019-12-27 11:29:26,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12305 states. [2019-12-27 11:29:27,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12305 states to 12305 states and 37287 transitions. [2019-12-27 11:29:27,000 INFO L78 Accepts]: Start accepts. Automaton has 12305 states and 37287 transitions. Word has length 94 [2019-12-27 11:29:27,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:29:27,001 INFO L462 AbstractCegarLoop]: Abstraction has 12305 states and 37287 transitions. [2019-12-27 11:29:27,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 11:29:27,001 INFO L276 IsEmpty]: Start isEmpty. Operand 12305 states and 37287 transitions. [2019-12-27 11:29:27,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 11:29:27,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:29:27,013 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 11:29:27,013 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:29:27,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:29:27,013 INFO L82 PathProgramCache]: Analyzing trace with hash 640185958, now seen corresponding path program 1 times [2019-12-27 11:29:27,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:29:27,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615145189] [2019-12-27 11:29:27,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:29:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:29:27,148 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 11:29:27,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615145189] [2019-12-27 11:29:27,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:29:27,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 11:29:27,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596452275] [2019-12-27 11:29:27,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 11:29:27,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:29:27,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 11:29:27,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-27 11:29:27,151 INFO L87 Difference]: Start difference. First operand 12305 states and 37287 transitions. Second operand 9 states. [2019-12-27 11:29:27,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:29:27,959 INFO L93 Difference]: Finished difference Result 52566 states and 158203 transitions. [2019-12-27 11:29:27,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 11:29:27,959 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-12-27 11:29:27,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:29:28,010 INFO L225 Difference]: With dead ends: 52566 [2019-12-27 11:29:28,011 INFO L226 Difference]: Without dead ends: 33065 [2019-12-27 11:29:28,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-12-27 11:29:28,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33065 states. [2019-12-27 11:29:28,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33065 to 12767. [2019-12-27 11:29:28,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12767 states. [2019-12-27 11:29:28,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12767 states to 12767 states and 38426 transitions. [2019-12-27 11:29:28,297 INFO L78 Accepts]: Start accepts. Automaton has 12767 states and 38426 transitions. Word has length 94 [2019-12-27 11:29:28,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:29:28,297 INFO L462 AbstractCegarLoop]: Abstraction has 12767 states and 38426 transitions. [2019-12-27 11:29:28,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 11:29:28,297 INFO L276 IsEmpty]: Start isEmpty. Operand 12767 states and 38426 transitions. [2019-12-27 11:29:28,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 11:29:28,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:29:28,312 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 11:29:28,312 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:29:28,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:29:28,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1872976991, now seen corresponding path program 1 times [2019-12-27 11:29:28,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:29:28,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243510642] [2019-12-27 11:29:28,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:29:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:29:28,582 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 11:29:28,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243510642] [2019-12-27 11:29:28,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:29:28,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 11:29:28,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770280724] [2019-12-27 11:29:28,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 11:29:28,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:29:28,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 11:29:28,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 11:29:28,584 INFO L87 Difference]: Start difference. First operand 12767 states and 38426 transitions. Second operand 7 states. [2019-12-27 11:29:29,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:29:29,252 INFO L93 Difference]: Finished difference Result 15722 states and 46799 transitions. [2019-12-27 11:29:29,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 11:29:29,253 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-27 11:29:29,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:29:29,275 INFO L225 Difference]: With dead ends: 15722 [2019-12-27 11:29:29,275 INFO L226 Difference]: Without dead ends: 15598 [2019-12-27 11:29:29,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-27 11:29:29,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15598 states. [2019-12-27 11:29:29,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15598 to 13569. [2019-12-27 11:29:29,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13569 states. [2019-12-27 11:29:29,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13569 states to 13569 states and 40643 transitions. [2019-12-27 11:29:29,464 INFO L78 Accepts]: Start accepts. Automaton has 13569 states and 40643 transitions. Word has length 94 [2019-12-27 11:29:29,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:29:29,464 INFO L462 AbstractCegarLoop]: Abstraction has 13569 states and 40643 transitions. [2019-12-27 11:29:29,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 11:29:29,464 INFO L276 IsEmpty]: Start isEmpty. Operand 13569 states and 40643 transitions. [2019-12-27 11:29:29,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 11:29:29,480 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:29:29,480 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 11:29:29,480 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:29:29,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:29:29,480 INFO L82 PathProgramCache]: Analyzing trace with hash 344780962, now seen corresponding path program 2 times [2019-12-27 11:29:29,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:29:29,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506073244] [2019-12-27 11:29:29,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:29:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:29:29,634 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 11:29:29,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506073244] [2019-12-27 11:29:29,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:29:29,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 11:29:29,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948441580] [2019-12-27 11:29:29,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 11:29:29,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:29:29,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 11:29:29,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 11:29:29,636 INFO L87 Difference]: Start difference. First operand 13569 states and 40643 transitions. Second operand 8 states. [2019-12-27 11:29:29,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:29:29,932 INFO L93 Difference]: Finished difference Result 29631 states and 87927 transitions. [2019-12-27 11:29:29,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 11:29:29,932 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-12-27 11:29:29,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:29:29,979 INFO L225 Difference]: With dead ends: 29631 [2019-12-27 11:29:29,979 INFO L226 Difference]: Without dead ends: 17564 [2019-12-27 11:29:29,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 11:29:30,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17564 states. [2019-12-27 11:29:30,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17564 to 12044. [2019-12-27 11:29:30,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12044 states. [2019-12-27 11:29:30,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12044 states to 12044 states and 35801 transitions. [2019-12-27 11:29:30,345 INFO L78 Accepts]: Start accepts. Automaton has 12044 states and 35801 transitions. Word has length 94 [2019-12-27 11:29:30,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:29:30,346 INFO L462 AbstractCegarLoop]: Abstraction has 12044 states and 35801 transitions. [2019-12-27 11:29:30,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 11:29:30,346 INFO L276 IsEmpty]: Start isEmpty. Operand 12044 states and 35801 transitions. [2019-12-27 11:29:30,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 11:29:30,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:29:30,370 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 11:29:30,370 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:29:30,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:29:30,370 INFO L82 PathProgramCache]: Analyzing trace with hash -369153956, now seen corresponding path program 3 times [2019-12-27 11:29:30,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:29:30,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27621274] [2019-12-27 11:29:30,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:29:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:29:30,460 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 11:29:30,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27621274] [2019-12-27 11:29:30,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:29:30,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 11:29:30,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358666955] [2019-12-27 11:29:30,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 11:29:30,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:29:30,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 11:29:30,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 11:29:30,462 INFO L87 Difference]: Start difference. First operand 12044 states and 35801 transitions. Second operand 6 states. [2019-12-27 11:29:30,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:29:30,599 INFO L93 Difference]: Finished difference Result 19217 states and 56969 transitions. [2019-12-27 11:29:30,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 11:29:30,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-27 11:29:30,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:29:30,615 INFO L225 Difference]: With dead ends: 19217 [2019-12-27 11:29:30,616 INFO L226 Difference]: Without dead ends: 7402 [2019-12-27 11:29:30,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 11:29:30,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7402 states. [2019-12-27 11:29:30,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7402 to 7402. [2019-12-27 11:29:30,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7402 states. [2019-12-27 11:29:30,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7402 states to 7402 states and 21701 transitions. [2019-12-27 11:29:30,748 INFO L78 Accepts]: Start accepts. Automaton has 7402 states and 21701 transitions. Word has length 94 [2019-12-27 11:29:30,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:29:30,748 INFO L462 AbstractCegarLoop]: Abstraction has 7402 states and 21701 transitions. [2019-12-27 11:29:30,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 11:29:30,748 INFO L276 IsEmpty]: Start isEmpty. Operand 7402 states and 21701 transitions. [2019-12-27 11:29:30,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 11:29:30,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:29:30,760 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 11:29:30,760 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:29:30,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:29:30,760 INFO L82 PathProgramCache]: Analyzing trace with hash 907836508, now seen corresponding path program 4 times [2019-12-27 11:29:30,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:29:30,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864652919] [2019-12-27 11:29:30,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:29:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 11:29:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 11:29:30,889 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 11:29:30,890 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 11:29:31,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 11:29:31 BasicIcfg [2019-12-27 11:29:31,106 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 11:29:31,108 INFO L168 Benchmark]: Toolchain (without parser) took 165974.18 ms. Allocated memory was 137.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 99.6 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 11:29:31,109 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 11:29:31,109 INFO L168 Benchmark]: CACSL2BoogieTranslator took 763.48 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 99.2 MB in the beginning and 154.9 MB in the end (delta: -55.7 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-27 11:29:31,110 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.15 ms. Allocated memory is still 201.9 MB. Free memory was 154.9 MB in the beginning and 152.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 11:29:31,110 INFO L168 Benchmark]: Boogie Preprocessor took 40.06 ms. Allocated memory is still 201.9 MB. Free memory was 152.2 MB in the beginning and 150.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 11:29:31,111 INFO L168 Benchmark]: RCFGBuilder took 804.99 ms. Allocated memory is still 201.9 MB. Free memory was 150.2 MB in the beginning and 106.9 MB in the end (delta: 43.3 MB). Peak memory consumption was 43.3 MB. Max. memory is 7.1 GB. [2019-12-27 11:29:31,112 INFO L168 Benchmark]: TraceAbstraction took 164266.12 ms. Allocated memory was 201.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 106.2 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 11:29:31,115 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 763.48 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 99.2 MB in the beginning and 154.9 MB in the end (delta: -55.7 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 87.15 ms. Allocated memory is still 201.9 MB. Free memory was 154.9 MB in the beginning and 152.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.06 ms. Allocated memory is still 201.9 MB. Free memory was 152.2 MB in the beginning and 150.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 804.99 ms. Allocated memory is still 201.9 MB. Free memory was 150.2 MB in the beginning and 106.9 MB in the end (delta: 43.3 MB). Peak memory consumption was 43.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 164266.12 ms. Allocated memory was 201.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 106.2 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L699] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L701] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L703] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L704] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L705] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L707] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L709] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L710] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L711] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L712] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L713] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L714] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L715] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L716] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L717] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L718] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L719] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L720] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L721] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L722] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L723] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L724] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L725] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L727] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L728] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L729] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L819] 0 pthread_t t1004; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t1004, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L821] 0 pthread_t t1005; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t1005, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L823] 0 pthread_t t1006; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L824] FCALL, FORK 0 pthread_create(&t1006, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 1 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 3 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 [L788] 3 z = 1 [L791] 3 __unbuffered_p2_EAX = z [L794] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 a = 1 [L736] 1 x = 1 [L741] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 2 x = 2 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L756] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L757] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L758] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L760] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L761] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 y = y$flush_delayed ? y$mem_tmp : y [L764] 2 y$flush_delayed = (_Bool)0 [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L798] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L804] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L831] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L832] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L833] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L834] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L837] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 144 locations, 2 error locations. Result: UNSAFE, OverallTime: 163.8s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 76.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8437 SDtfs, 9174 SDslu, 22171 SDs, 0 SdLazy, 6206 SolverSat, 406 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 289 GetRequests, 83 SyntacticMatches, 12 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232540occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 63.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 247728 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2232 NumberOfCodeBlocks, 2232 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2110 ConstructedInterpolants, 0 QuantifiedInterpolants, 453845 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...