/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/mix034_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 02:03:07,433 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 02:03:07,436 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 02:03:07,448 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 02:03:07,449 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 02:03:07,450 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 02:03:07,451 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 02:03:07,453 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 02:03:07,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 02:03:07,455 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 02:03:07,456 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 02:03:07,458 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 02:03:07,458 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 02:03:07,461 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 02:03:07,463 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 02:03:07,464 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 02:03:07,465 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 02:03:07,469 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 02:03:07,470 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 02:03:07,475 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 02:03:07,478 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 02:03:07,481 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 02:03:07,483 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 02:03:07,484 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 02:03:07,488 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 02:03:07,488 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 02:03:07,488 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 02:03:07,490 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 02:03:07,492 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 02:03:07,493 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 02:03:07,494 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 02:03:07,496 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 02:03:07,496 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 02:03:07,498 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 02:03:07,502 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 02:03:07,502 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 02:03:07,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 02:03:07,503 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 02:03:07,503 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 02:03:07,506 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 02:03:07,508 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 02:03:07,509 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 02:03:07,529 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 02:03:07,530 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 02:03:07,533 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 02:03:07,533 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 02:03:07,534 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 02:03:07,534 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 02:03:07,534 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 02:03:07,534 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 02:03:07,534 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 02:03:07,535 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 02:03:07,535 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 02:03:07,535 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 02:03:07,535 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 02:03:07,535 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 02:03:07,536 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 02:03:07,536 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 02:03:07,536 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 02:03:07,536 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 02:03:07,536 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 02:03:07,537 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 02:03:07,537 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 02:03:07,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 02:03:07,537 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 02:03:07,537 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 02:03:07,538 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 02:03:07,538 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 02:03:07,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 02:03:07,538 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 02:03:07,538 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 02:03:07,539 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 02:03:07,539 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 02:03:07,539 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 02:03:07,830 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 02:03:07,854 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 02:03:07,857 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 02:03:07,859 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 02:03:07,860 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 02:03:07,861 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_power.opt.i [2019-12-28 02:03:07,933 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/642727038/478c350537554b0cb3f22db2e9e1e1c7/FLAG68d49cc1d [2019-12-28 02:03:08,492 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 02:03:08,498 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_power.opt.i [2019-12-28 02:03:08,522 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/642727038/478c350537554b0cb3f22db2e9e1e1c7/FLAG68d49cc1d [2019-12-28 02:03:08,751 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/642727038/478c350537554b0cb3f22db2e9e1e1c7 [2019-12-28 02:03:08,759 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 02:03:08,761 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 02:03:08,762 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 02:03:08,762 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 02:03:08,766 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 02:03:08,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:03:08" (1/1) ... [2019-12-28 02:03:08,770 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad6db1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:08, skipping insertion in model container [2019-12-28 02:03:08,770 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:03:08" (1/1) ... [2019-12-28 02:03:08,778 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 02:03:08,836 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 02:03:09,334 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 02:03:09,347 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 02:03:09,445 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 02:03:09,513 INFO L208 MainTranslator]: Completed translation [2019-12-28 02:03:09,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:09 WrapperNode [2019-12-28 02:03:09,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 02:03:09,515 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 02:03:09,515 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 02:03:09,515 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 02:03:09,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:09" (1/1) ... [2019-12-28 02:03:09,545 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:09" (1/1) ... [2019-12-28 02:03:09,586 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 02:03:09,586 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 02:03:09,586 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 02:03:09,586 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 02:03:09,594 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:09" (1/1) ... [2019-12-28 02:03:09,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:09" (1/1) ... [2019-12-28 02:03:09,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:09" (1/1) ... [2019-12-28 02:03:09,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:09" (1/1) ... [2019-12-28 02:03:09,609 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:09" (1/1) ... [2019-12-28 02:03:09,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:09" (1/1) ... [2019-12-28 02:03:09,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:09" (1/1) ... [2019-12-28 02:03:09,622 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 02:03:09,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 02:03:09,622 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 02:03:09,623 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 02:03:09,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 02:03:09,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 02:03:09,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 02:03:09,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 02:03:09,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 02:03:09,699 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 02:03:09,700 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 02:03:09,700 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 02:03:09,700 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 02:03:09,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 02:03:09,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 02:03:09,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 02:03:09,702 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 02:03:10,490 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 02:03:10,491 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 02:03:10,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:03:10 BoogieIcfgContainer [2019-12-28 02:03:10,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 02:03:10,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 02:03:10,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 02:03:10,497 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 02:03:10,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 02:03:08" (1/3) ... [2019-12-28 02:03:10,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69d3d67f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:03:10, skipping insertion in model container [2019-12-28 02:03:10,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:09" (2/3) ... [2019-12-28 02:03:10,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69d3d67f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:03:10, skipping insertion in model container [2019-12-28 02:03:10,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:03:10" (3/3) ... [2019-12-28 02:03:10,502 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_power.opt.i [2019-12-28 02:03:10,513 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 02:03:10,513 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 02:03:10,522 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 02:03:10,523 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 02:03:10,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,565 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,565 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,566 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,567 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,567 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,585 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,585 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,660 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,661 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,661 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,667 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,669 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:10,687 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 02:03:10,711 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 02:03:10,711 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 02:03:10,712 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 02:03:10,712 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 02:03:10,712 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 02:03:10,712 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 02:03:10,712 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 02:03:10,712 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 02:03:10,732 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 149 places, 183 transitions [2019-12-28 02:03:12,730 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32593 states. [2019-12-28 02:03:12,732 INFO L276 IsEmpty]: Start isEmpty. Operand 32593 states. [2019-12-28 02:03:12,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-28 02:03:12,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:12,741 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:03:12,741 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:12,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:12,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1674583442, now seen corresponding path program 1 times [2019-12-28 02:03:12,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:12,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250893947] [2019-12-28 02:03:12,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:13,139 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 02:03:13,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250893947] [2019-12-28 02:03:13,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:13,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:03:13,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2079965281] [2019-12-28 02:03:13,144 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:13,151 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:13,176 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 36 transitions. [2019-12-28 02:03:13,177 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:13,184 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:03:13,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:03:13,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:13,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:03:13,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:03:13,208 INFO L87 Difference]: Start difference. First operand 32593 states. Second operand 4 states. [2019-12-28 02:03:14,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:14,725 INFO L93 Difference]: Finished difference Result 33593 states and 129570 transitions. [2019-12-28 02:03:14,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 02:03:14,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-28 02:03:14,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:15,058 INFO L225 Difference]: With dead ends: 33593 [2019-12-28 02:03:15,058 INFO L226 Difference]: Without dead ends: 25705 [2019-12-28 02:03:15,062 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 02:03:15,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25705 states. [2019-12-28 02:03:16,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25705 to 25705. [2019-12-28 02:03:16,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25705 states. [2019-12-28 02:03:16,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25705 states to 25705 states and 99586 transitions. [2019-12-28 02:03:16,730 INFO L78 Accepts]: Start accepts. Automaton has 25705 states and 99586 transitions. Word has length 36 [2019-12-28 02:03:16,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:16,731 INFO L462 AbstractCegarLoop]: Abstraction has 25705 states and 99586 transitions. [2019-12-28 02:03:16,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:03:16,731 INFO L276 IsEmpty]: Start isEmpty. Operand 25705 states and 99586 transitions. [2019-12-28 02:03:16,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-28 02:03:16,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:16,740 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:03:16,741 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:16,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:16,741 INFO L82 PathProgramCache]: Analyzing trace with hash -196337745, now seen corresponding path program 1 times [2019-12-28 02:03:16,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:16,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950023405] [2019-12-28 02:03:16,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:16,871 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 02:03:16,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950023405] [2019-12-28 02:03:16,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:16,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:03:16,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1375872965] [2019-12-28 02:03:16,872 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:16,878 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:16,886 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 48 transitions. [2019-12-28 02:03:16,886 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:16,888 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:03:16,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:03:16,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:16,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:03:16,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:03:16,892 INFO L87 Difference]: Start difference. First operand 25705 states and 99586 transitions. Second operand 5 states. [2019-12-28 02:03:17,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:17,797 INFO L93 Difference]: Finished difference Result 41083 states and 150433 transitions. [2019-12-28 02:03:17,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:03:17,798 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-28 02:03:17,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:19,299 INFO L225 Difference]: With dead ends: 41083 [2019-12-28 02:03:19,299 INFO L226 Difference]: Without dead ends: 40547 [2019-12-28 02:03:19,300 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 02:03:19,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40547 states. [2019-12-28 02:03:20,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40547 to 38927. [2019-12-28 02:03:20,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38927 states. [2019-12-28 02:03:20,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38927 states to 38927 states and 143583 transitions. [2019-12-28 02:03:20,677 INFO L78 Accepts]: Start accepts. Automaton has 38927 states and 143583 transitions. Word has length 48 [2019-12-28 02:03:20,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:20,678 INFO L462 AbstractCegarLoop]: Abstraction has 38927 states and 143583 transitions. [2019-12-28 02:03:20,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:03:20,678 INFO L276 IsEmpty]: Start isEmpty. Operand 38927 states and 143583 transitions. [2019-12-28 02:03:20,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-28 02:03:20,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:20,684 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:03:20,685 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:20,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:20,685 INFO L82 PathProgramCache]: Analyzing trace with hash -207257985, now seen corresponding path program 1 times [2019-12-28 02:03:20,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:20,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674419564] [2019-12-28 02:03:20,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:20,842 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 02:03:20,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674419564] [2019-12-28 02:03:20,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:20,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:03:20,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [538874714] [2019-12-28 02:03:20,844 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:20,850 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:20,855 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 49 transitions. [2019-12-28 02:03:20,856 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:20,856 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:03:20,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:03:20,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:20,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:03:20,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:03:20,858 INFO L87 Difference]: Start difference. First operand 38927 states and 143583 transitions. Second operand 5 states. [2019-12-28 02:03:21,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:21,810 INFO L93 Difference]: Finished difference Result 49780 states and 180635 transitions. [2019-12-28 02:03:21,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:03:21,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-28 02:03:21,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:21,976 INFO L225 Difference]: With dead ends: 49780 [2019-12-28 02:03:21,976 INFO L226 Difference]: Without dead ends: 49276 [2019-12-28 02:03:21,977 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 02:03:22,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49276 states. [2019-12-28 02:03:24,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49276 to 42679. [2019-12-28 02:03:24,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42679 states. [2019-12-28 02:03:24,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42679 states to 42679 states and 156594 transitions. [2019-12-28 02:03:24,946 INFO L78 Accepts]: Start accepts. Automaton has 42679 states and 156594 transitions. Word has length 49 [2019-12-28 02:03:24,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:24,946 INFO L462 AbstractCegarLoop]: Abstraction has 42679 states and 156594 transitions. [2019-12-28 02:03:24,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:03:24,947 INFO L276 IsEmpty]: Start isEmpty. Operand 42679 states and 156594 transitions. [2019-12-28 02:03:24,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-28 02:03:24,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:24,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] [2019-12-28 02:03:24,956 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:24,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:24,956 INFO L82 PathProgramCache]: Analyzing trace with hash -635197403, now seen corresponding path program 1 times [2019-12-28 02:03:24,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:24,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453730298] [2019-12-28 02:03:24,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:25,005 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 02:03:25,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453730298] [2019-12-28 02:03:25,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:25,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 02:03:25,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1801444940] [2019-12-28 02:03:25,006 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:25,012 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:25,018 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 52 states and 51 transitions. [2019-12-28 02:03:25,018 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:25,019 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:03:25,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 02:03:25,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:25,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 02:03:25,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 02:03:25,020 INFO L87 Difference]: Start difference. First operand 42679 states and 156594 transitions. Second operand 3 states. [2019-12-28 02:03:25,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:25,678 INFO L93 Difference]: Finished difference Result 61089 states and 221432 transitions. [2019-12-28 02:03:25,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 02:03:25,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-28 02:03:25,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:25,878 INFO L225 Difference]: With dead ends: 61089 [2019-12-28 02:03:25,879 INFO L226 Difference]: Without dead ends: 61089 [2019-12-28 02:03:25,880 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 02:03:26,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61089 states. [2019-12-28 02:03:28,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61089 to 48018. [2019-12-28 02:03:28,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48018 states. [2019-12-28 02:03:28,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48018 states to 48018 states and 174181 transitions. [2019-12-28 02:03:28,929 INFO L78 Accepts]: Start accepts. Automaton has 48018 states and 174181 transitions. Word has length 51 [2019-12-28 02:03:28,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:28,929 INFO L462 AbstractCegarLoop]: Abstraction has 48018 states and 174181 transitions. [2019-12-28 02:03:28,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 02:03:28,929 INFO L276 IsEmpty]: Start isEmpty. Operand 48018 states and 174181 transitions. [2019-12-28 02:03:28,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 02:03:28,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:28,948 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:03:28,948 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:28,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:28,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1064293156, now seen corresponding path program 1 times [2019-12-28 02:03:28,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:28,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347178900] [2019-12-28 02:03:28,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:29,084 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 02:03:29,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347178900] [2019-12-28 02:03:29,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:29,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:03:29,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [684935686] [2019-12-28 02:03:29,085 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:29,092 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:29,099 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 67 transitions. [2019-12-28 02:03:29,099 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:29,179 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 02:03:29,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:03:29,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:29,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:03:29,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:03:29,180 INFO L87 Difference]: Start difference. First operand 48018 states and 174181 transitions. Second operand 7 states. [2019-12-28 02:03:30,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:30,141 INFO L93 Difference]: Finished difference Result 63758 states and 229381 transitions. [2019-12-28 02:03:30,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:03:30,142 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-28 02:03:30,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:30,983 INFO L225 Difference]: With dead ends: 63758 [2019-12-28 02:03:30,983 INFO L226 Difference]: Without dead ends: 63758 [2019-12-28 02:03:30,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:03:31,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63758 states. [2019-12-28 02:03:34,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63758 to 59951. [2019-12-28 02:03:34,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59951 states. [2019-12-28 02:03:34,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59951 states to 59951 states and 215674 transitions. [2019-12-28 02:03:34,995 INFO L78 Accepts]: Start accepts. Automaton has 59951 states and 215674 transitions. Word has length 55 [2019-12-28 02:03:34,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:34,995 INFO L462 AbstractCegarLoop]: Abstraction has 59951 states and 215674 transitions. [2019-12-28 02:03:34,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:03:34,995 INFO L276 IsEmpty]: Start isEmpty. Operand 59951 states and 215674 transitions. [2019-12-28 02:03:35,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 02:03:35,026 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:35,026 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:03:35,027 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:35,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:35,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1433722781, now seen corresponding path program 1 times [2019-12-28 02:03:35,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:35,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146007059] [2019-12-28 02:03:35,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:35,157 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 02:03:35,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146007059] [2019-12-28 02:03:35,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:35,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 02:03:35,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1362653268] [2019-12-28 02:03:35,159 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:35,167 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:35,176 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 67 transitions. [2019-12-28 02:03:35,176 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:35,196 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 02:03:35,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 02:03:35,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:35,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 02:03:35,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:03:35,198 INFO L87 Difference]: Start difference. First operand 59951 states and 215674 transitions. Second operand 8 states. [2019-12-28 02:03:36,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:36,762 INFO L93 Difference]: Finished difference Result 83687 states and 290099 transitions. [2019-12-28 02:03:36,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 02:03:36,762 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-28 02:03:36,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:36,947 INFO L225 Difference]: With dead ends: 83687 [2019-12-28 02:03:36,947 INFO L226 Difference]: Without dead ends: 83687 [2019-12-28 02:03:36,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-28 02:03:37,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83687 states. [2019-12-28 02:03:38,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83687 to 71014. [2019-12-28 02:03:38,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71014 states. [2019-12-28 02:03:42,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71014 states to 71014 states and 249888 transitions. [2019-12-28 02:03:42,044 INFO L78 Accepts]: Start accepts. Automaton has 71014 states and 249888 transitions. Word has length 55 [2019-12-28 02:03:42,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:42,044 INFO L462 AbstractCegarLoop]: Abstraction has 71014 states and 249888 transitions. [2019-12-28 02:03:42,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 02:03:42,045 INFO L276 IsEmpty]: Start isEmpty. Operand 71014 states and 249888 transitions. [2019-12-28 02:03:42,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 02:03:42,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:42,063 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:03:42,063 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:42,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:42,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1973740834, now seen corresponding path program 1 times [2019-12-28 02:03:42,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:42,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765211775] [2019-12-28 02:03:42,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:42,146 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 02:03:42,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765211775] [2019-12-28 02:03:42,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:42,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:03:42,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [73227802] [2019-12-28 02:03:42,148 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:42,155 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:42,162 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 67 transitions. [2019-12-28 02:03:42,162 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:42,167 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 02:03:42,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:03:42,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:42,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:03:42,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:03:42,168 INFO L87 Difference]: Start difference. First operand 71014 states and 249888 transitions. Second operand 4 states. [2019-12-28 02:03:42,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:42,251 INFO L93 Difference]: Finished difference Result 12161 states and 37831 transitions. [2019-12-28 02:03:42,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 02:03:42,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-28 02:03:42,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:42,273 INFO L225 Difference]: With dead ends: 12161 [2019-12-28 02:03:42,273 INFO L226 Difference]: Without dead ends: 10676 [2019-12-28 02:03:42,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 02:03:42,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10676 states. [2019-12-28 02:03:42,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10676 to 10627. [2019-12-28 02:03:42,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10627 states. [2019-12-28 02:03:42,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10627 states to 10627 states and 32593 transitions. [2019-12-28 02:03:42,415 INFO L78 Accepts]: Start accepts. Automaton has 10627 states and 32593 transitions. Word has length 55 [2019-12-28 02:03:42,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:42,415 INFO L462 AbstractCegarLoop]: Abstraction has 10627 states and 32593 transitions. [2019-12-28 02:03:42,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:03:42,415 INFO L276 IsEmpty]: Start isEmpty. Operand 10627 states and 32593 transitions. [2019-12-28 02:03:42,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 02:03:42,417 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:42,417 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:03:42,417 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:42,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:42,417 INFO L82 PathProgramCache]: Analyzing trace with hash -984017040, now seen corresponding path program 1 times [2019-12-28 02:03:42,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:42,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694091144] [2019-12-28 02:03:42,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:42,481 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 02:03:42,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694091144] [2019-12-28 02:03:42,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:42,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:03:42,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [897367317] [2019-12-28 02:03:42,482 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:42,489 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:42,497 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 56 states and 55 transitions. [2019-12-28 02:03:42,497 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:42,497 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:03:42,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:03:42,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:42,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:03:42,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:03:42,499 INFO L87 Difference]: Start difference. First operand 10627 states and 32593 transitions. Second operand 6 states. [2019-12-28 02:03:42,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:42,996 INFO L93 Difference]: Finished difference Result 13184 states and 39874 transitions. [2019-12-28 02:03:42,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 02:03:42,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-28 02:03:42,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:43,015 INFO L225 Difference]: With dead ends: 13184 [2019-12-28 02:03:43,016 INFO L226 Difference]: Without dead ends: 13121 [2019-12-28 02:03:43,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-28 02:03:43,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13121 states. [2019-12-28 02:03:43,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13121 to 11050. [2019-12-28 02:03:43,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11050 states. [2019-12-28 02:03:43,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11050 states to 11050 states and 33787 transitions. [2019-12-28 02:03:43,172 INFO L78 Accepts]: Start accepts. Automaton has 11050 states and 33787 transitions. Word has length 55 [2019-12-28 02:03:43,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:43,172 INFO L462 AbstractCegarLoop]: Abstraction has 11050 states and 33787 transitions. [2019-12-28 02:03:43,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:03:43,172 INFO L276 IsEmpty]: Start isEmpty. Operand 11050 states and 33787 transitions. [2019-12-28 02:03:43,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-28 02:03:43,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:43,176 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:03:43,176 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:43,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:43,176 INFO L82 PathProgramCache]: Analyzing trace with hash 721551436, now seen corresponding path program 1 times [2019-12-28 02:03:43,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:43,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147087824] [2019-12-28 02:03:43,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:43,250 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 02:03:43,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147087824] [2019-12-28 02:03:43,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:43,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:03:43,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1463077586] [2019-12-28 02:03:43,254 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:43,265 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:43,277 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 63 transitions. [2019-12-28 02:03:43,277 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:43,277 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:03:43,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:03:43,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:43,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:03:43,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:03:43,279 INFO L87 Difference]: Start difference. First operand 11050 states and 33787 transitions. Second operand 4 states. [2019-12-28 02:03:43,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:43,459 INFO L93 Difference]: Finished difference Result 12864 states and 39393 transitions. [2019-12-28 02:03:43,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 02:03:43,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-28 02:03:43,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:43,491 INFO L225 Difference]: With dead ends: 12864 [2019-12-28 02:03:43,491 INFO L226 Difference]: Without dead ends: 12864 [2019-12-28 02:03:43,492 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 02:03:43,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12864 states. [2019-12-28 02:03:43,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12864 to 11695. [2019-12-28 02:03:43,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11695 states. [2019-12-28 02:03:43,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11695 states to 11695 states and 35764 transitions. [2019-12-28 02:03:43,782 INFO L78 Accepts]: Start accepts. Automaton has 11695 states and 35764 transitions. Word has length 63 [2019-12-28 02:03:43,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:43,783 INFO L462 AbstractCegarLoop]: Abstraction has 11695 states and 35764 transitions. [2019-12-28 02:03:43,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:03:43,783 INFO L276 IsEmpty]: Start isEmpty. Operand 11695 states and 35764 transitions. [2019-12-28 02:03:43,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-28 02:03:43,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:43,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] [2019-12-28 02:03:43,789 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:43,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:43,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1830605525, now seen corresponding path program 1 times [2019-12-28 02:03:43,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:43,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524585317] [2019-12-28 02:03:43,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:43,911 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 02:03:43,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524585317] [2019-12-28 02:03:43,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:43,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:03:43,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [16902000] [2019-12-28 02:03:43,912 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:43,922 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:43,945 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 63 transitions. [2019-12-28 02:03:43,945 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:43,946 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:03:43,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:03:43,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:43,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:03:43,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:03:43,947 INFO L87 Difference]: Start difference. First operand 11695 states and 35764 transitions. Second operand 6 states. [2019-12-28 02:03:44,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:44,411 INFO L93 Difference]: Finished difference Result 14221 states and 42862 transitions. [2019-12-28 02:03:44,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 02:03:44,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-12-28 02:03:44,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:44,614 INFO L225 Difference]: With dead ends: 14221 [2019-12-28 02:03:44,614 INFO L226 Difference]: Without dead ends: 14160 [2019-12-28 02:03:44,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-28 02:03:44,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14160 states. [2019-12-28 02:03:44,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14160 to 13463. [2019-12-28 02:03:44,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13463 states. [2019-12-28 02:03:44,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13463 states to 13463 states and 40781 transitions. [2019-12-28 02:03:44,799 INFO L78 Accepts]: Start accepts. Automaton has 13463 states and 40781 transitions. Word has length 63 [2019-12-28 02:03:44,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:44,799 INFO L462 AbstractCegarLoop]: Abstraction has 13463 states and 40781 transitions. [2019-12-28 02:03:44,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:03:44,800 INFO L276 IsEmpty]: Start isEmpty. Operand 13463 states and 40781 transitions. [2019-12-28 02:03:44,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 02:03:44,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:44,806 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 02:03:44,806 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:44,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:44,806 INFO L82 PathProgramCache]: Analyzing trace with hash -827165457, now seen corresponding path program 1 times [2019-12-28 02:03:44,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:44,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178960735] [2019-12-28 02:03:44,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:44,868 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 02:03:44,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178960735] [2019-12-28 02:03:44,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:44,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 02:03:44,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1932079806] [2019-12-28 02:03:44,869 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:44,879 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:44,906 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 171 transitions. [2019-12-28 02:03:44,907 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:44,976 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 02:03:44,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:03:44,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:44,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:03:44,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:03:44,978 INFO L87 Difference]: Start difference. First operand 13463 states and 40781 transitions. Second operand 5 states. [2019-12-28 02:03:45,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:45,321 INFO L93 Difference]: Finished difference Result 14051 states and 42317 transitions. [2019-12-28 02:03:45,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 02:03:45,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-28 02:03:45,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:45,343 INFO L225 Difference]: With dead ends: 14051 [2019-12-28 02:03:45,343 INFO L226 Difference]: Without dead ends: 14051 [2019-12-28 02:03:45,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:03:45,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14051 states. [2019-12-28 02:03:45,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14051 to 13757. [2019-12-28 02:03:45,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13757 states. [2019-12-28 02:03:45,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13757 states to 13757 states and 41549 transitions. [2019-12-28 02:03:45,535 INFO L78 Accepts]: Start accepts. Automaton has 13757 states and 41549 transitions. Word has length 67 [2019-12-28 02:03:45,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:45,535 INFO L462 AbstractCegarLoop]: Abstraction has 13757 states and 41549 transitions. [2019-12-28 02:03:45,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:03:45,535 INFO L276 IsEmpty]: Start isEmpty. Operand 13757 states and 41549 transitions. [2019-12-28 02:03:45,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 02:03:45,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:45,542 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 02:03:45,542 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:45,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:45,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1250043886, now seen corresponding path program 1 times [2019-12-28 02:03:45,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:45,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265933132] [2019-12-28 02:03:45,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:45,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:03:45,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265933132] [2019-12-28 02:03:45,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:45,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:03:45,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1640009034] [2019-12-28 02:03:45,602 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:45,615 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:45,640 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 171 transitions. [2019-12-28 02:03:45,641 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:45,686 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-28 02:03:45,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:03:45,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:45,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:03:45,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:03:45,689 INFO L87 Difference]: Start difference. First operand 13757 states and 41549 transitions. Second operand 7 states. [2019-12-28 02:03:46,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:46,196 INFO L93 Difference]: Finished difference Result 16799 states and 50141 transitions. [2019-12-28 02:03:46,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 02:03:46,197 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-28 02:03:46,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:46,222 INFO L225 Difference]: With dead ends: 16799 [2019-12-28 02:03:46,222 INFO L226 Difference]: Without dead ends: 16799 [2019-12-28 02:03:46,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:03:46,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16799 states. [2019-12-28 02:03:46,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16799 to 15278. [2019-12-28 02:03:46,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15278 states. [2019-12-28 02:03:46,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15278 states to 15278 states and 45730 transitions. [2019-12-28 02:03:46,432 INFO L78 Accepts]: Start accepts. Automaton has 15278 states and 45730 transitions. Word has length 67 [2019-12-28 02:03:46,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:46,432 INFO L462 AbstractCegarLoop]: Abstraction has 15278 states and 45730 transitions. [2019-12-28 02:03:46,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:03:46,432 INFO L276 IsEmpty]: Start isEmpty. Operand 15278 states and 45730 transitions. [2019-12-28 02:03:46,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:03:46,440 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:46,440 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 02:03:46,440 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:46,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:46,441 INFO L82 PathProgramCache]: Analyzing trace with hash -750353405, now seen corresponding path program 1 times [2019-12-28 02:03:46,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:46,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893326476] [2019-12-28 02:03:46,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:46,543 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 02:03:46,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893326476] [2019-12-28 02:03:46,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:46,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:03:46,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1028826568] [2019-12-28 02:03:46,544 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:46,555 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:46,580 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 173 transitions. [2019-12-28 02:03:46,580 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:46,710 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-28 02:03:46,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 02:03:46,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:46,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 02:03:46,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-28 02:03:46,711 INFO L87 Difference]: Start difference. First operand 15278 states and 45730 transitions. Second operand 10 states. [2019-12-28 02:03:47,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:47,708 INFO L93 Difference]: Finished difference Result 16275 states and 48105 transitions. [2019-12-28 02:03:47,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:03:47,708 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 69 [2019-12-28 02:03:47,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:47,732 INFO L225 Difference]: With dead ends: 16275 [2019-12-28 02:03:47,732 INFO L226 Difference]: Without dead ends: 16275 [2019-12-28 02:03:47,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-28 02:03:47,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16275 states. [2019-12-28 02:03:47,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16275 to 15851. [2019-12-28 02:03:47,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15851 states. [2019-12-28 02:03:48,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15851 states to 15851 states and 47027 transitions. [2019-12-28 02:03:48,003 INFO L78 Accepts]: Start accepts. Automaton has 15851 states and 47027 transitions. Word has length 69 [2019-12-28 02:03:48,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:48,004 INFO L462 AbstractCegarLoop]: Abstraction has 15851 states and 47027 transitions. [2019-12-28 02:03:48,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 02:03:48,004 INFO L276 IsEmpty]: Start isEmpty. Operand 15851 states and 47027 transitions. [2019-12-28 02:03:48,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:03:48,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:48,014 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:03:48,014 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:48,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:48,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1467404548, now seen corresponding path program 1 times [2019-12-28 02:03:48,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:48,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137627109] [2019-12-28 02:03:48,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:48,133 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 02:03:48,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137627109] [2019-12-28 02:03:48,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:48,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:03:48,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [58486626] [2019-12-28 02:03:48,135 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:48,159 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:48,186 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 173 transitions. [2019-12-28 02:03:48,186 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:48,336 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-28 02:03:48,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 02:03:48,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:48,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 02:03:48,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-28 02:03:48,337 INFO L87 Difference]: Start difference. First operand 15851 states and 47027 transitions. Second operand 10 states. [2019-12-28 02:03:49,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:49,024 INFO L93 Difference]: Finished difference Result 18162 states and 52355 transitions. [2019-12-28 02:03:49,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 02:03:49,025 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 69 [2019-12-28 02:03:49,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:49,051 INFO L225 Difference]: With dead ends: 18162 [2019-12-28 02:03:49,051 INFO L226 Difference]: Without dead ends: 18162 [2019-12-28 02:03:49,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-12-28 02:03:49,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18162 states. [2019-12-28 02:03:49,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18162 to 16543. [2019-12-28 02:03:49,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16543 states. [2019-12-28 02:03:49,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16543 states to 16543 states and 48247 transitions. [2019-12-28 02:03:49,287 INFO L78 Accepts]: Start accepts. Automaton has 16543 states and 48247 transitions. Word has length 69 [2019-12-28 02:03:49,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:49,287 INFO L462 AbstractCegarLoop]: Abstraction has 16543 states and 48247 transitions. [2019-12-28 02:03:49,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 02:03:49,287 INFO L276 IsEmpty]: Start isEmpty. Operand 16543 states and 48247 transitions. [2019-12-28 02:03:49,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:03:49,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:49,299 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 02:03:49,300 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:49,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:49,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1678755461, now seen corresponding path program 1 times [2019-12-28 02:03:49,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:49,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920061227] [2019-12-28 02:03:49,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:49,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:03:49,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920061227] [2019-12-28 02:03:49,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:49,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:03:49,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1246966060] [2019-12-28 02:03:49,368 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:49,378 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:49,402 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 173 transitions. [2019-12-28 02:03:49,403 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:49,449 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 02:03:49,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:03:49,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:49,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:03:49,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:03:49,450 INFO L87 Difference]: Start difference. First operand 16543 states and 48247 transitions. Second operand 7 states. [2019-12-28 02:03:49,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:49,896 INFO L93 Difference]: Finished difference Result 21457 states and 62487 transitions. [2019-12-28 02:03:49,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 02:03:49,896 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-12-28 02:03:49,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:49,926 INFO L225 Difference]: With dead ends: 21457 [2019-12-28 02:03:49,926 INFO L226 Difference]: Without dead ends: 21457 [2019-12-28 02:03:49,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:03:49,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21457 states. [2019-12-28 02:03:50,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21457 to 19522. [2019-12-28 02:03:50,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19522 states. [2019-12-28 02:03:50,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19522 states to 19522 states and 56656 transitions. [2019-12-28 02:03:50,184 INFO L78 Accepts]: Start accepts. Automaton has 19522 states and 56656 transitions. Word has length 69 [2019-12-28 02:03:50,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:50,184 INFO L462 AbstractCegarLoop]: Abstraction has 19522 states and 56656 transitions. [2019-12-28 02:03:50,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:03:50,184 INFO L276 IsEmpty]: Start isEmpty. Operand 19522 states and 56656 transitions. [2019-12-28 02:03:50,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:03:50,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:50,195 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 02:03:50,195 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:50,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:50,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1168221284, now seen corresponding path program 1 times [2019-12-28 02:03:50,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:50,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878214188] [2019-12-28 02:03:50,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:50,279 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 02:03:50,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878214188] [2019-12-28 02:03:50,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:50,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:03:50,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [304067795] [2019-12-28 02:03:50,281 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:50,456 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:50,481 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 173 transitions. [2019-12-28 02:03:50,482 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:50,522 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 02:03:50,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:03:50,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:50,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:03:50,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:03:50,524 INFO L87 Difference]: Start difference. First operand 19522 states and 56656 transitions. Second operand 7 states. [2019-12-28 02:03:51,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:51,176 INFO L93 Difference]: Finished difference Result 26409 states and 76314 transitions. [2019-12-28 02:03:51,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:03:51,177 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-12-28 02:03:51,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:51,215 INFO L225 Difference]: With dead ends: 26409 [2019-12-28 02:03:51,216 INFO L226 Difference]: Without dead ends: 26409 [2019-12-28 02:03:51,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-28 02:03:51,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26409 states. [2019-12-28 02:03:51,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26409 to 21410. [2019-12-28 02:03:51,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21410 states. [2019-12-28 02:03:51,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21410 states to 21410 states and 61930 transitions. [2019-12-28 02:03:51,517 INFO L78 Accepts]: Start accepts. Automaton has 21410 states and 61930 transitions. Word has length 69 [2019-12-28 02:03:51,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:51,517 INFO L462 AbstractCegarLoop]: Abstraction has 21410 states and 61930 transitions. [2019-12-28 02:03:51,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:03:51,517 INFO L276 IsEmpty]: Start isEmpty. Operand 21410 states and 61930 transitions. [2019-12-28 02:03:51,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:03:51,529 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:51,529 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 02:03:51,529 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:51,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:51,529 INFO L82 PathProgramCache]: Analyzing trace with hash -639233179, now seen corresponding path program 1 times [2019-12-28 02:03:51,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:51,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372580091] [2019-12-28 02:03:51,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:51,589 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 02:03:51,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372580091] [2019-12-28 02:03:51,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:51,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:03:51,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1745759799] [2019-12-28 02:03:51,590 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:51,599 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:51,623 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 173 transitions. [2019-12-28 02:03:51,624 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:51,624 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:03:51,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:03:51,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:51,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:03:51,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:03:51,625 INFO L87 Difference]: Start difference. First operand 21410 states and 61930 transitions. Second operand 4 states. [2019-12-28 02:03:52,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:52,279 INFO L93 Difference]: Finished difference Result 27971 states and 81352 transitions. [2019-12-28 02:03:52,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 02:03:52,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-28 02:03:52,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:52,318 INFO L225 Difference]: With dead ends: 27971 [2019-12-28 02:03:52,318 INFO L226 Difference]: Without dead ends: 27836 [2019-12-28 02:03:52,319 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 02:03:52,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27836 states. [2019-12-28 02:03:52,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27836 to 25847. [2019-12-28 02:03:52,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25847 states. [2019-12-28 02:03:52,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25847 states to 25847 states and 75190 transitions. [2019-12-28 02:03:52,665 INFO L78 Accepts]: Start accepts. Automaton has 25847 states and 75190 transitions. Word has length 69 [2019-12-28 02:03:52,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:52,665 INFO L462 AbstractCegarLoop]: Abstraction has 25847 states and 75190 transitions. [2019-12-28 02:03:52,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:03:52,666 INFO L276 IsEmpty]: Start isEmpty. Operand 25847 states and 75190 transitions. [2019-12-28 02:03:52,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:03:52,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:52,675 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 02:03:52,675 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:52,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:52,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1858782758, now seen corresponding path program 1 times [2019-12-28 02:03:52,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:52,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512396259] [2019-12-28 02:03:52,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:52,802 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 02:03:52,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512396259] [2019-12-28 02:03:52,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:52,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 02:03:52,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [697605954] [2019-12-28 02:03:52,803 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:52,812 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:52,838 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 173 transitions. [2019-12-28 02:03:52,838 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:52,981 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-28 02:03:52,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-28 02:03:52,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:52,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-28 02:03:52,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-12-28 02:03:52,982 INFO L87 Difference]: Start difference. First operand 25847 states and 75190 transitions. Second operand 13 states. [2019-12-28 02:03:54,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:54,718 INFO L93 Difference]: Finished difference Result 32127 states and 92914 transitions. [2019-12-28 02:03:54,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 02:03:54,719 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2019-12-28 02:03:54,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:54,764 INFO L225 Difference]: With dead ends: 32127 [2019-12-28 02:03:54,764 INFO L226 Difference]: Without dead ends: 32127 [2019-12-28 02:03:54,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2019-12-28 02:03:54,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32127 states. [2019-12-28 02:03:55,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32127 to 28383. [2019-12-28 02:03:55,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28383 states. [2019-12-28 02:03:55,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28383 states to 28383 states and 82403 transitions. [2019-12-28 02:03:55,145 INFO L78 Accepts]: Start accepts. Automaton has 28383 states and 82403 transitions. Word has length 69 [2019-12-28 02:03:55,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:55,145 INFO L462 AbstractCegarLoop]: Abstraction has 28383 states and 82403 transitions. [2019-12-28 02:03:55,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-28 02:03:55,145 INFO L276 IsEmpty]: Start isEmpty. Operand 28383 states and 82403 transitions. [2019-12-28 02:03:55,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:03:55,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:55,154 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 02:03:55,154 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:55,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:55,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1548680857, now seen corresponding path program 1 times [2019-12-28 02:03:55,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:55,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603222904] [2019-12-28 02:03:55,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:55,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:03:55,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603222904] [2019-12-28 02:03:55,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:55,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:03:55,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1331696189] [2019-12-28 02:03:55,226 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:55,236 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:55,260 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 173 transitions. [2019-12-28 02:03:55,260 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:55,282 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:03:55,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:03:55,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:55,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:03:55,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:03:55,284 INFO L87 Difference]: Start difference. First operand 28383 states and 82403 transitions. Second operand 6 states. [2019-12-28 02:03:55,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:55,373 INFO L93 Difference]: Finished difference Result 7794 states and 18427 transitions. [2019-12-28 02:03:55,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 02:03:55,374 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-28 02:03:55,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:55,383 INFO L225 Difference]: With dead ends: 7794 [2019-12-28 02:03:55,383 INFO L226 Difference]: Without dead ends: 6492 [2019-12-28 02:03:55,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:03:55,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6492 states. [2019-12-28 02:03:55,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6492 to 5192. [2019-12-28 02:03:55,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5192 states. [2019-12-28 02:03:55,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5192 states to 5192 states and 11976 transitions. [2019-12-28 02:03:55,493 INFO L78 Accepts]: Start accepts. Automaton has 5192 states and 11976 transitions. Word has length 69 [2019-12-28 02:03:55,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:55,494 INFO L462 AbstractCegarLoop]: Abstraction has 5192 states and 11976 transitions. [2019-12-28 02:03:55,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:03:55,494 INFO L276 IsEmpty]: Start isEmpty. Operand 5192 states and 11976 transitions. [2019-12-28 02:03:55,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:03:55,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:55,502 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 02:03:55,502 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:55,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:55,503 INFO L82 PathProgramCache]: Analyzing trace with hash -839136164, now seen corresponding path program 1 times [2019-12-28 02:03:55,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:55,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938690391] [2019-12-28 02:03:55,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:55,547 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 02:03:55,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938690391] [2019-12-28 02:03:55,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:55,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 02:03:55,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1132418756] [2019-12-28 02:03:55,548 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:55,566 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:55,586 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 02:03:55,586 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:55,587 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:03:55,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 02:03:55,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:55,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 02:03:55,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 02:03:55,589 INFO L87 Difference]: Start difference. First operand 5192 states and 11976 transitions. Second operand 3 states. [2019-12-28 02:03:55,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:55,633 INFO L93 Difference]: Finished difference Result 6814 states and 15573 transitions. [2019-12-28 02:03:55,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 02:03:55,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-28 02:03:55,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:55,643 INFO L225 Difference]: With dead ends: 6814 [2019-12-28 02:03:55,643 INFO L226 Difference]: Without dead ends: 6814 [2019-12-28 02:03:55,643 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 02:03:55,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6814 states. [2019-12-28 02:03:55,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6814 to 5115. [2019-12-28 02:03:55,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5115 states. [2019-12-28 02:03:55,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5115 states to 5115 states and 11523 transitions. [2019-12-28 02:03:55,722 INFO L78 Accepts]: Start accepts. Automaton has 5115 states and 11523 transitions. Word has length 69 [2019-12-28 02:03:55,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:55,722 INFO L462 AbstractCegarLoop]: Abstraction has 5115 states and 11523 transitions. [2019-12-28 02:03:55,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 02:03:55,722 INFO L276 IsEmpty]: Start isEmpty. Operand 5115 states and 11523 transitions. [2019-12-28 02:03:55,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 02:03:55,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:55,728 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:03:55,729 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:55,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:55,729 INFO L82 PathProgramCache]: Analyzing trace with hash -537618065, now seen corresponding path program 1 times [2019-12-28 02:03:55,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:55,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415421778] [2019-12-28 02:03:55,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:55,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:55,802 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 02:03:55,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415421778] [2019-12-28 02:03:55,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:55,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:03:55,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1497251655] [2019-12-28 02:03:55,804 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:55,817 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:55,837 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 75 transitions. [2019-12-28 02:03:55,837 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:55,837 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:03:55,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:03:55,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:55,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:03:55,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:03:55,839 INFO L87 Difference]: Start difference. First operand 5115 states and 11523 transitions. Second operand 5 states. [2019-12-28 02:03:56,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:56,016 INFO L93 Difference]: Finished difference Result 6192 states and 13988 transitions. [2019-12-28 02:03:56,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 02:03:56,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-12-28 02:03:56,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:56,024 INFO L225 Difference]: With dead ends: 6192 [2019-12-28 02:03:56,024 INFO L226 Difference]: Without dead ends: 6192 [2019-12-28 02:03:56,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:03:56,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6192 states. [2019-12-28 02:03:56,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6192 to 5535. [2019-12-28 02:03:56,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5535 states. [2019-12-28 02:03:56,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5535 states to 5535 states and 12481 transitions. [2019-12-28 02:03:56,076 INFO L78 Accepts]: Start accepts. Automaton has 5535 states and 12481 transitions. Word has length 75 [2019-12-28 02:03:56,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:56,076 INFO L462 AbstractCegarLoop]: Abstraction has 5535 states and 12481 transitions. [2019-12-28 02:03:56,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:03:56,076 INFO L276 IsEmpty]: Start isEmpty. Operand 5535 states and 12481 transitions. [2019-12-28 02:03:56,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 02:03:56,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:56,081 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:03:56,081 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:56,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:56,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1205192270, now seen corresponding path program 1 times [2019-12-28 02:03:56,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:56,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331848540] [2019-12-28 02:03:56,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:56,159 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 02:03:56,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331848540] [2019-12-28 02:03:56,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:56,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 02:03:56,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1384362808] [2019-12-28 02:03:56,160 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:56,174 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:56,195 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 75 transitions. [2019-12-28 02:03:56,195 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:56,195 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:03:56,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:03:56,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:56,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:03:56,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:03:56,196 INFO L87 Difference]: Start difference. First operand 5535 states and 12481 transitions. Second operand 7 states. [2019-12-28 02:03:56,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:56,697 INFO L93 Difference]: Finished difference Result 6346 states and 14202 transitions. [2019-12-28 02:03:56,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 02:03:56,698 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-12-28 02:03:56,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:56,707 INFO L225 Difference]: With dead ends: 6346 [2019-12-28 02:03:56,708 INFO L226 Difference]: Without dead ends: 6293 [2019-12-28 02:03:56,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-28 02:03:56,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6293 states. [2019-12-28 02:03:56,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6293 to 5566. [2019-12-28 02:03:56,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5566 states. [2019-12-28 02:03:56,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5566 states to 5566 states and 12481 transitions. [2019-12-28 02:03:56,938 INFO L78 Accepts]: Start accepts. Automaton has 5566 states and 12481 transitions. Word has length 75 [2019-12-28 02:03:56,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:56,938 INFO L462 AbstractCegarLoop]: Abstraction has 5566 states and 12481 transitions. [2019-12-28 02:03:56,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:03:56,939 INFO L276 IsEmpty]: Start isEmpty. Operand 5566 states and 12481 transitions. [2019-12-28 02:03:56,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-28 02:03:56,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:56,949 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:03:56,949 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:56,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:56,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1794925312, now seen corresponding path program 1 times [2019-12-28 02:03:56,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:56,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650329484] [2019-12-28 02:03:56,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:57,004 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 02:03:57,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650329484] [2019-12-28 02:03:57,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:57,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 02:03:57,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [413457477] [2019-12-28 02:03:57,005 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:57,044 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:57,185 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 201 states and 306 transitions. [2019-12-28 02:03:57,186 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:57,188 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 02:03:57,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 02:03:57,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:57,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 02:03:57,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 02:03:57,189 INFO L87 Difference]: Start difference. First operand 5566 states and 12481 transitions. Second operand 3 states. [2019-12-28 02:03:57,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:57,387 INFO L93 Difference]: Finished difference Result 7032 states and 15538 transitions. [2019-12-28 02:03:57,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 02:03:57,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-28 02:03:57,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:57,398 INFO L225 Difference]: With dead ends: 7032 [2019-12-28 02:03:57,398 INFO L226 Difference]: Without dead ends: 7032 [2019-12-28 02:03:57,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 02:03:57,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7032 states. [2019-12-28 02:03:57,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7032 to 6535. [2019-12-28 02:03:57,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6535 states. [2019-12-28 02:03:57,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6535 states to 6535 states and 14485 transitions. [2019-12-28 02:03:57,498 INFO L78 Accepts]: Start accepts. Automaton has 6535 states and 14485 transitions. Word has length 94 [2019-12-28 02:03:57,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:57,498 INFO L462 AbstractCegarLoop]: Abstraction has 6535 states and 14485 transitions. [2019-12-28 02:03:57,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 02:03:57,499 INFO L276 IsEmpty]: Start isEmpty. Operand 6535 states and 14485 transitions. [2019-12-28 02:03:57,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-28 02:03:57,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:57,508 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:03:57,508 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:57,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:57,508 INFO L82 PathProgramCache]: Analyzing trace with hash 967409837, now seen corresponding path program 1 times [2019-12-28 02:03:57,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:57,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498324424] [2019-12-28 02:03:57,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:57,566 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 02:03:57,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498324424] [2019-12-28 02:03:57,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:57,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:03:57,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1925673864] [2019-12-28 02:03:57,568 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:57,592 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:57,677 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 150 states and 203 transitions. [2019-12-28 02:03:57,678 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:57,678 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:03:57,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:03:57,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:57,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:03:57,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:03:57,680 INFO L87 Difference]: Start difference. First operand 6535 states and 14485 transitions. Second operand 4 states. [2019-12-28 02:03:57,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:57,792 INFO L93 Difference]: Finished difference Result 6989 states and 15530 transitions. [2019-12-28 02:03:57,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 02:03:57,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-28 02:03:57,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:57,801 INFO L225 Difference]: With dead ends: 6989 [2019-12-28 02:03:57,801 INFO L226 Difference]: Without dead ends: 6989 [2019-12-28 02:03:57,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:03:57,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6989 states. [2019-12-28 02:03:57,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6989 to 6410. [2019-12-28 02:03:57,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6410 states. [2019-12-28 02:03:57,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6410 states to 6410 states and 14304 transitions. [2019-12-28 02:03:57,871 INFO L78 Accepts]: Start accepts. Automaton has 6410 states and 14304 transitions. Word has length 94 [2019-12-28 02:03:57,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:57,871 INFO L462 AbstractCegarLoop]: Abstraction has 6410 states and 14304 transitions. [2019-12-28 02:03:57,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:03:57,871 INFO L276 IsEmpty]: Start isEmpty. Operand 6410 states and 14304 transitions. [2019-12-28 02:03:57,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 02:03:57,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:57,878 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:03:57,879 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:57,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:57,879 INFO L82 PathProgramCache]: Analyzing trace with hash 788317478, now seen corresponding path program 1 times [2019-12-28 02:03:57,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:57,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126272768] [2019-12-28 02:03:57,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:57,954 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 02:03:57,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126272768] [2019-12-28 02:03:57,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:57,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:03:57,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1009625255] [2019-12-28 02:03:57,956 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:57,980 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:58,099 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 312 transitions. [2019-12-28 02:03:58,099 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:58,120 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 02:03:58,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:03:58,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:58,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:03:58,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:03:58,122 INFO L87 Difference]: Start difference. First operand 6410 states and 14304 transitions. Second operand 6 states. [2019-12-28 02:03:58,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:58,262 INFO L93 Difference]: Finished difference Result 7215 states and 16054 transitions. [2019-12-28 02:03:58,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 02:03:58,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-28 02:03:58,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:58,271 INFO L225 Difference]: With dead ends: 7215 [2019-12-28 02:03:58,272 INFO L226 Difference]: Without dead ends: 7215 [2019-12-28 02:03:58,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:03:58,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7215 states. [2019-12-28 02:03:58,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7215 to 5485. [2019-12-28 02:03:58,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5485 states. [2019-12-28 02:03:58,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5485 states to 5485 states and 12247 transitions. [2019-12-28 02:03:58,363 INFO L78 Accepts]: Start accepts. Automaton has 5485 states and 12247 transitions. Word has length 96 [2019-12-28 02:03:58,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:58,363 INFO L462 AbstractCegarLoop]: Abstraction has 5485 states and 12247 transitions. [2019-12-28 02:03:58,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:03:58,364 INFO L276 IsEmpty]: Start isEmpty. Operand 5485 states and 12247 transitions. [2019-12-28 02:03:58,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 02:03:58,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:58,371 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:03:58,371 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:58,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:58,372 INFO L82 PathProgramCache]: Analyzing trace with hash 533580933, now seen corresponding path program 1 times [2019-12-28 02:03:58,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:58,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981375717] [2019-12-28 02:03:58,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:58,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:58,441 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 02:03:58,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981375717] [2019-12-28 02:03:58,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:58,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:03:58,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1447296483] [2019-12-28 02:03:58,443 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:58,461 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:58,583 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 312 transitions. [2019-12-28 02:03:58,583 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:58,594 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 02:03:58,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:03:58,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:58,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:03:58,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:03:58,596 INFO L87 Difference]: Start difference. First operand 5485 states and 12247 transitions. Second operand 5 states. [2019-12-28 02:03:59,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:59,240 INFO L93 Difference]: Finished difference Result 8793 states and 19711 transitions. [2019-12-28 02:03:59,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 02:03:59,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-28 02:03:59,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:59,252 INFO L225 Difference]: With dead ends: 8793 [2019-12-28 02:03:59,252 INFO L226 Difference]: Without dead ends: 8779 [2019-12-28 02:03:59,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:03:59,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8779 states. [2019-12-28 02:03:59,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8779 to 6401. [2019-12-28 02:03:59,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6401 states. [2019-12-28 02:03:59,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6401 states to 6401 states and 14375 transitions. [2019-12-28 02:03:59,499 INFO L78 Accepts]: Start accepts. Automaton has 6401 states and 14375 transitions. Word has length 96 [2019-12-28 02:03:59,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:59,500 INFO L462 AbstractCegarLoop]: Abstraction has 6401 states and 14375 transitions. [2019-12-28 02:03:59,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:03:59,500 INFO L276 IsEmpty]: Start isEmpty. Operand 6401 states and 14375 transitions. [2019-12-28 02:03:59,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 02:03:59,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:59,508 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:03:59,508 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:59,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:59,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1778345414, now seen corresponding path program 1 times [2019-12-28 02:03:59,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:59,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91463725] [2019-12-28 02:03:59,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:59,597 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 02:03:59,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91463725] [2019-12-28 02:03:59,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:59,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:03:59,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [513863022] [2019-12-28 02:03:59,598 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:59,617 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:59,730 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 312 transitions. [2019-12-28 02:03:59,730 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:59,813 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-28 02:03:59,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 02:03:59,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:59,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 02:03:59,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-28 02:03:59,814 INFO L87 Difference]: Start difference. First operand 6401 states and 14375 transitions. Second operand 10 states. [2019-12-28 02:04:01,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:01,383 INFO L93 Difference]: Finished difference Result 8929 states and 19848 transitions. [2019-12-28 02:04:01,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-28 02:04:01,384 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-28 02:04:01,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:01,394 INFO L225 Difference]: With dead ends: 8929 [2019-12-28 02:04:01,395 INFO L226 Difference]: Without dead ends: 8929 [2019-12-28 02:04:01,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-12-28 02:04:01,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8929 states. [2019-12-28 02:04:01,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8929 to 6089. [2019-12-28 02:04:01,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6089 states. [2019-12-28 02:04:01,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6089 states to 6089 states and 13680 transitions. [2019-12-28 02:04:01,472 INFO L78 Accepts]: Start accepts. Automaton has 6089 states and 13680 transitions. Word has length 96 [2019-12-28 02:04:01,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:01,472 INFO L462 AbstractCegarLoop]: Abstraction has 6089 states and 13680 transitions. [2019-12-28 02:04:01,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 02:04:01,472 INFO L276 IsEmpty]: Start isEmpty. Operand 6089 states and 13680 transitions. [2019-12-28 02:04:01,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 02:04:01,480 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:01,480 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:01,480 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:01,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:01,481 INFO L82 PathProgramCache]: Analyzing trace with hash 2065003707, now seen corresponding path program 1 times [2019-12-28 02:04:01,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:01,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178788342] [2019-12-28 02:04:01,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:01,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:04:01,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178788342] [2019-12-28 02:04:01,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:01,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 02:04:01,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1946936467] [2019-12-28 02:04:01,613 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:01,630 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:01,724 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 205 transitions. [2019-12-28 02:04:01,724 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:01,798 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 02:04:01,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-28 02:04:01,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:01,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-28 02:04:01,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-28 02:04:01,800 INFO L87 Difference]: Start difference. First operand 6089 states and 13680 transitions. Second operand 12 states. [2019-12-28 02:04:04,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:04,226 INFO L93 Difference]: Finished difference Result 11800 states and 26248 transitions. [2019-12-28 02:04:04,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-28 02:04:04,227 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-28 02:04:04,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:04,240 INFO L225 Difference]: With dead ends: 11800 [2019-12-28 02:04:04,241 INFO L226 Difference]: Without dead ends: 11755 [2019-12-28 02:04:04,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=256, Invalid=1076, Unknown=0, NotChecked=0, Total=1332 [2019-12-28 02:04:04,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11755 states. [2019-12-28 02:04:04,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11755 to 7499. [2019-12-28 02:04:04,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7499 states. [2019-12-28 02:04:04,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7499 states to 7499 states and 16820 transitions. [2019-12-28 02:04:04,349 INFO L78 Accepts]: Start accepts. Automaton has 7499 states and 16820 transitions. Word has length 96 [2019-12-28 02:04:04,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:04,350 INFO L462 AbstractCegarLoop]: Abstraction has 7499 states and 16820 transitions. [2019-12-28 02:04:04,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-28 02:04:04,350 INFO L276 IsEmpty]: Start isEmpty. Operand 7499 states and 16820 transitions. [2019-12-28 02:04:04,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 02:04:04,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:04,358 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:04,358 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:04,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:04,358 INFO L82 PathProgramCache]: Analyzing trace with hash 268052348, now seen corresponding path program 1 times [2019-12-28 02:04:04,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:04,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887066971] [2019-12-28 02:04:04,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:04,454 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 02:04:04,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887066971] [2019-12-28 02:04:04,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:04,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 02:04:04,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [613365642] [2019-12-28 02:04:04,456 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:04,472 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:04,707 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 205 transitions. [2019-12-28 02:04:04,707 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:04,709 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 02:04:04,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 02:04:04,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:04,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 02:04:04,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:04:04,710 INFO L87 Difference]: Start difference. First operand 7499 states and 16820 transitions. Second operand 8 states. [2019-12-28 02:04:05,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:05,257 INFO L93 Difference]: Finished difference Result 10983 states and 24709 transitions. [2019-12-28 02:04:05,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 02:04:05,258 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-12-28 02:04:05,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:05,269 INFO L225 Difference]: With dead ends: 10983 [2019-12-28 02:04:05,269 INFO L226 Difference]: Without dead ends: 10983 [2019-12-28 02:04:05,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-28 02:04:05,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10983 states. [2019-12-28 02:04:05,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10983 to 7882. [2019-12-28 02:04:05,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7882 states. [2019-12-28 02:04:05,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7882 states to 7882 states and 17773 transitions. [2019-12-28 02:04:05,361 INFO L78 Accepts]: Start accepts. Automaton has 7882 states and 17773 transitions. Word has length 96 [2019-12-28 02:04:05,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:05,361 INFO L462 AbstractCegarLoop]: Abstraction has 7882 states and 17773 transitions. [2019-12-28 02:04:05,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 02:04:05,361 INFO L276 IsEmpty]: Start isEmpty. Operand 7882 states and 17773 transitions. [2019-12-28 02:04:05,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 02:04:05,368 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:05,368 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:05,368 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:05,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:05,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1155556029, now seen corresponding path program 1 times [2019-12-28 02:04:05,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:05,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887762472] [2019-12-28 02:04:05,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:05,487 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 02:04:05,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887762472] [2019-12-28 02:04:05,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:05,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 02:04:05,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [666429319] [2019-12-28 02:04:05,488 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:05,504 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:05,589 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 205 transitions. [2019-12-28 02:04:05,589 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:05,627 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 02:04:05,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 02:04:05,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:05,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 02:04:05,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:04:05,628 INFO L87 Difference]: Start difference. First operand 7882 states and 17773 transitions. Second operand 8 states. [2019-12-28 02:04:05,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:05,836 INFO L93 Difference]: Finished difference Result 10351 states and 23170 transitions. [2019-12-28 02:04:05,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 02:04:05,837 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-12-28 02:04:05,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:05,846 INFO L225 Difference]: With dead ends: 10351 [2019-12-28 02:04:05,847 INFO L226 Difference]: Without dead ends: 10351 [2019-12-28 02:04:05,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-28 02:04:05,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10351 states. [2019-12-28 02:04:05,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10351 to 7989. [2019-12-28 02:04:05,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7989 states. [2019-12-28 02:04:05,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7989 states to 7989 states and 17796 transitions. [2019-12-28 02:04:05,936 INFO L78 Accepts]: Start accepts. Automaton has 7989 states and 17796 transitions. Word has length 96 [2019-12-28 02:04:05,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:05,936 INFO L462 AbstractCegarLoop]: Abstraction has 7989 states and 17796 transitions. [2019-12-28 02:04:05,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 02:04:05,936 INFO L276 IsEmpty]: Start isEmpty. Operand 7989 states and 17796 transitions. [2019-12-28 02:04:05,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 02:04:05,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:05,943 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:05,943 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:05,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:05,944 INFO L82 PathProgramCache]: Analyzing trace with hash -576419523, now seen corresponding path program 1 times [2019-12-28 02:04:05,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:05,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150123289] [2019-12-28 02:04:05,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:06,040 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 02:04:06,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150123289] [2019-12-28 02:04:06,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:06,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:04:06,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1694682901] [2019-12-28 02:04:06,041 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:06,057 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:06,138 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 205 transitions. [2019-12-28 02:04:06,139 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:06,160 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:04:06,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:04:06,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:06,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:04:06,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:04:06,161 INFO L87 Difference]: Start difference. First operand 7989 states and 17796 transitions. Second operand 7 states. [2019-12-28 02:04:06,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:06,299 INFO L93 Difference]: Finished difference Result 7719 states and 17022 transitions. [2019-12-28 02:04:06,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 02:04:06,300 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-12-28 02:04:06,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:06,308 INFO L225 Difference]: With dead ends: 7719 [2019-12-28 02:04:06,308 INFO L226 Difference]: Without dead ends: 7719 [2019-12-28 02:04:06,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:04:06,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7719 states. [2019-12-28 02:04:06,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7719 to 4815. [2019-12-28 02:04:06,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4815 states. [2019-12-28 02:04:06,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4815 states to 4815 states and 10655 transitions. [2019-12-28 02:04:06,374 INFO L78 Accepts]: Start accepts. Automaton has 4815 states and 10655 transitions. Word has length 96 [2019-12-28 02:04:06,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:06,374 INFO L462 AbstractCegarLoop]: Abstraction has 4815 states and 10655 transitions. [2019-12-28 02:04:06,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:04:06,374 INFO L276 IsEmpty]: Start isEmpty. Operand 4815 states and 10655 transitions. [2019-12-28 02:04:06,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 02:04:06,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:06,379 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:06,379 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:06,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:06,380 INFO L82 PathProgramCache]: Analyzing trace with hash -712112196, now seen corresponding path program 1 times [2019-12-28 02:04:06,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:06,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523989931] [2019-12-28 02:04:06,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:06,485 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 02:04:06,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523989931] [2019-12-28 02:04:06,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:06,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:04:06,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2015582930] [2019-12-28 02:04:06,486 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:06,502 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:06,641 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 207 states and 314 transitions. [2019-12-28 02:04:06,641 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:06,692 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:04:06,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:04:06,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:06,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:04:06,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:04:06,693 INFO L87 Difference]: Start difference. First operand 4815 states and 10655 transitions. Second operand 6 states. [2019-12-28 02:04:06,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:06,759 INFO L93 Difference]: Finished difference Result 4815 states and 10646 transitions. [2019-12-28 02:04:06,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 02:04:06,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-12-28 02:04:06,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:06,769 INFO L225 Difference]: With dead ends: 4815 [2019-12-28 02:04:06,769 INFO L226 Difference]: Without dead ends: 4815 [2019-12-28 02:04:06,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:04:06,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4815 states. [2019-12-28 02:04:06,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4815 to 4815. [2019-12-28 02:04:06,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4815 states. [2019-12-28 02:04:06,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4815 states to 4815 states and 10646 transitions. [2019-12-28 02:04:06,863 INFO L78 Accepts]: Start accepts. Automaton has 4815 states and 10646 transitions. Word has length 98 [2019-12-28 02:04:06,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:06,864 INFO L462 AbstractCegarLoop]: Abstraction has 4815 states and 10646 transitions. [2019-12-28 02:04:06,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:04:06,864 INFO L276 IsEmpty]: Start isEmpty. Operand 4815 states and 10646 transitions. [2019-12-28 02:04:06,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 02:04:06,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:06,870 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:06,871 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:06,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:06,871 INFO L82 PathProgramCache]: Analyzing trace with hash 175391485, now seen corresponding path program 1 times [2019-12-28 02:04:06,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:06,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086373851] [2019-12-28 02:04:06,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:07,127 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 02:04:07,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086373851] [2019-12-28 02:04:07,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:07,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-28 02:04:07,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1679717735] [2019-12-28 02:04:07,137 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:07,165 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:07,451 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 207 states and 314 transitions. [2019-12-28 02:04:07,451 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:07,604 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-28 02:04:07,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-28 02:04:07,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:07,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-28 02:04:07,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-12-28 02:04:07,605 INFO L87 Difference]: Start difference. First operand 4815 states and 10646 transitions. Second operand 15 states. [2019-12-28 02:04:10,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:10,306 INFO L93 Difference]: Finished difference Result 18552 states and 41711 transitions. [2019-12-28 02:04:10,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-28 02:04:10,306 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 98 [2019-12-28 02:04:10,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:10,319 INFO L225 Difference]: With dead ends: 18552 [2019-12-28 02:04:10,319 INFO L226 Difference]: Without dead ends: 11538 [2019-12-28 02:04:10,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=235, Invalid=1325, Unknown=0, NotChecked=0, Total=1560 [2019-12-28 02:04:10,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11538 states. [2019-12-28 02:04:10,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11538 to 4834. [2019-12-28 02:04:10,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4834 states. [2019-12-28 02:04:10,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4834 states to 4834 states and 10596 transitions. [2019-12-28 02:04:10,398 INFO L78 Accepts]: Start accepts. Automaton has 4834 states and 10596 transitions. Word has length 98 [2019-12-28 02:04:10,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:10,398 INFO L462 AbstractCegarLoop]: Abstraction has 4834 states and 10596 transitions. [2019-12-28 02:04:10,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-28 02:04:10,399 INFO L276 IsEmpty]: Start isEmpty. Operand 4834 states and 10596 transitions. [2019-12-28 02:04:10,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 02:04:10,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:10,403 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:10,403 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:10,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:10,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1383760123, now seen corresponding path program 1 times [2019-12-28 02:04:10,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:10,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6146558] [2019-12-28 02:04:10,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:10,470 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 02:04:10,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6146558] [2019-12-28 02:04:10,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:10,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:04:10,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [416605571] [2019-12-28 02:04:10,471 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:10,491 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:10,567 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 166 states and 222 transitions. [2019-12-28 02:04:10,567 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:10,616 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 02:04:10,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:04:10,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:10,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:04:10,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:04:10,617 INFO L87 Difference]: Start difference. First operand 4834 states and 10596 transitions. Second operand 7 states. [2019-12-28 02:04:10,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:10,890 INFO L93 Difference]: Finished difference Result 4572 states and 9911 transitions. [2019-12-28 02:04:10,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 02:04:10,891 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-12-28 02:04:10,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:10,898 INFO L225 Difference]: With dead ends: 4572 [2019-12-28 02:04:10,898 INFO L226 Difference]: Without dead ends: 4554 [2019-12-28 02:04:10,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:04:10,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4554 states. [2019-12-28 02:04:10,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4554 to 4211. [2019-12-28 02:04:10,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4211 states. [2019-12-28 02:04:10,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4211 states to 4211 states and 9180 transitions. [2019-12-28 02:04:10,942 INFO L78 Accepts]: Start accepts. Automaton has 4211 states and 9180 transitions. Word has length 98 [2019-12-28 02:04:10,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:10,943 INFO L462 AbstractCegarLoop]: Abstraction has 4211 states and 9180 transitions. [2019-12-28 02:04:10,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:04:10,943 INFO L276 IsEmpty]: Start isEmpty. Operand 4211 states and 9180 transitions. [2019-12-28 02:04:10,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 02:04:10,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:10,947 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:10,947 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:10,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:10,947 INFO L82 PathProgramCache]: Analyzing trace with hash -919272570, now seen corresponding path program 1 times [2019-12-28 02:04:10,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:10,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981672267] [2019-12-28 02:04:10,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:11,073 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 02:04:11,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981672267] [2019-12-28 02:04:11,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:11,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:04:11,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1535359910] [2019-12-28 02:04:11,076 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:11,094 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:11,227 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 166 states and 222 transitions. [2019-12-28 02:04:11,227 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:11,287 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 02:04:11,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 02:04:11,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:11,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 02:04:11,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:04:11,288 INFO L87 Difference]: Start difference. First operand 4211 states and 9180 transitions. Second operand 8 states. [2019-12-28 02:04:11,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:11,487 INFO L93 Difference]: Finished difference Result 4775 states and 10325 transitions. [2019-12-28 02:04:11,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 02:04:11,487 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 98 [2019-12-28 02:04:11,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:11,496 INFO L225 Difference]: With dead ends: 4775 [2019-12-28 02:04:11,496 INFO L226 Difference]: Without dead ends: 4747 [2019-12-28 02:04:11,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:04:11,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4747 states. [2019-12-28 02:04:11,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4747 to 4204. [2019-12-28 02:04:11,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4204 states. [2019-12-28 02:04:11,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4204 states to 4204 states and 9101 transitions. [2019-12-28 02:04:11,585 INFO L78 Accepts]: Start accepts. Automaton has 4204 states and 9101 transitions. Word has length 98 [2019-12-28 02:04:11,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:11,585 INFO L462 AbstractCegarLoop]: Abstraction has 4204 states and 9101 transitions. [2019-12-28 02:04:11,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 02:04:11,585 INFO L276 IsEmpty]: Start isEmpty. Operand 4204 states and 9101 transitions. [2019-12-28 02:04:11,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 02:04:11,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:11,592 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:11,592 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:11,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:11,592 INFO L82 PathProgramCache]: Analyzing trace with hash -750459706, now seen corresponding path program 2 times [2019-12-28 02:04:11,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:11,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65497745] [2019-12-28 02:04:11,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:11,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:11,684 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 02:04:11,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65497745] [2019-12-28 02:04:11,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:11,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:04:11,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [311678187] [2019-12-28 02:04:11,685 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:11,702 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:11,809 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 148 states and 190 transitions. [2019-12-28 02:04:11,810 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:11,824 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:04:11,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:04:11,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:11,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:04:11,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:04:11,825 INFO L87 Difference]: Start difference. First operand 4204 states and 9101 transitions. Second operand 7 states. [2019-12-28 02:04:12,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:12,166 INFO L93 Difference]: Finished difference Result 4353 states and 9403 transitions. [2019-12-28 02:04:12,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:04:12,167 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-12-28 02:04:12,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:12,174 INFO L225 Difference]: With dead ends: 4353 [2019-12-28 02:04:12,174 INFO L226 Difference]: Without dead ends: 4353 [2019-12-28 02:04:12,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:04:12,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4353 states. [2019-12-28 02:04:12,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4353 to 4172. [2019-12-28 02:04:12,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4172 states. [2019-12-28 02:04:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4172 states to 4172 states and 9029 transitions. [2019-12-28 02:04:12,253 INFO L78 Accepts]: Start accepts. Automaton has 4172 states and 9029 transitions. Word has length 98 [2019-12-28 02:04:12,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:12,253 INFO L462 AbstractCegarLoop]: Abstraction has 4172 states and 9029 transitions. [2019-12-28 02:04:12,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:04:12,253 INFO L276 IsEmpty]: Start isEmpty. Operand 4172 states and 9029 transitions. [2019-12-28 02:04:12,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 02:04:12,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:12,260 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:12,260 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:12,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:12,260 INFO L82 PathProgramCache]: Analyzing trace with hash -589506809, now seen corresponding path program 2 times [2019-12-28 02:04:12,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:12,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396512976] [2019-12-28 02:04:12,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 02:04:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 02:04:12,371 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 02:04:12,371 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 02:04:12,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 02:04:12 BasicIcfg [2019-12-28 02:04:12,581 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 02:04:12,584 INFO L168 Benchmark]: Toolchain (without parser) took 63822.61 ms. Allocated memory was 138.9 MB in the beginning and 2.5 GB in the end (delta: 2.4 GB). Free memory was 101.2 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 757.7 MB. Max. memory is 7.1 GB. [2019-12-28 02:04:12,585 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-28 02:04:12,585 INFO L168 Benchmark]: CACSL2BoogieTranslator took 752.73 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.0 MB in the beginning and 157.0 MB in the end (delta: -56.0 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-28 02:04:12,586 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.86 ms. Allocated memory is still 203.9 MB. Free memory was 157.0 MB in the beginning and 155.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-28 02:04:12,586 INFO L168 Benchmark]: Boogie Preprocessor took 35.92 ms. Allocated memory is still 203.9 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-28 02:04:12,587 INFO L168 Benchmark]: RCFGBuilder took 870.39 ms. Allocated memory is still 203.9 MB. Free memory was 152.3 MB in the beginning and 107.6 MB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. [2019-12-28 02:04:12,587 INFO L168 Benchmark]: TraceAbstraction took 62087.44 ms. Allocated memory was 203.9 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 107.6 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 699.1 MB. Max. memory is 7.1 GB. [2019-12-28 02:04:12,590 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 752.73 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.0 MB in the beginning and 157.0 MB in the end (delta: -56.0 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.86 ms. Allocated memory is still 203.9 MB. Free memory was 157.0 MB in the beginning and 155.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.92 ms. Allocated memory is still 203.9 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 870.39 ms. Allocated memory is still 203.9 MB. Free memory was 152.3 MB in the beginning and 107.6 MB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 62087.44 ms. Allocated memory was 203.9 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 107.6 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 699.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L700] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L701] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L702] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L704] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L708] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L709] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L710] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L711] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L712] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L713] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L714] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L715] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L716] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L717] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L718] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L719] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L720] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L721] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L722] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L723] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L724] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 0 pthread_t t899; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L804] FCALL, FORK 0 pthread_create(&t899, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L805] 0 pthread_t t900; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L728] 1 z$w_buff1 = z$w_buff0 [L729] 1 z$w_buff0 = 1 [L730] 1 z$w_buff1_used = z$w_buff0_used [L731] 1 z$w_buff0_used = (_Bool)1 [L806] FCALL, FORK 0 pthread_create(&t900, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L775] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 z = z$flush_delayed ? z$mem_tmp : z [L778] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L745] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=1] [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=1, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=1] [L781] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L783] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L785] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L813] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L814] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L815] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L816] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L819] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 143 locations, 2 error locations. Result: UNSAFE, OverallTime: 61.6s, OverallIterations: 37, TraceHistogramMax: 1, AutomataDifference: 28.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10149 SDtfs, 13012 SDslu, 27490 SDs, 0 SdLazy, 13268 SolverSat, 650 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 580 GetRequests, 235 SyntacticMatches, 33 SemanticMatches, 312 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71014occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 22.8s AutomataMinimizationTime, 36 MinimizatonAttempts, 91080 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2814 NumberOfCodeBlocks, 2814 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2680 ConstructedInterpolants, 0 QuantifiedInterpolants, 557856 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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...