/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/mix034_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 02:09:07,930 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 02:09:07,933 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 02:09:07,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 02:09:07,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 02:09:07,952 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 02:09:07,953 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 02:09:07,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 02:09:07,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 02:09:07,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 02:09:07,959 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 02:09:07,960 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 02:09:07,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 02:09:07,961 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 02:09:07,964 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 02:09:07,966 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 02:09:07,967 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 02:09:07,971 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 02:09:07,972 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 02:09:07,978 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 02:09:07,980 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 02:09:07,984 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 02:09:07,986 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 02:09:07,986 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 02:09:07,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 02:09:07,989 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 02:09:07,989 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 02:09:07,991 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 02:09:07,993 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 02:09:07,994 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 02:09:07,994 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 02:09:07,996 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 02:09:07,997 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 02:09:07,997 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 02:09:08,001 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 02:09:08,001 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 02:09:08,002 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 02:09:08,002 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 02:09:08,002 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 02:09:08,004 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 02:09:08,005 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 02:09:08,006 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-19 02:09:08,025 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 02:09:08,025 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 02:09:08,027 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 02:09:08,027 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 02:09:08,028 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 02:09:08,028 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 02:09:08,028 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 02:09:08,028 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 02:09:08,028 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 02:09:08,029 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 02:09:08,029 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 02:09:08,030 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 02:09:08,030 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 02:09:08,030 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 02:09:08,031 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 02:09:08,031 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 02:09:08,031 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 02:09:08,031 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 02:09:08,031 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 02:09:08,032 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 02:09:08,032 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 02:09:08,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 02:09:08,032 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 02:09:08,032 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 02:09:08,033 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 02:09:08,033 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 02:09:08,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 02:09:08,033 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 02:09:08,033 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 02:09:08,034 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 02:09:08,320 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 02:09:08,334 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 02:09:08,337 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 02:09:08,339 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 02:09:08,339 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 02:09:08,340 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_tso.oepc.i [2019-12-19 02:09:08,406 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ffe1e6c0/352bd7f576a346bab6405270e4f3053c/FLAGf7af78191 [2019-12-19 02:09:08,959 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 02:09:08,960 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_tso.oepc.i [2019-12-19 02:09:08,973 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ffe1e6c0/352bd7f576a346bab6405270e4f3053c/FLAGf7af78191 [2019-12-19 02:09:09,241 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ffe1e6c0/352bd7f576a346bab6405270e4f3053c [2019-12-19 02:09:09,250 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 02:09:09,252 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 02:09:09,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 02:09:09,253 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 02:09:09,256 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 02:09:09,257 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:09:09" (1/1) ... [2019-12-19 02:09:09,260 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e73aeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:09:09, skipping insertion in model container [2019-12-19 02:09:09,261 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:09:09" (1/1) ... [2019-12-19 02:09:09,268 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 02:09:09,312 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 02:09:09,824 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 02:09:09,837 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 02:09:09,901 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 02:09:09,978 INFO L208 MainTranslator]: Completed translation [2019-12-19 02:09:09,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:09:09 WrapperNode [2019-12-19 02:09:09,979 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 02:09:09,979 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 02:09:09,980 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 02:09:09,980 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 02:09:09,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:09:09" (1/1) ... [2019-12-19 02:09:10,009 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:09:09" (1/1) ... [2019-12-19 02:09:10,041 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 02:09:10,041 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 02:09:10,041 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 02:09:10,041 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 02:09:10,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:09:09" (1/1) ... [2019-12-19 02:09:10,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:09:09" (1/1) ... [2019-12-19 02:09:10,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:09:09" (1/1) ... [2019-12-19 02:09:10,056 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:09:09" (1/1) ... [2019-12-19 02:09:10,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:09:09" (1/1) ... [2019-12-19 02:09:10,074 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:09:09" (1/1) ... [2019-12-19 02:09:10,079 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:09:09" (1/1) ... [2019-12-19 02:09:10,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 02:09:10,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 02:09:10,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 02:09:10,085 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 02:09:10,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:09:09" (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-19 02:09:10,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 02:09:10,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 02:09:10,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 02:09:10,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 02:09:10,154 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 02:09:10,154 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 02:09:10,154 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 02:09:10,154 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 02:09:10,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 02:09:10,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 02:09:10,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 02:09:10,157 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-19 02:09:10,854 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 02:09:10,855 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 02:09:10,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:09:10 BoogieIcfgContainer [2019-12-19 02:09:10,857 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 02:09:10,859 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 02:09:10,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 02:09:10,864 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 02:09:10,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 02:09:09" (1/3) ... [2019-12-19 02:09:10,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db72bc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:09:10, skipping insertion in model container [2019-12-19 02:09:10,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:09:09" (2/3) ... [2019-12-19 02:09:10,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db72bc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:09:10, skipping insertion in model container [2019-12-19 02:09:10,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:09:10" (3/3) ... [2019-12-19 02:09:10,872 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_tso.oepc.i [2019-12-19 02:09:10,883 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 02:09:10,883 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 02:09:10,898 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 02:09:10,899 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 02:09:10,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,950 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,950 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,951 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,951 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,952 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,962 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,962 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,996 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:10,996 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,014 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,021 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,023 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:09:11,039 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 02:09:11,060 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 02:09:11,060 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 02:09:11,060 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 02:09:11,060 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 02:09:11,061 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 02:09:11,061 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 02:09:11,061 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 02:09:11,061 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 02:09:11,081 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 149 places, 183 transitions [2019-12-19 02:09:13,218 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32593 states. [2019-12-19 02:09:13,220 INFO L276 IsEmpty]: Start isEmpty. Operand 32593 states. [2019-12-19 02:09:13,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-19 02:09:13,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:13,228 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] [2019-12-19 02:09:13,228 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:13,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:13,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1674583442, now seen corresponding path program 1 times [2019-12-19 02:09:13,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:13,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855237703] [2019-12-19 02:09:13,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:13,537 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-19 02:09:13,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855237703] [2019-12-19 02:09:13,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:13,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:09:13,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539492515] [2019-12-19 02:09:13,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:09:13,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:13,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:09:13,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:09:13,563 INFO L87 Difference]: Start difference. First operand 32593 states. Second operand 4 states. [2019-12-19 02:09:14,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:14,254 INFO L93 Difference]: Finished difference Result 33593 states and 129570 transitions. [2019-12-19 02:09:14,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:09:14,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-19 02:09:14,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:15,452 INFO L225 Difference]: With dead ends: 33593 [2019-12-19 02:09:15,454 INFO L226 Difference]: Without dead ends: 25705 [2019-12-19 02:09:15,465 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-19 02:09:16,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25705 states. [2019-12-19 02:09:16,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25705 to 25705. [2019-12-19 02:09:16,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25705 states. [2019-12-19 02:09:17,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25705 states to 25705 states and 99586 transitions. [2019-12-19 02:09:17,161 INFO L78 Accepts]: Start accepts. Automaton has 25705 states and 99586 transitions. Word has length 36 [2019-12-19 02:09:17,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:17,163 INFO L462 AbstractCegarLoop]: Abstraction has 25705 states and 99586 transitions. [2019-12-19 02:09:17,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:09:17,163 INFO L276 IsEmpty]: Start isEmpty. Operand 25705 states and 99586 transitions. [2019-12-19 02:09:17,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-19 02:09:17,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:17,180 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:17,181 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:17,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:17,182 INFO L82 PathProgramCache]: Analyzing trace with hash -196337745, now seen corresponding path program 1 times [2019-12-19 02:09:17,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:17,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11059943] [2019-12-19 02:09:17,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:17,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:17,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11059943] [2019-12-19 02:09:17,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:17,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:09:17,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832257962] [2019-12-19 02:09:17,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:09:17,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:17,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:09:17,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:17,368 INFO L87 Difference]: Start difference. First operand 25705 states and 99586 transitions. Second operand 5 states. [2019-12-19 02:09:18,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:18,645 INFO L93 Difference]: Finished difference Result 41083 states and 150433 transitions. [2019-12-19 02:09:18,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:09:18,645 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-19 02:09:18,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:18,863 INFO L225 Difference]: With dead ends: 41083 [2019-12-19 02:09:18,863 INFO L226 Difference]: Without dead ends: 40547 [2019-12-19 02:09:18,864 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-19 02:09:20,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40547 states. [2019-12-19 02:09:21,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40547 to 38927. [2019-12-19 02:09:21,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38927 states. [2019-12-19 02:09:21,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38927 states to 38927 states and 143583 transitions. [2019-12-19 02:09:21,723 INFO L78 Accepts]: Start accepts. Automaton has 38927 states and 143583 transitions. Word has length 48 [2019-12-19 02:09:21,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:21,726 INFO L462 AbstractCegarLoop]: Abstraction has 38927 states and 143583 transitions. [2019-12-19 02:09:21,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:09:21,727 INFO L276 IsEmpty]: Start isEmpty. Operand 38927 states and 143583 transitions. [2019-12-19 02:09:21,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-19 02:09:21,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:21,735 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] [2019-12-19 02:09:21,735 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:21,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:21,736 INFO L82 PathProgramCache]: Analyzing trace with hash -207257985, now seen corresponding path program 1 times [2019-12-19 02:09:21,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:21,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524884358] [2019-12-19 02:09:21,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:21,885 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-19 02:09:21,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524884358] [2019-12-19 02:09:21,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:21,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:09:21,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580533283] [2019-12-19 02:09:21,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:09:21,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:21,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:09:21,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:21,889 INFO L87 Difference]: Start difference. First operand 38927 states and 143583 transitions. Second operand 5 states. [2019-12-19 02:09:22,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:22,523 INFO L93 Difference]: Finished difference Result 49780 states and 180635 transitions. [2019-12-19 02:09:22,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:09:22,523 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-19 02:09:22,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:24,438 INFO L225 Difference]: With dead ends: 49780 [2019-12-19 02:09:24,438 INFO L226 Difference]: Without dead ends: 49276 [2019-12-19 02:09:24,439 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-19 02:09:24,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49276 states. [2019-12-19 02:09:25,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49276 to 42679. [2019-12-19 02:09:25,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42679 states. [2019-12-19 02:09:25,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42679 states to 42679 states and 156594 transitions. [2019-12-19 02:09:25,668 INFO L78 Accepts]: Start accepts. Automaton has 42679 states and 156594 transitions. Word has length 49 [2019-12-19 02:09:25,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:25,669 INFO L462 AbstractCegarLoop]: Abstraction has 42679 states and 156594 transitions. [2019-12-19 02:09:25,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:09:25,669 INFO L276 IsEmpty]: Start isEmpty. Operand 42679 states and 156594 transitions. [2019-12-19 02:09:25,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-19 02:09:25,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:25,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] [2019-12-19 02:09:25,678 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:25,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:25,679 INFO L82 PathProgramCache]: Analyzing trace with hash -635197403, now seen corresponding path program 1 times [2019-12-19 02:09:25,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:25,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323934830] [2019-12-19 02:09:25,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:25,732 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-19 02:09:25,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323934830] [2019-12-19 02:09:25,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:25,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:09:25,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830967563] [2019-12-19 02:09:25,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:09:25,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:25,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:09:25,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:09:25,735 INFO L87 Difference]: Start difference. First operand 42679 states and 156594 transitions. Second operand 3 states. [2019-12-19 02:09:26,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:26,033 INFO L93 Difference]: Finished difference Result 61089 states and 221432 transitions. [2019-12-19 02:09:26,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:09:26,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-19 02:09:26,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:26,214 INFO L225 Difference]: With dead ends: 61089 [2019-12-19 02:09:26,214 INFO L226 Difference]: Without dead ends: 61089 [2019-12-19 02:09:26,215 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-19 02:09:27,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61089 states. [2019-12-19 02:09:30,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61089 to 48018. [2019-12-19 02:09:30,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48018 states. [2019-12-19 02:09:30,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48018 states to 48018 states and 174181 transitions. [2019-12-19 02:09:30,172 INFO L78 Accepts]: Start accepts. Automaton has 48018 states and 174181 transitions. Word has length 51 [2019-12-19 02:09:30,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:30,172 INFO L462 AbstractCegarLoop]: Abstraction has 48018 states and 174181 transitions. [2019-12-19 02:09:30,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:09:30,172 INFO L276 IsEmpty]: Start isEmpty. Operand 48018 states and 174181 transitions. [2019-12-19 02:09:30,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 02:09:30,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:30,187 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:30,188 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:30,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:30,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1064293156, now seen corresponding path program 1 times [2019-12-19 02:09:30,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:30,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738520693] [2019-12-19 02:09:30,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:30,322 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-19 02:09:30,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738520693] [2019-12-19 02:09:30,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:30,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:09:30,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756160669] [2019-12-19 02:09:30,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:09:30,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:30,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:09:30,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:30,325 INFO L87 Difference]: Start difference. First operand 48018 states and 174181 transitions. Second operand 6 states. [2019-12-19 02:09:31,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:31,164 INFO L93 Difference]: Finished difference Result 63758 states and 229381 transitions. [2019-12-19 02:09:31,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:09:31,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-19 02:09:31,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:31,297 INFO L225 Difference]: With dead ends: 63758 [2019-12-19 02:09:31,297 INFO L226 Difference]: Without dead ends: 63758 [2019-12-19 02:09:31,297 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-19 02:09:31,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63758 states. [2019-12-19 02:09:32,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63758 to 59951. [2019-12-19 02:09:32,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59951 states. [2019-12-19 02:09:35,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59951 states to 59951 states and 215674 transitions. [2019-12-19 02:09:35,756 INFO L78 Accepts]: Start accepts. Automaton has 59951 states and 215674 transitions. Word has length 55 [2019-12-19 02:09:35,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:35,756 INFO L462 AbstractCegarLoop]: Abstraction has 59951 states and 215674 transitions. [2019-12-19 02:09:35,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:09:35,756 INFO L276 IsEmpty]: Start isEmpty. Operand 59951 states and 215674 transitions. [2019-12-19 02:09:35,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 02:09:35,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:35,774 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-19 02:09:35,775 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:35,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:35,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1433722781, now seen corresponding path program 1 times [2019-12-19 02:09:35,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:35,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833616463] [2019-12-19 02:09:35,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:35,881 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-19 02:09:35,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833616463] [2019-12-19 02:09:35,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:35,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:09:35,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263245674] [2019-12-19 02:09:35,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:09:35,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:35,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:09:35,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:09:35,883 INFO L87 Difference]: Start difference. First operand 59951 states and 215674 transitions. Second operand 7 states. [2019-12-19 02:09:37,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:37,169 INFO L93 Difference]: Finished difference Result 83687 states and 290099 transitions. [2019-12-19 02:09:37,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 02:09:37,169 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-19 02:09:37,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:37,387 INFO L225 Difference]: With dead ends: 83687 [2019-12-19 02:09:37,387 INFO L226 Difference]: Without dead ends: 83687 [2019-12-19 02:09:37,388 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-19 02:09:37,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83687 states. [2019-12-19 02:09:38,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83687 to 71014. [2019-12-19 02:09:38,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71014 states. [2019-12-19 02:09:39,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71014 states to 71014 states and 249888 transitions. [2019-12-19 02:09:39,092 INFO L78 Accepts]: Start accepts. Automaton has 71014 states and 249888 transitions. Word has length 55 [2019-12-19 02:09:39,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:39,092 INFO L462 AbstractCegarLoop]: Abstraction has 71014 states and 249888 transitions. [2019-12-19 02:09:39,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:09:39,093 INFO L276 IsEmpty]: Start isEmpty. Operand 71014 states and 249888 transitions. [2019-12-19 02:09:39,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 02:09:39,105 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:39,105 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-19 02:09:39,105 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:39,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:39,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1973740834, now seen corresponding path program 1 times [2019-12-19 02:09:39,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:39,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910905131] [2019-12-19 02:09:39,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:39,181 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-19 02:09:39,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910905131] [2019-12-19 02:09:39,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:39,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:09:39,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660481528] [2019-12-19 02:09:39,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:09:39,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:39,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:09:39,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:09:39,185 INFO L87 Difference]: Start difference. First operand 71014 states and 249888 transitions. Second operand 4 states. [2019-12-19 02:09:39,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:39,258 INFO L93 Difference]: Finished difference Result 12161 states and 37831 transitions. [2019-12-19 02:09:39,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:09:39,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-19 02:09:39,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:39,287 INFO L225 Difference]: With dead ends: 12161 [2019-12-19 02:09:39,288 INFO L226 Difference]: Without dead ends: 10676 [2019-12-19 02:09:39,288 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-19 02:09:39,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10676 states. [2019-12-19 02:09:39,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10676 to 10627. [2019-12-19 02:09:39,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10627 states. [2019-12-19 02:09:39,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10627 states to 10627 states and 32593 transitions. [2019-12-19 02:09:39,883 INFO L78 Accepts]: Start accepts. Automaton has 10627 states and 32593 transitions. Word has length 55 [2019-12-19 02:09:39,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:39,884 INFO L462 AbstractCegarLoop]: Abstraction has 10627 states and 32593 transitions. [2019-12-19 02:09:39,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:09:39,884 INFO L276 IsEmpty]: Start isEmpty. Operand 10627 states and 32593 transitions. [2019-12-19 02:09:39,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 02:09:39,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:39,886 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-19 02:09:39,886 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:39,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:39,886 INFO L82 PathProgramCache]: Analyzing trace with hash -984017040, now seen corresponding path program 1 times [2019-12-19 02:09:39,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:39,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82663030] [2019-12-19 02:09:39,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:39,945 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-19 02:09:39,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82663030] [2019-12-19 02:09:39,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:39,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:09:39,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303970390] [2019-12-19 02:09:39,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:09:39,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:39,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:09:39,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:39,947 INFO L87 Difference]: Start difference. First operand 10627 states and 32593 transitions. Second operand 6 states. [2019-12-19 02:09:40,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:40,384 INFO L93 Difference]: Finished difference Result 13184 states and 39874 transitions. [2019-12-19 02:09:40,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 02:09:40,385 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-19 02:09:40,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:40,403 INFO L225 Difference]: With dead ends: 13184 [2019-12-19 02:09:40,403 INFO L226 Difference]: Without dead ends: 13121 [2019-12-19 02:09:40,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-19 02:09:40,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13121 states. [2019-12-19 02:09:40,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13121 to 11050. [2019-12-19 02:09:40,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11050 states. [2019-12-19 02:09:40,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11050 states to 11050 states and 33787 transitions. [2019-12-19 02:09:40,561 INFO L78 Accepts]: Start accepts. Automaton has 11050 states and 33787 transitions. Word has length 55 [2019-12-19 02:09:40,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:40,562 INFO L462 AbstractCegarLoop]: Abstraction has 11050 states and 33787 transitions. [2019-12-19 02:09:40,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:09:40,562 INFO L276 IsEmpty]: Start isEmpty. Operand 11050 states and 33787 transitions. [2019-12-19 02:09:40,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-19 02:09:40,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:40,565 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-19 02:09:40,565 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:40,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:40,566 INFO L82 PathProgramCache]: Analyzing trace with hash 721551436, now seen corresponding path program 1 times [2019-12-19 02:09:40,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:40,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517109237] [2019-12-19 02:09:40,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:40,620 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-19 02:09:40,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517109237] [2019-12-19 02:09:40,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:40,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:09:40,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165939440] [2019-12-19 02:09:40,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:09:40,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:40,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:09:40,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:09:40,623 INFO L87 Difference]: Start difference. First operand 11050 states and 33787 transitions. Second operand 4 states. [2019-12-19 02:09:40,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:40,769 INFO L93 Difference]: Finished difference Result 12864 states and 39393 transitions. [2019-12-19 02:09:40,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:09:40,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-19 02:09:40,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:40,797 INFO L225 Difference]: With dead ends: 12864 [2019-12-19 02:09:40,797 INFO L226 Difference]: Without dead ends: 12864 [2019-12-19 02:09:40,798 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-19 02:09:40,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12864 states. [2019-12-19 02:09:41,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12864 to 11695. [2019-12-19 02:09:41,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11695 states. [2019-12-19 02:09:41,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11695 states to 11695 states and 35764 transitions. [2019-12-19 02:09:41,059 INFO L78 Accepts]: Start accepts. Automaton has 11695 states and 35764 transitions. Word has length 63 [2019-12-19 02:09:41,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:41,059 INFO L462 AbstractCegarLoop]: Abstraction has 11695 states and 35764 transitions. [2019-12-19 02:09:41,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:09:41,060 INFO L276 IsEmpty]: Start isEmpty. Operand 11695 states and 35764 transitions. [2019-12-19 02:09:41,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-19 02:09:41,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:41,064 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-19 02:09:41,065 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:41,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:41,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1830605525, now seen corresponding path program 1 times [2019-12-19 02:09:41,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:41,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686022451] [2019-12-19 02:09:41,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:41,155 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-19 02:09:41,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686022451] [2019-12-19 02:09:41,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:41,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:09:41,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341416615] [2019-12-19 02:09:41,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:09:41,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:41,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:09:41,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:41,157 INFO L87 Difference]: Start difference. First operand 11695 states and 35764 transitions. Second operand 6 states. [2019-12-19 02:09:41,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:41,587 INFO L93 Difference]: Finished difference Result 14221 states and 42862 transitions. [2019-12-19 02:09:41,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 02:09:41,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-12-19 02:09:41,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:41,608 INFO L225 Difference]: With dead ends: 14221 [2019-12-19 02:09:41,608 INFO L226 Difference]: Without dead ends: 14160 [2019-12-19 02:09:41,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 02:09:41,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14160 states. [2019-12-19 02:09:41,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14160 to 13463. [2019-12-19 02:09:41,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13463 states. [2019-12-19 02:09:41,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13463 states to 13463 states and 40781 transitions. [2019-12-19 02:09:41,848 INFO L78 Accepts]: Start accepts. Automaton has 13463 states and 40781 transitions. Word has length 63 [2019-12-19 02:09:41,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:41,849 INFO L462 AbstractCegarLoop]: Abstraction has 13463 states and 40781 transitions. [2019-12-19 02:09:41,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:09:41,849 INFO L276 IsEmpty]: Start isEmpty. Operand 13463 states and 40781 transitions. [2019-12-19 02:09:41,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 02:09:41,856 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:41,857 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] [2019-12-19 02:09:41,857 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:41,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:41,857 INFO L82 PathProgramCache]: Analyzing trace with hash -827165457, now seen corresponding path program 1 times [2019-12-19 02:09:41,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:41,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46375448] [2019-12-19 02:09:41,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:42,046 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-12-19 02:09:42,051 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-19 02:09:42,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46375448] [2019-12-19 02:09:42,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:42,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:09:42,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569647740] [2019-12-19 02:09:42,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:09:42,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:42,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:09:42,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:09:42,054 INFO L87 Difference]: Start difference. First operand 13463 states and 40781 transitions. Second operand 3 states. [2019-12-19 02:09:42,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:42,285 INFO L93 Difference]: Finished difference Result 14051 states and 42317 transitions. [2019-12-19 02:09:42,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:09:42,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-19 02:09:42,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:42,305 INFO L225 Difference]: With dead ends: 14051 [2019-12-19 02:09:42,305 INFO L226 Difference]: Without dead ends: 14051 [2019-12-19 02:09:42,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:09:42,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14051 states. [2019-12-19 02:09:42,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14051 to 13757. [2019-12-19 02:09:42,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13757 states. [2019-12-19 02:09:42,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13757 states to 13757 states and 41549 transitions. [2019-12-19 02:09:42,528 INFO L78 Accepts]: Start accepts. Automaton has 13757 states and 41549 transitions. Word has length 67 [2019-12-19 02:09:42,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:42,528 INFO L462 AbstractCegarLoop]: Abstraction has 13757 states and 41549 transitions. [2019-12-19 02:09:42,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:09:42,528 INFO L276 IsEmpty]: Start isEmpty. Operand 13757 states and 41549 transitions. [2019-12-19 02:09:42,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 02:09:42,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:42,534 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] [2019-12-19 02:09:42,534 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:42,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:42,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1250043886, now seen corresponding path program 1 times [2019-12-19 02:09:42,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:42,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669171098] [2019-12-19 02:09:42,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:42,593 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-19 02:09:42,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669171098] [2019-12-19 02:09:42,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:42,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:09:42,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446016846] [2019-12-19 02:09:42,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:09:42,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:42,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:09:42,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:09:42,595 INFO L87 Difference]: Start difference. First operand 13757 states and 41549 transitions. Second operand 4 states. [2019-12-19 02:09:42,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:42,900 INFO L93 Difference]: Finished difference Result 16799 states and 50141 transitions. [2019-12-19 02:09:42,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:09:42,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-19 02:09:42,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:42,926 INFO L225 Difference]: With dead ends: 16799 [2019-12-19 02:09:42,926 INFO L226 Difference]: Without dead ends: 16799 [2019-12-19 02:09:42,926 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-19 02:09:42,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16799 states. [2019-12-19 02:09:43,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16799 to 15278. [2019-12-19 02:09:43,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15278 states. [2019-12-19 02:09:43,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15278 states to 15278 states and 45730 transitions. [2019-12-19 02:09:43,133 INFO L78 Accepts]: Start accepts. Automaton has 15278 states and 45730 transitions. Word has length 67 [2019-12-19 02:09:43,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:43,134 INFO L462 AbstractCegarLoop]: Abstraction has 15278 states and 45730 transitions. [2019-12-19 02:09:43,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:09:43,134 INFO L276 IsEmpty]: Start isEmpty. Operand 15278 states and 45730 transitions. [2019-12-19 02:09:43,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:09:43,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:43,142 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] [2019-12-19 02:09:43,142 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:43,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:43,143 INFO L82 PathProgramCache]: Analyzing trace with hash -750353405, now seen corresponding path program 1 times [2019-12-19 02:09:43,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:43,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045264864] [2019-12-19 02:09:43,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:43,262 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-19 02:09:43,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045264864] [2019-12-19 02:09:43,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:43,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:09:43,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958690007] [2019-12-19 02:09:43,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:09:43,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:43,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:09:43,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:43,264 INFO L87 Difference]: Start difference. First operand 15278 states and 45730 transitions. Second operand 6 states. [2019-12-19 02:09:43,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:43,878 INFO L93 Difference]: Finished difference Result 16275 states and 48105 transitions. [2019-12-19 02:09:43,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:09:43,879 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-19 02:09:43,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:43,901 INFO L225 Difference]: With dead ends: 16275 [2019-12-19 02:09:43,901 INFO L226 Difference]: Without dead ends: 16275 [2019-12-19 02:09:43,902 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-19 02:09:43,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16275 states. [2019-12-19 02:09:44,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16275 to 15851. [2019-12-19 02:09:44,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15851 states. [2019-12-19 02:09:44,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15851 states to 15851 states and 47027 transitions. [2019-12-19 02:09:44,100 INFO L78 Accepts]: Start accepts. Automaton has 15851 states and 47027 transitions. Word has length 69 [2019-12-19 02:09:44,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:44,100 INFO L462 AbstractCegarLoop]: Abstraction has 15851 states and 47027 transitions. [2019-12-19 02:09:44,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:09:44,100 INFO L276 IsEmpty]: Start isEmpty. Operand 15851 states and 47027 transitions. [2019-12-19 02:09:44,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:09:44,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:44,109 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] [2019-12-19 02:09:44,110 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:44,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:44,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1467404548, now seen corresponding path program 1 times [2019-12-19 02:09:44,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:44,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333973350] [2019-12-19 02:09:44,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:44,203 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-19 02:09:44,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333973350] [2019-12-19 02:09:44,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:44,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:09:44,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066112284] [2019-12-19 02:09:44,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:09:44,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:44,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:09:44,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:44,205 INFO L87 Difference]: Start difference. First operand 15851 states and 47027 transitions. Second operand 6 states. [2019-12-19 02:09:44,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:44,803 INFO L93 Difference]: Finished difference Result 18162 states and 52355 transitions. [2019-12-19 02:09:44,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 02:09:44,804 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-19 02:09:44,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:44,829 INFO L225 Difference]: With dead ends: 18162 [2019-12-19 02:09:44,829 INFO L226 Difference]: Without dead ends: 18162 [2019-12-19 02:09:44,829 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-19 02:09:44,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18162 states. [2019-12-19 02:09:45,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18162 to 16543. [2019-12-19 02:09:45,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16543 states. [2019-12-19 02:09:45,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16543 states to 16543 states and 48247 transitions. [2019-12-19 02:09:45,047 INFO L78 Accepts]: Start accepts. Automaton has 16543 states and 48247 transitions. Word has length 69 [2019-12-19 02:09:45,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:45,047 INFO L462 AbstractCegarLoop]: Abstraction has 16543 states and 48247 transitions. [2019-12-19 02:09:45,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:09:45,048 INFO L276 IsEmpty]: Start isEmpty. Operand 16543 states and 48247 transitions. [2019-12-19 02:09:45,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:09:45,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:45,058 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] [2019-12-19 02:09:45,058 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:45,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:45,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1678755461, now seen corresponding path program 1 times [2019-12-19 02:09:45,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:45,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103912604] [2019-12-19 02:09:45,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:45,129 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-19 02:09:45,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103912604] [2019-12-19 02:09:45,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:45,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:09:45,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707750636] [2019-12-19 02:09:45,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:09:45,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:45,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:09:45,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:45,131 INFO L87 Difference]: Start difference. First operand 16543 states and 48247 transitions. Second operand 5 states. [2019-12-19 02:09:45,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:45,536 INFO L93 Difference]: Finished difference Result 21457 states and 62487 transitions. [2019-12-19 02:09:45,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:09:45,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-19 02:09:45,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:45,566 INFO L225 Difference]: With dead ends: 21457 [2019-12-19 02:09:45,566 INFO L226 Difference]: Without dead ends: 21457 [2019-12-19 02:09:45,567 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-19 02:09:45,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21457 states. [2019-12-19 02:09:45,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21457 to 19522. [2019-12-19 02:09:45,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19522 states. [2019-12-19 02:09:45,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19522 states to 19522 states and 56656 transitions. [2019-12-19 02:09:45,829 INFO L78 Accepts]: Start accepts. Automaton has 19522 states and 56656 transitions. Word has length 69 [2019-12-19 02:09:45,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:45,829 INFO L462 AbstractCegarLoop]: Abstraction has 19522 states and 56656 transitions. [2019-12-19 02:09:45,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:09:45,830 INFO L276 IsEmpty]: Start isEmpty. Operand 19522 states and 56656 transitions. [2019-12-19 02:09:45,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:09:45,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:45,840 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] [2019-12-19 02:09:45,840 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:45,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:45,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1168221284, now seen corresponding path program 1 times [2019-12-19 02:09:45,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:45,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463013316] [2019-12-19 02:09:45,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:45,953 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-19 02:09:45,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463013316] [2019-12-19 02:09:45,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:45,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:09:45,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50263660] [2019-12-19 02:09:45,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:09:45,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:45,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:09:45,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:45,956 INFO L87 Difference]: Start difference. First operand 19522 states and 56656 transitions. Second operand 5 states. [2019-12-19 02:09:46,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:46,557 INFO L93 Difference]: Finished difference Result 26409 states and 76314 transitions. [2019-12-19 02:09:46,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:09:46,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-19 02:09:46,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:46,595 INFO L225 Difference]: With dead ends: 26409 [2019-12-19 02:09:46,595 INFO L226 Difference]: Without dead ends: 26409 [2019-12-19 02:09:46,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 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-19 02:09:46,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26409 states. [2019-12-19 02:09:47,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26409 to 21410. [2019-12-19 02:09:47,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21410 states. [2019-12-19 02:09:47,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21410 states to 21410 states and 61930 transitions. [2019-12-19 02:09:47,120 INFO L78 Accepts]: Start accepts. Automaton has 21410 states and 61930 transitions. Word has length 69 [2019-12-19 02:09:47,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:47,120 INFO L462 AbstractCegarLoop]: Abstraction has 21410 states and 61930 transitions. [2019-12-19 02:09:47,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:09:47,121 INFO L276 IsEmpty]: Start isEmpty. Operand 21410 states and 61930 transitions. [2019-12-19 02:09:47,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:09:47,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:47,132 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] [2019-12-19 02:09:47,132 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:47,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:47,132 INFO L82 PathProgramCache]: Analyzing trace with hash -639233179, now seen corresponding path program 1 times [2019-12-19 02:09:47,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:47,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10244512] [2019-12-19 02:09:47,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:47,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:47,187 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-19 02:09:47,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10244512] [2019-12-19 02:09:47,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:47,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:09:47,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863138539] [2019-12-19 02:09:47,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:09:47,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:47,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:09:47,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:09:47,190 INFO L87 Difference]: Start difference. First operand 21410 states and 61930 transitions. Second operand 4 states. [2019-12-19 02:09:47,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:47,871 INFO L93 Difference]: Finished difference Result 27971 states and 81352 transitions. [2019-12-19 02:09:47,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:09:47,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-19 02:09:47,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:47,913 INFO L225 Difference]: With dead ends: 27971 [2019-12-19 02:09:47,913 INFO L226 Difference]: Without dead ends: 27836 [2019-12-19 02:09:47,914 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-19 02:09:47,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27836 states. [2019-12-19 02:09:48,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27836 to 25847. [2019-12-19 02:09:48,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25847 states. [2019-12-19 02:09:48,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25847 states to 25847 states and 75190 transitions. [2019-12-19 02:09:48,277 INFO L78 Accepts]: Start accepts. Automaton has 25847 states and 75190 transitions. Word has length 69 [2019-12-19 02:09:48,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:48,277 INFO L462 AbstractCegarLoop]: Abstraction has 25847 states and 75190 transitions. [2019-12-19 02:09:48,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:09:48,277 INFO L276 IsEmpty]: Start isEmpty. Operand 25847 states and 75190 transitions. [2019-12-19 02:09:48,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:09:48,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:48,287 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] [2019-12-19 02:09:48,287 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:48,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:48,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1858782758, now seen corresponding path program 1 times [2019-12-19 02:09:48,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:48,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465137327] [2019-12-19 02:09:48,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:48,445 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-19 02:09:48,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465137327] [2019-12-19 02:09:48,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:48,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:09:48,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855388163] [2019-12-19 02:09:48,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:09:48,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:48,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:09:48,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:09:48,451 INFO L87 Difference]: Start difference. First operand 25847 states and 75190 transitions. Second operand 7 states. [2019-12-19 02:09:49,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:49,014 INFO L93 Difference]: Finished difference Result 23115 states and 64212 transitions. [2019-12-19 02:09:49,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 02:09:49,014 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-12-19 02:09:49,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:49,042 INFO L225 Difference]: With dead ends: 23115 [2019-12-19 02:09:49,042 INFO L226 Difference]: Without dead ends: 23115 [2019-12-19 02:09:49,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-12-19 02:09:49,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23115 states. [2019-12-19 02:09:49,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23115 to 18811. [2019-12-19 02:09:49,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18811 states. [2019-12-19 02:09:49,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18811 states to 18811 states and 52247 transitions. [2019-12-19 02:09:49,281 INFO L78 Accepts]: Start accepts. Automaton has 18811 states and 52247 transitions. Word has length 69 [2019-12-19 02:09:49,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:49,282 INFO L462 AbstractCegarLoop]: Abstraction has 18811 states and 52247 transitions. [2019-12-19 02:09:49,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:09:49,282 INFO L276 IsEmpty]: Start isEmpty. Operand 18811 states and 52247 transitions. [2019-12-19 02:09:49,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:09:49,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:49,289 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] [2019-12-19 02:09:49,290 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:49,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:49,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1548680857, now seen corresponding path program 1 times [2019-12-19 02:09:49,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:49,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287502991] [2019-12-19 02:09:49,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:49,365 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-19 02:09:49,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287502991] [2019-12-19 02:09:49,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:49,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:09:49,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367579119] [2019-12-19 02:09:49,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:09:49,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:49,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:09:49,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:49,367 INFO L87 Difference]: Start difference. First operand 18811 states and 52247 transitions. Second operand 5 states. [2019-12-19 02:09:49,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:49,427 INFO L93 Difference]: Finished difference Result 6133 states and 14464 transitions. [2019-12-19 02:09:49,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 02:09:49,428 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-19 02:09:49,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:49,435 INFO L225 Difference]: With dead ends: 6133 [2019-12-19 02:09:49,436 INFO L226 Difference]: Without dead ends: 5263 [2019-12-19 02:09:49,436 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-19 02:09:49,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5263 states. [2019-12-19 02:09:49,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5263 to 4728. [2019-12-19 02:09:49,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4728 states. [2019-12-19 02:09:49,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4728 states to 4728 states and 10823 transitions. [2019-12-19 02:09:49,508 INFO L78 Accepts]: Start accepts. Automaton has 4728 states and 10823 transitions. Word has length 69 [2019-12-19 02:09:49,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:49,508 INFO L462 AbstractCegarLoop]: Abstraction has 4728 states and 10823 transitions. [2019-12-19 02:09:49,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:09:49,509 INFO L276 IsEmpty]: Start isEmpty. Operand 4728 states and 10823 transitions. [2019-12-19 02:09:49,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:09:49,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:49,514 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] [2019-12-19 02:09:49,514 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:49,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:49,515 INFO L82 PathProgramCache]: Analyzing trace with hash -839136164, now seen corresponding path program 1 times [2019-12-19 02:09:49,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:49,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301494158] [2019-12-19 02:09:49,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:49,544 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-19 02:09:49,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301494158] [2019-12-19 02:09:49,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:49,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:09:49,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638243427] [2019-12-19 02:09:49,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:09:49,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:49,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:09:49,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:09:49,546 INFO L87 Difference]: Start difference. First operand 4728 states and 10823 transitions. Second operand 3 states. [2019-12-19 02:09:49,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:49,649 INFO L93 Difference]: Finished difference Result 5858 states and 13189 transitions. [2019-12-19 02:09:49,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:09:49,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-19 02:09:49,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:49,658 INFO L225 Difference]: With dead ends: 5858 [2019-12-19 02:09:49,658 INFO L226 Difference]: Without dead ends: 5858 [2019-12-19 02:09:49,659 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-19 02:09:49,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5858 states. [2019-12-19 02:09:49,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5858 to 4663. [2019-12-19 02:09:49,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4663 states. [2019-12-19 02:09:49,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4663 states to 4663 states and 10385 transitions. [2019-12-19 02:09:49,729 INFO L78 Accepts]: Start accepts. Automaton has 4663 states and 10385 transitions. Word has length 69 [2019-12-19 02:09:49,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:49,729 INFO L462 AbstractCegarLoop]: Abstraction has 4663 states and 10385 transitions. [2019-12-19 02:09:49,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:09:49,729 INFO L276 IsEmpty]: Start isEmpty. Operand 4663 states and 10385 transitions. [2019-12-19 02:09:49,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-19 02:09:49,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:49,735 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-19 02:09:49,735 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:49,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:49,735 INFO L82 PathProgramCache]: Analyzing trace with hash -537618065, now seen corresponding path program 1 times [2019-12-19 02:09:49,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:49,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095189162] [2019-12-19 02:09:49,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:49,800 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-19 02:09:49,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095189162] [2019-12-19 02:09:49,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:49,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:09:49,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106111330] [2019-12-19 02:09:49,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:09:49,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:49,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:09:49,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:49,803 INFO L87 Difference]: Start difference. First operand 4663 states and 10385 transitions. Second operand 5 states. [2019-12-19 02:09:49,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:49,968 INFO L93 Difference]: Finished difference Result 5724 states and 12814 transitions. [2019-12-19 02:09:49,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 02:09:49,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-12-19 02:09:49,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:49,976 INFO L225 Difference]: With dead ends: 5724 [2019-12-19 02:09:49,976 INFO L226 Difference]: Without dead ends: 5724 [2019-12-19 02:09:49,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-19 02:09:49,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5724 states. [2019-12-19 02:09:50,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5724 to 5083. [2019-12-19 02:09:50,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5083 states. [2019-12-19 02:09:50,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5083 states to 5083 states and 11343 transitions. [2019-12-19 02:09:50,032 INFO L78 Accepts]: Start accepts. Automaton has 5083 states and 11343 transitions. Word has length 75 [2019-12-19 02:09:50,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:50,032 INFO L462 AbstractCegarLoop]: Abstraction has 5083 states and 11343 transitions. [2019-12-19 02:09:50,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:09:50,032 INFO L276 IsEmpty]: Start isEmpty. Operand 5083 states and 11343 transitions. [2019-12-19 02:09:50,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-19 02:09:50,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:50,037 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-19 02:09:50,037 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:50,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:50,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1205192270, now seen corresponding path program 1 times [2019-12-19 02:09:50,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:50,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786123343] [2019-12-19 02:09:50,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:50,135 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-19 02:09:50,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786123343] [2019-12-19 02:09:50,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:50,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:09:50,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357897011] [2019-12-19 02:09:50,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:09:50,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:50,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:09:50,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:09:50,137 INFO L87 Difference]: Start difference. First operand 5083 states and 11343 transitions. Second operand 7 states. [2019-12-19 02:09:50,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:50,598 INFO L93 Difference]: Finished difference Result 5823 states and 12866 transitions. [2019-12-19 02:09:50,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 02:09:50,599 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-12-19 02:09:50,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:50,606 INFO L225 Difference]: With dead ends: 5823 [2019-12-19 02:09:50,606 INFO L226 Difference]: Without dead ends: 5770 [2019-12-19 02:09:50,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-19 02:09:50,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5770 states. [2019-12-19 02:09:50,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5770 to 5170. [2019-12-19 02:09:50,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5170 states. [2019-12-19 02:09:50,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5170 states to 5170 states and 11432 transitions. [2019-12-19 02:09:50,658 INFO L78 Accepts]: Start accepts. Automaton has 5170 states and 11432 transitions. Word has length 75 [2019-12-19 02:09:50,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:50,659 INFO L462 AbstractCegarLoop]: Abstraction has 5170 states and 11432 transitions. [2019-12-19 02:09:50,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:09:50,659 INFO L276 IsEmpty]: Start isEmpty. Operand 5170 states and 11432 transitions. [2019-12-19 02:09:50,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 02:09:50,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:50,664 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, 1, 1] [2019-12-19 02:09:50,664 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:50,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:50,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1470478578, now seen corresponding path program 1 times [2019-12-19 02:09:50,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:50,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731459366] [2019-12-19 02:09:50,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:50,730 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-19 02:09:50,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731459366] [2019-12-19 02:09:50,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:50,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:09:50,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639644817] [2019-12-19 02:09:50,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:09:50,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:50,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:09:50,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:50,732 INFO L87 Difference]: Start difference. First operand 5170 states and 11432 transitions. Second operand 5 states. [2019-12-19 02:09:51,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:51,077 INFO L93 Difference]: Finished difference Result 6012 states and 13224 transitions. [2019-12-19 02:09:51,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:09:51,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-19 02:09:51,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:51,085 INFO L225 Difference]: With dead ends: 6012 [2019-12-19 02:09:51,086 INFO L226 Difference]: Without dead ends: 6012 [2019-12-19 02:09:51,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-19 02:09:51,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2019-12-19 02:09:51,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 5315. [2019-12-19 02:09:51,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5315 states. [2019-12-19 02:09:51,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5315 states to 5315 states and 11747 transitions. [2019-12-19 02:09:51,139 INFO L78 Accepts]: Start accepts. Automaton has 5315 states and 11747 transitions. Word has length 96 [2019-12-19 02:09:51,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:51,139 INFO L462 AbstractCegarLoop]: Abstraction has 5315 states and 11747 transitions. [2019-12-19 02:09:51,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:09:51,139 INFO L276 IsEmpty]: Start isEmpty. Operand 5315 states and 11747 transitions. [2019-12-19 02:09:51,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 02:09:51,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:51,145 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:09:51,146 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:51,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:51,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1713375192, now seen corresponding path program 2 times [2019-12-19 02:09:51,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:51,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668510961] [2019-12-19 02:09:51,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:51,215 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-19 02:09:51,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668510961] [2019-12-19 02:09:51,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:51,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:09:51,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570504882] [2019-12-19 02:09:51,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:09:51,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:51,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:09:51,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:09:51,217 INFO L87 Difference]: Start difference. First operand 5315 states and 11747 transitions. Second operand 4 states. [2019-12-19 02:09:51,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:51,328 INFO L93 Difference]: Finished difference Result 6278 states and 13796 transitions. [2019-12-19 02:09:51,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:09:51,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-19 02:09:51,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:51,336 INFO L225 Difference]: With dead ends: 6278 [2019-12-19 02:09:51,336 INFO L226 Difference]: Without dead ends: 6278 [2019-12-19 02:09:51,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:51,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6278 states. [2019-12-19 02:09:51,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6278 to 5509. [2019-12-19 02:09:51,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5509 states. [2019-12-19 02:09:51,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5509 states to 5509 states and 12153 transitions. [2019-12-19 02:09:51,411 INFO L78 Accepts]: Start accepts. Automaton has 5509 states and 12153 transitions. Word has length 96 [2019-12-19 02:09:51,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:51,411 INFO L462 AbstractCegarLoop]: Abstraction has 5509 states and 12153 transitions. [2019-12-19 02:09:51,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:09:51,411 INFO L276 IsEmpty]: Start isEmpty. Operand 5509 states and 12153 transitions. [2019-12-19 02:09:51,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:51,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:51,416 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, 1, 1, 1, 1] [2019-12-19 02:09:51,416 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:51,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:51,417 INFO L82 PathProgramCache]: Analyzing trace with hash -319220326, now seen corresponding path program 1 times [2019-12-19 02:09:51,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:51,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043136879] [2019-12-19 02:09:51,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:51,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:51,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043136879] [2019-12-19 02:09:51,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:51,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:09:51,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699183681] [2019-12-19 02:09:51,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:09:51,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:51,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:09:51,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:51,484 INFO L87 Difference]: Start difference. First operand 5509 states and 12153 transitions. Second operand 5 states. [2019-12-19 02:09:51,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:51,590 INFO L93 Difference]: Finished difference Result 5979 states and 13177 transitions. [2019-12-19 02:09:51,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:09:51,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-12-19 02:09:51,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:51,598 INFO L225 Difference]: With dead ends: 5979 [2019-12-19 02:09:51,598 INFO L226 Difference]: Without dead ends: 5979 [2019-12-19 02:09:51,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:09:51,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5979 states. [2019-12-19 02:09:51,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5979 to 4609. [2019-12-19 02:09:51,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4609 states. [2019-12-19 02:09:51,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4609 states to 4609 states and 10154 transitions. [2019-12-19 02:09:51,650 INFO L78 Accepts]: Start accepts. Automaton has 4609 states and 10154 transitions. Word has length 98 [2019-12-19 02:09:51,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:51,650 INFO L462 AbstractCegarLoop]: Abstraction has 4609 states and 10154 transitions. [2019-12-19 02:09:51,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:09:51,650 INFO L276 IsEmpty]: Start isEmpty. Operand 4609 states and 10154 transitions. [2019-12-19 02:09:51,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:51,659 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:51,659 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, 1, 1, 1, 1] [2019-12-19 02:09:51,659 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:51,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:51,660 INFO L82 PathProgramCache]: Analyzing trace with hash -307904199, now seen corresponding path program 1 times [2019-12-19 02:09:51,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:51,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885500374] [2019-12-19 02:09:51,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:51,771 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-19 02:09:51,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885500374] [2019-12-19 02:09:51,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:51,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:09:51,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289161252] [2019-12-19 02:09:51,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:09:51,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:51,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:09:51,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:51,773 INFO L87 Difference]: Start difference. First operand 4609 states and 10154 transitions. Second operand 6 states. [2019-12-19 02:09:52,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:52,027 INFO L93 Difference]: Finished difference Result 5093 states and 11141 transitions. [2019-12-19 02:09:52,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 02:09:52,028 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-12-19 02:09:52,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:52,037 INFO L225 Difference]: With dead ends: 5093 [2019-12-19 02:09:52,037 INFO L226 Difference]: Without dead ends: 5093 [2019-12-19 02:09:52,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:52,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5093 states. [2019-12-19 02:09:52,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5093 to 4503. [2019-12-19 02:09:52,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4503 states. [2019-12-19 02:09:52,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4503 states to 4503 states and 9963 transitions. [2019-12-19 02:09:52,129 INFO L78 Accepts]: Start accepts. Automaton has 4503 states and 9963 transitions. Word has length 98 [2019-12-19 02:09:52,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:52,130 INFO L462 AbstractCegarLoop]: Abstraction has 4503 states and 9963 transitions. [2019-12-19 02:09:52,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:09:52,130 INFO L276 IsEmpty]: Start isEmpty. Operand 4503 states and 9963 transitions. [2019-12-19 02:09:52,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:52,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:52,139 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, 1, 1, 1, 1] [2019-12-19 02:09:52,140 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:52,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:52,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1153746234, now seen corresponding path program 1 times [2019-12-19 02:09:52,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:52,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216199382] [2019-12-19 02:09:52,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:52,223 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-19 02:09:52,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216199382] [2019-12-19 02:09:52,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:52,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:09:52,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667588699] [2019-12-19 02:09:52,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:09:52,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:52,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:09:52,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:09:52,225 INFO L87 Difference]: Start difference. First operand 4503 states and 9963 transitions. Second operand 4 states. [2019-12-19 02:09:52,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:52,555 INFO L93 Difference]: Finished difference Result 5718 states and 12590 transitions. [2019-12-19 02:09:52,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:09:52,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-19 02:09:52,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:52,563 INFO L225 Difference]: With dead ends: 5718 [2019-12-19 02:09:52,563 INFO L226 Difference]: Without dead ends: 5662 [2019-12-19 02:09:52,564 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-19 02:09:52,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5662 states. [2019-12-19 02:09:52,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5662 to 5357. [2019-12-19 02:09:52,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5357 states. [2019-12-19 02:09:52,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5357 states to 5357 states and 11821 transitions. [2019-12-19 02:09:52,649 INFO L78 Accepts]: Start accepts. Automaton has 5357 states and 11821 transitions. Word has length 98 [2019-12-19 02:09:52,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:52,650 INFO L462 AbstractCegarLoop]: Abstraction has 5357 states and 11821 transitions. [2019-12-19 02:09:52,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:09:52,650 INFO L276 IsEmpty]: Start isEmpty. Operand 5357 states and 11821 transitions. [2019-12-19 02:09:52,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:52,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:52,657 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, 1, 1, 1, 1] [2019-12-19 02:09:52,657 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:52,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:52,657 INFO L82 PathProgramCache]: Analyzing trace with hash -923463109, now seen corresponding path program 1 times [2019-12-19 02:09:52,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:52,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947912780] [2019-12-19 02:09:52,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:52,867 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-19 02:09:52,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947912780] [2019-12-19 02:09:52,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:52,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-19 02:09:52,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251481975] [2019-12-19 02:09:52,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-19 02:09:52,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:52,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-19 02:09:52,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-19 02:09:52,870 INFO L87 Difference]: Start difference. First operand 5357 states and 11821 transitions. Second operand 10 states. [2019-12-19 02:09:54,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:54,313 INFO L93 Difference]: Finished difference Result 7134 states and 15580 transitions. [2019-12-19 02:09:54,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-19 02:09:54,314 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 98 [2019-12-19 02:09:54,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:54,325 INFO L225 Difference]: With dead ends: 7134 [2019-12-19 02:09:54,325 INFO L226 Difference]: Without dead ends: 7094 [2019-12-19 02:09:54,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-12-19 02:09:54,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7094 states. [2019-12-19 02:09:54,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7094 to 5638. [2019-12-19 02:09:54,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5638 states. [2019-12-19 02:09:54,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5638 states to 5638 states and 12399 transitions. [2019-12-19 02:09:54,439 INFO L78 Accepts]: Start accepts. Automaton has 5638 states and 12399 transitions. Word has length 98 [2019-12-19 02:09:54,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:54,439 INFO L462 AbstractCegarLoop]: Abstraction has 5638 states and 12399 transitions. [2019-12-19 02:09:54,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-19 02:09:54,440 INFO L276 IsEmpty]: Start isEmpty. Operand 5638 states and 12399 transitions. [2019-12-19 02:09:54,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:54,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:54,450 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, 1, 1, 1, 1] [2019-12-19 02:09:54,450 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:54,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:54,450 INFO L82 PathProgramCache]: Analyzing trace with hash -35959428, now seen corresponding path program 1 times [2019-12-19 02:09:54,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:54,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2894032] [2019-12-19 02:09:54,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:54,601 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-19 02:09:54,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2894032] [2019-12-19 02:09:54,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:54,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:09:54,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178974298] [2019-12-19 02:09:54,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:09:54,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:54,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:09:54,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:09:54,604 INFO L87 Difference]: Start difference. First operand 5638 states and 12399 transitions. Second operand 7 states. [2019-12-19 02:09:54,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:54,814 INFO L93 Difference]: Finished difference Result 7047 states and 15390 transitions. [2019-12-19 02:09:54,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:09:54,815 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-12-19 02:09:54,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:54,827 INFO L225 Difference]: With dead ends: 7047 [2019-12-19 02:09:54,827 INFO L226 Difference]: Without dead ends: 7047 [2019-12-19 02:09:54,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-19 02:09:54,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7047 states. [2019-12-19 02:09:54,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7047 to 5506. [2019-12-19 02:09:54,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5506 states. [2019-12-19 02:09:54,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5506 states to 5506 states and 12070 transitions. [2019-12-19 02:09:54,941 INFO L78 Accepts]: Start accepts. Automaton has 5506 states and 12070 transitions. Word has length 98 [2019-12-19 02:09:54,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:54,941 INFO L462 AbstractCegarLoop]: Abstraction has 5506 states and 12070 transitions. [2019-12-19 02:09:54,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:09:54,942 INFO L276 IsEmpty]: Start isEmpty. Operand 5506 states and 12070 transitions. [2019-12-19 02:09:54,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:54,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:54,952 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, 1, 1, 1, 1] [2019-12-19 02:09:54,952 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:54,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:54,952 INFO L82 PathProgramCache]: Analyzing trace with hash -712112196, now seen corresponding path program 1 times [2019-12-19 02:09:54,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:54,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675828349] [2019-12-19 02:09:54,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:55,199 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-19 02:09:55,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675828349] [2019-12-19 02:09:55,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:55,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-19 02:09:55,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712037177] [2019-12-19 02:09:55,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-19 02:09:55,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:55,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-19 02:09:55,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-19 02:09:55,204 INFO L87 Difference]: Start difference. First operand 5506 states and 12070 transitions. Second operand 9 states. [2019-12-19 02:09:55,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:55,776 INFO L93 Difference]: Finished difference Result 6020 states and 13096 transitions. [2019-12-19 02:09:55,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-19 02:09:55,776 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-12-19 02:09:55,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:55,785 INFO L225 Difference]: With dead ends: 6020 [2019-12-19 02:09:55,785 INFO L226 Difference]: Without dead ends: 6020 [2019-12-19 02:09:55,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-12-19 02:09:55,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2019-12-19 02:09:55,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 5525. [2019-12-19 02:09:55,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5525 states. [2019-12-19 02:09:55,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5525 states to 5525 states and 12061 transitions. [2019-12-19 02:09:55,868 INFO L78 Accepts]: Start accepts. Automaton has 5525 states and 12061 transitions. Word has length 98 [2019-12-19 02:09:55,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:55,868 INFO L462 AbstractCegarLoop]: Abstraction has 5525 states and 12061 transitions. [2019-12-19 02:09:55,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-19 02:09:55,868 INFO L276 IsEmpty]: Start isEmpty. Operand 5525 states and 12061 transitions. [2019-12-19 02:09:55,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:55,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:55,875 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, 1, 1, 1, 1] [2019-12-19 02:09:55,875 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:55,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:55,876 INFO L82 PathProgramCache]: Analyzing trace with hash 175391485, now seen corresponding path program 1 times [2019-12-19 02:09:55,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:55,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228718449] [2019-12-19 02:09:55,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:56,056 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-19 02:09:56,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228718449] [2019-12-19 02:09:56,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:56,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-19 02:09:56,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096283069] [2019-12-19 02:09:56,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-19 02:09:56,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:56,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-19 02:09:56,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-19 02:09:56,058 INFO L87 Difference]: Start difference. First operand 5525 states and 12061 transitions. Second operand 10 states. [2019-12-19 02:09:56,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:56,730 INFO L93 Difference]: Finished difference Result 17370 states and 38511 transitions. [2019-12-19 02:09:56,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-19 02:09:56,730 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 98 [2019-12-19 02:09:56,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:56,751 INFO L225 Difference]: With dead ends: 17370 [2019-12-19 02:09:56,752 INFO L226 Difference]: Without dead ends: 11452 [2019-12-19 02:09:56,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-19 02:09:56,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11452 states. [2019-12-19 02:09:56,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11452 to 5499. [2019-12-19 02:09:56,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5499 states. [2019-12-19 02:09:56,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5499 states to 5499 states and 11933 transitions. [2019-12-19 02:09:56,915 INFO L78 Accepts]: Start accepts. Automaton has 5499 states and 11933 transitions. Word has length 98 [2019-12-19 02:09:56,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:56,915 INFO L462 AbstractCegarLoop]: Abstraction has 5499 states and 11933 transitions. [2019-12-19 02:09:56,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-19 02:09:56,915 INFO L276 IsEmpty]: Start isEmpty. Operand 5499 states and 11933 transitions. [2019-12-19 02:09:56,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:56,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:56,926 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, 1, 1, 1, 1] [2019-12-19 02:09:56,926 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:56,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:56,927 INFO L82 PathProgramCache]: Analyzing trace with hash 2023703492, now seen corresponding path program 1 times [2019-12-19 02:09:56,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:56,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12394721] [2019-12-19 02:09:56,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:57,059 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-19 02:09:57,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12394721] [2019-12-19 02:09:57,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:57,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:09:57,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295812918] [2019-12-19 02:09:57,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:09:57,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:57,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:09:57,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:57,062 INFO L87 Difference]: Start difference. First operand 5499 states and 11933 transitions. Second operand 5 states. [2019-12-19 02:09:57,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:57,344 INFO L93 Difference]: Finished difference Result 4884 states and 10543 transitions. [2019-12-19 02:09:57,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 02:09:57,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-12-19 02:09:57,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:57,350 INFO L225 Difference]: With dead ends: 4884 [2019-12-19 02:09:57,351 INFO L226 Difference]: Without dead ends: 4884 [2019-12-19 02:09:57,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:57,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4884 states. [2019-12-19 02:09:57,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4884 to 4536. [2019-12-19 02:09:57,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4536 states. [2019-12-19 02:09:57,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4536 states to 4536 states and 9835 transitions. [2019-12-19 02:09:57,390 INFO L78 Accepts]: Start accepts. Automaton has 4536 states and 9835 transitions. Word has length 98 [2019-12-19 02:09:57,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:57,390 INFO L462 AbstractCegarLoop]: Abstraction has 4536 states and 9835 transitions. [2019-12-19 02:09:57,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:09:57,391 INFO L276 IsEmpty]: Start isEmpty. Operand 4536 states and 9835 transitions. [2019-12-19 02:09:57,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:57,394 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:57,394 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, 1, 1, 1, 1] [2019-12-19 02:09:57,394 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:57,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:57,395 INFO L82 PathProgramCache]: Analyzing trace with hash -919272570, now seen corresponding path program 1 times [2019-12-19 02:09:57,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:57,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628371098] [2019-12-19 02:09:57,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:57,521 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-19 02:09:57,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628371098] [2019-12-19 02:09:57,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:57,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:09:57,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400582128] [2019-12-19 02:09:57,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:09:57,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:57,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:09:57,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:57,523 INFO L87 Difference]: Start difference. First operand 4536 states and 9835 transitions. Second operand 6 states. [2019-12-19 02:09:57,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:57,739 INFO L93 Difference]: Finished difference Result 5183 states and 11144 transitions. [2019-12-19 02:09:57,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:09:57,739 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-12-19 02:09:57,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:57,746 INFO L225 Difference]: With dead ends: 5183 [2019-12-19 02:09:57,746 INFO L226 Difference]: Without dead ends: 5135 [2019-12-19 02:09:57,746 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-19 02:09:57,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5135 states. [2019-12-19 02:09:57,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5135 to 4539. [2019-12-19 02:09:57,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4539 states. [2019-12-19 02:09:57,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4539 states to 4539 states and 9771 transitions. [2019-12-19 02:09:57,791 INFO L78 Accepts]: Start accepts. Automaton has 4539 states and 9771 transitions. Word has length 98 [2019-12-19 02:09:57,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:57,792 INFO L462 AbstractCegarLoop]: Abstraction has 4539 states and 9771 transitions. [2019-12-19 02:09:57,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:09:57,792 INFO L276 IsEmpty]: Start isEmpty. Operand 4539 states and 9771 transitions. [2019-12-19 02:09:57,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:57,796 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:57,796 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, 1, 1, 1, 1] [2019-12-19 02:09:57,796 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:57,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:57,796 INFO L82 PathProgramCache]: Analyzing trace with hash -750459706, now seen corresponding path program 2 times [2019-12-19 02:09:57,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:57,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038395866] [2019-12-19 02:09:57,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:57,882 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-19 02:09:57,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038395866] [2019-12-19 02:09:57,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:57,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:09:57,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359864002] [2019-12-19 02:09:57,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:09:57,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:57,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:09:57,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:57,885 INFO L87 Difference]: Start difference. First operand 4539 states and 9771 transitions. Second operand 6 states. [2019-12-19 02:09:58,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:58,078 INFO L93 Difference]: Finished difference Result 4692 states and 10081 transitions. [2019-12-19 02:09:58,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:09:58,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-12-19 02:09:58,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:58,084 INFO L225 Difference]: With dead ends: 4692 [2019-12-19 02:09:58,084 INFO L226 Difference]: Without dead ends: 4692 [2019-12-19 02:09:58,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:09:58,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4692 states. [2019-12-19 02:09:58,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4692 to 4497. [2019-12-19 02:09:58,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4497 states. [2019-12-19 02:09:58,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4497 states to 4497 states and 9679 transitions. [2019-12-19 02:09:58,133 INFO L78 Accepts]: Start accepts. Automaton has 4497 states and 9679 transitions. Word has length 98 [2019-12-19 02:09:58,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:58,134 INFO L462 AbstractCegarLoop]: Abstraction has 4497 states and 9679 transitions. [2019-12-19 02:09:58,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:09:58,134 INFO L276 IsEmpty]: Start isEmpty. Operand 4497 states and 9679 transitions. [2019-12-19 02:09:58,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:58,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:58,139 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, 1, 1, 1, 1] [2019-12-19 02:09:58,139 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:58,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:58,140 INFO L82 PathProgramCache]: Analyzing trace with hash -589506809, now seen corresponding path program 2 times [2019-12-19 02:09:58,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:58,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342953669] [2019-12-19 02:09:58,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 02:09:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 02:09:58,229 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 02:09:58,229 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 02:09:58,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 02:09:58 BasicIcfg [2019-12-19 02:09:58,466 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 02:09:58,467 INFO L168 Benchmark]: Toolchain (without parser) took 49216.03 ms. Allocated memory was 137.4 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 99.0 MB in the beginning and 653.1 MB in the end (delta: -554.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-19 02:09:58,468 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory is still 118.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-19 02:09:58,468 INFO L168 Benchmark]: CACSL2BoogieTranslator took 726.41 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 98.5 MB in the beginning and 154.9 MB in the end (delta: -56.3 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-19 02:09:58,468 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.44 ms. Allocated memory is still 201.3 MB. Free memory was 154.9 MB in the beginning and 152.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-19 02:09:58,469 INFO L168 Benchmark]: Boogie Preprocessor took 42.79 ms. Allocated memory is still 201.3 MB. Free memory was 152.9 MB in the beginning and 151.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-19 02:09:58,469 INFO L168 Benchmark]: RCFGBuilder took 772.50 ms. Allocated memory is still 201.3 MB. Free memory was 150.0 MB in the beginning and 106.0 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-19 02:09:58,470 INFO L168 Benchmark]: TraceAbstraction took 47606.45 ms. Allocated memory was 201.3 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 105.0 MB in the beginning and 653.1 MB in the end (delta: -548.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-19 02:09:58,472 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.21 ms. Allocated memory is still 137.4 MB. Free memory is still 118.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 726.41 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 98.5 MB in the beginning and 154.9 MB in the end (delta: -56.3 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.44 ms. Allocated memory is still 201.3 MB. Free memory was 154.9 MB in the beginning and 152.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.79 ms. Allocated memory is still 201.3 MB. Free memory was 152.9 MB in the beginning and 151.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 772.50 ms. Allocated memory is still 201.3 MB. Free memory was 150.0 MB in the beginning and 106.0 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 47606.45 ms. Allocated memory was 201.3 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 105.0 MB in the beginning and 653.1 MB in the end (delta: -548.1 MB). Peak memory consumption was 1.5 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: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L700] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L701] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L702] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L704] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L708] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L709] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L710] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L711] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L712] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L713] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L714] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L715] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L716] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L717] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L718] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L719] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L720] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L721] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L722] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L723] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L724] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 0 pthread_t t909; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L804] FCALL, FORK 0 pthread_create(&t909, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L805] 0 pthread_t t910; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L728] 1 z$w_buff1 = z$w_buff0 [L729] 1 z$w_buff0 = 1 [L730] 1 z$w_buff1_used = z$w_buff0_used [L731] 1 z$w_buff0_used = (_Bool)1 [L806] FCALL, FORK 0 pthread_create(&t910, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L775] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 z = z$flush_delayed ? z$mem_tmp : z [L778] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L745] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=1] [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=1, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=1] [L781] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L783] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L785] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L813] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L814] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L815] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L816] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L819] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 143 locations, 2 error locations. Result: UNSAFE, OverallTime: 47.1s, OverallIterations: 35, TraceHistogramMax: 1, AutomataDifference: 20.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9520 SDtfs, 10217 SDslu, 22081 SDs, 0 SdLazy, 8481 SolverSat, 491 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 347 GetRequests, 95 SyntacticMatches, 27 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71014occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 20.5s AutomataMinimizationTime, 34 MinimizatonAttempts, 76125 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2636 NumberOfCodeBlocks, 2636 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2504 ConstructedInterpolants, 0 QuantifiedInterpolants, 527135 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...