/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 03:53:15,002 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 03:53:15,005 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 03:53:15,024 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 03:53:15,025 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 03:53:15,027 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 03:53:15,030 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 03:53:15,037 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 03:53:15,039 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 03:53:15,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 03:53:15,044 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 03:53:15,046 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 03:53:15,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 03:53:15,050 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 03:53:15,053 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 03:53:15,055 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 03:53:15,057 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 03:53:15,060 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 03:53:15,061 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 03:53:15,067 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 03:53:15,072 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 03:53:15,075 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 03:53:15,077 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 03:53:15,077 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 03:53:15,080 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 03:53:15,080 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 03:53:15,081 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 03:53:15,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 03:53:15,084 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 03:53:15,085 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 03:53:15,086 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 03:53:15,087 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 03:53:15,088 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 03:53:15,089 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 03:53:15,091 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 03:53:15,091 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 03:53:15,092 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 03:53:15,092 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 03:53:15,093 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 03:53:15,094 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 03:53:15,096 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 03:53:15,097 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-MCR.epf [2019-12-28 03:53:15,119 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 03:53:15,120 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 03:53:15,122 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 03:53:15,122 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 03:53:15,122 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 03:53:15,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 03:53:15,123 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 03:53:15,123 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 03:53:15,123 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 03:53:15,123 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 03:53:15,124 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 03:53:15,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 03:53:15,125 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 03:53:15,125 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 03:53:15,126 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 03:53:15,126 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 03:53:15,126 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 03:53:15,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 03:53:15,126 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 03:53:15,127 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 03:53:15,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 03:53:15,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 03:53:15,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 03:53:15,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 03:53:15,128 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 03:53:15,128 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 03:53:15,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 03:53:15,128 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 03:53:15,128 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 03:53:15,129 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 03:53:15,130 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 03:53:15,130 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 03:53:15,438 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 03:53:15,459 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 03:53:15,462 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 03:53:15,464 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 03:53:15,465 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 03:53:15,466 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc.i [2019-12-28 03:53:15,548 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3eb116179/3cf50370ff92451bbbc463b0b78b1546/FLAGc6a69f45e [2019-12-28 03:53:16,102 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 03:53:16,103 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc.i [2019-12-28 03:53:16,129 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3eb116179/3cf50370ff92451bbbc463b0b78b1546/FLAGc6a69f45e [2019-12-28 03:53:16,373 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3eb116179/3cf50370ff92451bbbc463b0b78b1546 [2019-12-28 03:53:16,386 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 03:53:16,388 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 03:53:16,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 03:53:16,394 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 03:53:16,397 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 03:53:16,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:53:16" (1/1) ... [2019-12-28 03:53:16,402 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1da86fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:53:16, skipping insertion in model container [2019-12-28 03:53:16,402 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:53:16" (1/1) ... [2019-12-28 03:53:16,411 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 03:53:16,482 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 03:53:17,071 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:53:17,090 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 03:53:17,155 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:53:17,231 INFO L208 MainTranslator]: Completed translation [2019-12-28 03:53:17,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:53:17 WrapperNode [2019-12-28 03:53:17,232 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 03:53:17,233 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 03:53:17,233 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 03:53:17,233 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 03:53:17,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:53:17" (1/1) ... [2019-12-28 03:53:17,263 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:53:17" (1/1) ... [2019-12-28 03:53:17,297 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 03:53:17,298 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 03:53:17,298 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 03:53:17,298 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 03:53:17,306 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:53:17" (1/1) ... [2019-12-28 03:53:17,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:53:17" (1/1) ... [2019-12-28 03:53:17,312 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:53:17" (1/1) ... [2019-12-28 03:53:17,312 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:53:17" (1/1) ... [2019-12-28 03:53:17,324 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:53:17" (1/1) ... [2019-12-28 03:53:17,330 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:53:17" (1/1) ... [2019-12-28 03:53:17,334 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:53:17" (1/1) ... [2019-12-28 03:53:17,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 03:53:17,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 03:53:17,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 03:53:17,340 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 03:53:17,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:53:17" (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-28 03:53:17,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 03:53:17,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 03:53:17,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 03:53:17,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 03:53:17,403 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 03:53:17,403 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 03:53:17,403 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 03:53:17,404 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 03:53:17,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 03:53:17,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 03:53:17,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 03:53:17,406 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-28 03:53:18,157 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 03:53:18,157 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 03:53:18,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:53:18 BoogieIcfgContainer [2019-12-28 03:53:18,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 03:53:18,160 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 03:53:18,160 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 03:53:18,164 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 03:53:18,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 03:53:16" (1/3) ... [2019-12-28 03:53:18,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb6a79e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:53:18, skipping insertion in model container [2019-12-28 03:53:18,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:53:17" (2/3) ... [2019-12-28 03:53:18,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb6a79e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:53:18, skipping insertion in model container [2019-12-28 03:53:18,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:53:18" (3/3) ... [2019-12-28 03:53:18,169 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_power.oepc.i [2019-12-28 03:53:18,180 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 03:53:18,181 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 03:53:18,189 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 03:53:18,190 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 03:53:18,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,231 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,232 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,232 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,233 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,233 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,243 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,243 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,277 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,277 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,278 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,301 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,303 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:53:18,321 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 03:53:18,344 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 03:53:18,344 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 03:53:18,344 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 03:53:18,344 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 03:53:18,345 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 03:53:18,345 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 03:53:18,345 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 03:53:18,345 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 03:53:18,360 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 147 places, 181 transitions [2019-12-28 03:53:20,471 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32591 states. [2019-12-28 03:53:20,473 INFO L276 IsEmpty]: Start isEmpty. Operand 32591 states. [2019-12-28 03:53:20,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-28 03:53:20,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:53:20,482 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] [2019-12-28 03:53:20,483 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:53:20,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:53:20,488 INFO L82 PathProgramCache]: Analyzing trace with hash -79944004, now seen corresponding path program 1 times [2019-12-28 03:53:20,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:53:20,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797746498] [2019-12-28 03:53:20,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:53:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:53:20,845 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-28 03:53:20,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797746498] [2019-12-28 03:53:20,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:53:20,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:53:20,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2006834781] [2019-12-28 03:53:20,849 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:53:20,855 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:53:20,875 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 34 transitions. [2019-12-28 03:53:20,875 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:53:20,880 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:53:20,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:53:20,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:53:20,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:53:20,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:53:20,902 INFO L87 Difference]: Start difference. First operand 32591 states. Second operand 4 states. [2019-12-28 03:53:22,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:53:22,434 INFO L93 Difference]: Finished difference Result 33591 states and 129568 transitions. [2019-12-28 03:53:22,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:53:22,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-28 03:53:22,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:53:22,691 INFO L225 Difference]: With dead ends: 33591 [2019-12-28 03:53:22,692 INFO L226 Difference]: Without dead ends: 25703 [2019-12-28 03:53:22,693 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-28 03:53:22,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25703 states. [2019-12-28 03:53:23,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25703 to 25703. [2019-12-28 03:53:23,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25703 states. [2019-12-28 03:53:24,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25703 states to 25703 states and 99584 transitions. [2019-12-28 03:53:24,027 INFO L78 Accepts]: Start accepts. Automaton has 25703 states and 99584 transitions. Word has length 34 [2019-12-28 03:53:24,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:53:24,027 INFO L462 AbstractCegarLoop]: Abstraction has 25703 states and 99584 transitions. [2019-12-28 03:53:24,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:53:24,028 INFO L276 IsEmpty]: Start isEmpty. Operand 25703 states and 99584 transitions. [2019-12-28 03:53:24,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-28 03:53:24,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:53:24,036 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] [2019-12-28 03:53:24,036 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:53:24,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:53:24,037 INFO L82 PathProgramCache]: Analyzing trace with hash -352982198, now seen corresponding path program 1 times [2019-12-28 03:53:24,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:53:24,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743070508] [2019-12-28 03:53:24,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:53:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:53:24,185 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-28 03:53:24,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743070508] [2019-12-28 03:53:24,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:53:24,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:53:24,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [329526135] [2019-12-28 03:53:24,187 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:53:24,192 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:53:24,400 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 47 states and 46 transitions. [2019-12-28 03:53:24,400 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:53:24,401 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:53:24,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:53:24,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:53:24,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:53:24,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:53:24,404 INFO L87 Difference]: Start difference. First operand 25703 states and 99584 transitions. Second operand 5 states. [2019-12-28 03:53:25,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:53:25,344 INFO L93 Difference]: Finished difference Result 41081 states and 150431 transitions. [2019-12-28 03:53:25,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:53:25,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-28 03:53:25,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:53:25,507 INFO L225 Difference]: With dead ends: 41081 [2019-12-28 03:53:25,508 INFO L226 Difference]: Without dead ends: 40545 [2019-12-28 03:53:25,509 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-28 03:53:27,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40545 states. [2019-12-28 03:53:28,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40545 to 38925. [2019-12-28 03:53:28,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38925 states. [2019-12-28 03:53:28,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38925 states to 38925 states and 143581 transitions. [2019-12-28 03:53:28,265 INFO L78 Accepts]: Start accepts. Automaton has 38925 states and 143581 transitions. Word has length 46 [2019-12-28 03:53:28,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:53:28,269 INFO L462 AbstractCegarLoop]: Abstraction has 38925 states and 143581 transitions. [2019-12-28 03:53:28,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:53:28,269 INFO L276 IsEmpty]: Start isEmpty. Operand 38925 states and 143581 transitions. [2019-12-28 03:53:28,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-28 03:53:28,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:53:28,285 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:53:28,285 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:53:28,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:53:28,286 INFO L82 PathProgramCache]: Analyzing trace with hash -216993211, now seen corresponding path program 1 times [2019-12-28 03:53:28,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:53:28,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110125204] [2019-12-28 03:53:28,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:53:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:53:28,366 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-28 03:53:28,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110125204] [2019-12-28 03:53:28,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:53:28,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:53:28,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1250712607] [2019-12-28 03:53:28,367 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:53:28,373 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:53:28,379 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 47 transitions. [2019-12-28 03:53:28,379 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:53:28,379 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:53:28,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:53:28,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:53:28,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:53:28,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:53:28,381 INFO L87 Difference]: Start difference. First operand 38925 states and 143581 transitions. Second operand 5 states. [2019-12-28 03:53:30,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:53:30,439 INFO L93 Difference]: Finished difference Result 49778 states and 180633 transitions. [2019-12-28 03:53:30,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:53:30,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-28 03:53:30,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:53:30,622 INFO L225 Difference]: With dead ends: 49778 [2019-12-28 03:53:30,622 INFO L226 Difference]: Without dead ends: 49274 [2019-12-28 03:53:30,623 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-28 03:53:30,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49274 states. [2019-12-28 03:53:31,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49274 to 42677. [2019-12-28 03:53:31,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42677 states. [2019-12-28 03:53:31,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42677 states to 42677 states and 156592 transitions. [2019-12-28 03:53:31,957 INFO L78 Accepts]: Start accepts. Automaton has 42677 states and 156592 transitions. Word has length 47 [2019-12-28 03:53:31,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:53:31,957 INFO L462 AbstractCegarLoop]: Abstraction has 42677 states and 156592 transitions. [2019-12-28 03:53:31,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:53:31,957 INFO L276 IsEmpty]: Start isEmpty. Operand 42677 states and 156592 transitions. [2019-12-28 03:53:31,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-28 03:53:31,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:53:31,965 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-28 03:53:31,965 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:53:31,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:53:31,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1400815125, now seen corresponding path program 1 times [2019-12-28 03:53:31,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:53:31,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738746120] [2019-12-28 03:53:31,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:53:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:53:32,025 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-28 03:53:32,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738746120] [2019-12-28 03:53:32,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:53:32,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:53:32,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [254522642] [2019-12-28 03:53:32,026 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:53:32,032 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:53:32,038 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 49 transitions. [2019-12-28 03:53:32,038 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:53:32,040 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:53:32,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:53:32,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:53:32,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:53:32,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:53:32,043 INFO L87 Difference]: Start difference. First operand 42677 states and 156592 transitions. Second operand 3 states. [2019-12-28 03:53:32,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:53:32,788 INFO L93 Difference]: Finished difference Result 61087 states and 221430 transitions. [2019-12-28 03:53:32,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:53:32,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-12-28 03:53:32,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:53:32,996 INFO L225 Difference]: With dead ends: 61087 [2019-12-28 03:53:32,996 INFO L226 Difference]: Without dead ends: 61087 [2019-12-28 03:53:32,997 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-28 03:53:33,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61087 states. [2019-12-28 03:53:35,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61087 to 48016. [2019-12-28 03:53:35,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48016 states. [2019-12-28 03:53:35,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48016 states to 48016 states and 174179 transitions. [2019-12-28 03:53:35,964 INFO L78 Accepts]: Start accepts. Automaton has 48016 states and 174179 transitions. Word has length 49 [2019-12-28 03:53:35,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:53:35,964 INFO L462 AbstractCegarLoop]: Abstraction has 48016 states and 174179 transitions. [2019-12-28 03:53:35,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:53:35,964 INFO L276 IsEmpty]: Start isEmpty. Operand 48016 states and 174179 transitions. [2019-12-28 03:53:35,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-28 03:53:35,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:53:35,983 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] [2019-12-28 03:53:35,983 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:53:35,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:53:35,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1223127365, now seen corresponding path program 1 times [2019-12-28 03:53:35,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:53:35,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501561654] [2019-12-28 03:53:35,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:53:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:53:36,044 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-28 03:53:36,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501561654] [2019-12-28 03:53:36,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:53:36,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:53:36,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2000877310] [2019-12-28 03:53:36,045 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:53:36,051 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:53:36,057 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 65 transitions. [2019-12-28 03:53:36,057 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:53:36,061 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:53:36,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:53:36,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:53:36,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:53:36,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:53:36,062 INFO L87 Difference]: Start difference. First operand 48016 states and 174179 transitions. Second operand 3 states. [2019-12-28 03:53:36,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:53:36,554 INFO L93 Difference]: Finished difference Result 53336 states and 193527 transitions. [2019-12-28 03:53:36,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:53:36,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-28 03:53:36,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:53:36,672 INFO L225 Difference]: With dead ends: 53336 [2019-12-28 03:53:36,672 INFO L226 Difference]: Without dead ends: 53336 [2019-12-28 03:53:36,673 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-28 03:53:37,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53336 states. [2019-12-28 03:53:37,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53336 to 50674. [2019-12-28 03:53:37,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50674 states. [2019-12-28 03:53:38,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50674 states to 50674 states and 183847 transitions. [2019-12-28 03:53:38,086 INFO L78 Accepts]: Start accepts. Automaton has 50674 states and 183847 transitions. Word has length 53 [2019-12-28 03:53:38,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:53:38,086 INFO L462 AbstractCegarLoop]: Abstraction has 50674 states and 183847 transitions. [2019-12-28 03:53:38,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:53:38,087 INFO L276 IsEmpty]: Start isEmpty. Operand 50674 states and 183847 transitions. [2019-12-28 03:53:38,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-28 03:53:38,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:53:38,101 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] [2019-12-28 03:53:38,101 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:53:38,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:53:38,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1557788475, now seen corresponding path program 1 times [2019-12-28 03:53:38,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:53:38,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444824008] [2019-12-28 03:53:38,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:53:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:53:38,255 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-28 03:53:38,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444824008] [2019-12-28 03:53:38,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:53:38,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:53:38,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [613020895] [2019-12-28 03:53:38,256 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:53:38,262 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:53:38,269 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 65 transitions. [2019-12-28 03:53:38,269 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:53:38,271 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:53:38,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:53:38,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:53:38,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:53:38,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:53:38,272 INFO L87 Difference]: Start difference. First operand 50674 states and 183847 transitions. Second operand 6 states. [2019-12-28 03:53:40,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:53:40,575 INFO L93 Difference]: Finished difference Result 65266 states and 234905 transitions. [2019-12-28 03:53:40,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:53:40,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-28 03:53:40,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:53:40,721 INFO L225 Difference]: With dead ends: 65266 [2019-12-28 03:53:40,721 INFO L226 Difference]: Without dead ends: 65266 [2019-12-28 03:53:40,721 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-28 03:53:41,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65266 states. [2019-12-28 03:53:41,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65266 to 59949. [2019-12-28 03:53:41,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59949 states. [2019-12-28 03:53:42,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59949 states to 59949 states and 215672 transitions. [2019-12-28 03:53:42,116 INFO L78 Accepts]: Start accepts. Automaton has 59949 states and 215672 transitions. Word has length 53 [2019-12-28 03:53:42,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:53:42,117 INFO L462 AbstractCegarLoop]: Abstraction has 59949 states and 215672 transitions. [2019-12-28 03:53:42,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:53:42,117 INFO L276 IsEmpty]: Start isEmpty. Operand 59949 states and 215672 transitions. [2019-12-28 03:53:42,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-28 03:53:42,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:53:42,135 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] [2019-12-28 03:53:42,135 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:53:42,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:53:42,135 INFO L82 PathProgramCache]: Analyzing trace with hash -239162884, now seen corresponding path program 1 times [2019-12-28 03:53:42,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:53:42,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379377647] [2019-12-28 03:53:42,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:53:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:53:42,260 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-28 03:53:42,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379377647] [2019-12-28 03:53:42,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:53:42,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:53:42,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1331214312] [2019-12-28 03:53:42,261 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:53:42,267 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:53:42,273 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 65 transitions. [2019-12-28 03:53:42,274 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:53:42,274 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:53:42,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:53:42,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:53:42,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:53:42,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:53:42,275 INFO L87 Difference]: Start difference. First operand 59949 states and 215672 transitions. Second operand 7 states. [2019-12-28 03:53:44,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:53:44,274 INFO L93 Difference]: Finished difference Result 83685 states and 290097 transitions. [2019-12-28 03:53:44,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 03:53:44,279 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-28 03:53:44,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:53:44,475 INFO L225 Difference]: With dead ends: 83685 [2019-12-28 03:53:44,476 INFO L226 Difference]: Without dead ends: 83685 [2019-12-28 03:53:44,476 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-28 03:53:44,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83685 states. [2019-12-28 03:53:48,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83685 to 71012. [2019-12-28 03:53:48,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71012 states. [2019-12-28 03:53:48,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71012 states to 71012 states and 249886 transitions. [2019-12-28 03:53:48,491 INFO L78 Accepts]: Start accepts. Automaton has 71012 states and 249886 transitions. Word has length 53 [2019-12-28 03:53:48,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:53:48,492 INFO L462 AbstractCegarLoop]: Abstraction has 71012 states and 249886 transitions. [2019-12-28 03:53:48,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:53:48,492 INFO L276 IsEmpty]: Start isEmpty. Operand 71012 states and 249886 transitions. [2019-12-28 03:53:48,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-28 03:53:48,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:53:48,504 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] [2019-12-28 03:53:48,504 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:53:48,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:53:48,505 INFO L82 PathProgramCache]: Analyzing trace with hash 648340797, now seen corresponding path program 1 times [2019-12-28 03:53:48,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:53:48,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705125037] [2019-12-28 03:53:48,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:53:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:53:48,571 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-28 03:53:48,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705125037] [2019-12-28 03:53:48,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:53:48,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:53:48,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1638119157] [2019-12-28 03:53:48,572 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:53:48,578 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:53:48,584 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 65 transitions. [2019-12-28 03:53:48,584 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:53:48,585 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:53:48,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:53:48,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:53:48,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:53:48,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:53:48,586 INFO L87 Difference]: Start difference. First operand 71012 states and 249886 transitions. Second operand 3 states. [2019-12-28 03:53:48,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:53:48,820 INFO L93 Difference]: Finished difference Result 54021 states and 188918 transitions. [2019-12-28 03:53:48,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:53:48,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-28 03:53:48,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:53:48,922 INFO L225 Difference]: With dead ends: 54021 [2019-12-28 03:53:48,922 INFO L226 Difference]: Without dead ends: 54021 [2019-12-28 03:53:48,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:53:49,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54021 states. [2019-12-28 03:53:50,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54021 to 53406. [2019-12-28 03:53:50,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53406 states. [2019-12-28 03:53:50,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53406 states to 53406 states and 187037 transitions. [2019-12-28 03:53:50,291 INFO L78 Accepts]: Start accepts. Automaton has 53406 states and 187037 transitions. Word has length 53 [2019-12-28 03:53:50,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:53:50,291 INFO L462 AbstractCegarLoop]: Abstraction has 53406 states and 187037 transitions. [2019-12-28 03:53:50,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:53:50,291 INFO L276 IsEmpty]: Start isEmpty. Operand 53406 states and 187037 transitions. [2019-12-28 03:53:50,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-28 03:53:50,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:53:50,301 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] [2019-12-28 03:53:50,301 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:53:50,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:53:50,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1742308042, now seen corresponding path program 1 times [2019-12-28 03:53:50,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:53:50,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284433799] [2019-12-28 03:53:50,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:53:50,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:53:50,372 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-28 03:53:50,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284433799] [2019-12-28 03:53:50,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:53:50,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:53:50,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1575283887] [2019-12-28 03:53:50,373 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:53:50,380 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:53:50,389 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 53 transitions. [2019-12-28 03:53:50,389 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:53:50,389 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:53:50,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:53:50,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:53:50,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:53:50,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:53:50,391 INFO L87 Difference]: Start difference. First operand 53406 states and 187037 transitions. Second operand 6 states. [2019-12-28 03:53:51,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:53:51,229 INFO L93 Difference]: Finished difference Result 68646 states and 237301 transitions. [2019-12-28 03:53:51,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 03:53:51,230 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-28 03:53:51,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:53:51,386 INFO L225 Difference]: With dead ends: 68646 [2019-12-28 03:53:51,386 INFO L226 Difference]: Without dead ends: 68078 [2019-12-28 03:53:51,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-28 03:53:51,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68078 states. [2019-12-28 03:53:52,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68078 to 53490. [2019-12-28 03:53:52,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53490 states. [2019-12-28 03:53:53,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53490 states to 53490 states and 187734 transitions. [2019-12-28 03:53:53,113 INFO L78 Accepts]: Start accepts. Automaton has 53490 states and 187734 transitions. Word has length 53 [2019-12-28 03:53:53,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:53:53,114 INFO L462 AbstractCegarLoop]: Abstraction has 53490 states and 187734 transitions. [2019-12-28 03:53:53,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:53:53,114 INFO L276 IsEmpty]: Start isEmpty. Operand 53490 states and 187734 transitions. [2019-12-28 03:53:53,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 03:53:53,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:53:53,124 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:53:53,124 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:53:53,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:53:53,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1362179492, now seen corresponding path program 1 times [2019-12-28 03:53:53,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:53:53,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105229603] [2019-12-28 03:53:53,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:53:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:53:53,241 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-28 03:53:53,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105229603] [2019-12-28 03:53:53,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:53:53,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:53:53,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1174907807] [2019-12-28 03:53:53,243 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:53:53,252 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:53:53,259 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 54 transitions. [2019-12-28 03:53:53,260 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:53:53,260 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:53:53,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:53:53,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:53:53,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:53:53,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:53:53,261 INFO L87 Difference]: Start difference. First operand 53490 states and 187734 transitions. Second operand 6 states. [2019-12-28 03:53:54,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:53:54,165 INFO L93 Difference]: Finished difference Result 67849 states and 231360 transitions. [2019-12-28 03:53:54,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:53:54,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-28 03:53:54,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:53:54,767 INFO L225 Difference]: With dead ends: 67849 [2019-12-28 03:53:54,768 INFO L226 Difference]: Without dead ends: 67849 [2019-12-28 03:53:54,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:53:55,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67849 states. [2019-12-28 03:53:55,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67849 to 59081. [2019-12-28 03:53:55,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59081 states. [2019-12-28 03:53:55,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59081 states to 59081 states and 204130 transitions. [2019-12-28 03:53:55,796 INFO L78 Accepts]: Start accepts. Automaton has 59081 states and 204130 transitions. Word has length 54 [2019-12-28 03:53:55,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:53:55,796 INFO L462 AbstractCegarLoop]: Abstraction has 59081 states and 204130 transitions. [2019-12-28 03:53:55,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:53:55,797 INFO L276 IsEmpty]: Start isEmpty. Operand 59081 states and 204130 transitions. [2019-12-28 03:53:55,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 03:53:55,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:53:55,807 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:53:55,807 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:53:55,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:53:55,807 INFO L82 PathProgramCache]: Analyzing trace with hash -2045284123, now seen corresponding path program 1 times [2019-12-28 03:53:55,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:53:55,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412913653] [2019-12-28 03:53:55,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:53:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:53:55,897 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-28 03:53:55,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412913653] [2019-12-28 03:53:55,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:53:55,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:53:55,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1716472315] [2019-12-28 03:53:55,899 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:53:55,904 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:53:55,909 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 54 transitions. [2019-12-28 03:53:55,909 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:53:55,910 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:53:55,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:53:55,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:53:55,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:53:55,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:53:55,911 INFO L87 Difference]: Start difference. First operand 59081 states and 204130 transitions. Second operand 4 states. [2019-12-28 03:53:55,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:53:55,969 INFO L93 Difference]: Finished difference Result 10212 states and 31246 transitions. [2019-12-28 03:53:55,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:53:55,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-28 03:53:55,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:53:55,982 INFO L225 Difference]: With dead ends: 10212 [2019-12-28 03:53:55,982 INFO L226 Difference]: Without dead ends: 8507 [2019-12-28 03:53:55,982 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-28 03:53:56,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8507 states. [2019-12-28 03:53:56,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8507 to 8459. [2019-12-28 03:53:56,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8459 states. [2019-12-28 03:53:56,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8459 states to 8459 states and 25325 transitions. [2019-12-28 03:53:56,089 INFO L78 Accepts]: Start accepts. Automaton has 8459 states and 25325 transitions. Word has length 54 [2019-12-28 03:53:56,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:53:56,089 INFO L462 AbstractCegarLoop]: Abstraction has 8459 states and 25325 transitions. [2019-12-28 03:53:56,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:53:56,089 INFO L276 IsEmpty]: Start isEmpty. Operand 8459 states and 25325 transitions. [2019-12-28 03:53:56,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-28 03:53:56,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:53:56,093 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] [2019-12-28 03:53:56,093 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:53:56,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:53:56,093 INFO L82 PathProgramCache]: Analyzing trace with hash 324861458, now seen corresponding path program 1 times [2019-12-28 03:53:56,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:53:56,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592793108] [2019-12-28 03:53:56,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:53:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:53:56,145 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-28 03:53:56,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592793108] [2019-12-28 03:53:56,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:53:56,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:53:56,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [149814251] [2019-12-28 03:53:56,146 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:53:56,156 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:53:56,166 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 61 transitions. [2019-12-28 03:53:56,166 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:53:56,167 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:53:56,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:53:56,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:53:56,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:53:56,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:53:56,168 INFO L87 Difference]: Start difference. First operand 8459 states and 25325 transitions. Second operand 4 states. [2019-12-28 03:53:56,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:53:56,300 INFO L93 Difference]: Finished difference Result 9706 states and 29104 transitions. [2019-12-28 03:53:56,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:53:56,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-28 03:53:56,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:53:56,383 INFO L225 Difference]: With dead ends: 9706 [2019-12-28 03:53:56,383 INFO L226 Difference]: Without dead ends: 9706 [2019-12-28 03:53:56,384 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-28 03:53:56,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9706 states. [2019-12-28 03:53:56,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9706 to 8879. [2019-12-28 03:53:56,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8879 states. [2019-12-28 03:53:56,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8879 states to 8879 states and 26588 transitions. [2019-12-28 03:53:56,536 INFO L78 Accepts]: Start accepts. Automaton has 8879 states and 26588 transitions. Word has length 61 [2019-12-28 03:53:56,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:53:56,536 INFO L462 AbstractCegarLoop]: Abstraction has 8879 states and 26588 transitions. [2019-12-28 03:53:56,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:53:56,537 INFO L276 IsEmpty]: Start isEmpty. Operand 8879 states and 26588 transitions. [2019-12-28 03:53:56,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-28 03:53:56,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:53:56,540 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] [2019-12-28 03:53:56,540 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:53:56,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:53:56,540 INFO L82 PathProgramCache]: Analyzing trace with hash 2067671793, now seen corresponding path program 1 times [2019-12-28 03:53:56,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:53:56,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984073798] [2019-12-28 03:53:56,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:53:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:53:56,631 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-28 03:53:56,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984073798] [2019-12-28 03:53:56,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:53:56,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:53:56,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1300665402] [2019-12-28 03:53:56,633 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:53:56,642 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:53:56,653 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 61 transitions. [2019-12-28 03:53:56,653 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:53:56,654 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:53:56,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:53:56,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:53:56,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:53:56,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:53:56,655 INFO L87 Difference]: Start difference. First operand 8879 states and 26588 transitions. Second operand 6 states. [2019-12-28 03:53:57,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:53:57,084 INFO L93 Difference]: Finished difference Result 11195 states and 33075 transitions. [2019-12-28 03:53:57,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 03:53:57,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-28 03:53:57,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:53:57,100 INFO L225 Difference]: With dead ends: 11195 [2019-12-28 03:53:57,100 INFO L226 Difference]: Without dead ends: 11134 [2019-12-28 03:53:57,101 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-28 03:53:57,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11134 states. [2019-12-28 03:53:57,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11134 to 10410. [2019-12-28 03:53:57,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10410 states. [2019-12-28 03:53:57,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10410 states to 10410 states and 30942 transitions. [2019-12-28 03:53:57,236 INFO L78 Accepts]: Start accepts. Automaton has 10410 states and 30942 transitions. Word has length 61 [2019-12-28 03:53:57,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:53:57,236 INFO L462 AbstractCegarLoop]: Abstraction has 10410 states and 30942 transitions. [2019-12-28 03:53:57,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:53:57,236 INFO L276 IsEmpty]: Start isEmpty. Operand 10410 states and 30942 transitions. [2019-12-28 03:53:57,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 03:53:57,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:53:57,242 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:53:57,242 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:53:57,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:53:57,242 INFO L82 PathProgramCache]: Analyzing trace with hash 78391775, now seen corresponding path program 1 times [2019-12-28 03:53:57,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:53:57,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516528236] [2019-12-28 03:53:57,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:53:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:53:57,288 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-28 03:53:57,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516528236] [2019-12-28 03:53:57,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:53:57,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:53:57,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1359108136] [2019-12-28 03:53:57,289 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:53:57,301 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:53:57,328 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 171 transitions. [2019-12-28 03:53:57,328 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:53:57,423 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 03:53:57,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:53:57,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:53:57,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:53:57,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:53:57,424 INFO L87 Difference]: Start difference. First operand 10410 states and 30942 transitions. Second operand 6 states. [2019-12-28 03:53:58,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:53:58,019 INFO L93 Difference]: Finished difference Result 15178 states and 44225 transitions. [2019-12-28 03:53:58,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:53:58,019 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-28 03:53:58,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:53:58,089 INFO L225 Difference]: With dead ends: 15178 [2019-12-28 03:53:58,090 INFO L226 Difference]: Without dead ends: 15178 [2019-12-28 03:53:58,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:53:58,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15178 states. [2019-12-28 03:53:58,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15178 to 11727. [2019-12-28 03:53:58,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11727 states. [2019-12-28 03:53:58,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11727 states to 11727 states and 34516 transitions. [2019-12-28 03:53:58,387 INFO L78 Accepts]: Start accepts. Automaton has 11727 states and 34516 transitions. Word has length 67 [2019-12-28 03:53:58,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:53:58,388 INFO L462 AbstractCegarLoop]: Abstraction has 11727 states and 34516 transitions. [2019-12-28 03:53:58,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:53:58,388 INFO L276 IsEmpty]: Start isEmpty. Operand 11727 states and 34516 transitions. [2019-12-28 03:53:58,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 03:53:58,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:53:58,405 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:53:58,406 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:53:58,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:53:58,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1323156256, now seen corresponding path program 1 times [2019-12-28 03:53:58,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:53:58,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161657895] [2019-12-28 03:53:58,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:53:58,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:53:58,517 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-28 03:53:58,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161657895] [2019-12-28 03:53:58,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:53:58,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:53:58,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1395546143] [2019-12-28 03:53:58,519 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:53:58,535 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:53:58,569 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 171 transitions. [2019-12-28 03:53:58,569 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:53:58,674 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 03:53:58,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:53:58,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:53:58,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:53:58,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:53:58,676 INFO L87 Difference]: Start difference. First operand 11727 states and 34516 transitions. Second operand 8 states. [2019-12-28 03:53:59,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:53:59,264 INFO L93 Difference]: Finished difference Result 12772 states and 36832 transitions. [2019-12-28 03:53:59,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 03:53:59,265 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-12-28 03:53:59,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:53:59,287 INFO L225 Difference]: With dead ends: 12772 [2019-12-28 03:53:59,287 INFO L226 Difference]: Without dead ends: 12772 [2019-12-28 03:53:59,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-28 03:53:59,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12772 states. [2019-12-28 03:53:59,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12772 to 11925. [2019-12-28 03:53:59,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11925 states. [2019-12-28 03:53:59,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11925 states to 11925 states and 34759 transitions. [2019-12-28 03:53:59,518 INFO L78 Accepts]: Start accepts. Automaton has 11925 states and 34759 transitions. Word has length 67 [2019-12-28 03:53:59,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:53:59,518 INFO L462 AbstractCegarLoop]: Abstraction has 11925 states and 34759 transitions. [2019-12-28 03:53:59,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:53:59,519 INFO L276 IsEmpty]: Start isEmpty. Operand 11925 states and 34759 transitions. [2019-12-28 03:53:59,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 03:53:59,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:53:59,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] [2019-12-28 03:53:59,526 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:53:59,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:53:59,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1534507169, now seen corresponding path program 1 times [2019-12-28 03:53:59,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:53:59,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205633679] [2019-12-28 03:53:59,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:53:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:53:59,609 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-28 03:53:59,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205633679] [2019-12-28 03:53:59,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:53:59,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:53:59,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [706324590] [2019-12-28 03:53:59,613 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:53:59,638 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:53:59,676 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 171 transitions. [2019-12-28 03:53:59,676 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:53:59,707 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:53:59,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:53:59,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:53:59,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:53:59,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:53:59,708 INFO L87 Difference]: Start difference. First operand 11925 states and 34759 transitions. Second operand 6 states. [2019-12-28 03:54:00,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:54:00,177 INFO L93 Difference]: Finished difference Result 15220 states and 44029 transitions. [2019-12-28 03:54:00,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 03:54:00,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-28 03:54:00,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:54:00,200 INFO L225 Difference]: With dead ends: 15220 [2019-12-28 03:54:00,200 INFO L226 Difference]: Without dead ends: 15220 [2019-12-28 03:54:00,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:54:00,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15220 states. [2019-12-28 03:54:00,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15220 to 14156. [2019-12-28 03:54:00,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14156 states. [2019-12-28 03:54:00,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14156 states to 14156 states and 40894 transitions. [2019-12-28 03:54:00,407 INFO L78 Accepts]: Start accepts. Automaton has 14156 states and 40894 transitions. Word has length 67 [2019-12-28 03:54:00,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:54:00,407 INFO L462 AbstractCegarLoop]: Abstraction has 14156 states and 40894 transitions. [2019-12-28 03:54:00,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:54:00,407 INFO L276 IsEmpty]: Start isEmpty. Operand 14156 states and 40894 transitions. [2019-12-28 03:54:00,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 03:54:00,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:54:00,415 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:54:00,415 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:54:00,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:54:00,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1023972992, now seen corresponding path program 1 times [2019-12-28 03:54:00,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:54:00,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671870183] [2019-12-28 03:54:00,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:54:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:54:00,523 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-28 03:54:00,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671870183] [2019-12-28 03:54:00,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:54:00,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:54:00,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1470671162] [2019-12-28 03:54:00,524 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:54:00,536 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:54:00,559 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 171 transitions. [2019-12-28 03:54:00,559 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:54:00,560 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:54:00,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:54:00,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:54:00,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:54:00,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:54:00,561 INFO L87 Difference]: Start difference. First operand 14156 states and 40894 transitions. Second operand 6 states. [2019-12-28 03:54:00,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:54:00,714 INFO L93 Difference]: Finished difference Result 14534 states and 40657 transitions. [2019-12-28 03:54:00,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:54:00,715 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-28 03:54:00,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:54:00,735 INFO L225 Difference]: With dead ends: 14534 [2019-12-28 03:54:00,735 INFO L226 Difference]: Without dead ends: 14534 [2019-12-28 03:54:00,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-28 03:54:00,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14534 states. [2019-12-28 03:54:00,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14534 to 13450. [2019-12-28 03:54:00,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13450 states. [2019-12-28 03:54:00,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13450 states to 13450 states and 37711 transitions. [2019-12-28 03:54:00,902 INFO L78 Accepts]: Start accepts. Automaton has 13450 states and 37711 transitions. Word has length 67 [2019-12-28 03:54:00,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:54:00,903 INFO L462 AbstractCegarLoop]: Abstraction has 13450 states and 37711 transitions. [2019-12-28 03:54:00,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:54:00,903 INFO L276 IsEmpty]: Start isEmpty. Operand 13450 states and 37711 transitions. [2019-12-28 03:54:00,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 03:54:00,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:54:00,909 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:54:00,909 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:54:00,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:54:00,909 INFO L82 PathProgramCache]: Analyzing trace with hash 114525314, now seen corresponding path program 1 times [2019-12-28 03:54:00,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:54:00,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251711593] [2019-12-28 03:54:00,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:54:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:54:00,984 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-28 03:54:00,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251711593] [2019-12-28 03:54:00,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:54:00,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:54:00,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1015616213] [2019-12-28 03:54:00,985 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:54:00,996 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:54:01,020 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 171 transitions. [2019-12-28 03:54:01,020 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:54:01,040 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:54:01,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:54:01,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:54:01,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:54:01,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:54:01,044 INFO L87 Difference]: Start difference. First operand 13450 states and 37711 transitions. Second operand 6 states. [2019-12-28 03:54:01,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:54:01,103 INFO L93 Difference]: Finished difference Result 4249 states and 10316 transitions. [2019-12-28 03:54:01,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 03:54:01,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-28 03:54:01,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:54:01,109 INFO L225 Difference]: With dead ends: 4249 [2019-12-28 03:54:01,109 INFO L226 Difference]: Without dead ends: 3586 [2019-12-28 03:54:01,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:54:01,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3586 states. [2019-12-28 03:54:01,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3586 to 3504. [2019-12-28 03:54:01,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3504 states. [2019-12-28 03:54:01,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3504 states to 3504 states and 8202 transitions. [2019-12-28 03:54:01,159 INFO L78 Accepts]: Start accepts. Automaton has 3504 states and 8202 transitions. Word has length 67 [2019-12-28 03:54:01,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:54:01,159 INFO L462 AbstractCegarLoop]: Abstraction has 3504 states and 8202 transitions. [2019-12-28 03:54:01,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:54:01,160 INFO L276 IsEmpty]: Start isEmpty. Operand 3504 states and 8202 transitions. [2019-12-28 03:54:01,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 03:54:01,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:54:01,164 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:54:01,164 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:54:01,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:54:01,164 INFO L82 PathProgramCache]: Analyzing trace with hash -160875486, now seen corresponding path program 1 times [2019-12-28 03:54:01,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:54:01,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943243218] [2019-12-28 03:54:01,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:54:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:54:01,202 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-28 03:54:01,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943243218] [2019-12-28 03:54:01,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:54:01,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:54:01,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1410255374] [2019-12-28 03:54:01,203 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:54:01,215 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:54:01,229 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 67 transitions. [2019-12-28 03:54:01,230 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:54:01,230 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:54:01,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:54:01,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:54:01,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:54:01,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:54:01,231 INFO L87 Difference]: Start difference. First operand 3504 states and 8202 transitions. Second operand 3 states. [2019-12-28 03:54:01,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:54:01,261 INFO L93 Difference]: Finished difference Result 4255 states and 9774 transitions. [2019-12-28 03:54:01,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:54:01,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-28 03:54:01,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:54:01,265 INFO L225 Difference]: With dead ends: 4255 [2019-12-28 03:54:01,265 INFO L226 Difference]: Without dead ends: 4255 [2019-12-28 03:54:01,266 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-28 03:54:01,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4255 states. [2019-12-28 03:54:01,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4255 to 3447. [2019-12-28 03:54:01,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3447 states. [2019-12-28 03:54:01,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3447 states to 3447 states and 7860 transitions. [2019-12-28 03:54:01,304 INFO L78 Accepts]: Start accepts. Automaton has 3447 states and 7860 transitions. Word has length 67 [2019-12-28 03:54:01,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:54:01,304 INFO L462 AbstractCegarLoop]: Abstraction has 3447 states and 7860 transitions. [2019-12-28 03:54:01,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:54:01,304 INFO L276 IsEmpty]: Start isEmpty. Operand 3447 states and 7860 transitions. [2019-12-28 03:54:01,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-28 03:54:01,308 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:54:01,308 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:54:01,308 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:54:01,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:54:01,308 INFO L82 PathProgramCache]: Analyzing trace with hash -111740107, now seen corresponding path program 1 times [2019-12-28 03:54:01,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:54:01,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185800610] [2019-12-28 03:54:01,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:54:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:54:01,388 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-28 03:54:01,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185800610] [2019-12-28 03:54:01,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:54:01,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:54:01,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [945377919] [2019-12-28 03:54:01,389 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:54:01,404 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:54:01,426 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 73 transitions. [2019-12-28 03:54:01,426 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:54:01,427 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:54:01,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:54:01,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:54:01,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:54:01,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:54:01,428 INFO L87 Difference]: Start difference. First operand 3447 states and 7860 transitions. Second operand 5 states. [2019-12-28 03:54:01,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:54:01,645 INFO L93 Difference]: Finished difference Result 4330 states and 9908 transitions. [2019-12-28 03:54:01,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 03:54:01,645 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-12-28 03:54:01,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:54:01,652 INFO L225 Difference]: With dead ends: 4330 [2019-12-28 03:54:01,652 INFO L226 Difference]: Without dead ends: 4330 [2019-12-28 03:54:01,653 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-28 03:54:01,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4330 states. [2019-12-28 03:54:01,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4330 to 3794. [2019-12-28 03:54:01,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3794 states. [2019-12-28 03:54:01,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 8670 transitions. [2019-12-28 03:54:01,719 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 8670 transitions. Word has length 73 [2019-12-28 03:54:01,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:54:01,719 INFO L462 AbstractCegarLoop]: Abstraction has 3794 states and 8670 transitions. [2019-12-28 03:54:01,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:54:01,719 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 8670 transitions. [2019-12-28 03:54:01,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-28 03:54:01,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:54:01,725 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:54:01,725 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:54:01,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:54:01,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1631070228, now seen corresponding path program 1 times [2019-12-28 03:54:01,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:54:01,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602674774] [2019-12-28 03:54:01,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:54:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:54:01,823 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-28 03:54:01,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602674774] [2019-12-28 03:54:01,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:54:01,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:54:01,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1843665287] [2019-12-28 03:54:01,826 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:54:01,841 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:54:01,864 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 73 transitions. [2019-12-28 03:54:01,864 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:54:01,865 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:54:01,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:54:01,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:54:01,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:54:01,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:54:01,866 INFO L87 Difference]: Start difference. First operand 3794 states and 8670 transitions. Second operand 7 states. [2019-12-28 03:54:02,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:54:02,329 INFO L93 Difference]: Finished difference Result 4457 states and 10042 transitions. [2019-12-28 03:54:02,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 03:54:02,329 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-12-28 03:54:02,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:54:02,335 INFO L225 Difference]: With dead ends: 4457 [2019-12-28 03:54:02,335 INFO L226 Difference]: Without dead ends: 4404 [2019-12-28 03:54:02,335 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-28 03:54:02,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4404 states. [2019-12-28 03:54:02,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4404 to 3840. [2019-12-28 03:54:02,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3840 states. [2019-12-28 03:54:02,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3840 states to 3840 states and 8675 transitions. [2019-12-28 03:54:02,374 INFO L78 Accepts]: Start accepts. Automaton has 3840 states and 8675 transitions. Word has length 73 [2019-12-28 03:54:02,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:54:02,375 INFO L462 AbstractCegarLoop]: Abstraction has 3840 states and 8675 transitions. [2019-12-28 03:54:02,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:54:02,375 INFO L276 IsEmpty]: Start isEmpty. Operand 3840 states and 8675 transitions. [2019-12-28 03:54:02,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-28 03:54:02,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:54:02,379 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:54:02,379 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:54:02,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:54:02,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1731680239, now seen corresponding path program 1 times [2019-12-28 03:54:02,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:54:02,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701624159] [2019-12-28 03:54:02,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:54:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:54:02,456 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-28 03:54:02,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701624159] [2019-12-28 03:54:02,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:54:02,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:54:02,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [836099144] [2019-12-28 03:54:02,457 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:54:02,486 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:54:02,598 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 274 transitions. [2019-12-28 03:54:02,598 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:54:02,600 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:54:02,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:54:02,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:54:02,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:54:02,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:54:02,601 INFO L87 Difference]: Start difference. First operand 3840 states and 8675 transitions. Second operand 3 states. [2019-12-28 03:54:02,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:54:02,762 INFO L93 Difference]: Finished difference Result 5383 states and 11868 transitions. [2019-12-28 03:54:02,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:54:02,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-28 03:54:02,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:54:02,769 INFO L225 Difference]: With dead ends: 5383 [2019-12-28 03:54:02,769 INFO L226 Difference]: Without dead ends: 5092 [2019-12-28 03:54:02,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 03:54:02,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5092 states. [2019-12-28 03:54:02,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5092 to 4632. [2019-12-28 03:54:02,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-12-28 03:54:02,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 10340 transitions. [2019-12-28 03:54:02,856 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 10340 transitions. Word has length 94 [2019-12-28 03:54:02,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:54:02,856 INFO L462 AbstractCegarLoop]: Abstraction has 4632 states and 10340 transitions. [2019-12-28 03:54:02,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:54:02,857 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 10340 transitions. [2019-12-28 03:54:02,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-28 03:54:02,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:54:02,861 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:54:02,861 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:54:02,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:54:02,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1448529775, now seen corresponding path program 1 times [2019-12-28 03:54:02,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:54:02,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93985064] [2019-12-28 03:54:02,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:54:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:54:02,922 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-28 03:54:02,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93985064] [2019-12-28 03:54:02,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:54:02,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:54:02,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1103775361] [2019-12-28 03:54:02,923 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:54:02,944 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:54:03,039 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 274 transitions. [2019-12-28 03:54:03,039 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:54:03,041 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:54:03,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:54:03,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:54:03,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:54:03,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:54:03,042 INFO L87 Difference]: Start difference. First operand 4632 states and 10340 transitions. Second operand 4 states. [2019-12-28 03:54:03,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:54:03,154 INFO L93 Difference]: Finished difference Result 4834 states and 10823 transitions. [2019-12-28 03:54:03,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:54:03,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-28 03:54:03,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:54:03,160 INFO L225 Difference]: With dead ends: 4834 [2019-12-28 03:54:03,160 INFO L226 Difference]: Without dead ends: 4834 [2019-12-28 03:54:03,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-28 03:54:03,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4834 states. [2019-12-28 03:54:03,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4834 to 4318. [2019-12-28 03:54:03,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4318 states. [2019-12-28 03:54:03,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4318 states to 4318 states and 9721 transitions. [2019-12-28 03:54:03,202 INFO L78 Accepts]: Start accepts. Automaton has 4318 states and 9721 transitions. Word has length 94 [2019-12-28 03:54:03,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:54:03,202 INFO L462 AbstractCegarLoop]: Abstraction has 4318 states and 9721 transitions. [2019-12-28 03:54:03,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:54:03,203 INFO L276 IsEmpty]: Start isEmpty. Operand 4318 states and 9721 transitions. [2019-12-28 03:54:03,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 03:54:03,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:54:03,206 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:54:03,206 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:54:03,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:54:03,207 INFO L82 PathProgramCache]: Analyzing trace with hash 603700279, now seen corresponding path program 1 times [2019-12-28 03:54:03,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:54:03,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278336375] [2019-12-28 03:54:03,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:54:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:54:03,281 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-28 03:54:03,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278336375] [2019-12-28 03:54:03,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:54:03,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:54:03,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [676891859] [2019-12-28 03:54:03,282 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:54:03,304 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:54:03,404 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 280 transitions. [2019-12-28 03:54:03,404 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:54:03,406 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:54:03,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:54:03,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:54:03,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:54:03,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:54:03,407 INFO L87 Difference]: Start difference. First operand 4318 states and 9721 transitions. Second operand 5 states. [2019-12-28 03:54:03,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:54:03,523 INFO L93 Difference]: Finished difference Result 4883 states and 10964 transitions. [2019-12-28 03:54:03,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 03:54:03,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-28 03:54:03,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:54:03,528 INFO L225 Difference]: With dead ends: 4883 [2019-12-28 03:54:03,528 INFO L226 Difference]: Without dead ends: 4883 [2019-12-28 03:54:03,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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-28 03:54:03,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4883 states. [2019-12-28 03:54:03,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4883 to 3736. [2019-12-28 03:54:03,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3736 states. [2019-12-28 03:54:03,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3736 states to 3736 states and 8382 transitions. [2019-12-28 03:54:03,566 INFO L78 Accepts]: Start accepts. Automaton has 3736 states and 8382 transitions. Word has length 96 [2019-12-28 03:54:03,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:54:03,566 INFO L462 AbstractCegarLoop]: Abstraction has 3736 states and 8382 transitions. [2019-12-28 03:54:03,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:54:03,566 INFO L276 IsEmpty]: Start isEmpty. Operand 3736 states and 8382 transitions. [2019-12-28 03:54:03,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 03:54:03,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:54:03,570 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:54:03,570 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:54:03,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:54:03,570 INFO L82 PathProgramCache]: Analyzing trace with hash 615016406, now seen corresponding path program 1 times [2019-12-28 03:54:03,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:54:03,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172447668] [2019-12-28 03:54:03,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:54:03,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:54:03,632 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-28 03:54:03,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172447668] [2019-12-28 03:54:03,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:54:03,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:54:03,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [310699832] [2019-12-28 03:54:03,633 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:54:03,652 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:54:03,761 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 280 transitions. [2019-12-28 03:54:03,762 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:54:03,764 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 03:54:03,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:54:03,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:54:03,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:54:03,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:54:03,765 INFO L87 Difference]: Start difference. First operand 3736 states and 8382 transitions. Second operand 4 states. [2019-12-28 03:54:04,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:54:04,006 INFO L93 Difference]: Finished difference Result 4375 states and 9785 transitions. [2019-12-28 03:54:04,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:54:04,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-28 03:54:04,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:54:04,012 INFO L225 Difference]: With dead ends: 4375 [2019-12-28 03:54:04,012 INFO L226 Difference]: Without dead ends: 4337 [2019-12-28 03:54:04,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-28 03:54:04,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4337 states. [2019-12-28 03:54:04,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4337 to 4159. [2019-12-28 03:54:04,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4159 states. [2019-12-28 03:54:04,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4159 states to 4159 states and 9314 transitions. [2019-12-28 03:54:04,052 INFO L78 Accepts]: Start accepts. Automaton has 4159 states and 9314 transitions. Word has length 96 [2019-12-28 03:54:04,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:54:04,052 INFO L462 AbstractCegarLoop]: Abstraction has 4159 states and 9314 transitions. [2019-12-28 03:54:04,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:54:04,052 INFO L276 IsEmpty]: Start isEmpty. Operand 4159 states and 9314 transitions. [2019-12-28 03:54:04,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 03:54:04,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:54:04,056 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:54:04,056 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:54:04,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:54:04,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1462192937, now seen corresponding path program 1 times [2019-12-28 03:54:04,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:54:04,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991292347] [2019-12-28 03:54:04,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:54:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:54:04,225 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-28 03:54:04,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991292347] [2019-12-28 03:54:04,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:54:04,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 03:54:04,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [105355085] [2019-12-28 03:54:04,226 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:54:04,245 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:54:04,361 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 280 transitions. [2019-12-28 03:54:04,362 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:54:04,550 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-28 03:54:04,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-28 03:54:04,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:54:04,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-28 03:54:04,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-12-28 03:54:04,551 INFO L87 Difference]: Start difference. First operand 4159 states and 9314 transitions. Second operand 14 states. [2019-12-28 03:54:05,452 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-12-28 03:54:05,682 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-12-28 03:54:05,867 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-12-28 03:54:09,406 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-12-28 03:54:09,830 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-12-28 03:54:10,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:54:10,885 INFO L93 Difference]: Finished difference Result 8237 states and 18176 transitions. [2019-12-28 03:54:10,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-12-28 03:54:10,886 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2019-12-28 03:54:10,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:54:10,896 INFO L225 Difference]: With dead ends: 8237 [2019-12-28 03:54:10,897 INFO L226 Difference]: Without dead ends: 8237 [2019-12-28 03:54:10,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1328 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=688, Invalid=3472, Unknown=0, NotChecked=0, Total=4160 [2019-12-28 03:54:10,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8237 states. [2019-12-28 03:54:10,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8237 to 4833. [2019-12-28 03:54:10,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4833 states. [2019-12-28 03:54:10,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4833 states to 4833 states and 10815 transitions. [2019-12-28 03:54:10,964 INFO L78 Accepts]: Start accepts. Automaton has 4833 states and 10815 transitions. Word has length 96 [2019-12-28 03:54:10,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:54:10,964 INFO L462 AbstractCegarLoop]: Abstraction has 4833 states and 10815 transitions. [2019-12-28 03:54:10,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-28 03:54:10,965 INFO L276 IsEmpty]: Start isEmpty. Operand 4833 states and 10815 transitions. [2019-12-28 03:54:10,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 03:54:10,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:54:10,971 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:54:10,971 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:54:10,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:54:10,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1250842024, now seen corresponding path program 1 times [2019-12-28 03:54:10,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:54:10,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169577637] [2019-12-28 03:54:10,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:54:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:54:11,101 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-28 03:54:11,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169577637] [2019-12-28 03:54:11,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:54:11,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-28 03:54:11,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [281130297] [2019-12-28 03:54:11,102 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:54:11,119 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:54:11,202 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 280 transitions. [2019-12-28 03:54:11,202 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:54:11,257 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 03:54:11,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-28 03:54:11,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:54:11,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-28 03:54:11,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-12-28 03:54:11,258 INFO L87 Difference]: Start difference. First operand 4833 states and 10815 transitions. Second operand 12 states. [2019-12-28 03:54:13,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:54:13,247 INFO L93 Difference]: Finished difference Result 19164 states and 42289 transitions. [2019-12-28 03:54:13,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-28 03:54:13,248 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-28 03:54:13,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:54:13,261 INFO L225 Difference]: With dead ends: 19164 [2019-12-28 03:54:13,262 INFO L226 Difference]: Without dead ends: 12096 [2019-12-28 03:54:13,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=765, Unknown=0, NotChecked=0, Total=930 [2019-12-28 03:54:13,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12096 states. [2019-12-28 03:54:13,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12096 to 4917. [2019-12-28 03:54:13,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4917 states. [2019-12-28 03:54:13,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4917 states to 4917 states and 10855 transitions. [2019-12-28 03:54:13,404 INFO L78 Accepts]: Start accepts. Automaton has 4917 states and 10855 transitions. Word has length 96 [2019-12-28 03:54:13,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:54:13,404 INFO L462 AbstractCegarLoop]: Abstraction has 4917 states and 10855 transitions. [2019-12-28 03:54:13,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-28 03:54:13,404 INFO L276 IsEmpty]: Start isEmpty. Operand 4917 states and 10855 transitions. [2019-12-28 03:54:13,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 03:54:13,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:54:13,408 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:54:13,408 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:54:13,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:54:13,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1029420438, now seen corresponding path program 2 times [2019-12-28 03:54:13,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:54:13,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204178822] [2019-12-28 03:54:13,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:54:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 03:54:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 03:54:13,528 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 03:54:13,528 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 03:54:13,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 03:54:13 BasicIcfg [2019-12-28 03:54:13,722 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 03:54:13,727 INFO L168 Benchmark]: Toolchain (without parser) took 57339.30 ms. Allocated memory was 138.4 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 102.0 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 757.9 MB. Max. memory is 7.1 GB. [2019-12-28 03:54:13,727 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-28 03:54:13,728 INFO L168 Benchmark]: CACSL2BoogieTranslator took 839.05 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.6 MB in the beginning and 157.0 MB in the end (delta: -55.3 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-28 03:54:13,728 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.75 ms. Allocated memory is still 202.4 MB. Free memory was 157.0 MB in the beginning and 154.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-28 03:54:13,729 INFO L168 Benchmark]: Boogie Preprocessor took 41.24 ms. Allocated memory is still 202.4 MB. Free memory was 154.3 MB in the beginning and 152.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-28 03:54:13,729 INFO L168 Benchmark]: RCFGBuilder took 819.62 ms. Allocated memory is still 202.4 MB. Free memory was 152.3 MB in the beginning and 108.1 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-12-28 03:54:13,730 INFO L168 Benchmark]: TraceAbstraction took 55562.07 ms. Allocated memory was 202.4 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 107.5 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 699.4 MB. Max. memory is 7.1 GB. [2019-12-28 03:54:13,737 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.19 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 839.05 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.6 MB in the beginning and 157.0 MB in the end (delta: -55.3 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.75 ms. Allocated memory is still 202.4 MB. Free memory was 157.0 MB in the beginning and 154.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.24 ms. Allocated memory is still 202.4 MB. Free memory was 154.3 MB in the beginning and 152.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 819.62 ms. Allocated memory is still 202.4 MB. Free memory was 152.3 MB in the beginning and 108.1 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 55562.07 ms. Allocated memory was 202.4 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 107.5 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 699.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L698] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L703] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L704] 0 int x$mem_tmp; VAL [__unbuffered_cnt=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] [L705] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=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] [L706] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L707] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L708] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=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] [L709] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=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] [L710] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=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] [L711] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=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] [L712] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=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}] [L713] 0 int x$w_buff0; VAL [__unbuffered_cnt=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] [L714] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=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] [L715] 0 int x$w_buff1; VAL [__unbuffered_cnt=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] [L716] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=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] [L718] 0 int y = 0; VAL [__unbuffered_cnt=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] [L719] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=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] [L720] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=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] [L796] 0 pthread_t t1705; VAL [__unbuffered_cnt=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] [L797] FCALL, FORK 0 pthread_create(&t1705, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L724] 1 x$w_buff1 = x$w_buff0 [L725] 1 x$w_buff0 = 1 [L726] 1 x$w_buff1_used = x$w_buff0_used [L727] 1 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L730] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L731] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L732] 1 x$r_buff0_thd1 = (_Bool)1 [L735] 1 y = 1 VAL [__unbuffered_cnt=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=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] [L738] 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_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=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] [L798] 0 pthread_t t1706; VAL [__unbuffered_cnt=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=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] [L799] FCALL, FORK 0 pthread_create(&t1706, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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=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] [L752] 2 y = 2 [L755] 2 __unbuffered_p1_EAX = y [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 x$flush_delayed = weak$$choice2 [L761] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2] [L762] 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_p1_EAX=2, __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=2] [L738] 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) [L739] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used 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_p1_EAX=2, __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$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=2] [L762] 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) [L763] 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_p1_EAX=2, __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=2] [L763] 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)) [L764] 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_p1_EAX=2, __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=2] [L764] 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)) [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] 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_p1_EAX=2, __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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 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 [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L742] 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_p1_EAX=2, __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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 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 [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] 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=1, __unbuffered_p1_EAX=2, __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))=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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] 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)) [L766] 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=1, __unbuffered_p1_EAX=2, __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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 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)) [L767] 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=1, __unbuffered_p1_EAX=2, __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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 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)) [L768] 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=1, __unbuffered_p1_EAX=2, __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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] 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)) [L769] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L770] EXPR 2 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L770] 2 x = x$flush_delayed ? x$mem_tmp : x [L771] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=2] [L774] 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_p1_EAX=2, __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=2] [L774] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=2] [L774] 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_p1_EAX=2, __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=2] [L774] 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) [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=2] [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 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_p1_EAX=2, __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=2] [L776] 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 [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=2] [L777] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L778] 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_p1_EAX=2, __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=2] [L778] 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 [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2] [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2] [L805] 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_p1_EAX=2, __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=2] [L805] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2] [L805] 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_p1_EAX=2, __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=2] [L805] 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) [L806] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 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_p1_EAX=2, __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=2] [L807] 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 [L808] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2] [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L809] 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_p1_EAX=2, __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=2] [L809] 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 [L812] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 55.1s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 26.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7779 SDtfs, 9183 SDslu, 19804 SDs, 0 SdLazy, 9567 SolverSat, 452 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 357 GetRequests, 121 SyntacticMatches, 13 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1580 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71012occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 21.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 88830 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1887 NumberOfCodeBlocks, 1887 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1764 ConstructedInterpolants, 0 QuantifiedInterpolants, 301680 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...