/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/mix031_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 01:55:04,177 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 01:55:04,180 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 01:55:04,199 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 01:55:04,199 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 01:55:04,201 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 01:55:04,203 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 01:55:04,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 01:55:04,217 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 01:55:04,220 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 01:55:04,222 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 01:55:04,224 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 01:55:04,224 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 01:55:04,226 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 01:55:04,229 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 01:55:04,230 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 01:55:04,231 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 01:55:04,232 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 01:55:04,234 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 01:55:04,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 01:55:04,243 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 01:55:04,247 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 01:55:04,248 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 01:55:04,249 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 01:55:04,251 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 01:55:04,251 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 01:55:04,251 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 01:55:04,253 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 01:55:04,255 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 01:55:04,256 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 01:55:04,256 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 01:55:04,257 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 01:55:04,258 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 01:55:04,259 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 01:55:04,261 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 01:55:04,261 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 01:55:04,262 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 01:55:04,262 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 01:55:04,262 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 01:55:04,263 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 01:55:04,265 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 01:55:04,266 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 01:55:04,290 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 01:55:04,290 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 01:55:04,292 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 01:55:04,292 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 01:55:04,292 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 01:55:04,292 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 01:55:04,292 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 01:55:04,293 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 01:55:04,293 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 01:55:04,293 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 01:55:04,293 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 01:55:04,294 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 01:55:04,294 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 01:55:04,294 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 01:55:04,294 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 01:55:04,294 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 01:55:04,295 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 01:55:04,295 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 01:55:04,295 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 01:55:04,295 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 01:55:04,295 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 01:55:04,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 01:55:04,296 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 01:55:04,296 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 01:55:04,296 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 01:55:04,296 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 01:55:04,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 01:55:04,297 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 01:55:04,297 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 01:55:04,297 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 01:55:04,298 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 01:55:04,298 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 01:55:04,571 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 01:55:04,588 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 01:55:04,592 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 01:55:04,593 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 01:55:04,595 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 01:55:04,595 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031_rmo.opt.i [2019-12-28 01:55:04,670 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e90d88c3/b4d398ed41f740f7aafca5c8a4ec0e32/FLAG38eb96557 [2019-12-28 01:55:05,212 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 01:55:05,213 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_rmo.opt.i [2019-12-28 01:55:05,228 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e90d88c3/b4d398ed41f740f7aafca5c8a4ec0e32/FLAG38eb96557 [2019-12-28 01:55:05,498 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e90d88c3/b4d398ed41f740f7aafca5c8a4ec0e32 [2019-12-28 01:55:05,507 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 01:55:05,509 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 01:55:05,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 01:55:05,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 01:55:05,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 01:55:05,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 01:55:05" (1/1) ... [2019-12-28 01:55:05,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23588bd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:05, skipping insertion in model container [2019-12-28 01:55:05,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 01:55:05" (1/1) ... [2019-12-28 01:55:05,526 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 01:55:05,587 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 01:55:06,135 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 01:55:06,153 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 01:55:06,265 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 01:55:06,342 INFO L208 MainTranslator]: Completed translation [2019-12-28 01:55:06,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:06 WrapperNode [2019-12-28 01:55:06,342 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 01:55:06,343 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 01:55:06,343 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 01:55:06,343 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 01:55:06,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:06" (1/1) ... [2019-12-28 01:55:06,378 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:06" (1/1) ... [2019-12-28 01:55:06,419 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 01:55:06,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 01:55:06,420 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 01:55:06,420 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 01:55:06,430 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:06" (1/1) ... [2019-12-28 01:55:06,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:06" (1/1) ... [2019-12-28 01:55:06,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:06" (1/1) ... [2019-12-28 01:55:06,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:06" (1/1) ... [2019-12-28 01:55:06,445 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:06" (1/1) ... [2019-12-28 01:55:06,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:06" (1/1) ... [2019-12-28 01:55:06,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:06" (1/1) ... [2019-12-28 01:55:06,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 01:55:06,465 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 01:55:06,465 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 01:55:06,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 01:55:06,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:06" (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 01:55:06,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 01:55:06,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 01:55:06,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 01:55:06,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 01:55:06,535 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 01:55:06,535 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 01:55:06,535 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 01:55:06,535 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 01:55:06,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 01:55:06,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 01:55:06,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 01:55:06,538 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 01:55:07,242 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 01:55:07,242 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 01:55:07,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:55:07 BoogieIcfgContainer [2019-12-28 01:55:07,245 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 01:55:07,246 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 01:55:07,246 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 01:55:07,250 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 01:55:07,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 01:55:05" (1/3) ... [2019-12-28 01:55:07,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f39a13c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 01:55:07, skipping insertion in model container [2019-12-28 01:55:07,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:06" (2/3) ... [2019-12-28 01:55:07,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f39a13c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 01:55:07, skipping insertion in model container [2019-12-28 01:55:07,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:55:07" (3/3) ... [2019-12-28 01:55:07,256 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_rmo.opt.i [2019-12-28 01:55:07,269 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 01:55:07,269 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 01:55:07,283 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 01:55:07,284 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 01:55:07,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,347 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,348 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,384 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,384 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,384 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,384 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,385 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,415 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,417 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,426 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,426 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,427 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:07,446 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 01:55:07,465 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 01:55:07,466 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 01:55:07,466 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 01:55:07,466 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 01:55:07,466 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 01:55:07,466 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 01:55:07,467 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 01:55:07,467 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 01:55:07,481 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 139 places, 167 transitions [2019-12-28 01:55:09,241 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25979 states. [2019-12-28 01:55:09,243 INFO L276 IsEmpty]: Start isEmpty. Operand 25979 states. [2019-12-28 01:55:09,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-28 01:55:09,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:09,264 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] [2019-12-28 01:55:09,265 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:09,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:09,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1982457826, now seen corresponding path program 1 times [2019-12-28 01:55:09,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:09,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387343208] [2019-12-28 01:55:09,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:09,600 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 01:55:09,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387343208] [2019-12-28 01:55:09,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:09,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:55:09,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1057753948] [2019-12-28 01:55:09,604 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:09,611 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:09,632 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 43 states and 42 transitions. [2019-12-28 01:55:09,632 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:09,637 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:09,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:55:09,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:09,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:55:09,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:55:09,655 INFO L87 Difference]: Start difference. First operand 25979 states. Second operand 4 states. [2019-12-28 01:55:10,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:10,989 INFO L93 Difference]: Finished difference Result 26619 states and 102124 transitions. [2019-12-28 01:55:10,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 01:55:10,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-28 01:55:10,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:11,176 INFO L225 Difference]: With dead ends: 26619 [2019-12-28 01:55:11,177 INFO L226 Difference]: Without dead ends: 20363 [2019-12-28 01:55:11,179 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 01:55:11,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20363 states. [2019-12-28 01:55:12,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20363 to 20363. [2019-12-28 01:55:12,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20363 states. [2019-12-28 01:55:12,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20363 states to 20363 states and 78428 transitions. [2019-12-28 01:55:12,273 INFO L78 Accepts]: Start accepts. Automaton has 20363 states and 78428 transitions. Word has length 42 [2019-12-28 01:55:12,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:12,274 INFO L462 AbstractCegarLoop]: Abstraction has 20363 states and 78428 transitions. [2019-12-28 01:55:12,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:55:12,275 INFO L276 IsEmpty]: Start isEmpty. Operand 20363 states and 78428 transitions. [2019-12-28 01:55:12,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-28 01:55:12,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:12,287 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:55:12,288 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:12,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:12,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1965107530, now seen corresponding path program 1 times [2019-12-28 01:55:12,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:12,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307274267] [2019-12-28 01:55:12,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:12,478 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 01:55:12,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307274267] [2019-12-28 01:55:12,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:12,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:55:12,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1750761984] [2019-12-28 01:55:12,483 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:12,491 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:12,501 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 50 transitions. [2019-12-28 01:55:12,501 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:12,502 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:12,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:55:12,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:12,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:55:12,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:55:12,505 INFO L87 Difference]: Start difference. First operand 20363 states and 78428 transitions. Second operand 5 states. [2019-12-28 01:55:13,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:13,767 INFO L93 Difference]: Finished difference Result 31841 states and 116045 transitions. [2019-12-28 01:55:13,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:55:13,768 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-12-28 01:55:13,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:13,898 INFO L225 Difference]: With dead ends: 31841 [2019-12-28 01:55:13,899 INFO L226 Difference]: Without dead ends: 31289 [2019-12-28 01:55:13,900 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 01:55:14,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31289 states. [2019-12-28 01:55:15,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31289 to 29708. [2019-12-28 01:55:15,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29708 states. [2019-12-28 01:55:15,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29708 states to 29708 states and 109522 transitions. [2019-12-28 01:55:15,941 INFO L78 Accepts]: Start accepts. Automaton has 29708 states and 109522 transitions. Word has length 50 [2019-12-28 01:55:15,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:15,944 INFO L462 AbstractCegarLoop]: Abstraction has 29708 states and 109522 transitions. [2019-12-28 01:55:15,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:55:15,944 INFO L276 IsEmpty]: Start isEmpty. Operand 29708 states and 109522 transitions. [2019-12-28 01:55:15,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-28 01:55:15,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:15,952 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:55:15,952 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:15,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:15,953 INFO L82 PathProgramCache]: Analyzing trace with hash -2091945449, now seen corresponding path program 1 times [2019-12-28 01:55:15,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:15,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103605015] [2019-12-28 01:55:15,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:16,141 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 01:55:16,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103605015] [2019-12-28 01:55:16,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:16,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:55:16,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1959615019] [2019-12-28 01:55:16,143 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:16,152 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:16,400 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 123 transitions. [2019-12-28 01:55:16,400 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:16,490 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 01:55:16,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:55:16,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:16,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:55:16,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:55:16,492 INFO L87 Difference]: Start difference. First operand 29708 states and 109522 transitions. Second operand 6 states. [2019-12-28 01:55:17,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:17,115 INFO L93 Difference]: Finished difference Result 38699 states and 139694 transitions. [2019-12-28 01:55:17,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:55:17,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-28 01:55:17,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:17,278 INFO L225 Difference]: With dead ends: 38699 [2019-12-28 01:55:17,278 INFO L226 Difference]: Without dead ends: 38251 [2019-12-28 01:55:17,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:55:17,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38251 states. [2019-12-28 01:55:19,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38251 to 32954. [2019-12-28 01:55:19,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32954 states. [2019-12-28 01:55:19,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32954 states to 32954 states and 120531 transitions. [2019-12-28 01:55:19,671 INFO L78 Accepts]: Start accepts. Automaton has 32954 states and 120531 transitions. Word has length 51 [2019-12-28 01:55:19,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:19,672 INFO L462 AbstractCegarLoop]: Abstraction has 32954 states and 120531 transitions. [2019-12-28 01:55:19,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:55:19,672 INFO L276 IsEmpty]: Start isEmpty. Operand 32954 states and 120531 transitions. [2019-12-28 01:55:19,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-28 01:55:19,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:19,693 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 01:55:19,693 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:19,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:19,694 INFO L82 PathProgramCache]: Analyzing trace with hash 568644221, now seen corresponding path program 1 times [2019-12-28 01:55:19,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:19,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097050890] [2019-12-28 01:55:19,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:19,760 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 01:55:19,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097050890] [2019-12-28 01:55:19,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:19,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 01:55:19,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [599597112] [2019-12-28 01:55:19,762 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:19,769 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:19,780 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 98 states and 141 transitions. [2019-12-28 01:55:19,781 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:19,833 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 01:55:19,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:55:19,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:19,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:55:19,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:55:19,837 INFO L87 Difference]: Start difference. First operand 32954 states and 120531 transitions. Second operand 5 states. [2019-12-28 01:55:20,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:20,487 INFO L93 Difference]: Finished difference Result 42415 states and 152022 transitions. [2019-12-28 01:55:20,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 01:55:20,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-28 01:55:20,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:20,730 INFO L225 Difference]: With dead ends: 42415 [2019-12-28 01:55:20,731 INFO L226 Difference]: Without dead ends: 42415 [2019-12-28 01:55:20,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:55:21,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42415 states. [2019-12-28 01:55:23,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42415 to 37668. [2019-12-28 01:55:23,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37668 states. [2019-12-28 01:55:23,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37668 states to 37668 states and 136335 transitions. [2019-12-28 01:55:23,180 INFO L78 Accepts]: Start accepts. Automaton has 37668 states and 136335 transitions. Word has length 53 [2019-12-28 01:55:23,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:23,180 INFO L462 AbstractCegarLoop]: Abstraction has 37668 states and 136335 transitions. [2019-12-28 01:55:23,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:55:23,180 INFO L276 IsEmpty]: Start isEmpty. Operand 37668 states and 136335 transitions. [2019-12-28 01:55:23,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-28 01:55:23,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:23,196 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] [2019-12-28 01:55:23,196 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:23,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:23,197 INFO L82 PathProgramCache]: Analyzing trace with hash -208895999, now seen corresponding path program 1 times [2019-12-28 01:55:23,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:23,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410551015] [2019-12-28 01:55:23,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:23,303 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 01:55:23,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410551015] [2019-12-28 01:55:23,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:23,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:55:23,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [849837385] [2019-12-28 01:55:23,305 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:23,311 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:23,317 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 61 transitions. [2019-12-28 01:55:23,317 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:23,343 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 01:55:23,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 01:55:23,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:23,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 01:55:23,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:55:23,344 INFO L87 Difference]: Start difference. First operand 37668 states and 136335 transitions. Second operand 8 states. [2019-12-28 01:55:24,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:24,320 INFO L93 Difference]: Finished difference Result 51814 states and 185563 transitions. [2019-12-28 01:55:24,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 01:55:24,321 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-28 01:55:24,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:24,430 INFO L225 Difference]: With dead ends: 51814 [2019-12-28 01:55:24,430 INFO L226 Difference]: Without dead ends: 51014 [2019-12-28 01:55:24,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-28 01:55:25,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51014 states. [2019-12-28 01:55:25,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51014 to 47936. [2019-12-28 01:55:25,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47936 states. [2019-12-28 01:55:25,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47936 states to 47936 states and 172264 transitions. [2019-12-28 01:55:25,769 INFO L78 Accepts]: Start accepts. Automaton has 47936 states and 172264 transitions. Word has length 57 [2019-12-28 01:55:25,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:25,769 INFO L462 AbstractCegarLoop]: Abstraction has 47936 states and 172264 transitions. [2019-12-28 01:55:25,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 01:55:25,769 INFO L276 IsEmpty]: Start isEmpty. Operand 47936 states and 172264 transitions. [2019-12-28 01:55:25,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-28 01:55:25,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:25,788 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] [2019-12-28 01:55:25,791 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:25,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:25,791 INFO L82 PathProgramCache]: Analyzing trace with hash -2005847358, now seen corresponding path program 1 times [2019-12-28 01:55:25,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:25,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425246101] [2019-12-28 01:55:25,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:27,188 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 01:55:27,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425246101] [2019-12-28 01:55:27,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:27,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:55:27,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [852624398] [2019-12-28 01:55:27,190 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:27,196 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:27,202 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 61 transitions. [2019-12-28 01:55:27,203 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:27,224 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 01:55:27,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 01:55:27,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:27,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 01:55:27,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:55:27,225 INFO L87 Difference]: Start difference. First operand 47936 states and 172264 transitions. Second operand 9 states. [2019-12-28 01:55:28,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:28,431 INFO L93 Difference]: Finished difference Result 68550 states and 236789 transitions. [2019-12-28 01:55:28,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 01:55:28,432 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-28 01:55:28,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:28,576 INFO L225 Difference]: With dead ends: 68550 [2019-12-28 01:55:28,576 INFO L226 Difference]: Without dead ends: 68550 [2019-12-28 01:55:28,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-12-28 01:55:28,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68550 states. [2019-12-28 01:55:29,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68550 to 56774. [2019-12-28 01:55:29,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56774 states. [2019-12-28 01:55:29,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56774 states to 56774 states and 199367 transitions. [2019-12-28 01:55:29,882 INFO L78 Accepts]: Start accepts. Automaton has 56774 states and 199367 transitions. Word has length 57 [2019-12-28 01:55:29,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:29,882 INFO L462 AbstractCegarLoop]: Abstraction has 56774 states and 199367 transitions. [2019-12-28 01:55:29,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 01:55:29,883 INFO L276 IsEmpty]: Start isEmpty. Operand 56774 states and 199367 transitions. [2019-12-28 01:55:29,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-28 01:55:29,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:29,896 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:55:29,896 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:29,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:29,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1118343677, now seen corresponding path program 1 times [2019-12-28 01:55:29,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:29,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878856163] [2019-12-28 01:55:29,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:29,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:29,978 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 01:55:29,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878856163] [2019-12-28 01:55:29,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:29,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:55:29,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [712132984] [2019-12-28 01:55:29,980 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:29,985 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:29,992 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 61 transitions. [2019-12-28 01:55:29,992 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:29,992 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:29,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:55:29,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:29,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:55:29,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:55:29,994 INFO L87 Difference]: Start difference. First operand 56774 states and 199367 transitions. Second operand 4 states. [2019-12-28 01:55:30,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:30,052 INFO L93 Difference]: Finished difference Result 10469 states and 32215 transitions. [2019-12-28 01:55:30,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 01:55:30,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-28 01:55:30,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:30,067 INFO L225 Difference]: With dead ends: 10469 [2019-12-28 01:55:30,067 INFO L226 Difference]: Without dead ends: 9223 [2019-12-28 01:55:30,067 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 01:55:30,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9223 states. [2019-12-28 01:55:30,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9223 to 9175. [2019-12-28 01:55:30,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9175 states. [2019-12-28 01:55:30,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9175 states to 9175 states and 27926 transitions. [2019-12-28 01:55:30,179 INFO L78 Accepts]: Start accepts. Automaton has 9175 states and 27926 transitions. Word has length 57 [2019-12-28 01:55:30,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:30,180 INFO L462 AbstractCegarLoop]: Abstraction has 9175 states and 27926 transitions. [2019-12-28 01:55:30,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:55:30,180 INFO L276 IsEmpty]: Start isEmpty. Operand 9175 states and 27926 transitions. [2019-12-28 01:55:30,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-28 01:55:30,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:30,182 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:55:30,182 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:30,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:30,182 INFO L82 PathProgramCache]: Analyzing trace with hash -195256504, now seen corresponding path program 1 times [2019-12-28 01:55:30,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:30,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321600968] [2019-12-28 01:55:30,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:30,248 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 01:55:30,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321600968] [2019-12-28 01:55:30,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:30,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:55:30,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1741646247] [2019-12-28 01:55:30,249 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:30,315 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:30,331 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 118 states and 177 transitions. [2019-12-28 01:55:30,331 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:30,380 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 01:55:30,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 01:55:30,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:30,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 01:55:30,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:55:30,383 INFO L87 Difference]: Start difference. First operand 9175 states and 27926 transitions. Second operand 8 states. [2019-12-28 01:55:30,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:30,889 INFO L93 Difference]: Finished difference Result 11222 states and 33697 transitions. [2019-12-28 01:55:30,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 01:55:30,889 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-28 01:55:30,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:30,906 INFO L225 Difference]: With dead ends: 11222 [2019-12-28 01:55:30,906 INFO L226 Difference]: Without dead ends: 11135 [2019-12-28 01:55:30,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-12-28 01:55:30,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11135 states. [2019-12-28 01:55:31,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11135 to 9316. [2019-12-28 01:55:31,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9316 states. [2019-12-28 01:55:31,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9316 states to 9316 states and 28348 transitions. [2019-12-28 01:55:31,051 INFO L78 Accepts]: Start accepts. Automaton has 9316 states and 28348 transitions. Word has length 57 [2019-12-28 01:55:31,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:31,051 INFO L462 AbstractCegarLoop]: Abstraction has 9316 states and 28348 transitions. [2019-12-28 01:55:31,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 01:55:31,052 INFO L276 IsEmpty]: Start isEmpty. Operand 9316 states and 28348 transitions. [2019-12-28 01:55:31,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 01:55:31,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:31,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] [2019-12-28 01:55:31,057 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:31,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:31,057 INFO L82 PathProgramCache]: Analyzing trace with hash 141668315, now seen corresponding path program 1 times [2019-12-28 01:55:31,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:31,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763220053] [2019-12-28 01:55:31,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:31,110 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 01:55:31,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763220053] [2019-12-28 01:55:31,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:31,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:55:31,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2097765467] [2019-12-28 01:55:31,114 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:31,125 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:31,152 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 136 states and 203 transitions. [2019-12-28 01:55:31,153 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:31,173 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 01:55:31,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:55:31,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:31,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:55:31,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:55:31,175 INFO L87 Difference]: Start difference. First operand 9316 states and 28348 transitions. Second operand 5 states. [2019-12-28 01:55:31,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:31,401 INFO L93 Difference]: Finished difference Result 10891 states and 33040 transitions. [2019-12-28 01:55:31,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 01:55:31,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-28 01:55:31,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:31,422 INFO L225 Difference]: With dead ends: 10891 [2019-12-28 01:55:31,422 INFO L226 Difference]: Without dead ends: 10891 [2019-12-28 01:55:31,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:55:31,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10891 states. [2019-12-28 01:55:31,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10891 to 9883. [2019-12-28 01:55:31,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9883 states. [2019-12-28 01:55:31,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9883 states to 9883 states and 30019 transitions. [2019-12-28 01:55:31,615 INFO L78 Accepts]: Start accepts. Automaton has 9883 states and 30019 transitions. Word has length 67 [2019-12-28 01:55:31,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:31,615 INFO L462 AbstractCegarLoop]: Abstraction has 9883 states and 30019 transitions. [2019-12-28 01:55:31,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:55:31,616 INFO L276 IsEmpty]: Start isEmpty. Operand 9883 states and 30019 transitions. [2019-12-28 01:55:31,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 01:55:31,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:31,624 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 01:55:31,624 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:31,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:31,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1884478650, now seen corresponding path program 1 times [2019-12-28 01:55:31,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:31,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808570127] [2019-12-28 01:55:31,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:31,734 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 01:55:31,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808570127] [2019-12-28 01:55:31,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:31,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:55:31,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1745738606] [2019-12-28 01:55:31,736 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:31,746 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:31,772 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 136 states and 203 transitions. [2019-12-28 01:55:31,773 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:31,796 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 01:55:31,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 01:55:31,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:31,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 01:55:31,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:55:31,798 INFO L87 Difference]: Start difference. First operand 9883 states and 30019 transitions. Second operand 7 states. [2019-12-28 01:55:32,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:32,345 INFO L93 Difference]: Finished difference Result 12789 states and 38229 transitions. [2019-12-28 01:55:32,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-28 01:55:32,346 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-28 01:55:32,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:32,363 INFO L225 Difference]: With dead ends: 12789 [2019-12-28 01:55:32,363 INFO L226 Difference]: Without dead ends: 12741 [2019-12-28 01:55:32,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-28 01:55:32,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12741 states. [2019-12-28 01:55:32,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12741 to 10622. [2019-12-28 01:55:32,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10622 states. [2019-12-28 01:55:32,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10622 states to 10622 states and 32072 transitions. [2019-12-28 01:55:32,515 INFO L78 Accepts]: Start accepts. Automaton has 10622 states and 32072 transitions. Word has length 67 [2019-12-28 01:55:32,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:32,515 INFO L462 AbstractCegarLoop]: Abstraction has 10622 states and 32072 transitions. [2019-12-28 01:55:32,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 01:55:32,516 INFO L276 IsEmpty]: Start isEmpty. Operand 10622 states and 32072 transitions. [2019-12-28 01:55:32,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 01:55:32,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:32,523 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:55:32,523 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:32,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:32,524 INFO L82 PathProgramCache]: Analyzing trace with hash -17868351, now seen corresponding path program 1 times [2019-12-28 01:55:32,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:32,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995055861] [2019-12-28 01:55:32,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:32,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:32,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 01:55:32,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995055861] [2019-12-28 01:55:32,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:32,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:55:32,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [151742318] [2019-12-28 01:55:32,594 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:32,607 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:32,619 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 01:55:32,620 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:32,620 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:32,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:55:32,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:32,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:55:32,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:55:32,621 INFO L87 Difference]: Start difference. First operand 10622 states and 32072 transitions. Second operand 4 states. [2019-12-28 01:55:32,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:32,917 INFO L93 Difference]: Finished difference Result 13324 states and 39674 transitions. [2019-12-28 01:55:32,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 01:55:32,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-28 01:55:32,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:32,937 INFO L225 Difference]: With dead ends: 13324 [2019-12-28 01:55:32,937 INFO L226 Difference]: Without dead ends: 13324 [2019-12-28 01:55:32,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:55:32,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13324 states. [2019-12-28 01:55:33,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13324 to 12178. [2019-12-28 01:55:33,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12178 states. [2019-12-28 01:55:33,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12178 states to 12178 states and 36363 transitions. [2019-12-28 01:55:33,097 INFO L78 Accepts]: Start accepts. Automaton has 12178 states and 36363 transitions. Word has length 69 [2019-12-28 01:55:33,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:33,097 INFO L462 AbstractCegarLoop]: Abstraction has 12178 states and 36363 transitions. [2019-12-28 01:55:33,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:55:33,098 INFO L276 IsEmpty]: Start isEmpty. Operand 12178 states and 36363 transitions. [2019-12-28 01:55:33,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 01:55:33,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:33,106 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:55:33,107 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:33,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:33,107 INFO L82 PathProgramCache]: Analyzing trace with hash -2095077694, now seen corresponding path program 1 times [2019-12-28 01:55:33,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:33,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062614782] [2019-12-28 01:55:33,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:33,154 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 01:55:33,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062614782] [2019-12-28 01:55:33,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:33,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 01:55:33,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2092486060] [2019-12-28 01:55:33,156 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:33,169 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:33,183 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 01:55:33,183 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:33,184 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:33,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 01:55:33,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:33,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 01:55:33,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 01:55:33,185 INFO L87 Difference]: Start difference. First operand 12178 states and 36363 transitions. Second operand 3 states. [2019-12-28 01:55:33,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:33,381 INFO L93 Difference]: Finished difference Result 12704 states and 37768 transitions. [2019-12-28 01:55:33,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 01:55:33,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-28 01:55:33,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:33,401 INFO L225 Difference]: With dead ends: 12704 [2019-12-28 01:55:33,401 INFO L226 Difference]: Without dead ends: 12704 [2019-12-28 01:55:33,401 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 01:55:33,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12704 states. [2019-12-28 01:55:33,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12704 to 12466. [2019-12-28 01:55:33,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12466 states. [2019-12-28 01:55:33,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12466 states to 12466 states and 37127 transitions. [2019-12-28 01:55:33,572 INFO L78 Accepts]: Start accepts. Automaton has 12466 states and 37127 transitions. Word has length 69 [2019-12-28 01:55:33,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:33,572 INFO L462 AbstractCegarLoop]: Abstraction has 12466 states and 37127 transitions. [2019-12-28 01:55:33,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 01:55:33,572 INFO L276 IsEmpty]: Start isEmpty. Operand 12466 states and 37127 transitions. [2019-12-28 01:55:33,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 01:55:33,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:33,583 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] [2019-12-28 01:55:33,583 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:33,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:33,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1715982354, now seen corresponding path program 1 times [2019-12-28 01:55:33,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:33,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206702929] [2019-12-28 01:55:33,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:33,680 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 01:55:33,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206702929] [2019-12-28 01:55:33,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:33,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:55:33,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1526385279] [2019-12-28 01:55:33,681 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:33,697 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:33,712 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 71 transitions. [2019-12-28 01:55:33,712 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:33,713 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:33,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:55:33,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:33,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:55:33,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:55:33,714 INFO L87 Difference]: Start difference. First operand 12466 states and 37127 transitions. Second operand 6 states. [2019-12-28 01:55:34,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:34,235 INFO L93 Difference]: Finished difference Result 13737 states and 40366 transitions. [2019-12-28 01:55:34,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:55:34,235 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-12-28 01:55:34,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:34,262 INFO L225 Difference]: With dead ends: 13737 [2019-12-28 01:55:34,262 INFO L226 Difference]: Without dead ends: 13737 [2019-12-28 01:55:34,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:55:34,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13737 states. [2019-12-28 01:55:34,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13737 to 13251. [2019-12-28 01:55:34,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13251 states. [2019-12-28 01:55:34,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13251 states to 13251 states and 39082 transitions. [2019-12-28 01:55:34,446 INFO L78 Accepts]: Start accepts. Automaton has 13251 states and 39082 transitions. Word has length 71 [2019-12-28 01:55:34,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:34,447 INFO L462 AbstractCegarLoop]: Abstraction has 13251 states and 39082 transitions. [2019-12-28 01:55:34,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:55:34,447 INFO L276 IsEmpty]: Start isEmpty. Operand 13251 states and 39082 transitions. [2019-12-28 01:55:34,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 01:55:34,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:34,458 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] [2019-12-28 01:55:34,458 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:34,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:34,459 INFO L82 PathProgramCache]: Analyzing trace with hash 501775599, now seen corresponding path program 1 times [2019-12-28 01:55:34,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:34,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801103663] [2019-12-28 01:55:34,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:34,561 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 01:55:34,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801103663] [2019-12-28 01:55:34,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:34,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:55:34,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [190189258] [2019-12-28 01:55:34,562 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:34,576 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:34,590 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 71 transitions. [2019-12-28 01:55:34,591 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:34,591 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:34,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:55:34,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:34,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:55:34,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:55:34,592 INFO L87 Difference]: Start difference. First operand 13251 states and 39082 transitions. Second operand 6 states. [2019-12-28 01:55:35,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:35,127 INFO L93 Difference]: Finished difference Result 15574 states and 44592 transitions. [2019-12-28 01:55:35,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 01:55:35,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-12-28 01:55:35,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:35,148 INFO L225 Difference]: With dead ends: 15574 [2019-12-28 01:55:35,148 INFO L226 Difference]: Without dead ends: 15574 [2019-12-28 01:55:35,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:55:35,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15574 states. [2019-12-28 01:55:35,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15574 to 13825. [2019-12-28 01:55:35,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13825 states. [2019-12-28 01:55:35,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13825 states to 13825 states and 39932 transitions. [2019-12-28 01:55:35,322 INFO L78 Accepts]: Start accepts. Automaton has 13825 states and 39932 transitions. Word has length 71 [2019-12-28 01:55:35,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:35,322 INFO L462 AbstractCegarLoop]: Abstraction has 13825 states and 39932 transitions. [2019-12-28 01:55:35,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:55:35,322 INFO L276 IsEmpty]: Start isEmpty. Operand 13825 states and 39932 transitions. [2019-12-28 01:55:35,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 01:55:35,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:35,335 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] [2019-12-28 01:55:35,335 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:35,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:35,335 INFO L82 PathProgramCache]: Analyzing trace with hash 713126512, now seen corresponding path program 1 times [2019-12-28 01:55:35,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:35,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081270482] [2019-12-28 01:55:35,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:35,420 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 01:55:35,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081270482] [2019-12-28 01:55:35,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:35,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:55:35,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1052801255] [2019-12-28 01:55:35,421 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:35,446 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:35,461 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 71 transitions. [2019-12-28 01:55:35,461 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:35,462 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:35,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:55:35,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:35,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:55:35,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:55:35,463 INFO L87 Difference]: Start difference. First operand 13825 states and 39932 transitions. Second operand 5 states. [2019-12-28 01:55:35,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:35,779 INFO L93 Difference]: Finished difference Result 17386 states and 50011 transitions. [2019-12-28 01:55:35,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 01:55:35,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-28 01:55:35,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:35,801 INFO L225 Difference]: With dead ends: 17386 [2019-12-28 01:55:35,801 INFO L226 Difference]: Without dead ends: 17386 [2019-12-28 01:55:35,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:55:35,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17386 states. [2019-12-28 01:55:35,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17386 to 14863. [2019-12-28 01:55:35,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14863 states. [2019-12-28 01:55:35,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14863 states to 14863 states and 42564 transitions. [2019-12-28 01:55:36,000 INFO L78 Accepts]: Start accepts. Automaton has 14863 states and 42564 transitions. Word has length 71 [2019-12-28 01:55:36,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:36,000 INFO L462 AbstractCegarLoop]: Abstraction has 14863 states and 42564 transitions. [2019-12-28 01:55:36,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:55:36,000 INFO L276 IsEmpty]: Start isEmpty. Operand 14863 states and 42564 transitions. [2019-12-28 01:55:36,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 01:55:36,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:36,012 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] [2019-12-28 01:55:36,012 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:36,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:36,013 INFO L82 PathProgramCache]: Analyzing trace with hash 202592335, now seen corresponding path program 1 times [2019-12-28 01:55:36,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:36,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092574431] [2019-12-28 01:55:36,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:36,078 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 01:55:36,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092574431] [2019-12-28 01:55:36,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:36,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:55:36,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [670444963] [2019-12-28 01:55:36,079 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:36,090 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:36,102 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 71 transitions. [2019-12-28 01:55:36,103 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:36,103 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:36,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:55:36,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:36,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:55:36,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:55:36,104 INFO L87 Difference]: Start difference. First operand 14863 states and 42564 transitions. Second operand 5 states. [2019-12-28 01:55:36,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:36,525 INFO L93 Difference]: Finished difference Result 19768 states and 56511 transitions. [2019-12-28 01:55:36,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:55:36,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-28 01:55:36,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:36,552 INFO L225 Difference]: With dead ends: 19768 [2019-12-28 01:55:36,552 INFO L226 Difference]: Without dead ends: 19768 [2019-12-28 01:55:36,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:55:36,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19768 states. [2019-12-28 01:55:36,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19768 to 15768. [2019-12-28 01:55:36,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15768 states. [2019-12-28 01:55:36,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15768 states to 15768 states and 45150 transitions. [2019-12-28 01:55:36,793 INFO L78 Accepts]: Start accepts. Automaton has 15768 states and 45150 transitions. Word has length 71 [2019-12-28 01:55:36,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:36,793 INFO L462 AbstractCegarLoop]: Abstraction has 15768 states and 45150 transitions. [2019-12-28 01:55:36,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:55:36,794 INFO L276 IsEmpty]: Start isEmpty. Operand 15768 states and 45150 transitions. [2019-12-28 01:55:36,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 01:55:36,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:36,805 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] [2019-12-28 01:55:36,806 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:36,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:36,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1604862128, now seen corresponding path program 1 times [2019-12-28 01:55:36,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:36,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416464660] [2019-12-28 01:55:36,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:36,860 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 01:55:36,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416464660] [2019-12-28 01:55:36,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:36,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:55:36,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2146958182] [2019-12-28 01:55:36,861 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:36,952 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:36,964 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 71 transitions. [2019-12-28 01:55:36,965 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:36,965 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:36,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:55:36,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:36,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:55:36,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:55:36,966 INFO L87 Difference]: Start difference. First operand 15768 states and 45150 transitions. Second operand 4 states. [2019-12-28 01:55:37,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:37,498 INFO L93 Difference]: Finished difference Result 20664 states and 59358 transitions. [2019-12-28 01:55:37,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 01:55:37,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-12-28 01:55:37,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:37,528 INFO L225 Difference]: With dead ends: 20664 [2019-12-28 01:55:37,528 INFO L226 Difference]: Without dead ends: 20388 [2019-12-28 01:55:37,528 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 01:55:37,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20388 states. [2019-12-28 01:55:37,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20388 to 18951. [2019-12-28 01:55:37,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18951 states. [2019-12-28 01:55:37,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18951 states to 18951 states and 54439 transitions. [2019-12-28 01:55:37,778 INFO L78 Accepts]: Start accepts. Automaton has 18951 states and 54439 transitions. Word has length 71 [2019-12-28 01:55:37,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:37,778 INFO L462 AbstractCegarLoop]: Abstraction has 18951 states and 54439 transitions. [2019-12-28 01:55:37,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:55:37,778 INFO L276 IsEmpty]: Start isEmpty. Operand 18951 states and 54439 transitions. [2019-12-28 01:55:37,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 01:55:37,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:37,789 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] [2019-12-28 01:55:37,789 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:37,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:37,789 INFO L82 PathProgramCache]: Analyzing trace with hash 893153809, now seen corresponding path program 1 times [2019-12-28 01:55:37,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:37,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924926224] [2019-12-28 01:55:37,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:37,929 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 01:55:37,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924926224] [2019-12-28 01:55:37,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:37,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 01:55:37,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [992438397] [2019-12-28 01:55:37,930 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:37,941 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:37,964 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 71 transitions. [2019-12-28 01:55:37,965 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:37,965 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:37,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 01:55:37,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:37,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 01:55:37,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:55:37,971 INFO L87 Difference]: Start difference. First operand 18951 states and 54439 transitions. Second operand 9 states. [2019-12-28 01:55:38,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:38,685 INFO L93 Difference]: Finished difference Result 24278 states and 69372 transitions. [2019-12-28 01:55:38,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 01:55:38,685 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-12-28 01:55:38,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:38,717 INFO L225 Difference]: With dead ends: 24278 [2019-12-28 01:55:38,717 INFO L226 Difference]: Without dead ends: 24278 [2019-12-28 01:55:38,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-28 01:55:38,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24278 states. [2019-12-28 01:55:38,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24278 to 20616. [2019-12-28 01:55:38,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20616 states. [2019-12-28 01:55:38,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20616 states to 20616 states and 59237 transitions. [2019-12-28 01:55:38,993 INFO L78 Accepts]: Start accepts. Automaton has 20616 states and 59237 transitions. Word has length 71 [2019-12-28 01:55:38,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:38,993 INFO L462 AbstractCegarLoop]: Abstraction has 20616 states and 59237 transitions. [2019-12-28 01:55:38,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 01:55:38,993 INFO L276 IsEmpty]: Start isEmpty. Operand 20616 states and 59237 transitions. [2019-12-28 01:55:39,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 01:55:39,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:39,004 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] [2019-12-28 01:55:39,004 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:39,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:39,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1780657490, now seen corresponding path program 1 times [2019-12-28 01:55:39,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:39,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152663742] [2019-12-28 01:55:39,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:39,097 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 01:55:39,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152663742] [2019-12-28 01:55:39,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:39,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:55:39,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1278280912] [2019-12-28 01:55:39,098 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:39,109 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:39,123 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 71 transitions. [2019-12-28 01:55:39,124 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:39,124 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:39,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:55:39,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:39,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:55:39,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:55:39,126 INFO L87 Difference]: Start difference. First operand 20616 states and 59237 transitions. Second operand 5 states. [2019-12-28 01:55:39,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:39,178 INFO L93 Difference]: Finished difference Result 6192 states and 14494 transitions. [2019-12-28 01:55:39,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 01:55:39,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-28 01:55:39,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:39,184 INFO L225 Difference]: With dead ends: 6192 [2019-12-28 01:55:39,184 INFO L226 Difference]: Without dead ends: 5020 [2019-12-28 01:55:39,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:55:39,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5020 states. [2019-12-28 01:55:39,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5020 to 4283. [2019-12-28 01:55:39,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4283 states. [2019-12-28 01:55:39,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4283 states to 4283 states and 9830 transitions. [2019-12-28 01:55:39,227 INFO L78 Accepts]: Start accepts. Automaton has 4283 states and 9830 transitions. Word has length 71 [2019-12-28 01:55:39,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:39,227 INFO L462 AbstractCegarLoop]: Abstraction has 4283 states and 9830 transitions. [2019-12-28 01:55:39,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:55:39,227 INFO L276 IsEmpty]: Start isEmpty. Operand 4283 states and 9830 transitions. [2019-12-28 01:55:39,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 01:55:39,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:39,233 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] [2019-12-28 01:55:39,233 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:39,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:39,233 INFO L82 PathProgramCache]: Analyzing trace with hash -222857875, now seen corresponding path program 1 times [2019-12-28 01:55:39,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:39,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051350923] [2019-12-28 01:55:39,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:39,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 01:55:39,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051350923] [2019-12-28 01:55:39,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:39,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:55:39,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [734808108] [2019-12-28 01:55:39,324 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:39,341 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:39,409 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 155 states and 213 transitions. [2019-12-28 01:55:39,410 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:39,455 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 01:55:39,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 01:55:39,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:39,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 01:55:39,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:55:39,456 INFO L87 Difference]: Start difference. First operand 4283 states and 9830 transitions. Second operand 8 states. [2019-12-28 01:55:40,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:40,887 INFO L93 Difference]: Finished difference Result 6758 states and 15032 transitions. [2019-12-28 01:55:40,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-28 01:55:40,888 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 86 [2019-12-28 01:55:40,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:40,896 INFO L225 Difference]: With dead ends: 6758 [2019-12-28 01:55:40,896 INFO L226 Difference]: Without dead ends: 6705 [2019-12-28 01:55:40,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2019-12-28 01:55:40,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6705 states. [2019-12-28 01:55:40,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6705 to 5288. [2019-12-28 01:55:40,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5288 states. [2019-12-28 01:55:40,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5288 states to 5288 states and 11882 transitions. [2019-12-28 01:55:40,950 INFO L78 Accepts]: Start accepts. Automaton has 5288 states and 11882 transitions. Word has length 86 [2019-12-28 01:55:40,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:40,950 INFO L462 AbstractCegarLoop]: Abstraction has 5288 states and 11882 transitions. [2019-12-28 01:55:40,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 01:55:40,950 INFO L276 IsEmpty]: Start isEmpty. Operand 5288 states and 11882 transitions. [2019-12-28 01:55:40,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 01:55:40,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:40,955 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] [2019-12-28 01:55:40,955 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:40,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:40,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1011259222, now seen corresponding path program 1 times [2019-12-28 01:55:40,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:40,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808165714] [2019-12-28 01:55:40,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:41,062 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 01:55:41,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808165714] [2019-12-28 01:55:41,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:41,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:55:41,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [790768572] [2019-12-28 01:55:41,064 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:41,087 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:41,149 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 149 states and 198 transitions. [2019-12-28 01:55:41,149 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:41,185 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 01:55:41,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 01:55:41,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:41,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 01:55:41,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:55:41,187 INFO L87 Difference]: Start difference. First operand 5288 states and 11882 transitions. Second operand 9 states. [2019-12-28 01:55:42,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:42,485 INFO L93 Difference]: Finished difference Result 16188 states and 36576 transitions. [2019-12-28 01:55:42,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-28 01:55:42,487 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-12-28 01:55:42,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:42,504 INFO L225 Difference]: With dead ends: 16188 [2019-12-28 01:55:42,505 INFO L226 Difference]: Without dead ends: 16134 [2019-12-28 01:55:42,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=460, Unknown=0, NotChecked=0, Total=650 [2019-12-28 01:55:42,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16134 states. [2019-12-28 01:55:42,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16134 to 5689. [2019-12-28 01:55:42,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5689 states. [2019-12-28 01:55:42,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5689 states to 5689 states and 12815 transitions. [2019-12-28 01:55:42,614 INFO L78 Accepts]: Start accepts. Automaton has 5689 states and 12815 transitions. Word has length 86 [2019-12-28 01:55:42,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:42,614 INFO L462 AbstractCegarLoop]: Abstraction has 5689 states and 12815 transitions. [2019-12-28 01:55:42,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 01:55:42,614 INFO L276 IsEmpty]: Start isEmpty. Operand 5689 states and 12815 transitions. [2019-12-28 01:55:42,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 01:55:42,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:42,622 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] [2019-12-28 01:55:42,623 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:42,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:42,623 INFO L82 PathProgramCache]: Analyzing trace with hash -785692137, now seen corresponding path program 1 times [2019-12-28 01:55:42,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:42,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006143914] [2019-12-28 01:55:42,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:42,709 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 01:55:42,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006143914] [2019-12-28 01:55:42,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:42,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:55:42,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [632302971] [2019-12-28 01:55:42,710 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:42,728 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:42,795 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 149 states and 198 transitions. [2019-12-28 01:55:42,795 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:42,918 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-28 01:55:42,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-28 01:55:42,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:42,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-28 01:55:42,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-28 01:55:42,920 INFO L87 Difference]: Start difference. First operand 5689 states and 12815 transitions. Second operand 13 states. [2019-12-28 01:55:45,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:45,568 INFO L93 Difference]: Finished difference Result 19939 states and 45420 transitions. [2019-12-28 01:55:45,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-28 01:55:45,574 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2019-12-28 01:55:45,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:45,596 INFO L225 Difference]: With dead ends: 19939 [2019-12-28 01:55:45,596 INFO L226 Difference]: Without dead ends: 19939 [2019-12-28 01:55:45,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=550, Invalid=1900, Unknown=0, NotChecked=0, Total=2450 [2019-12-28 01:55:45,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19939 states. [2019-12-28 01:55:45,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19939 to 6212. [2019-12-28 01:55:45,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2019-12-28 01:55:45,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 14043 transitions. [2019-12-28 01:55:45,739 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 14043 transitions. Word has length 86 [2019-12-28 01:55:45,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:45,739 INFO L462 AbstractCegarLoop]: Abstraction has 6212 states and 14043 transitions. [2019-12-28 01:55:45,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-28 01:55:45,740 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 14043 transitions. [2019-12-28 01:55:45,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 01:55:45,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:45,746 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] [2019-12-28 01:55:45,746 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:45,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:45,747 INFO L82 PathProgramCache]: Analyzing trace with hash 101811544, now seen corresponding path program 1 times [2019-12-28 01:55:45,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:45,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519575176] [2019-12-28 01:55:45,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:45,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:45,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 01:55:45,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519575176] [2019-12-28 01:55:45,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:45,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:55:45,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [424775480] [2019-12-28 01:55:45,883 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:45,912 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:46,000 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 149 states and 198 transitions. [2019-12-28 01:55:46,000 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:46,133 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-28 01:55:46,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-28 01:55:46,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:46,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-28 01:55:46,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-28 01:55:46,134 INFO L87 Difference]: Start difference. First operand 6212 states and 14043 transitions. Second operand 12 states. [2019-12-28 01:55:46,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:46,573 INFO L93 Difference]: Finished difference Result 7553 states and 16921 transitions. [2019-12-28 01:55:46,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-28 01:55:46,574 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 86 [2019-12-28 01:55:46,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:46,584 INFO L225 Difference]: With dead ends: 7553 [2019-12-28 01:55:46,584 INFO L226 Difference]: Without dead ends: 7553 [2019-12-28 01:55:46,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2019-12-28 01:55:46,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7553 states. [2019-12-28 01:55:46,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7553 to 5669. [2019-12-28 01:55:46,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5669 states. [2019-12-28 01:55:46,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5669 states to 5669 states and 12721 transitions. [2019-12-28 01:55:46,671 INFO L78 Accepts]: Start accepts. Automaton has 5669 states and 12721 transitions. Word has length 86 [2019-12-28 01:55:46,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:46,672 INFO L462 AbstractCegarLoop]: Abstraction has 5669 states and 12721 transitions. [2019-12-28 01:55:46,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-28 01:55:46,672 INFO L276 IsEmpty]: Start isEmpty. Operand 5669 states and 12721 transitions. [2019-12-28 01:55:46,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 01:55:46,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:46,679 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] [2019-12-28 01:55:46,679 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:46,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:46,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1630164008, now seen corresponding path program 1 times [2019-12-28 01:55:46,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:46,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850883633] [2019-12-28 01:55:46,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:46,790 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 01:55:46,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850883633] [2019-12-28 01:55:46,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:46,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:55:46,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [399751724] [2019-12-28 01:55:46,791 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:46,806 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:46,857 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 149 states and 198 transitions. [2019-12-28 01:55:46,857 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:46,858 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:46,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:55:46,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:46,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:55:46,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:55:46,859 INFO L87 Difference]: Start difference. First operand 5669 states and 12721 transitions. Second operand 6 states. [2019-12-28 01:55:46,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:46,990 INFO L93 Difference]: Finished difference Result 5489 states and 12184 transitions. [2019-12-28 01:55:46,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 01:55:46,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-12-28 01:55:46,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:46,997 INFO L225 Difference]: With dead ends: 5489 [2019-12-28 01:55:46,998 INFO L226 Difference]: Without dead ends: 5489 [2019-12-28 01:55:46,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:55:47,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5489 states. [2019-12-28 01:55:47,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5489 to 3608. [2019-12-28 01:55:47,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3608 states. [2019-12-28 01:55:47,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3608 states to 3608 states and 8133 transitions. [2019-12-28 01:55:47,037 INFO L78 Accepts]: Start accepts. Automaton has 3608 states and 8133 transitions. Word has length 86 [2019-12-28 01:55:47,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:47,038 INFO L462 AbstractCegarLoop]: Abstraction has 3608 states and 8133 transitions. [2019-12-28 01:55:47,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:55:47,038 INFO L276 IsEmpty]: Start isEmpty. Operand 3608 states and 8133 transitions. [2019-12-28 01:55:47,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-28 01:55:47,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:47,041 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] [2019-12-28 01:55:47,041 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:47,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:47,041 INFO L82 PathProgramCache]: Analyzing trace with hash -751041092, now seen corresponding path program 1 times [2019-12-28 01:55:47,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:47,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731175055] [2019-12-28 01:55:47,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:47,186 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 01:55:47,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731175055] [2019-12-28 01:55:47,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:47,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 01:55:47,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1599326554] [2019-12-28 01:55:47,187 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:47,201 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:47,331 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 215 transitions. [2019-12-28 01:55:47,331 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:47,355 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 01:55:47,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 01:55:47,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:47,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 01:55:47,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:55:47,357 INFO L87 Difference]: Start difference. First operand 3608 states and 8133 transitions. Second operand 9 states. [2019-12-28 01:55:48,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:48,264 INFO L93 Difference]: Finished difference Result 4581 states and 10206 transitions. [2019-12-28 01:55:48,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-28 01:55:48,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-12-28 01:55:48,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:48,271 INFO L225 Difference]: With dead ends: 4581 [2019-12-28 01:55:48,272 INFO L226 Difference]: Without dead ends: 4581 [2019-12-28 01:55:48,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-12-28 01:55:48,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4581 states. [2019-12-28 01:55:48,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4581 to 3748. [2019-12-28 01:55:48,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3748 states. [2019-12-28 01:55:48,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3748 states to 3748 states and 8418 transitions. [2019-12-28 01:55:48,312 INFO L78 Accepts]: Start accepts. Automaton has 3748 states and 8418 transitions. Word has length 88 [2019-12-28 01:55:48,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:48,312 INFO L462 AbstractCegarLoop]: Abstraction has 3748 states and 8418 transitions. [2019-12-28 01:55:48,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 01:55:48,312 INFO L276 IsEmpty]: Start isEmpty. Operand 3748 states and 8418 transitions. [2019-12-28 01:55:48,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-28 01:55:48,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:48,316 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] [2019-12-28 01:55:48,316 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:48,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:48,316 INFO L82 PathProgramCache]: Analyzing trace with hash 136462589, now seen corresponding path program 1 times [2019-12-28 01:55:48,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:48,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287407059] [2019-12-28 01:55:48,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:48,448 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 01:55:48,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287407059] [2019-12-28 01:55:48,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:48,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 01:55:48,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1527436291] [2019-12-28 01:55:48,449 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:48,462 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:48,537 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 215 transitions. [2019-12-28 01:55:48,537 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:48,566 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 01:55:48,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 01:55:48,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:48,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 01:55:48,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:55:48,567 INFO L87 Difference]: Start difference. First operand 3748 states and 8418 transitions. Second operand 9 states. [2019-12-28 01:55:48,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:48,725 INFO L93 Difference]: Finished difference Result 6372 states and 14391 transitions. [2019-12-28 01:55:48,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:55:48,726 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-12-28 01:55:48,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:48,731 INFO L225 Difference]: With dead ends: 6372 [2019-12-28 01:55:48,732 INFO L226 Difference]: Without dead ends: 2716 [2019-12-28 01:55:48,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-12-28 01:55:48,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2019-12-28 01:55:48,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 2716. [2019-12-28 01:55:48,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2716 states. [2019-12-28 01:55:48,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 6121 transitions. [2019-12-28 01:55:48,775 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 6121 transitions. Word has length 88 [2019-12-28 01:55:48,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:48,775 INFO L462 AbstractCegarLoop]: Abstraction has 2716 states and 6121 transitions. [2019-12-28 01:55:48,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 01:55:48,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 6121 transitions. [2019-12-28 01:55:48,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-28 01:55:48,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:48,781 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] [2019-12-28 01:55:48,781 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:48,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:48,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1710229601, now seen corresponding path program 2 times [2019-12-28 01:55:48,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:48,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494750564] [2019-12-28 01:55:48,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:48,989 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 01:55:48,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494750564] [2019-12-28 01:55:48,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:48,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-28 01:55:48,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [406051878] [2019-12-28 01:55:48,991 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:49,011 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:49,072 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 127 states and 160 transitions. [2019-12-28 01:55:49,072 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:49,104 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 01:55:49,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 01:55:49,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:49,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 01:55:49,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-28 01:55:49,105 INFO L87 Difference]: Start difference. First operand 2716 states and 6121 transitions. Second operand 11 states. [2019-12-28 01:55:49,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:49,997 INFO L93 Difference]: Finished difference Result 5019 states and 11307 transitions. [2019-12-28 01:55:49,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-28 01:55:49,997 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 88 [2019-12-28 01:55:49,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:50,002 INFO L225 Difference]: With dead ends: 5019 [2019-12-28 01:55:50,003 INFO L226 Difference]: Without dead ends: 3340 [2019-12-28 01:55:50,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-28 01:55:50,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3340 states. [2019-12-28 01:55:50,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3340 to 2763. [2019-12-28 01:55:50,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2763 states. [2019-12-28 01:55:50,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 6162 transitions. [2019-12-28 01:55:50,031 INFO L78 Accepts]: Start accepts. Automaton has 2763 states and 6162 transitions. Word has length 88 [2019-12-28 01:55:50,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:50,031 INFO L462 AbstractCegarLoop]: Abstraction has 2763 states and 6162 transitions. [2019-12-28 01:55:50,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 01:55:50,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2763 states and 6162 transitions. [2019-12-28 01:55:50,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-28 01:55:50,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:50,033 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] [2019-12-28 01:55:50,034 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:50,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:50,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1220418877, now seen corresponding path program 3 times [2019-12-28 01:55:50,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:50,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550679398] [2019-12-28 01:55:50,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 01:55:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 01:55:50,111 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 01:55:50,111 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 01:55:50,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 01:55:50 BasicIcfg [2019-12-28 01:55:50,262 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 01:55:50,265 INFO L168 Benchmark]: Toolchain (without parser) took 44755.71 ms. Allocated memory was 138.4 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 100.4 MB in the beginning and 724.9 MB in the end (delta: -624.5 MB). Peak memory consumption was 961.0 MB. Max. memory is 7.1 GB. [2019-12-28 01:55:50,266 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-28 01:55:50,269 INFO L168 Benchmark]: CACSL2BoogieTranslator took 832.59 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.2 MB in the beginning and 157.5 MB in the end (delta: -57.3 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-28 01:55:50,272 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.04 ms. Allocated memory is still 202.9 MB. Free memory was 157.5 MB in the beginning and 154.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-28 01:55:50,272 INFO L168 Benchmark]: Boogie Preprocessor took 39.19 ms. Allocated memory is still 202.9 MB. Free memory was 154.8 MB in the beginning and 152.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-28 01:55:50,273 INFO L168 Benchmark]: RCFGBuilder took 779.90 ms. Allocated memory is still 202.9 MB. Free memory was 152.8 MB in the beginning and 111.0 MB in the end (delta: 41.8 MB). Peak memory consumption was 41.8 MB. Max. memory is 7.1 GB. [2019-12-28 01:55:50,273 INFO L168 Benchmark]: TraceAbstraction took 43016.55 ms. Allocated memory was 202.9 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 110.3 MB in the beginning and 724.9 MB in the end (delta: -614.5 MB). Peak memory consumption was 906.4 MB. Max. memory is 7.1 GB. [2019-12-28 01:55:50,277 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.15 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 832.59 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.2 MB in the beginning and 157.5 MB in the end (delta: -57.3 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.04 ms. Allocated memory is still 202.9 MB. Free memory was 157.5 MB in the beginning and 154.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.19 ms. Allocated memory is still 202.9 MB. Free memory was 154.8 MB in the beginning and 152.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 779.90 ms. Allocated memory is still 202.9 MB. Free memory was 152.8 MB in the beginning and 111.0 MB in the end (delta: 41.8 MB). Peak memory consumption was 41.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 43016.55 ms. Allocated memory was 202.9 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 110.3 MB in the beginning and 724.9 MB in the end (delta: -614.5 MB). Peak memory consumption was 906.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L701] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L703] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L705] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L706] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0] [L707] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L709] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L711] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L712] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L713] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L714] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L715] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L716] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L717] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L718] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L719] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L720] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L721] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L722] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L723] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L724] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L725] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L727] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L728] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L729] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L809] 0 pthread_t t843; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L810] FCALL, FORK 0 pthread_create(&t843, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L811] 0 pthread_t t844; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t844, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 2 y$w_buff1 = y$w_buff0 [L768] 2 y$w_buff0 = 1 [L769] 2 y$w_buff1_used = y$w_buff0_used [L770] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L772] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L773] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L774] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L775] 2 y$r_buff0_thd2 = (_Bool)1 [L778] 2 z = 1 [L781] 2 __unbuffered_p1_EAX = z [L784] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 a = 1 [L736] 1 x = 1 [L739] 1 __unbuffered_p0_EAX = x [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 y$flush_delayed = weak$$choice2 [L745] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L788] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L789] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L752] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 1 y = y$flush_delayed ? y$mem_tmp : y [L755] 1 y$flush_delayed = (_Bool)0 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L819] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L825] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 133 locations, 2 error locations. Result: UNSAFE, OverallTime: 42.6s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 20.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7619 SDtfs, 13419 SDslu, 20131 SDs, 0 SdLazy, 9089 SolverSat, 779 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 460 GetRequests, 159 SyntacticMatches, 13 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1228 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56774occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.4s AutomataMinimizationTime, 27 MinimizatonAttempts, 78215 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1975 NumberOfCodeBlocks, 1975 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1860 ConstructedInterpolants, 0 QuantifiedInterpolants, 370680 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...