/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/rfi008_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 03:58:22,567 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 03:58:22,571 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 03:58:22,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 03:58:22,590 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 03:58:22,592 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 03:58:22,594 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 03:58:22,606 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 03:58:22,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 03:58:22,609 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 03:58:22,612 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 03:58:22,614 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 03:58:22,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 03:58:22,618 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 03:58:22,621 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 03:58:22,623 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 03:58:22,625 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 03:58:22,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 03:58:22,630 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 03:58:22,636 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 03:58:22,640 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 03:58:22,642 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 03:58:22,642 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 03:58:22,643 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 03:58:22,648 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 03:58:22,649 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 03:58:22,650 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 03:58:22,652 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 03:58:22,654 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 03:58:22,655 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 03:58:22,655 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 03:58:22,656 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 03:58:22,657 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 03:58:22,657 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 03:58:22,659 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 03:58:22,660 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 03:58:22,660 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 03:58:22,661 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 03:58:22,661 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 03:58:22,665 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 03:58:22,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 03:58:22,667 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 03:58:22,687 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 03:58:22,687 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 03:58:22,691 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 03:58:22,691 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 03:58:22,691 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 03:58:22,692 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 03:58:22,692 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 03:58:22,692 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 03:58:22,692 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 03:58:22,693 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 03:58:22,694 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 03:58:22,694 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 03:58:22,694 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 03:58:22,695 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 03:58:22,695 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 03:58:22,695 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 03:58:22,695 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 03:58:22,696 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 03:58:22,696 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 03:58:22,696 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 03:58:22,696 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 03:58:22,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 03:58:22,697 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 03:58:22,697 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 03:58:22,697 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 03:58:22,697 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 03:58:22,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 03:58:22,698 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 03:58:22,698 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 03:58:22,698 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 03:58:23,003 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 03:58:23,024 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 03:58:23,027 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 03:58:23,029 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 03:58:23,029 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 03:58:23,030 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi008_power.oepc.i [2019-12-19 03:58:23,093 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11551bcd3/4c6cfb429f55414693ca248e927a9d5b/FLAG19df6e8c7 [2019-12-19 03:58:23,699 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 03:58:23,700 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008_power.oepc.i [2019-12-19 03:58:23,714 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11551bcd3/4c6cfb429f55414693ca248e927a9d5b/FLAG19df6e8c7 [2019-12-19 03:58:24,016 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11551bcd3/4c6cfb429f55414693ca248e927a9d5b [2019-12-19 03:58:24,025 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 03:58:24,027 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 03:58:24,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 03:58:24,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 03:58:24,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 03:58:24,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:58:24" (1/1) ... [2019-12-19 03:58:24,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c36589b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:24, skipping insertion in model container [2019-12-19 03:58:24,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:58:24" (1/1) ... [2019-12-19 03:58:24,049 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 03:58:24,111 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 03:58:24,804 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 03:58:24,817 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 03:58:24,889 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 03:58:24,968 INFO L208 MainTranslator]: Completed translation [2019-12-19 03:58:24,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:24 WrapperNode [2019-12-19 03:58:24,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 03:58:24,970 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 03:58:24,970 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 03:58:24,970 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 03:58:24,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:24" (1/1) ... [2019-12-19 03:58:25,007 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:24" (1/1) ... [2019-12-19 03:58:25,052 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 03:58:25,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 03:58:25,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 03:58:25,053 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 03:58:25,064 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:24" (1/1) ... [2019-12-19 03:58:25,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:24" (1/1) ... [2019-12-19 03:58:25,069 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:24" (1/1) ... [2019-12-19 03:58:25,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:24" (1/1) ... [2019-12-19 03:58:25,081 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:24" (1/1) ... [2019-12-19 03:58:25,086 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:24" (1/1) ... [2019-12-19 03:58:25,090 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:24" (1/1) ... [2019-12-19 03:58:25,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 03:58:25,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 03:58:25,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 03:58:25,099 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 03:58:25,103 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:24" (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 03:58:25,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 03:58:25,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 03:58:25,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 03:58:25,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 03:58:25,191 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 03:58:25,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 03:58:25,192 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 03:58:25,194 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 03:58:25,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 03:58:25,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 03:58:25,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 03:58:25,197 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 03:58:26,264 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 03:58:26,264 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 03:58:26,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:58:26 BoogieIcfgContainer [2019-12-19 03:58:26,266 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 03:58:26,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 03:58:26,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 03:58:26,272 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 03:58:26,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 03:58:24" (1/3) ... [2019-12-19 03:58:26,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@304b14d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:58:26, skipping insertion in model container [2019-12-19 03:58:26,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:24" (2/3) ... [2019-12-19 03:58:26,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@304b14d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:58:26, skipping insertion in model container [2019-12-19 03:58:26,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:58:26" (3/3) ... [2019-12-19 03:58:26,295 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi008_power.oepc.i [2019-12-19 03:58:26,304 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 03:58:26,304 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 03:58:26,311 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 03:58:26,312 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 03:58:26,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,354 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,354 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,354 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,355 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,355 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,382 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,382 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,411 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,413 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,418 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,419 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,422 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:26,439 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 03:58:26,460 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 03:58:26,461 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 03:58:26,461 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 03:58:26,461 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 03:58:26,461 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 03:58:26,461 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 03:58:26,461 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 03:58:26,462 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 03:58:26,477 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 191 places, 246 transitions [2019-12-19 03:58:39,088 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 100969 states. [2019-12-19 03:58:39,090 INFO L276 IsEmpty]: Start isEmpty. Operand 100969 states. [2019-12-19 03:58:39,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-19 03:58:39,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:58:39,098 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 03:58:39,098 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:58:39,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:58:39,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1761614935, now seen corresponding path program 1 times [2019-12-19 03:58:39,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:58:39,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989041904] [2019-12-19 03:58:39,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:58:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:58:39,400 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 03:58:39,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989041904] [2019-12-19 03:58:39,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:58:39,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:58:39,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278867231] [2019-12-19 03:58:39,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:58:39,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:58:39,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:58:39,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:58:39,426 INFO L87 Difference]: Start difference. First operand 100969 states. Second operand 4 states. [2019-12-19 03:58:42,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:58:42,713 INFO L93 Difference]: Finished difference Result 101969 states and 411474 transitions. [2019-12-19 03:58:42,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 03:58:42,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-19 03:58:42,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:58:43,378 INFO L225 Difference]: With dead ends: 101969 [2019-12-19 03:58:43,378 INFO L226 Difference]: Without dead ends: 74593 [2019-12-19 03:58:43,384 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 03:58:45,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74593 states. [2019-12-19 03:58:47,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74593 to 74593. [2019-12-19 03:58:47,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74593 states. [2019-12-19 03:58:47,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74593 states to 74593 states and 304546 transitions. [2019-12-19 03:58:47,675 INFO L78 Accepts]: Start accepts. Automaton has 74593 states and 304546 transitions. Word has length 36 [2019-12-19 03:58:47,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:58:47,676 INFO L462 AbstractCegarLoop]: Abstraction has 74593 states and 304546 transitions. [2019-12-19 03:58:47,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:58:47,676 INFO L276 IsEmpty]: Start isEmpty. Operand 74593 states and 304546 transitions. [2019-12-19 03:58:47,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-19 03:58:47,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:58:47,691 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 03:58:47,693 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:58:47,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:58:47,693 INFO L82 PathProgramCache]: Analyzing trace with hash -776334369, now seen corresponding path program 1 times [2019-12-19 03:58:47,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:58:47,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758790487] [2019-12-19 03:58:47,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:58:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:58:47,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:58:47,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758790487] [2019-12-19 03:58:47,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:58:47,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:58:47,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577120492] [2019-12-19 03:58:47,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:58:47,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:58:47,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:58:47,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:58:47,830 INFO L87 Difference]: Start difference. First operand 74593 states and 304546 transitions. Second operand 5 states. [2019-12-19 03:58:51,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:58:51,636 INFO L93 Difference]: Finished difference Result 121639 states and 464551 transitions. [2019-12-19 03:58:51,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:58:51,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-19 03:58:51,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:58:52,060 INFO L225 Difference]: With dead ends: 121639 [2019-12-19 03:58:52,060 INFO L226 Difference]: Without dead ends: 121103 [2019-12-19 03:58:52,061 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 03:58:54,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121103 states. [2019-12-19 03:58:56,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121103 to 119213. [2019-12-19 03:58:56,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119213 states. [2019-12-19 03:58:57,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119213 states to 119213 states and 456891 transitions. [2019-12-19 03:58:57,208 INFO L78 Accepts]: Start accepts. Automaton has 119213 states and 456891 transitions. Word has length 48 [2019-12-19 03:58:57,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:58:57,210 INFO L462 AbstractCegarLoop]: Abstraction has 119213 states and 456891 transitions. [2019-12-19 03:58:57,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:58:57,210 INFO L276 IsEmpty]: Start isEmpty. Operand 119213 states and 456891 transitions. [2019-12-19 03:58:57,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-19 03:58:57,216 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:58:57,216 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 03:58:57,216 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:58:57,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:58:57,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1542620855, now seen corresponding path program 1 times [2019-12-19 03:58:57,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:58:57,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236388245] [2019-12-19 03:58:57,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:58:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:58:57,346 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 03:58:57,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236388245] [2019-12-19 03:58:57,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:58:57,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:58:57,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101160840] [2019-12-19 03:58:57,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:58:57,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:58:57,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:58:57,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:58:57,350 INFO L87 Difference]: Start difference. First operand 119213 states and 456891 transitions. Second operand 5 states. [2019-12-19 03:59:02,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:59:02,496 INFO L93 Difference]: Finished difference Result 149065 states and 560747 transitions. [2019-12-19 03:59:02,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:59:02,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-19 03:59:02,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:59:02,894 INFO L225 Difference]: With dead ends: 149065 [2019-12-19 03:59:02,894 INFO L226 Difference]: Without dead ends: 148561 [2019-12-19 03:59:02,895 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 03:59:05,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148561 states. [2019-12-19 03:59:06,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148561 to 131878. [2019-12-19 03:59:06,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131878 states. [2019-12-19 03:59:08,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131878 states to 131878 states and 501408 transitions. [2019-12-19 03:59:08,168 INFO L78 Accepts]: Start accepts. Automaton has 131878 states and 501408 transitions. Word has length 49 [2019-12-19 03:59:08,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:59:08,169 INFO L462 AbstractCegarLoop]: Abstraction has 131878 states and 501408 transitions. [2019-12-19 03:59:08,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:59:08,169 INFO L276 IsEmpty]: Start isEmpty. Operand 131878 states and 501408 transitions. [2019-12-19 03:59:08,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-19 03:59:08,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:59:08,182 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 03:59:08,182 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:59:08,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:59:08,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1726220477, now seen corresponding path program 1 times [2019-12-19 03:59:08,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:59:08,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877265430] [2019-12-19 03:59:08,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:59:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:59:08,246 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 03:59:08,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877265430] [2019-12-19 03:59:08,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:59:08,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:59:08,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207557572] [2019-12-19 03:59:08,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:59:08,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:59:08,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:59:08,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:59:08,249 INFO L87 Difference]: Start difference. First operand 131878 states and 501408 transitions. Second operand 3 states. [2019-12-19 03:59:09,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:59:09,349 INFO L93 Difference]: Finished difference Result 226103 states and 838073 transitions. [2019-12-19 03:59:09,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:59:09,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-19 03:59:09,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:59:09,945 INFO L225 Difference]: With dead ends: 226103 [2019-12-19 03:59:09,946 INFO L226 Difference]: Without dead ends: 226103 [2019-12-19 03:59:09,946 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 03:59:18,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226103 states. [2019-12-19 03:59:21,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226103 to 201720. [2019-12-19 03:59:21,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201720 states. [2019-12-19 03:59:21,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201720 states to 201720 states and 750697 transitions. [2019-12-19 03:59:23,044 INFO L78 Accepts]: Start accepts. Automaton has 201720 states and 750697 transitions. Word has length 51 [2019-12-19 03:59:23,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:59:23,045 INFO L462 AbstractCegarLoop]: Abstraction has 201720 states and 750697 transitions. [2019-12-19 03:59:23,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:59:23,045 INFO L276 IsEmpty]: Start isEmpty. Operand 201720 states and 750697 transitions. [2019-12-19 03:59:23,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 03:59:23,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:59:23,071 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 03:59:23,071 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:59:23,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:59:23,072 INFO L82 PathProgramCache]: Analyzing trace with hash -2125163740, now seen corresponding path program 1 times [2019-12-19 03:59:23,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:59:23,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84875541] [2019-12-19 03:59:23,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:59:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:59:23,231 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 03:59:23,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84875541] [2019-12-19 03:59:23,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:59:23,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:59:23,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818808152] [2019-12-19 03:59:23,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:59:23,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:59:23,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:59:23,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:59:23,234 INFO L87 Difference]: Start difference. First operand 201720 states and 750697 transitions. Second operand 6 states. [2019-12-19 03:59:25,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:59:25,164 INFO L93 Difference]: Finished difference Result 257719 states and 956292 transitions. [2019-12-19 03:59:25,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:59:25,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-19 03:59:25,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:59:33,350 INFO L225 Difference]: With dead ends: 257719 [2019-12-19 03:59:33,350 INFO L226 Difference]: Without dead ends: 257719 [2019-12-19 03:59:33,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:59:36,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257719 states. [2019-12-19 03:59:40,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257719 to 241036. [2019-12-19 03:59:40,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241036 states. [2019-12-19 03:59:40,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241036 states to 241036 states and 894179 transitions. [2019-12-19 03:59:40,880 INFO L78 Accepts]: Start accepts. Automaton has 241036 states and 894179 transitions. Word has length 55 [2019-12-19 03:59:40,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:59:40,880 INFO L462 AbstractCegarLoop]: Abstraction has 241036 states and 894179 transitions. [2019-12-19 03:59:40,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:59:40,880 INFO L276 IsEmpty]: Start isEmpty. Operand 241036 states and 894179 transitions. [2019-12-19 03:59:40,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 03:59:40,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:59:40,902 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 03:59:40,903 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:59:40,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:59:40,903 INFO L82 PathProgramCache]: Analyzing trace with hash 372852197, now seen corresponding path program 1 times [2019-12-19 03:59:40,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:59:40,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105846062] [2019-12-19 03:59:40,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:59:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:59:41,053 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 03:59:41,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105846062] [2019-12-19 03:59:41,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:59:41,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:59:41,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415710706] [2019-12-19 03:59:41,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:59:41,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:59:41,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:59:41,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:59:41,056 INFO L87 Difference]: Start difference. First operand 241036 states and 894179 transitions. Second operand 7 states. [2019-12-19 03:59:45,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:59:45,249 INFO L93 Difference]: Finished difference Result 334522 states and 1202846 transitions. [2019-12-19 03:59:45,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 03:59:45,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-19 03:59:45,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:59:54,906 INFO L225 Difference]: With dead ends: 334522 [2019-12-19 03:59:54,906 INFO L226 Difference]: Without dead ends: 334522 [2019-12-19 03:59:54,907 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 03:59:58,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334522 states. [2019-12-19 04:00:02,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334522 to 278543. [2019-12-19 04:00:02,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278543 states. [2019-12-19 04:00:12,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278543 states to 278543 states and 1017057 transitions. [2019-12-19 04:00:12,661 INFO L78 Accepts]: Start accepts. Automaton has 278543 states and 1017057 transitions. Word has length 55 [2019-12-19 04:00:12,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:12,661 INFO L462 AbstractCegarLoop]: Abstraction has 278543 states and 1017057 transitions. [2019-12-19 04:00:12,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:00:12,662 INFO L276 IsEmpty]: Start isEmpty. Operand 278543 states and 1017057 transitions. [2019-12-19 04:00:12,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 04:00:12,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:12,684 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 04:00:12,684 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:12,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:12,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1260355878, now seen corresponding path program 1 times [2019-12-19 04:00:12,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:12,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668193909] [2019-12-19 04:00:12,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:12,757 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 04:00:12,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668193909] [2019-12-19 04:00:12,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:12,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:00:12,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282247348] [2019-12-19 04:00:12,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:00:12,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:12,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:00:12,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:00:12,759 INFO L87 Difference]: Start difference. First operand 278543 states and 1017057 transitions. Second operand 4 states. [2019-12-19 04:00:12,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:12,924 INFO L93 Difference]: Finished difference Result 34538 states and 108800 transitions. [2019-12-19 04:00:12,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:00:12,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-19 04:00:12,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:12,966 INFO L225 Difference]: With dead ends: 34538 [2019-12-19 04:00:12,966 INFO L226 Difference]: Without dead ends: 26989 [2019-12-19 04:00:12,966 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 04:00:13,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26989 states. [2019-12-19 04:00:13,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26989 to 26730. [2019-12-19 04:00:13,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26730 states. [2019-12-19 04:00:13,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26730 states to 26730 states and 81037 transitions. [2019-12-19 04:00:13,308 INFO L78 Accepts]: Start accepts. Automaton has 26730 states and 81037 transitions. Word has length 55 [2019-12-19 04:00:13,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:13,308 INFO L462 AbstractCegarLoop]: Abstraction has 26730 states and 81037 transitions. [2019-12-19 04:00:13,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:00:13,308 INFO L276 IsEmpty]: Start isEmpty. Operand 26730 states and 81037 transitions. [2019-12-19 04:00:13,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 04:00:13,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:13,312 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:00:13,312 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:13,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:13,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1217896248, now seen corresponding path program 1 times [2019-12-19 04:00:13,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:13,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894844172] [2019-12-19 04:00:13,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:13,433 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 04:00:13,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894844172] [2019-12-19 04:00:13,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:13,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:00:13,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122339698] [2019-12-19 04:00:13,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:00:13,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:13,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:00:13,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:00:13,435 INFO L87 Difference]: Start difference. First operand 26730 states and 81037 transitions. Second operand 6 states. [2019-12-19 04:00:14,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:14,225 INFO L93 Difference]: Finished difference Result 31474 states and 93784 transitions. [2019-12-19 04:00:14,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 04:00:14,225 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-19 04:00:14,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:14,288 INFO L225 Difference]: With dead ends: 31474 [2019-12-19 04:00:14,288 INFO L226 Difference]: Without dead ends: 31411 [2019-12-19 04:00:14,289 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 04:00:14,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31411 states. [2019-12-19 04:00:15,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31411 to 26773. [2019-12-19 04:00:15,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26773 states. [2019-12-19 04:00:15,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26773 states to 26773 states and 81115 transitions. [2019-12-19 04:00:15,898 INFO L78 Accepts]: Start accepts. Automaton has 26773 states and 81115 transitions. Word has length 55 [2019-12-19 04:00:15,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:15,898 INFO L462 AbstractCegarLoop]: Abstraction has 26773 states and 81115 transitions. [2019-12-19 04:00:15,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:00:15,899 INFO L276 IsEmpty]: Start isEmpty. Operand 26773 states and 81115 transitions. [2019-12-19 04:00:15,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-19 04:00:15,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:15,904 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 04:00:15,904 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:15,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:15,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1786247972, now seen corresponding path program 1 times [2019-12-19 04:00:15,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:15,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962243156] [2019-12-19 04:00:15,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:15,955 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 04:00:15,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962243156] [2019-12-19 04:00:15,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:15,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:00:15,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556964987] [2019-12-19 04:00:15,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:00:15,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:15,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:00:15,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:00:15,958 INFO L87 Difference]: Start difference. First operand 26773 states and 81115 transitions. Second operand 4 states. [2019-12-19 04:00:16,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:16,111 INFO L93 Difference]: Finished difference Result 29478 states and 89161 transitions. [2019-12-19 04:00:16,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:00:16,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-19 04:00:16,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:16,153 INFO L225 Difference]: With dead ends: 29478 [2019-12-19 04:00:16,153 INFO L226 Difference]: Without dead ends: 29478 [2019-12-19 04:00:16,154 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 04:00:16,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29478 states. [2019-12-19 04:00:16,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29478 to 27743. [2019-12-19 04:00:16,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27743 states. [2019-12-19 04:00:16,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27743 states to 27743 states and 83974 transitions. [2019-12-19 04:00:16,547 INFO L78 Accepts]: Start accepts. Automaton has 27743 states and 83974 transitions. Word has length 63 [2019-12-19 04:00:16,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:16,547 INFO L462 AbstractCegarLoop]: Abstraction has 27743 states and 83974 transitions. [2019-12-19 04:00:16,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:00:16,548 INFO L276 IsEmpty]: Start isEmpty. Operand 27743 states and 83974 transitions. [2019-12-19 04:00:16,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-19 04:00:16,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:16,553 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 04:00:16,553 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:16,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:16,554 INFO L82 PathProgramCache]: Analyzing trace with hash -765908989, now seen corresponding path program 1 times [2019-12-19 04:00:16,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:16,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364451887] [2019-12-19 04:00:16,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:16,618 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 04:00:16,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364451887] [2019-12-19 04:00:16,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:16,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:00:16,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607425292] [2019-12-19 04:00:16,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:00:16,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:16,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:00:16,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:00:16,620 INFO L87 Difference]: Start difference. First operand 27743 states and 83974 transitions. Second operand 6 states. [2019-12-19 04:00:17,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:17,332 INFO L93 Difference]: Finished difference Result 35252 states and 104342 transitions. [2019-12-19 04:00:17,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 04:00:17,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-12-19 04:00:17,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:17,382 INFO L225 Difference]: With dead ends: 35252 [2019-12-19 04:00:17,383 INFO L226 Difference]: Without dead ends: 35191 [2019-12-19 04:00:17,383 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 04:00:17,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35191 states. [2019-12-19 04:00:18,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35191 to 34420. [2019-12-19 04:00:18,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34420 states. [2019-12-19 04:00:18,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34420 states to 34420 states and 102076 transitions. [2019-12-19 04:00:18,239 INFO L78 Accepts]: Start accepts. Automaton has 34420 states and 102076 transitions. Word has length 63 [2019-12-19 04:00:18,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:18,239 INFO L462 AbstractCegarLoop]: Abstraction has 34420 states and 102076 transitions. [2019-12-19 04:00:18,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:00:18,239 INFO L276 IsEmpty]: Start isEmpty. Operand 34420 states and 102076 transitions. [2019-12-19 04:00:18,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 04:00:18,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:18,249 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 04:00:18,250 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:18,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:18,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1293652052, now seen corresponding path program 1 times [2019-12-19 04:00:18,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:18,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881651033] [2019-12-19 04:00:18,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:18,285 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 04:00:18,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881651033] [2019-12-19 04:00:18,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:18,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:00:18,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375585349] [2019-12-19 04:00:18,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:00:18,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:18,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:00:18,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:00:18,288 INFO L87 Difference]: Start difference. First operand 34420 states and 102076 transitions. Second operand 3 states. [2019-12-19 04:00:18,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:18,496 INFO L93 Difference]: Finished difference Result 42956 states and 126097 transitions. [2019-12-19 04:00:18,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:00:18,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-19 04:00:18,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:18,561 INFO L225 Difference]: With dead ends: 42956 [2019-12-19 04:00:18,562 INFO L226 Difference]: Without dead ends: 42956 [2019-12-19 04:00:18,562 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 04:00:18,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42956 states. [2019-12-19 04:00:19,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42956 to 35387. [2019-12-19 04:00:19,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35387 states. [2019-12-19 04:00:19,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35387 states to 35387 states and 102964 transitions. [2019-12-19 04:00:19,080 INFO L78 Accepts]: Start accepts. Automaton has 35387 states and 102964 transitions. Word has length 69 [2019-12-19 04:00:19,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:19,080 INFO L462 AbstractCegarLoop]: Abstraction has 35387 states and 102964 transitions. [2019-12-19 04:00:19,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:00:19,080 INFO L276 IsEmpty]: Start isEmpty. Operand 35387 states and 102964 transitions. [2019-12-19 04:00:19,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-19 04:00:19,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:19,094 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 04:00:19,094 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:19,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:19,094 INFO L82 PathProgramCache]: Analyzing trace with hash -582300025, now seen corresponding path program 1 times [2019-12-19 04:00:19,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:19,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875281927] [2019-12-19 04:00:19,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:19,162 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 04:00:19,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875281927] [2019-12-19 04:00:19,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:19,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:00:19,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161371048] [2019-12-19 04:00:19,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:00:19,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:19,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:00:19,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:00:19,164 INFO L87 Difference]: Start difference. First operand 35387 states and 102964 transitions. Second operand 5 states. [2019-12-19 04:00:19,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:19,846 INFO L93 Difference]: Finished difference Result 40929 states and 118812 transitions. [2019-12-19 04:00:19,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 04:00:19,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-12-19 04:00:19,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:19,911 INFO L225 Difference]: With dead ends: 40929 [2019-12-19 04:00:19,912 INFO L226 Difference]: Without dead ends: 40929 [2019-12-19 04:00:19,912 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 04:00:19,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40929 states. [2019-12-19 04:00:20,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40929 to 39056. [2019-12-19 04:00:20,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39056 states. [2019-12-19 04:00:20,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39056 states to 39056 states and 113480 transitions. [2019-12-19 04:00:20,430 INFO L78 Accepts]: Start accepts. Automaton has 39056 states and 113480 transitions. Word has length 75 [2019-12-19 04:00:20,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:20,430 INFO L462 AbstractCegarLoop]: Abstraction has 39056 states and 113480 transitions. [2019-12-19 04:00:20,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:00:20,430 INFO L276 IsEmpty]: Start isEmpty. Operand 39056 states and 113480 transitions. [2019-12-19 04:00:20,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-19 04:00:20,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:20,445 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 04:00:20,445 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:20,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:20,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1160510310, now seen corresponding path program 1 times [2019-12-19 04:00:20,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:20,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369895005] [2019-12-19 04:00:20,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:20,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 04:00:20,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369895005] [2019-12-19 04:00:20,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:20,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:00:20,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530960857] [2019-12-19 04:00:20,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:00:20,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:20,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:00:20,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:00:20,523 INFO L87 Difference]: Start difference. First operand 39056 states and 113480 transitions. Second operand 7 states. [2019-12-19 04:00:21,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:21,583 INFO L93 Difference]: Finished difference Result 43100 states and 124718 transitions. [2019-12-19 04:00:21,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 04:00:21,583 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-12-19 04:00:21,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:21,644 INFO L225 Difference]: With dead ends: 43100 [2019-12-19 04:00:21,644 INFO L226 Difference]: Without dead ends: 43023 [2019-12-19 04:00:21,645 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 04:00:21,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43023 states. [2019-12-19 04:00:22,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43023 to 36439. [2019-12-19 04:00:22,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36439 states. [2019-12-19 04:00:22,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36439 states to 36439 states and 106972 transitions. [2019-12-19 04:00:22,424 INFO L78 Accepts]: Start accepts. Automaton has 36439 states and 106972 transitions. Word has length 75 [2019-12-19 04:00:22,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:22,424 INFO L462 AbstractCegarLoop]: Abstraction has 36439 states and 106972 transitions. [2019-12-19 04:00:22,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:00:22,424 INFO L276 IsEmpty]: Start isEmpty. Operand 36439 states and 106972 transitions. [2019-12-19 04:00:22,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-19 04:00:22,438 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:22,438 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:00:22,438 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:22,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:22,438 INFO L82 PathProgramCache]: Analyzing trace with hash 406738322, now seen corresponding path program 1 times [2019-12-19 04:00:22,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:22,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280193396] [2019-12-19 04:00:22,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:22,511 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 04:00:22,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280193396] [2019-12-19 04:00:22,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:22,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:00:22,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746956864] [2019-12-19 04:00:22,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:00:22,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:22,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:00:22,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:00:22,514 INFO L87 Difference]: Start difference. First operand 36439 states and 106972 transitions. Second operand 7 states. [2019-12-19 04:00:23,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:23,684 INFO L93 Difference]: Finished difference Result 48613 states and 140149 transitions. [2019-12-19 04:00:23,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-19 04:00:23,685 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2019-12-19 04:00:23,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:23,761 INFO L225 Difference]: With dead ends: 48613 [2019-12-19 04:00:23,761 INFO L226 Difference]: Without dead ends: 48565 [2019-12-19 04:00:23,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-19 04:00:23,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48565 states. [2019-12-19 04:00:24,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48565 to 40512. [2019-12-19 04:00:24,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40512 states. [2019-12-19 04:00:24,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40512 states to 40512 states and 117398 transitions. [2019-12-19 04:00:24,772 INFO L78 Accepts]: Start accepts. Automaton has 40512 states and 117398 transitions. Word has length 77 [2019-12-19 04:00:24,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:24,773 INFO L462 AbstractCegarLoop]: Abstraction has 40512 states and 117398 transitions. [2019-12-19 04:00:24,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:00:24,773 INFO L276 IsEmpty]: Start isEmpty. Operand 40512 states and 117398 transitions. [2019-12-19 04:00:24,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-19 04:00:24,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:24,794 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] [2019-12-19 04:00:24,794 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:24,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:24,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1183066378, now seen corresponding path program 1 times [2019-12-19 04:00:24,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:24,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215432804] [2019-12-19 04:00:24,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:24,829 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 04:00:24,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215432804] [2019-12-19 04:00:24,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:24,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:00:24,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170503933] [2019-12-19 04:00:24,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:00:24,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:24,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:00:24,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:00:24,831 INFO L87 Difference]: Start difference. First operand 40512 states and 117398 transitions. Second operand 3 states. [2019-12-19 04:00:25,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:25,240 INFO L93 Difference]: Finished difference Result 49571 states and 141798 transitions. [2019-12-19 04:00:25,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:00:25,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-12-19 04:00:25,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:25,308 INFO L225 Difference]: With dead ends: 49571 [2019-12-19 04:00:25,308 INFO L226 Difference]: Without dead ends: 49571 [2019-12-19 04:00:25,308 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 04:00:25,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49571 states. [2019-12-19 04:00:25,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49571 to 45675. [2019-12-19 04:00:25,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45675 states. [2019-12-19 04:00:25,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45675 states to 45675 states and 131329 transitions. [2019-12-19 04:00:25,897 INFO L78 Accepts]: Start accepts. Automaton has 45675 states and 131329 transitions. Word has length 82 [2019-12-19 04:00:25,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:25,897 INFO L462 AbstractCegarLoop]: Abstraction has 45675 states and 131329 transitions. [2019-12-19 04:00:25,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:00:25,897 INFO L276 IsEmpty]: Start isEmpty. Operand 45675 states and 131329 transitions. [2019-12-19 04:00:25,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-19 04:00:25,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:25,925 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] [2019-12-19 04:00:25,926 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:25,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:25,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1797217747, now seen corresponding path program 1 times [2019-12-19 04:00:25,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:25,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109238795] [2019-12-19 04:00:25,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:25,980 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 04:00:25,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109238795] [2019-12-19 04:00:25,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:25,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:00:25,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420152292] [2019-12-19 04:00:25,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:00:25,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:25,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:00:25,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:00:25,982 INFO L87 Difference]: Start difference. First operand 45675 states and 131329 transitions. Second operand 4 states. [2019-12-19 04:00:26,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:26,634 INFO L93 Difference]: Finished difference Result 50506 states and 144515 transitions. [2019-12-19 04:00:26,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 04:00:26,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-12-19 04:00:26,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:26,703 INFO L225 Difference]: With dead ends: 50506 [2019-12-19 04:00:26,703 INFO L226 Difference]: Without dead ends: 50506 [2019-12-19 04:00:26,704 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 04:00:26,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50506 states. [2019-12-19 04:00:27,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50506 to 49663. [2019-12-19 04:00:27,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49663 states. [2019-12-19 04:00:27,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49663 states to 49663 states and 142083 transitions. [2019-12-19 04:00:27,307 INFO L78 Accepts]: Start accepts. Automaton has 49663 states and 142083 transitions. Word has length 83 [2019-12-19 04:00:27,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:27,307 INFO L462 AbstractCegarLoop]: Abstraction has 49663 states and 142083 transitions. [2019-12-19 04:00:27,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:00:27,307 INFO L276 IsEmpty]: Start isEmpty. Operand 49663 states and 142083 transitions. [2019-12-19 04:00:27,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-19 04:00:27,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:27,339 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] [2019-12-19 04:00:27,339 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:27,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:27,339 INFO L82 PathProgramCache]: Analyzing trace with hash -279991596, now seen corresponding path program 1 times [2019-12-19 04:00:27,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:27,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780164897] [2019-12-19 04:00:27,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:27,378 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 04:00:27,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780164897] [2019-12-19 04:00:27,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:27,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:00:27,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562447371] [2019-12-19 04:00:27,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:00:27,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:27,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:00:27,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:00:27,380 INFO L87 Difference]: Start difference. First operand 49663 states and 142083 transitions. Second operand 3 states. [2019-12-19 04:00:27,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:27,786 INFO L93 Difference]: Finished difference Result 60693 states and 170203 transitions. [2019-12-19 04:00:27,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:00:27,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-19 04:00:27,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:27,865 INFO L225 Difference]: With dead ends: 60693 [2019-12-19 04:00:27,865 INFO L226 Difference]: Without dead ends: 60693 [2019-12-19 04:00:27,865 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 04:00:27,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60693 states. [2019-12-19 04:00:28,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60693 to 56625. [2019-12-19 04:00:28,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56625 states. [2019-12-19 04:00:28,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56625 states to 56625 states and 159736 transitions. [2019-12-19 04:00:28,871 INFO L78 Accepts]: Start accepts. Automaton has 56625 states and 159736 transitions. Word has length 83 [2019-12-19 04:00:28,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:28,871 INFO L462 AbstractCegarLoop]: Abstraction has 56625 states and 159736 transitions. [2019-12-19 04:00:28,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:00:28,871 INFO L276 IsEmpty]: Start isEmpty. Operand 56625 states and 159736 transitions. [2019-12-19 04:00:28,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-19 04:00:28,900 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:28,900 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] [2019-12-19 04:00:28,901 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:28,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:28,901 INFO L82 PathProgramCache]: Analyzing trace with hash -276703570, now seen corresponding path program 1 times [2019-12-19 04:00:28,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:28,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75002228] [2019-12-19 04:00:28,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:28,952 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 04:00:28,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75002228] [2019-12-19 04:00:28,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:28,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:00:28,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436209063] [2019-12-19 04:00:28,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:00:28,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:28,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:00:28,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:00:28,954 INFO L87 Difference]: Start difference. First operand 56625 states and 159736 transitions. Second operand 4 states. [2019-12-19 04:00:29,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:29,248 INFO L93 Difference]: Finished difference Result 59784 states and 166836 transitions. [2019-12-19 04:00:29,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 04:00:29,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-12-19 04:00:29,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:29,358 INFO L225 Difference]: With dead ends: 59784 [2019-12-19 04:00:29,358 INFO L226 Difference]: Without dead ends: 59784 [2019-12-19 04:00:29,359 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 04:00:29,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59784 states. [2019-12-19 04:00:30,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59784 to 56662. [2019-12-19 04:00:30,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56662 states. [2019-12-19 04:00:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56662 states to 56662 states and 158140 transitions. [2019-12-19 04:00:30,427 INFO L78 Accepts]: Start accepts. Automaton has 56662 states and 158140 transitions. Word has length 84 [2019-12-19 04:00:30,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:30,428 INFO L462 AbstractCegarLoop]: Abstraction has 56662 states and 158140 transitions. [2019-12-19 04:00:30,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:00:30,428 INFO L276 IsEmpty]: Start isEmpty. Operand 56662 states and 158140 transitions. [2019-12-19 04:00:30,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-19 04:00:30,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:30,455 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] [2019-12-19 04:00:30,455 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:30,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:30,456 INFO L82 PathProgramCache]: Analyzing trace with hash -65352657, now seen corresponding path program 1 times [2019-12-19 04:00:30,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:30,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707871972] [2019-12-19 04:00:30,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:30,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 04:00:30,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707871972] [2019-12-19 04:00:30,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:30,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:00:30,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778147593] [2019-12-19 04:00:30,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:00:30,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:30,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:00:30,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:00:30,523 INFO L87 Difference]: Start difference. First operand 56662 states and 158140 transitions. Second operand 5 states. [2019-12-19 04:00:31,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:31,578 INFO L93 Difference]: Finished difference Result 64151 states and 176361 transitions. [2019-12-19 04:00:31,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 04:00:31,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-12-19 04:00:31,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:31,667 INFO L225 Difference]: With dead ends: 64151 [2019-12-19 04:00:31,667 INFO L226 Difference]: Without dead ends: 64151 [2019-12-19 04:00:31,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 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 04:00:31,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64151 states. [2019-12-19 04:00:32,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64151 to 61941. [2019-12-19 04:00:32,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61941 states. [2019-12-19 04:00:32,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61941 states to 61941 states and 171191 transitions. [2019-12-19 04:00:32,850 INFO L78 Accepts]: Start accepts. Automaton has 61941 states and 171191 transitions. Word has length 84 [2019-12-19 04:00:32,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:32,850 INFO L462 AbstractCegarLoop]: Abstraction has 61941 states and 171191 transitions. [2019-12-19 04:00:32,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:00:32,850 INFO L276 IsEmpty]: Start isEmpty. Operand 61941 states and 171191 transitions. [2019-12-19 04:00:32,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-19 04:00:32,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:32,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, 1, 1, 1, 1, 1, 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 04:00:32,887 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:32,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:32,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1179411824, now seen corresponding path program 1 times [2019-12-19 04:00:32,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:32,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966400435] [2019-12-19 04:00:32,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:33,026 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 04:00:33,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966400435] [2019-12-19 04:00:33,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:33,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 04:00:33,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102640313] [2019-12-19 04:00:33,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 04:00:33,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:33,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 04:00:33,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:00:33,028 INFO L87 Difference]: Start difference. First operand 61941 states and 171191 transitions. Second operand 8 states. [2019-12-19 04:00:35,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:35,201 INFO L93 Difference]: Finished difference Result 99818 states and 275787 transitions. [2019-12-19 04:00:35,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-19 04:00:35,202 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2019-12-19 04:00:35,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:35,359 INFO L225 Difference]: With dead ends: 99818 [2019-12-19 04:00:35,360 INFO L226 Difference]: Without dead ends: 99500 [2019-12-19 04:00:35,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-12-19 04:00:35,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99500 states. [2019-12-19 04:00:36,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99500 to 83793. [2019-12-19 04:00:36,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83793 states. [2019-12-19 04:00:36,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83793 states to 83793 states and 231549 transitions. [2019-12-19 04:00:36,997 INFO L78 Accepts]: Start accepts. Automaton has 83793 states and 231549 transitions. Word has length 84 [2019-12-19 04:00:36,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:36,997 INFO L462 AbstractCegarLoop]: Abstraction has 83793 states and 231549 transitions. [2019-12-19 04:00:36,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 04:00:36,997 INFO L276 IsEmpty]: Start isEmpty. Operand 83793 states and 231549 transitions. [2019-12-19 04:00:37,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-19 04:00:37,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:37,038 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] [2019-12-19 04:00:37,038 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:37,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:37,038 INFO L82 PathProgramCache]: Analyzing trace with hash -617539535, now seen corresponding path program 1 times [2019-12-19 04:00:37,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:37,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295735239] [2019-12-19 04:00:37,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:37,138 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 04:00:37,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295735239] [2019-12-19 04:00:37,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:37,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 04:00:37,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695144523] [2019-12-19 04:00:37,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 04:00:37,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:37,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 04:00:37,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:00:37,140 INFO L87 Difference]: Start difference. First operand 83793 states and 231549 transitions. Second operand 8 states. [2019-12-19 04:00:40,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:40,413 INFO L93 Difference]: Finished difference Result 178613 states and 505336 transitions. [2019-12-19 04:00:40,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-19 04:00:40,414 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2019-12-19 04:00:40,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:40,705 INFO L225 Difference]: With dead ends: 178613 [2019-12-19 04:00:40,705 INFO L226 Difference]: Without dead ends: 178505 [2019-12-19 04:00:40,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=629, Unknown=0, NotChecked=0, Total=812 [2019-12-19 04:00:40,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178505 states. [2019-12-19 04:00:42,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178505 to 110513. [2019-12-19 04:00:42,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110513 states. [2019-12-19 04:00:43,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110513 states to 110513 states and 311403 transitions. [2019-12-19 04:00:43,194 INFO L78 Accepts]: Start accepts. Automaton has 110513 states and 311403 transitions. Word has length 84 [2019-12-19 04:00:43,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:43,194 INFO L462 AbstractCegarLoop]: Abstraction has 110513 states and 311403 transitions. [2019-12-19 04:00:43,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 04:00:43,194 INFO L276 IsEmpty]: Start isEmpty. Operand 110513 states and 311403 transitions. [2019-12-19 04:00:43,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-19 04:00:43,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:43,249 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] [2019-12-19 04:00:43,249 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:43,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:43,250 INFO L82 PathProgramCache]: Analyzing trace with hash 269964146, now seen corresponding path program 1 times [2019-12-19 04:00:43,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:43,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139798327] [2019-12-19 04:00:43,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:43,328 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 04:00:43,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139798327] [2019-12-19 04:00:43,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:43,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:00:43,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863022120] [2019-12-19 04:00:43,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:00:43,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:43,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:00:43,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:00:43,333 INFO L87 Difference]: Start difference. First operand 110513 states and 311403 transitions. Second operand 5 states. [2019-12-19 04:00:43,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:43,511 INFO L93 Difference]: Finished difference Result 45095 states and 107744 transitions. [2019-12-19 04:00:43,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 04:00:43,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-12-19 04:00:43,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:43,554 INFO L225 Difference]: With dead ends: 45095 [2019-12-19 04:00:43,554 INFO L226 Difference]: Without dead ends: 39743 [2019-12-19 04:00:43,554 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 04:00:43,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39743 states. [2019-12-19 04:00:44,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39743 to 32550. [2019-12-19 04:00:44,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32550 states. [2019-12-19 04:00:44,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32550 states to 32550 states and 77200 transitions. [2019-12-19 04:00:44,528 INFO L78 Accepts]: Start accepts. Automaton has 32550 states and 77200 transitions. Word has length 84 [2019-12-19 04:00:44,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:44,528 INFO L462 AbstractCegarLoop]: Abstraction has 32550 states and 77200 transitions. [2019-12-19 04:00:44,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:00:44,529 INFO L276 IsEmpty]: Start isEmpty. Operand 32550 states and 77200 transitions. [2019-12-19 04:00:44,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-19 04:00:44,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:44,567 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:00:44,567 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:44,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:44,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1633083230, now seen corresponding path program 1 times [2019-12-19 04:00:44,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:44,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308620904] [2019-12-19 04:00:44,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:44,691 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 04:00:44,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308620904] [2019-12-19 04:00:44,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:44,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:00:44,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297792018] [2019-12-19 04:00:44,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:00:44,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:44,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:00:44,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:00:44,699 INFO L87 Difference]: Start difference. First operand 32550 states and 77200 transitions. Second operand 7 states. [2019-12-19 04:00:45,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:45,200 INFO L93 Difference]: Finished difference Result 43587 states and 100851 transitions. [2019-12-19 04:00:45,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:00:45,201 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2019-12-19 04:00:45,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:45,244 INFO L225 Difference]: With dead ends: 43587 [2019-12-19 04:00:45,244 INFO L226 Difference]: Without dead ends: 43529 [2019-12-19 04:00:45,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-19 04:00:45,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43529 states. [2019-12-19 04:00:45,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43529 to 34140. [2019-12-19 04:00:45,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34140 states. [2019-12-19 04:00:45,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34140 states to 34140 states and 79729 transitions. [2019-12-19 04:00:45,673 INFO L78 Accepts]: Start accepts. Automaton has 34140 states and 79729 transitions. Word has length 112 [2019-12-19 04:00:45,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:45,674 INFO L462 AbstractCegarLoop]: Abstraction has 34140 states and 79729 transitions. [2019-12-19 04:00:45,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:00:45,674 INFO L276 IsEmpty]: Start isEmpty. Operand 34140 states and 79729 transitions. [2019-12-19 04:00:45,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-19 04:00:45,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:45,706 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:00:45,706 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:45,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:45,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1516270661, now seen corresponding path program 1 times [2019-12-19 04:00:45,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:45,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350070353] [2019-12-19 04:00:45,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:45,764 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 04:00:45,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350070353] [2019-12-19 04:00:45,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:45,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:00:45,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730575581] [2019-12-19 04:00:45,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:00:45,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:45,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:00:45,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:00:45,766 INFO L87 Difference]: Start difference. First operand 34140 states and 79729 transitions. Second operand 5 states. [2019-12-19 04:00:46,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:46,223 INFO L93 Difference]: Finished difference Result 35958 states and 83701 transitions. [2019-12-19 04:00:46,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:00:46,223 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-12-19 04:00:46,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:46,261 INFO L225 Difference]: With dead ends: 35958 [2019-12-19 04:00:46,261 INFO L226 Difference]: Without dead ends: 35896 [2019-12-19 04:00:46,262 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 04:00:46,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35896 states. [2019-12-19 04:00:46,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35896 to 34146. [2019-12-19 04:00:46,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34146 states. [2019-12-19 04:00:46,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34146 states to 34146 states and 79742 transitions. [2019-12-19 04:00:46,633 INFO L78 Accepts]: Start accepts. Automaton has 34146 states and 79742 transitions. Word has length 112 [2019-12-19 04:00:46,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:46,633 INFO L462 AbstractCegarLoop]: Abstraction has 34146 states and 79742 transitions. [2019-12-19 04:00:46,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:00:46,634 INFO L276 IsEmpty]: Start isEmpty. Operand 34146 states and 79742 transitions. [2019-12-19 04:00:46,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-19 04:00:46,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:00:46,664 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:46,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:46,665 INFO L82 PathProgramCache]: Analyzing trace with hash 843036348, now seen corresponding path program 2 times [2019-12-19 04:00:46,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:46,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493028523] [2019-12-19 04:00:46,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:46,794 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 04:00:46,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493028523] [2019-12-19 04:00:46,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:46,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:00:46,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510558515] [2019-12-19 04:00:46,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:00:46,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:46,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:00:46,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:00:46,796 INFO L87 Difference]: Start difference. First operand 34146 states and 79742 transitions. Second operand 7 states. [2019-12-19 04:00:47,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:47,702 INFO L93 Difference]: Finished difference Result 45199 states and 102865 transitions. [2019-12-19 04:00:47,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 04:00:47,702 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2019-12-19 04:00:47,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:47,750 INFO L225 Difference]: With dead ends: 45199 [2019-12-19 04:00:47,750 INFO L226 Difference]: Without dead ends: 45199 [2019-12-19 04:00:47,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-19 04:00:47,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45199 states. [2019-12-19 04:00:48,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45199 to 38168. [2019-12-19 04:00:48,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38168 states. [2019-12-19 04:00:48,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38168 states to 38168 states and 87539 transitions. [2019-12-19 04:00:48,220 INFO L78 Accepts]: Start accepts. Automaton has 38168 states and 87539 transitions. Word has length 112 [2019-12-19 04:00:48,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:48,220 INFO L462 AbstractCegarLoop]: Abstraction has 38168 states and 87539 transitions. [2019-12-19 04:00:48,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:00:48,220 INFO L276 IsEmpty]: Start isEmpty. Operand 38168 states and 87539 transitions. [2019-12-19 04:00:48,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-19 04:00:48,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:48,253 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:00:48,253 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:48,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:48,253 INFO L82 PathProgramCache]: Analyzing trace with hash -79647235, now seen corresponding path program 1 times [2019-12-19 04:00:48,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:48,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215625554] [2019-12-19 04:00:48,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:48,331 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 04:00:48,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215625554] [2019-12-19 04:00:48,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:48,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:00:48,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79009178] [2019-12-19 04:00:48,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:00:48,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:48,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:00:48,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:00:48,333 INFO L87 Difference]: Start difference. First operand 38168 states and 87539 transitions. Second operand 5 states. [2019-12-19 04:00:48,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:48,638 INFO L93 Difference]: Finished difference Result 43450 states and 99209 transitions. [2019-12-19 04:00:48,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:00:48,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-12-19 04:00:48,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:48,713 INFO L225 Difference]: With dead ends: 43450 [2019-12-19 04:00:48,714 INFO L226 Difference]: Without dead ends: 43450 [2019-12-19 04:00:48,714 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 04:00:48,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43450 states. [2019-12-19 04:00:49,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43450 to 35145. [2019-12-19 04:00:49,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35145 states. [2019-12-19 04:00:49,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35145 states to 35145 states and 80302 transitions. [2019-12-19 04:00:49,477 INFO L78 Accepts]: Start accepts. Automaton has 35145 states and 80302 transitions. Word has length 112 [2019-12-19 04:00:49,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:49,478 INFO L462 AbstractCegarLoop]: Abstraction has 35145 states and 80302 transitions. [2019-12-19 04:00:49,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:00:49,478 INFO L276 IsEmpty]: Start isEmpty. Operand 35145 states and 80302 transitions. [2019-12-19 04:00:49,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-19 04:00:49,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:49,526 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:00:49,526 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:49,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:49,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1819828379, now seen corresponding path program 1 times [2019-12-19 04:00:49,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:49,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248228094] [2019-12-19 04:00:49,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:49,612 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 04:00:49,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248228094] [2019-12-19 04:00:49,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:49,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:00:49,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086232732] [2019-12-19 04:00:49,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:00:49,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:49,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:00:49,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:00:49,615 INFO L87 Difference]: Start difference. First operand 35145 states and 80302 transitions. Second operand 6 states. [2019-12-19 04:00:50,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:50,653 INFO L93 Difference]: Finished difference Result 38722 states and 88056 transitions. [2019-12-19 04:00:50,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 04:00:50,654 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2019-12-19 04:00:50,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:50,708 INFO L225 Difference]: With dead ends: 38722 [2019-12-19 04:00:50,708 INFO L226 Difference]: Without dead ends: 38616 [2019-12-19 04:00:50,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 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 04:00:50,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38616 states. [2019-12-19 04:00:51,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38616 to 35120. [2019-12-19 04:00:51,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35120 states. [2019-12-19 04:00:51,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35120 states to 35120 states and 80155 transitions. [2019-12-19 04:00:51,166 INFO L78 Accepts]: Start accepts. Automaton has 35120 states and 80155 transitions. Word has length 112 [2019-12-19 04:00:51,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:51,167 INFO L462 AbstractCegarLoop]: Abstraction has 35120 states and 80155 transitions. [2019-12-19 04:00:51,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:00:51,168 INFO L276 IsEmpty]: Start isEmpty. Operand 35120 states and 80155 transitions. [2019-12-19 04:00:51,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-19 04:00:51,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:51,203 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:00:51,203 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:51,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:51,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1007934813, now seen corresponding path program 1 times [2019-12-19 04:00:51,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:51,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111082631] [2019-12-19 04:00:51,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:51,325 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 04:00:51,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111082631] [2019-12-19 04:00:51,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:51,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 04:00:51,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497990960] [2019-12-19 04:00:51,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 04:00:51,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:51,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 04:00:51,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:00:51,327 INFO L87 Difference]: Start difference. First operand 35120 states and 80155 transitions. Second operand 8 states. [2019-12-19 04:00:52,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:52,467 INFO L93 Difference]: Finished difference Result 47319 states and 107707 transitions. [2019-12-19 04:00:52,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-19 04:00:52,467 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2019-12-19 04:00:52,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:52,518 INFO L225 Difference]: With dead ends: 47319 [2019-12-19 04:00:52,519 INFO L226 Difference]: Without dead ends: 47301 [2019-12-19 04:00:52,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-12-19 04:00:52,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47301 states. [2019-12-19 04:00:52,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47301 to 42192. [2019-12-19 04:00:52,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42192 states. [2019-12-19 04:00:53,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42192 states to 42192 states and 96279 transitions. [2019-12-19 04:00:53,019 INFO L78 Accepts]: Start accepts. Automaton has 42192 states and 96279 transitions. Word has length 112 [2019-12-19 04:00:53,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:53,020 INFO L462 AbstractCegarLoop]: Abstraction has 42192 states and 96279 transitions. [2019-12-19 04:00:53,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 04:00:53,020 INFO L276 IsEmpty]: Start isEmpty. Operand 42192 states and 96279 transitions. [2019-12-19 04:00:53,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-19 04:00:53,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:53,061 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:00:53,061 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:53,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:53,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1917382491, now seen corresponding path program 1 times [2019-12-19 04:00:53,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:53,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665824271] [2019-12-19 04:00:53,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:53,184 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 04:00:53,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665824271] [2019-12-19 04:00:53,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:53,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:00:53,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823247442] [2019-12-19 04:00:53,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:00:53,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:53,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:00:53,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:00:53,186 INFO L87 Difference]: Start difference. First operand 42192 states and 96279 transitions. Second operand 7 states. [2019-12-19 04:00:53,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:53,463 INFO L93 Difference]: Finished difference Result 49714 states and 111889 transitions. [2019-12-19 04:00:53,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:00:53,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2019-12-19 04:00:53,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:53,515 INFO L225 Difference]: With dead ends: 49714 [2019-12-19 04:00:53,515 INFO L226 Difference]: Without dead ends: 49714 [2019-12-19 04:00:53,515 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 04:00:53,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49714 states. [2019-12-19 04:00:54,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49714 to 42742. [2019-12-19 04:00:54,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42742 states. [2019-12-19 04:00:54,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42742 states to 42742 states and 96720 transitions. [2019-12-19 04:00:54,209 INFO L78 Accepts]: Start accepts. Automaton has 42742 states and 96720 transitions. Word has length 112 [2019-12-19 04:00:54,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:54,209 INFO L462 AbstractCegarLoop]: Abstraction has 42742 states and 96720 transitions. [2019-12-19 04:00:54,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:00:54,209 INFO L276 IsEmpty]: Start isEmpty. Operand 42742 states and 96720 transitions. [2019-12-19 04:00:54,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-19 04:00:54,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:54,248 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:00:54,248 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:54,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:54,249 INFO L82 PathProgramCache]: Analyzing trace with hash 645609253, now seen corresponding path program 1 times [2019-12-19 04:00:54,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:54,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701228082] [2019-12-19 04:00:54,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:54,361 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 04:00:54,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701228082] [2019-12-19 04:00:54,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:54,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:00:54,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205188833] [2019-12-19 04:00:54,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:00:54,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:54,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:00:54,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:00:54,363 INFO L87 Difference]: Start difference. First operand 42742 states and 96720 transitions. Second operand 6 states. [2019-12-19 04:00:54,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:54,636 INFO L93 Difference]: Finished difference Result 42589 states and 96210 transitions. [2019-12-19 04:00:54,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:00:54,636 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2019-12-19 04:00:54,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:54,681 INFO L225 Difference]: With dead ends: 42589 [2019-12-19 04:00:54,681 INFO L226 Difference]: Without dead ends: 42589 [2019-12-19 04:00:54,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 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 04:00:54,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42589 states. [2019-12-19 04:00:55,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42589 to 31613. [2019-12-19 04:00:55,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31613 states. [2019-12-19 04:00:55,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31613 states to 31613 states and 71588 transitions. [2019-12-19 04:00:55,111 INFO L78 Accepts]: Start accepts. Automaton has 31613 states and 71588 transitions. Word has length 112 [2019-12-19 04:00:55,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:55,111 INFO L462 AbstractCegarLoop]: Abstraction has 31613 states and 71588 transitions. [2019-12-19 04:00:55,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:00:55,111 INFO L276 IsEmpty]: Start isEmpty. Operand 31613 states and 71588 transitions. [2019-12-19 04:00:55,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-19 04:00:55,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:55,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:00:55,139 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:55,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:55,139 INFO L82 PathProgramCache]: Analyzing trace with hash -333774747, now seen corresponding path program 1 times [2019-12-19 04:00:55,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:55,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154532165] [2019-12-19 04:00:55,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:55,219 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 04:00:55,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154532165] [2019-12-19 04:00:55,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:55,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:00:55,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074380581] [2019-12-19 04:00:55,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:00:55,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:55,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:00:55,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:00:55,221 INFO L87 Difference]: Start difference. First operand 31613 states and 71588 transitions. Second operand 7 states. [2019-12-19 04:00:55,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:55,735 INFO L93 Difference]: Finished difference Result 36799 states and 83106 transitions. [2019-12-19 04:00:55,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:00:55,735 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 114 [2019-12-19 04:00:55,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:55,774 INFO L225 Difference]: With dead ends: 36799 [2019-12-19 04:00:55,774 INFO L226 Difference]: Without dead ends: 36799 [2019-12-19 04:00:55,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:00:55,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36799 states. [2019-12-19 04:00:56,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36799 to 34137. [2019-12-19 04:00:56,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34137 states. [2019-12-19 04:00:56,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34137 states to 34137 states and 77448 transitions. [2019-12-19 04:00:56,354 INFO L78 Accepts]: Start accepts. Automaton has 34137 states and 77448 transitions. Word has length 114 [2019-12-19 04:00:56,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:56,354 INFO L462 AbstractCegarLoop]: Abstraction has 34137 states and 77448 transitions. [2019-12-19 04:00:56,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:00:56,354 INFO L276 IsEmpty]: Start isEmpty. Operand 34137 states and 77448 transitions. [2019-12-19 04:00:56,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-19 04:00:56,386 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:56,386 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:00:56,386 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:56,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:56,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1660322440, now seen corresponding path program 1 times [2019-12-19 04:00:56,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:56,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354890106] [2019-12-19 04:00:56,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:56,490 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 04:00:56,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354890106] [2019-12-19 04:00:56,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:56,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:00:56,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450130620] [2019-12-19 04:00:56,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:00:56,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:56,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:00:56,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:00:56,492 INFO L87 Difference]: Start difference. First operand 34137 states and 77448 transitions. Second operand 5 states. [2019-12-19 04:00:56,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:56,661 INFO L93 Difference]: Finished difference Result 34137 states and 77439 transitions. [2019-12-19 04:00:56,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:00:56,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-12-19 04:00:56,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:56,721 INFO L225 Difference]: With dead ends: 34137 [2019-12-19 04:00:56,721 INFO L226 Difference]: Without dead ends: 34137 [2019-12-19 04:00:56,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 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 04:00:56,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34137 states. [2019-12-19 04:00:57,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34137 to 34137. [2019-12-19 04:00:57,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34137 states. [2019-12-19 04:00:57,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34137 states to 34137 states and 77439 transitions. [2019-12-19 04:00:57,293 INFO L78 Accepts]: Start accepts. Automaton has 34137 states and 77439 transitions. Word has length 114 [2019-12-19 04:00:57,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:57,294 INFO L462 AbstractCegarLoop]: Abstraction has 34137 states and 77439 transitions. [2019-12-19 04:00:57,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:00:57,294 INFO L276 IsEmpty]: Start isEmpty. Operand 34137 states and 77439 transitions. [2019-12-19 04:00:57,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-19 04:00:57,336 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:57,336 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:00:57,336 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:57,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:57,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1747141175, now seen corresponding path program 1 times [2019-12-19 04:00:57,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:57,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201966721] [2019-12-19 04:00:57,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:57,423 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 04:00:57,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201966721] [2019-12-19 04:00:57,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:57,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:00:57,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336263757] [2019-12-19 04:00:57,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:00:57,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:57,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:00:57,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:00:57,426 INFO L87 Difference]: Start difference. First operand 34137 states and 77439 transitions. Second operand 4 states. [2019-12-19 04:00:57,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:57,740 INFO L93 Difference]: Finished difference Result 36228 states and 82028 transitions. [2019-12-19 04:00:57,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 04:00:57,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-12-19 04:00:57,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:57,780 INFO L225 Difference]: With dead ends: 36228 [2019-12-19 04:00:57,780 INFO L226 Difference]: Without dead ends: 36228 [2019-12-19 04:00:57,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:00:57,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36228 states. [2019-12-19 04:00:58,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36228 to 33283. [2019-12-19 04:00:58,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33283 states. [2019-12-19 04:00:58,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33283 states to 33283 states and 75508 transitions. [2019-12-19 04:00:58,135 INFO L78 Accepts]: Start accepts. Automaton has 33283 states and 75508 transitions. Word has length 114 [2019-12-19 04:00:58,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:58,136 INFO L462 AbstractCegarLoop]: Abstraction has 33283 states and 75508 transitions. [2019-12-19 04:00:58,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:00:58,136 INFO L276 IsEmpty]: Start isEmpty. Operand 33283 states and 75508 transitions. [2019-12-19 04:00:58,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-19 04:00:58,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:58,165 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:00:58,165 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:58,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:58,166 INFO L82 PathProgramCache]: Analyzing trace with hash -207576506, now seen corresponding path program 1 times [2019-12-19 04:00:58,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:58,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41762606] [2019-12-19 04:00:58,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:58,264 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 04:00:58,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41762606] [2019-12-19 04:00:58,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:58,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:00:58,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760494599] [2019-12-19 04:00:58,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:00:58,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:58,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:00:58,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:00:58,266 INFO L87 Difference]: Start difference. First operand 33283 states and 75508 transitions. Second operand 7 states. [2019-12-19 04:00:58,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:58,720 INFO L93 Difference]: Finished difference Result 34058 states and 77357 transitions. [2019-12-19 04:00:58,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 04:00:58,721 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 114 [2019-12-19 04:00:58,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:58,756 INFO L225 Difference]: With dead ends: 34058 [2019-12-19 04:00:58,756 INFO L226 Difference]: Without dead ends: 34058 [2019-12-19 04:00:58,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-19 04:00:58,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34058 states. [2019-12-19 04:00:59,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34058 to 32796. [2019-12-19 04:00:59,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32796 states. [2019-12-19 04:00:59,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32796 states to 32796 states and 74427 transitions. [2019-12-19 04:00:59,285 INFO L78 Accepts]: Start accepts. Automaton has 32796 states and 74427 transitions. Word has length 114 [2019-12-19 04:00:59,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:59,285 INFO L462 AbstractCegarLoop]: Abstraction has 32796 states and 74427 transitions. [2019-12-19 04:00:59,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:00:59,285 INFO L276 IsEmpty]: Start isEmpty. Operand 32796 states and 74427 transitions. [2019-12-19 04:00:59,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-19 04:00:59,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:59,318 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:00:59,318 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:59,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:59,318 INFO L82 PathProgramCache]: Analyzing trace with hash -160487065, now seen corresponding path program 2 times [2019-12-19 04:00:59,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:59,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939891741] [2019-12-19 04:00:59,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:59,401 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 04:00:59,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939891741] [2019-12-19 04:00:59,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:59,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:00:59,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458161949] [2019-12-19 04:00:59,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:00:59,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:59,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:00:59,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:00:59,403 INFO L87 Difference]: Start difference. First operand 32796 states and 74427 transitions. Second operand 6 states. [2019-12-19 04:00:59,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:59,882 INFO L93 Difference]: Finished difference Result 35979 states and 81385 transitions. [2019-12-19 04:00:59,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 04:00:59,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2019-12-19 04:00:59,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:59,920 INFO L225 Difference]: With dead ends: 35979 [2019-12-19 04:00:59,920 INFO L226 Difference]: Without dead ends: 35979 [2019-12-19 04:00:59,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:00:59,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35979 states. [2019-12-19 04:01:00,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35979 to 32753. [2019-12-19 04:01:00,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32753 states. [2019-12-19 04:01:00,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32753 states to 32753 states and 74252 transitions. [2019-12-19 04:01:00,280 INFO L78 Accepts]: Start accepts. Automaton has 32753 states and 74252 transitions. Word has length 114 [2019-12-19 04:01:00,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:01:00,281 INFO L462 AbstractCegarLoop]: Abstraction has 32753 states and 74252 transitions. [2019-12-19 04:01:00,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:01:00,281 INFO L276 IsEmpty]: Start isEmpty. Operand 32753 states and 74252 transitions. [2019-12-19 04:01:00,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-19 04:01:00,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:01:00,309 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:01:00,309 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:01:00,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:01:00,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1517791349, now seen corresponding path program 3 times [2019-12-19 04:01:00,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:01:00,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816411679] [2019-12-19 04:01:00,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:01:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:01:00,358 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 04:01:00,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816411679] [2019-12-19 04:01:00,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:01:00,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:01:00,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267952464] [2019-12-19 04:01:00,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:01:00,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:01:00,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:01:00,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:01:00,360 INFO L87 Difference]: Start difference. First operand 32753 states and 74252 transitions. Second operand 3 states. [2019-12-19 04:01:00,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:01:00,469 INFO L93 Difference]: Finished difference Result 41132 states and 92435 transitions. [2019-12-19 04:01:00,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:01:00,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-12-19 04:01:00,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:01:00,508 INFO L225 Difference]: With dead ends: 41132 [2019-12-19 04:01:00,508 INFO L226 Difference]: Without dead ends: 41132 [2019-12-19 04:01:00,508 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 04:01:00,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41132 states. [2019-12-19 04:01:00,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41132 to 40765. [2019-12-19 04:01:00,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40765 states. [2019-12-19 04:01:00,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40765 states to 40765 states and 91645 transitions. [2019-12-19 04:01:00,926 INFO L78 Accepts]: Start accepts. Automaton has 40765 states and 91645 transitions. Word has length 114 [2019-12-19 04:01:00,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:01:00,927 INFO L462 AbstractCegarLoop]: Abstraction has 40765 states and 91645 transitions. [2019-12-19 04:01:00,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:01:00,927 INFO L276 IsEmpty]: Start isEmpty. Operand 40765 states and 91645 transitions. [2019-12-19 04:01:00,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-19 04:01:00,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:01:00,975 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:01:00,975 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:01:00,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:01:00,976 INFO L82 PathProgramCache]: Analyzing trace with hash -665885578, now seen corresponding path program 1 times [2019-12-19 04:01:00,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:01:00,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182355360] [2019-12-19 04:01:00,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:01:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:01:01,119 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 04:01:01,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182355360] [2019-12-19 04:01:01,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:01:01,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 04:01:01,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725130920] [2019-12-19 04:01:01,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 04:01:01,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:01:01,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 04:01:01,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:01:01,122 INFO L87 Difference]: Start difference. First operand 40765 states and 91645 transitions. Second operand 8 states. [2019-12-19 04:01:02,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:01:02,025 INFO L93 Difference]: Finished difference Result 48646 states and 108944 transitions. [2019-12-19 04:01:02,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 04:01:02,025 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 114 [2019-12-19 04:01:02,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:01:02,081 INFO L225 Difference]: With dead ends: 48646 [2019-12-19 04:01:02,081 INFO L226 Difference]: Without dead ends: 48646 [2019-12-19 04:01:02,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-12-19 04:01:02,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48646 states. [2019-12-19 04:01:02,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48646 to 42736. [2019-12-19 04:01:02,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42736 states. [2019-12-19 04:01:02,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42736 states to 42736 states and 95979 transitions. [2019-12-19 04:01:02,596 INFO L78 Accepts]: Start accepts. Automaton has 42736 states and 95979 transitions. Word has length 114 [2019-12-19 04:01:02,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:01:02,597 INFO L462 AbstractCegarLoop]: Abstraction has 42736 states and 95979 transitions. [2019-12-19 04:01:02,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 04:01:02,597 INFO L276 IsEmpty]: Start isEmpty. Operand 42736 states and 95979 transitions. [2019-12-19 04:01:02,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-19 04:01:02,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:01:02,635 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:01:02,635 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:01:02,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:01:02,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1079723378, now seen corresponding path program 1 times [2019-12-19 04:01:02,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:01:02,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146250837] [2019-12-19 04:01:02,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:01:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:01:02,795 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 04:01:02,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146250837] [2019-12-19 04:01:02,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:01:02,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:01:02,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349093905] [2019-12-19 04:01:02,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:01:02,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:01:02,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:01:02,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:01:02,797 INFO L87 Difference]: Start difference. First operand 42736 states and 95979 transitions. Second operand 6 states. [2019-12-19 04:01:03,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:01:03,403 INFO L93 Difference]: Finished difference Result 47483 states and 106810 transitions. [2019-12-19 04:01:03,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:01:03,404 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2019-12-19 04:01:03,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:01:03,455 INFO L225 Difference]: With dead ends: 47483 [2019-12-19 04:01:03,455 INFO L226 Difference]: Without dead ends: 47483 [2019-12-19 04:01:03,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-19 04:01:03,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47483 states. [2019-12-19 04:01:03,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47483 to 42238. [2019-12-19 04:01:03,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42238 states. [2019-12-19 04:01:03,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42238 states to 42238 states and 94881 transitions. [2019-12-19 04:01:03,924 INFO L78 Accepts]: Start accepts. Automaton has 42238 states and 94881 transitions. Word has length 114 [2019-12-19 04:01:03,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:01:03,924 INFO L462 AbstractCegarLoop]: Abstraction has 42238 states and 94881 transitions. [2019-12-19 04:01:03,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:01:03,924 INFO L276 IsEmpty]: Start isEmpty. Operand 42238 states and 94881 transitions. [2019-12-19 04:01:03,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-19 04:01:03,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:01:03,961 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:03,961 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:01:03,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:01:03,962 INFO L82 PathProgramCache]: Analyzing trace with hash 598555036, now seen corresponding path program 2 times [2019-12-19 04:01:03,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:01:03,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217080453] [2019-12-19 04:01:03,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:01:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:01:04,087 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 04:01:04,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217080453] [2019-12-19 04:01:04,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:01:04,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 04:01:04,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046703959] [2019-12-19 04:01:04,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 04:01:04,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:01:04,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 04:01:04,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:01:04,089 INFO L87 Difference]: Start difference. First operand 42238 states and 94881 transitions. Second operand 8 states. [2019-12-19 04:01:04,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:01:04,882 INFO L93 Difference]: Finished difference Result 50294 states and 112863 transitions. [2019-12-19 04:01:04,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 04:01:04,882 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 114 [2019-12-19 04:01:04,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:01:04,937 INFO L225 Difference]: With dead ends: 50294 [2019-12-19 04:01:04,937 INFO L226 Difference]: Without dead ends: 50294 [2019-12-19 04:01:04,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-19 04:01:05,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50294 states. [2019-12-19 04:01:05,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50294 to 40967. [2019-12-19 04:01:05,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40967 states. [2019-12-19 04:01:05,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40967 states to 40967 states and 92041 transitions. [2019-12-19 04:01:05,636 INFO L78 Accepts]: Start accepts. Automaton has 40967 states and 92041 transitions. Word has length 114 [2019-12-19 04:01:05,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:01:05,636 INFO L462 AbstractCegarLoop]: Abstraction has 40967 states and 92041 transitions. [2019-12-19 04:01:05,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 04:01:05,636 INFO L276 IsEmpty]: Start isEmpty. Operand 40967 states and 92041 transitions. [2019-12-19 04:01:05,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-19 04:01:05,672 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:01:05,672 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:01:05,672 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:01:05,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:01:05,673 INFO L82 PathProgramCache]: Analyzing trace with hash -432842779, now seen corresponding path program 4 times [2019-12-19 04:01:05,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:01:05,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557090504] [2019-12-19 04:01:05,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:01:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:01:05,791 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 04:01:05,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557090504] [2019-12-19 04:01:05,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:01:05,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 04:01:05,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802164326] [2019-12-19 04:01:05,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 04:01:05,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:01:05,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 04:01:05,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:01:05,793 INFO L87 Difference]: Start difference. First operand 40967 states and 92041 transitions. Second operand 8 states. [2019-12-19 04:01:06,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:01:06,995 INFO L93 Difference]: Finished difference Result 56137 states and 126963 transitions. [2019-12-19 04:01:06,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 04:01:06,995 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 114 [2019-12-19 04:01:06,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:01:07,056 INFO L225 Difference]: With dead ends: 56137 [2019-12-19 04:01:07,057 INFO L226 Difference]: Without dead ends: 56137 [2019-12-19 04:01:07,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-12-19 04:01:07,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56137 states. [2019-12-19 04:01:07,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56137 to 40633. [2019-12-19 04:01:07,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40633 states. [2019-12-19 04:01:07,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40633 states to 40633 states and 91335 transitions. [2019-12-19 04:01:07,598 INFO L78 Accepts]: Start accepts. Automaton has 40633 states and 91335 transitions. Word has length 114 [2019-12-19 04:01:07,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:01:07,598 INFO L462 AbstractCegarLoop]: Abstraction has 40633 states and 91335 transitions. [2019-12-19 04:01:07,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 04:01:07,599 INFO L276 IsEmpty]: Start isEmpty. Operand 40633 states and 91335 transitions. [2019-12-19 04:01:07,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-19 04:01:07,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:01:07,633 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:07,633 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:01:07,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:01:07,634 INFO L82 PathProgramCache]: Analyzing trace with hash -977113266, now seen corresponding path program 2 times [2019-12-19 04:01:07,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:01:07,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289344077] [2019-12-19 04:01:07,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:01:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:01:07,691 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 04:01:07,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289344077] [2019-12-19 04:01:07,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:01:07,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:01:07,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310494783] [2019-12-19 04:01:07,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:01:07,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:01:07,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:01:07,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:01:07,694 INFO L87 Difference]: Start difference. First operand 40633 states and 91335 transitions. Second operand 5 states. [2019-12-19 04:01:08,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:01:08,032 INFO L93 Difference]: Finished difference Result 41775 states and 93684 transitions. [2019-12-19 04:01:08,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:01:08,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-12-19 04:01:08,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:01:08,074 INFO L225 Difference]: With dead ends: 41775 [2019-12-19 04:01:08,075 INFO L226 Difference]: Without dead ends: 41775 [2019-12-19 04:01:08,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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 04:01:08,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41775 states. [2019-12-19 04:01:08,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41775 to 40781. [2019-12-19 04:01:08,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40781 states. [2019-12-19 04:01:08,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40781 states to 40781 states and 91643 transitions. [2019-12-19 04:01:08,738 INFO L78 Accepts]: Start accepts. Automaton has 40781 states and 91643 transitions. Word has length 114 [2019-12-19 04:01:08,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:01:08,738 INFO L462 AbstractCegarLoop]: Abstraction has 40781 states and 91643 transitions. [2019-12-19 04:01:08,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:01:08,738 INFO L276 IsEmpty]: Start isEmpty. Operand 40781 states and 91643 transitions. [2019-12-19 04:01:08,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-19 04:01:08,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:01:08,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:08,774 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:01:08,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:01:08,774 INFO L82 PathProgramCache]: Analyzing trace with hash 448032188, now seen corresponding path program 3 times [2019-12-19 04:01:08,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:01:08,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544539529] [2019-12-19 04:01:08,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:01:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:01:08,836 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 04:01:08,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544539529] [2019-12-19 04:01:08,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:01:08,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:01:08,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299035637] [2019-12-19 04:01:08,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:01:08,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:01:08,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:01:08,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:01:08,838 INFO L87 Difference]: Start difference. First operand 40781 states and 91643 transitions. Second operand 6 states. [2019-12-19 04:01:09,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:01:09,517 INFO L93 Difference]: Finished difference Result 43549 states and 97411 transitions. [2019-12-19 04:01:09,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 04:01:09,518 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2019-12-19 04:01:09,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:01:09,576 INFO L225 Difference]: With dead ends: 43549 [2019-12-19 04:01:09,576 INFO L226 Difference]: Without dead ends: 43531 [2019-12-19 04:01:09,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-19 04:01:09,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43531 states. [2019-12-19 04:01:09,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43531 to 41136. [2019-12-19 04:01:09,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41136 states. [2019-12-19 04:01:10,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41136 states to 41136 states and 92404 transitions. [2019-12-19 04:01:10,036 INFO L78 Accepts]: Start accepts. Automaton has 41136 states and 92404 transitions. Word has length 114 [2019-12-19 04:01:10,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:01:10,036 INFO L462 AbstractCegarLoop]: Abstraction has 41136 states and 92404 transitions. [2019-12-19 04:01:10,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:01:10,036 INFO L276 IsEmpty]: Start isEmpty. Operand 41136 states and 92404 transitions. [2019-12-19 04:01:10,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-19 04:01:10,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:01:10,072 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:01:10,072 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:01:10,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:01:10,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1850989116, now seen corresponding path program 1 times [2019-12-19 04:01:10,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:01:10,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904769228] [2019-12-19 04:01:10,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:01:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:01:10,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 04:01:10,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904769228] [2019-12-19 04:01:10,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:01:10,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-19 04:01:10,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071562491] [2019-12-19 04:01:10,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-19 04:01:10,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:01:10,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-19 04:01:10,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-19 04:01:10,205 INFO L87 Difference]: Start difference. First operand 41136 states and 92404 transitions. Second operand 11 states. [2019-12-19 04:01:10,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:01:10,892 INFO L93 Difference]: Finished difference Result 65495 states and 147510 transitions. [2019-12-19 04:01:10,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 04:01:10,893 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 116 [2019-12-19 04:01:10,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:01:10,964 INFO L225 Difference]: With dead ends: 65495 [2019-12-19 04:01:10,964 INFO L226 Difference]: Without dead ends: 59131 [2019-12-19 04:01:10,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2019-12-19 04:01:11,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59131 states. [2019-12-19 04:01:11,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59131 to 43917. [2019-12-19 04:01:11,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43917 states. [2019-12-19 04:01:11,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43917 states to 43917 states and 98399 transitions. [2019-12-19 04:01:11,535 INFO L78 Accepts]: Start accepts. Automaton has 43917 states and 98399 transitions. Word has length 116 [2019-12-19 04:01:11,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:01:11,535 INFO L462 AbstractCegarLoop]: Abstraction has 43917 states and 98399 transitions. [2019-12-19 04:01:11,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-19 04:01:11,536 INFO L276 IsEmpty]: Start isEmpty. Operand 43917 states and 98399 transitions. [2019-12-19 04:01:11,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-19 04:01:11,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:01:11,880 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:01:11,880 INFO L410 AbstractCegarLoop]: === Iteration 44 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:01:11,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:01:11,880 INFO L82 PathProgramCache]: Analyzing trace with hash 698796334, now seen corresponding path program 2 times [2019-12-19 04:01:11,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:01:11,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603514832] [2019-12-19 04:01:11,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:01:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 04:01:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 04:01:11,998 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 04:01:11,998 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 04:01:12,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 04:01:12 BasicIcfg [2019-12-19 04:01:12,245 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 04:01:12,247 INFO L168 Benchmark]: Toolchain (without parser) took 168220.48 ms. Allocated memory was 146.8 MB in the beginning and 5.3 GB in the end (delta: 5.1 GB). Free memory was 101.9 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2019-12-19 04:01:12,248 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 146.8 MB. Free memory is still 121.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-19 04:01:12,248 INFO L168 Benchmark]: CACSL2BoogieTranslator took 940.76 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 101.5 MB in the beginning and 157.2 MB in the end (delta: -55.7 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-19 04:01:12,249 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.05 ms. Allocated memory is still 205.0 MB. Free memory was 157.2 MB in the beginning and 154.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-19 04:01:12,249 INFO L168 Benchmark]: Boogie Preprocessor took 44.85 ms. Allocated memory is still 205.0 MB. Free memory was 154.2 MB in the beginning and 151.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-19 04:01:12,249 INFO L168 Benchmark]: RCFGBuilder took 1168.30 ms. Allocated memory is still 205.0 MB. Free memory was 151.4 MB in the beginning and 95.8 MB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 7.1 GB. [2019-12-19 04:01:12,250 INFO L168 Benchmark]: TraceAbstraction took 165976.82 ms. Allocated memory was 205.0 MB in the beginning and 5.3 GB in the end (delta: 5.1 GB). Free memory was 95.5 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2019-12-19 04:01:12,252 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.50 ms. Allocated memory is still 146.8 MB. Free memory is still 121.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 940.76 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 101.5 MB in the beginning and 157.2 MB in the end (delta: -55.7 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 83.05 ms. Allocated memory is still 205.0 MB. Free memory was 157.2 MB in the beginning and 154.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.85 ms. Allocated memory is still 205.0 MB. Free memory was 154.2 MB in the beginning and 151.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1168.30 ms. Allocated memory is still 205.0 MB. Free memory was 151.4 MB in the beginning and 95.8 MB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 165976.82 ms. Allocated memory was 205.0 MB in the beginning and 5.3 GB in the end (delta: 5.1 GB). Free memory was 95.5 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L701] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L703] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L704] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L705] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L707] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L708] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L709] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L710] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L711] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L712] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L713] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L714] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L715] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L716] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L717] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L718] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L719] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L720] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L721] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L723] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L725] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L817] 0 pthread_t t1721; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L818] FCALL, FORK 0 pthread_create(&t1721, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L819] 0 pthread_t t1722; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] FCALL, FORK 0 pthread_create(&t1722, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 1 x$w_buff1 = x$w_buff0 [L730] 1 x$w_buff0 = 1 [L731] 1 x$w_buff1_used = x$w_buff0_used [L732] 1 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L734] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L735] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L736] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L737] 1 x$r_buff0_thd1 = (_Bool)1 [L740] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L741] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L742] 1 x$flush_delayed = weak$$choice2 [L743] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L745] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L745] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L746] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L746] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L747] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L748] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L749] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L750] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L750] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] 1 x = x$flush_delayed ? x$mem_tmp : x [L753] 1 x$flush_delayed = (_Bool)0 [L756] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 [L776] 2 __unbuffered_p1_EAX = y [L779] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 2 x$flush_delayed = weak$$choice2 [L782] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L784] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L784] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L785] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L786] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L786] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L787] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L788] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L789] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L791] EXPR 2 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L759] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L760] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L761] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L762] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L762] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L763] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L763] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L766] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L791] 2 x = x$flush_delayed ? x$mem_tmp : x [L792] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=1] [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=1] [L795] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L796] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L796] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L797] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L826] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L828] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L829] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L830] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L830] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L833] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 185 locations, 2 error locations. Result: UNSAFE, OverallTime: 165.5s, OverallIterations: 44, TraceHistogramMax: 1, AutomataDifference: 67.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 18725 SDtfs, 19422 SDslu, 46870 SDs, 0 SdLazy, 18098 SolverSat, 891 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 491 GetRequests, 133 SyntacticMatches, 38 SemanticMatches, 320 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=278543occurred 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: 78.2s AutomataMinimizationTime, 43 MinimizatonAttempts, 370210 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 3990 NumberOfCodeBlocks, 3990 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 3831 ConstructedInterpolants, 0 QuantifiedInterpolants, 888033 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 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...