/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix041_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 02:34:32,562 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 02:34:32,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 02:34:32,581 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 02:34:32,582 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 02:34:32,583 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 02:34:32,585 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 02:34:32,594 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 02:34:32,596 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 02:34:32,597 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 02:34:32,598 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 02:34:32,599 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 02:34:32,600 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 02:34:32,601 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 02:34:32,605 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 02:34:32,607 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 02:34:32,609 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 02:34:32,612 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 02:34:32,613 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 02:34:32,619 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 02:34:32,621 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 02:34:32,626 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 02:34:32,627 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 02:34:32,627 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 02:34:32,631 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 02:34:32,631 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 02:34:32,631 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 02:34:32,633 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 02:34:32,635 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 02:34:32,636 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 02:34:32,637 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 02:34:32,639 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 02:34:32,640 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 02:34:32,641 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 02:34:32,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 02:34:32,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 02:34:32,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 02:34:32,647 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 02:34:32,647 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 02:34:32,648 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 02:34:32,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 02:34:32,650 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-19 02:34:32,671 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 02:34:32,671 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 02:34:32,675 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 02:34:32,675 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 02:34:32,676 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 02:34:32,676 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 02:34:32,677 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 02:34:32,677 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 02:34:32,677 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 02:34:32,677 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 02:34:32,678 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 02:34:32,679 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 02:34:32,679 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 02:34:32,679 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 02:34:32,679 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 02:34:32,680 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 02:34:32,680 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 02:34:32,680 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 02:34:32,680 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 02:34:32,680 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 02:34:32,680 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 02:34:32,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 02:34:32,682 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 02:34:32,684 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 02:34:32,684 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 02:34:32,685 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 02:34:32,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 02:34:32,685 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 02:34:32,685 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 02:34:32,686 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 02:34:32,963 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 02:34:32,986 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 02:34:32,989 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 02:34:32,991 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 02:34:32,991 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 02:34:32,992 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_power.opt.i [2019-12-19 02:34:33,074 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfa5f2a9c/ec4d27ae80e34b9ca0584342c159e906/FLAG12dc66126 [2019-12-19 02:34:33,672 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 02:34:33,673 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_power.opt.i [2019-12-19 02:34:33,687 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfa5f2a9c/ec4d27ae80e34b9ca0584342c159e906/FLAG12dc66126 [2019-12-19 02:34:33,920 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfa5f2a9c/ec4d27ae80e34b9ca0584342c159e906 [2019-12-19 02:34:33,932 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 02:34:33,934 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 02:34:33,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 02:34:33,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 02:34:33,941 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 02:34:33,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:34:33" (1/1) ... [2019-12-19 02:34:33,945 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20f0f0d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:34:33, skipping insertion in model container [2019-12-19 02:34:33,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:34:33" (1/1) ... [2019-12-19 02:34:33,955 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 02:34:34,016 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 02:34:34,527 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 02:34:34,540 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 02:34:34,633 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 02:34:34,712 INFO L208 MainTranslator]: Completed translation [2019-12-19 02:34:34,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:34:34 WrapperNode [2019-12-19 02:34:34,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 02:34:34,714 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 02:34:34,714 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 02:34:34,714 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 02:34:34,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:34:34" (1/1) ... [2019-12-19 02:34:34,747 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:34:34" (1/1) ... [2019-12-19 02:34:34,794 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 02:34:34,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 02:34:34,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 02:34:34,795 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 02:34:34,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:34:34" (1/1) ... [2019-12-19 02:34:34,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:34:34" (1/1) ... [2019-12-19 02:34:34,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:34:34" (1/1) ... [2019-12-19 02:34:34,809 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:34:34" (1/1) ... [2019-12-19 02:34:34,819 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:34:34" (1/1) ... [2019-12-19 02:34:34,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:34:34" (1/1) ... [2019-12-19 02:34:34,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:34:34" (1/1) ... [2019-12-19 02:34:34,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 02:34:34,832 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 02:34:34,832 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 02:34:34,832 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 02:34:34,833 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:34:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 02:34:34,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 02:34:34,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 02:34:34,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 02:34:34,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 02:34:34,895 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 02:34:34,895 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 02:34:34,895 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 02:34:34,896 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 02:34:34,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 02:34:34,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 02:34:34,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 02:34:34,898 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-19 02:34:35,705 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 02:34:35,705 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 02:34:35,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:34:35 BoogieIcfgContainer [2019-12-19 02:34:35,707 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 02:34:35,708 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 02:34:35,708 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 02:34:35,712 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 02:34:35,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 02:34:33" (1/3) ... [2019-12-19 02:34:35,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7edc9f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:34:35, skipping insertion in model container [2019-12-19 02:34:35,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:34:34" (2/3) ... [2019-12-19 02:34:35,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7edc9f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:34:35, skipping insertion in model container [2019-12-19 02:34:35,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:34:35" (3/3) ... [2019-12-19 02:34:35,716 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_power.opt.i [2019-12-19 02:34:35,727 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 02:34:35,727 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 02:34:35,736 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 02:34:35,738 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 02:34:35,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,774 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,774 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,783 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,783 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,784 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,784 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,784 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,798 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,798 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,801 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,801 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,802 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:34:35,819 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 02:34:35,836 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 02:34:35,837 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 02:34:35,837 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 02:34:35,837 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 02:34:35,837 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 02:34:35,837 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 02:34:35,837 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 02:34:35,838 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 02:34:35,853 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 148 places, 182 transitions [2019-12-19 02:34:37,162 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22496 states. [2019-12-19 02:34:37,165 INFO L276 IsEmpty]: Start isEmpty. Operand 22496 states. [2019-12-19 02:34:37,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-19 02:34:37,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:34:37,175 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] [2019-12-19 02:34:37,175 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:34:37,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:34:37,181 INFO L82 PathProgramCache]: Analyzing trace with hash 697146637, now seen corresponding path program 1 times [2019-12-19 02:34:37,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:34:37,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761371464] [2019-12-19 02:34:37,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:34:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:34:37,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:34:37,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761371464] [2019-12-19 02:34:37,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:34:37,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:34:37,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405464847] [2019-12-19 02:34:37,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:34:37,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:34:37,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:34:37,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:34:37,519 INFO L87 Difference]: Start difference. First operand 22496 states. Second operand 4 states. [2019-12-19 02:34:38,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:34:38,190 INFO L93 Difference]: Finished difference Result 23448 states and 91749 transitions. [2019-12-19 02:34:38,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:34:38,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-19 02:34:38,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:34:38,413 INFO L225 Difference]: With dead ends: 23448 [2019-12-19 02:34:38,413 INFO L226 Difference]: Without dead ends: 21272 [2019-12-19 02:34:38,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:34:38,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21272 states. [2019-12-19 02:34:40,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21272 to 21272. [2019-12-19 02:34:40,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21272 states. [2019-12-19 02:34:40,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21272 states to 21272 states and 83773 transitions. [2019-12-19 02:34:40,414 INFO L78 Accepts]: Start accepts. Automaton has 21272 states and 83773 transitions. Word has length 39 [2019-12-19 02:34:40,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:34:40,415 INFO L462 AbstractCegarLoop]: Abstraction has 21272 states and 83773 transitions. [2019-12-19 02:34:40,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:34:40,416 INFO L276 IsEmpty]: Start isEmpty. Operand 21272 states and 83773 transitions. [2019-12-19 02:34:40,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-19 02:34:40,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:34:40,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:34:40,422 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:34:40,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:34:40,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1403469956, now seen corresponding path program 1 times [2019-12-19 02:34:40,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:34:40,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595890478] [2019-12-19 02:34:40,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:34:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:34:40,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:34:40,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595890478] [2019-12-19 02:34:40,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:34:40,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:34:40,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808447035] [2019-12-19 02:34:40,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:34:40,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:34:40,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:34:40,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:34:40,562 INFO L87 Difference]: Start difference. First operand 21272 states and 83773 transitions. Second operand 5 states. [2019-12-19 02:34:42,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:34:42,656 INFO L93 Difference]: Finished difference Result 34706 states and 129065 transitions. [2019-12-19 02:34:42,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:34:42,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-19 02:34:42,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:34:42,821 INFO L225 Difference]: With dead ends: 34706 [2019-12-19 02:34:42,821 INFO L226 Difference]: Without dead ends: 34562 [2019-12-19 02:34:42,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:34:43,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34562 states. [2019-12-19 02:34:43,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34562 to 33062. [2019-12-19 02:34:43,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33062 states. [2019-12-19 02:34:43,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33062 states to 33062 states and 123953 transitions. [2019-12-19 02:34:43,976 INFO L78 Accepts]: Start accepts. Automaton has 33062 states and 123953 transitions. Word has length 46 [2019-12-19 02:34:43,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:34:43,978 INFO L462 AbstractCegarLoop]: Abstraction has 33062 states and 123953 transitions. [2019-12-19 02:34:43,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:34:43,978 INFO L276 IsEmpty]: Start isEmpty. Operand 33062 states and 123953 transitions. [2019-12-19 02:34:43,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-19 02:34:43,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:34:43,983 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:34:43,983 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:34:43,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:34:43,984 INFO L82 PathProgramCache]: Analyzing trace with hash 227456424, now seen corresponding path program 1 times [2019-12-19 02:34:43,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:34:43,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872212501] [2019-12-19 02:34:43,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:34:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:34:44,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:34:44,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872212501] [2019-12-19 02:34:44,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:34:44,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:34:44,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709829693] [2019-12-19 02:34:44,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:34:44,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:34:44,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:34:44,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:34:44,103 INFO L87 Difference]: Start difference. First operand 33062 states and 123953 transitions. Second operand 5 states. [2019-12-19 02:34:44,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:34:44,979 INFO L93 Difference]: Finished difference Result 40214 states and 148622 transitions. [2019-12-19 02:34:44,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:34:44,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-19 02:34:44,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:34:45,107 INFO L225 Difference]: With dead ends: 40214 [2019-12-19 02:34:45,108 INFO L226 Difference]: Without dead ends: 40054 [2019-12-19 02:34:45,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:34:45,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40054 states. [2019-12-19 02:34:47,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40054 to 34635. [2019-12-19 02:34:47,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34635 states. [2019-12-19 02:34:47,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34635 states to 34635 states and 129249 transitions. [2019-12-19 02:34:47,701 INFO L78 Accepts]: Start accepts. Automaton has 34635 states and 129249 transitions. Word has length 47 [2019-12-19 02:34:47,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:34:47,702 INFO L462 AbstractCegarLoop]: Abstraction has 34635 states and 129249 transitions. [2019-12-19 02:34:47,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:34:47,702 INFO L276 IsEmpty]: Start isEmpty. Operand 34635 states and 129249 transitions. [2019-12-19 02:34:47,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 02:34:47,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:34:47,716 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:34:47,716 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:34:47,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:34:47,717 INFO L82 PathProgramCache]: Analyzing trace with hash -171706089, now seen corresponding path program 1 times [2019-12-19 02:34:47,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:34:47,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237085297] [2019-12-19 02:34:47,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:34:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:34:47,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:34:47,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237085297] [2019-12-19 02:34:47,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:34:47,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:34:47,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736423098] [2019-12-19 02:34:47,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:34:47,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:34:47,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:34:47,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:34:47,831 INFO L87 Difference]: Start difference. First operand 34635 states and 129249 transitions. Second operand 6 states. [2019-12-19 02:34:49,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:34:49,059 INFO L93 Difference]: Finished difference Result 45663 states and 166143 transitions. [2019-12-19 02:34:49,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 02:34:49,060 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-19 02:34:49,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:34:49,194 INFO L225 Difference]: With dead ends: 45663 [2019-12-19 02:34:49,195 INFO L226 Difference]: Without dead ends: 45519 [2019-12-19 02:34:49,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-19 02:34:49,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45519 states. [2019-12-19 02:34:51,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45519 to 33598. [2019-12-19 02:34:51,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33598 states. [2019-12-19 02:34:51,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33598 states to 33598 states and 125404 transitions. [2019-12-19 02:34:51,634 INFO L78 Accepts]: Start accepts. Automaton has 33598 states and 125404 transitions. Word has length 54 [2019-12-19 02:34:51,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:34:51,634 INFO L462 AbstractCegarLoop]: Abstraction has 33598 states and 125404 transitions. [2019-12-19 02:34:51,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:34:51,634 INFO L276 IsEmpty]: Start isEmpty. Operand 33598 states and 125404 transitions. [2019-12-19 02:34:51,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-19 02:34:51,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:34:51,668 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:34:51,669 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:34:51,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:34:51,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1292892266, now seen corresponding path program 1 times [2019-12-19 02:34:51,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:34:51,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482135409] [2019-12-19 02:34:51,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:34:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:34:51,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:34:51,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482135409] [2019-12-19 02:34:51,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:34:51,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:34:51,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222003470] [2019-12-19 02:34:51,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:34:51,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:34:51,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:34:51,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:34:51,790 INFO L87 Difference]: Start difference. First operand 33598 states and 125404 transitions. Second operand 6 states. [2019-12-19 02:34:52,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:34:52,488 INFO L93 Difference]: Finished difference Result 46070 states and 167837 transitions. [2019-12-19 02:34:52,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 02:34:52,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-19 02:34:52,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:34:52,957 INFO L225 Difference]: With dead ends: 46070 [2019-12-19 02:34:52,958 INFO L226 Difference]: Without dead ends: 45830 [2019-12-19 02:34:52,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 02:34:53,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45830 states. [2019-12-19 02:34:53,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45830 to 39959. [2019-12-19 02:34:53,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39959 states. [2019-12-19 02:34:55,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39959 states to 39959 states and 147328 transitions. [2019-12-19 02:34:55,873 INFO L78 Accepts]: Start accepts. Automaton has 39959 states and 147328 transitions. Word has length 61 [2019-12-19 02:34:55,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:34:55,874 INFO L462 AbstractCegarLoop]: Abstraction has 39959 states and 147328 transitions. [2019-12-19 02:34:55,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:34:55,874 INFO L276 IsEmpty]: Start isEmpty. Operand 39959 states and 147328 transitions. [2019-12-19 02:34:55,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-19 02:34:55,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:34:55,902 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:34:55,902 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:34:55,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:34:55,903 INFO L82 PathProgramCache]: Analyzing trace with hash 43524005, now seen corresponding path program 1 times [2019-12-19 02:34:55,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:34:55,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372612744] [2019-12-19 02:34:55,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:34:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:34:55,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:34:55,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372612744] [2019-12-19 02:34:55,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:34:55,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:34:55,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805250673] [2019-12-19 02:34:55,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:34:55,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:34:55,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:34:55,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:34:55,983 INFO L87 Difference]: Start difference. First operand 39959 states and 147328 transitions. Second operand 3 states. [2019-12-19 02:34:56,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:34:56,213 INFO L93 Difference]: Finished difference Result 50257 states and 182163 transitions. [2019-12-19 02:34:56,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:34:56,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-19 02:34:56,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:34:56,316 INFO L225 Difference]: With dead ends: 50257 [2019-12-19 02:34:56,316 INFO L226 Difference]: Without dead ends: 50257 [2019-12-19 02:34:56,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:34:56,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50257 states. [2019-12-19 02:34:57,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50257 to 43889. [2019-12-19 02:34:57,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43889 states. [2019-12-19 02:34:57,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43889 states to 43889 states and 160766 transitions. [2019-12-19 02:34:57,397 INFO L78 Accepts]: Start accepts. Automaton has 43889 states and 160766 transitions. Word has length 63 [2019-12-19 02:34:57,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:34:57,398 INFO L462 AbstractCegarLoop]: Abstraction has 43889 states and 160766 transitions. [2019-12-19 02:34:57,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:34:57,398 INFO L276 IsEmpty]: Start isEmpty. Operand 43889 states and 160766 transitions. [2019-12-19 02:34:57,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 02:34:57,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:34:57,432 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:34:57,433 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:34:57,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:34:57,433 INFO L82 PathProgramCache]: Analyzing trace with hash -41034466, now seen corresponding path program 1 times [2019-12-19 02:34:57,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:34:57,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678618812] [2019-12-19 02:34:57,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:34:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:34: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-19 02:34:57,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678618812] [2019-12-19 02:34:57,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:34:57,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:34:57,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797425002] [2019-12-19 02:34:57,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:34:57,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:34:57,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:34:57,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:34:57,571 INFO L87 Difference]: Start difference. First operand 43889 states and 160766 transitions. Second operand 7 states. [2019-12-19 02:34:58,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:34:58,639 INFO L93 Difference]: Finished difference Result 55885 states and 200500 transitions. [2019-12-19 02:34:58,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 02:34:58,639 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-19 02:34:58,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:34:58,763 INFO L225 Difference]: With dead ends: 55885 [2019-12-19 02:34:58,763 INFO L226 Difference]: Without dead ends: 55645 [2019-12-19 02:34:58,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-19 02:34:59,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55645 states. [2019-12-19 02:34:59,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55645 to 45115. [2019-12-19 02:34:59,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45115 states. [2019-12-19 02:35:00,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45115 states to 45115 states and 164933 transitions. [2019-12-19 02:35:00,070 INFO L78 Accepts]: Start accepts. Automaton has 45115 states and 164933 transitions. Word has length 67 [2019-12-19 02:35:00,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:00,070 INFO L462 AbstractCegarLoop]: Abstraction has 45115 states and 164933 transitions. [2019-12-19 02:35:00,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:35:00,071 INFO L276 IsEmpty]: Start isEmpty. Operand 45115 states and 164933 transitions. [2019-12-19 02:35:00,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 02:35:00,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:00,106 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:35:00,106 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:00,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:00,107 INFO L82 PathProgramCache]: Analyzing trace with hash -44622651, now seen corresponding path program 1 times [2019-12-19 02:35:00,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:00,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152735329] [2019-12-19 02:35:00,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:00,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:35:00,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152735329] [2019-12-19 02:35:00,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:00,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:35:00,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41744554] [2019-12-19 02:35:00,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:35:00,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:00,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:35:00,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:35:00,220 INFO L87 Difference]: Start difference. First operand 45115 states and 164933 transitions. Second operand 7 states. [2019-12-19 02:35:01,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:01,737 INFO L93 Difference]: Finished difference Result 55099 states and 197677 transitions. [2019-12-19 02:35:01,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 02:35:01,738 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-19 02:35:01,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:01,853 INFO L225 Difference]: With dead ends: 55099 [2019-12-19 02:35:01,853 INFO L226 Difference]: Without dead ends: 54899 [2019-12-19 02:35:01,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-12-19 02:35:02,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54899 states. [2019-12-19 02:35:03,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54899 to 45993. [2019-12-19 02:35:03,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45993 states. [2019-12-19 02:35:03,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45993 states to 45993 states and 167804 transitions. [2019-12-19 02:35:03,195 INFO L78 Accepts]: Start accepts. Automaton has 45993 states and 167804 transitions. Word has length 68 [2019-12-19 02:35:03,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:03,195 INFO L462 AbstractCegarLoop]: Abstraction has 45993 states and 167804 transitions. [2019-12-19 02:35:03,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:35:03,196 INFO L276 IsEmpty]: Start isEmpty. Operand 45993 states and 167804 transitions. [2019-12-19 02:35:03,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 02:35:03,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:03,231 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] [2019-12-19 02:35:03,231 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:03,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:03,231 INFO L82 PathProgramCache]: Analyzing trace with hash 500322373, now seen corresponding path program 1 times [2019-12-19 02:35:03,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:03,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551491211] [2019-12-19 02:35:03,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:03,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:03,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:35:03,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551491211] [2019-12-19 02:35:03,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:03,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:35:03,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746838747] [2019-12-19 02:35:03,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:35:03,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:03,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:35:03,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:35:03,377 INFO L87 Difference]: Start difference. First operand 45993 states and 167804 transitions. Second operand 6 states. [2019-12-19 02:35:04,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:04,156 INFO L93 Difference]: Finished difference Result 65553 states and 237331 transitions. [2019-12-19 02:35:04,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:35:04,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-19 02:35:04,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:04,295 INFO L225 Difference]: With dead ends: 65553 [2019-12-19 02:35:04,295 INFO L226 Difference]: Without dead ends: 64909 [2019-12-19 02:35:04,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:35:04,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64909 states. [2019-12-19 02:35:07,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64909 to 56043. [2019-12-19 02:35:07,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56043 states. [2019-12-19 02:35:07,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56043 states to 56043 states and 204334 transitions. [2019-12-19 02:35:07,654 INFO L78 Accepts]: Start accepts. Automaton has 56043 states and 204334 transitions. Word has length 70 [2019-12-19 02:35:07,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:07,655 INFO L462 AbstractCegarLoop]: Abstraction has 56043 states and 204334 transitions. [2019-12-19 02:35:07,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:35:07,655 INFO L276 IsEmpty]: Start isEmpty. Operand 56043 states and 204334 transitions. [2019-12-19 02:35:07,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 02:35:07,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:07,706 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:35:07,706 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:07,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:07,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1461936390, now seen corresponding path program 1 times [2019-12-19 02:35:07,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:07,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492146250] [2019-12-19 02:35:07,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:07,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:35:07,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492146250] [2019-12-19 02:35:07,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:07,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:35:07,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288925934] [2019-12-19 02:35:07,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:35:07,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:07,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:35:07,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:35:07,811 INFO L87 Difference]: Start difference. First operand 56043 states and 204334 transitions. Second operand 7 states. [2019-12-19 02:35:09,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:09,351 INFO L93 Difference]: Finished difference Result 83031 states and 292762 transitions. [2019-12-19 02:35:09,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 02:35:09,351 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-12-19 02:35:09,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:09,537 INFO L225 Difference]: With dead ends: 83031 [2019-12-19 02:35:09,538 INFO L226 Difference]: Without dead ends: 83031 [2019-12-19 02:35:09,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 02:35:09,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83031 states. [2019-12-19 02:35:13,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83031 to 76080. [2019-12-19 02:35:13,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76080 states. [2019-12-19 02:35:13,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76080 states to 76080 states and 270629 transitions. [2019-12-19 02:35:13,444 INFO L78 Accepts]: Start accepts. Automaton has 76080 states and 270629 transitions. Word has length 70 [2019-12-19 02:35:13,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:13,444 INFO L462 AbstractCegarLoop]: Abstraction has 76080 states and 270629 transitions. [2019-12-19 02:35:13,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:35:13,445 INFO L276 IsEmpty]: Start isEmpty. Operand 76080 states and 270629 transitions. [2019-12-19 02:35:13,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 02:35:13,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:13,523 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:35:13,524 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:13,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:13,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1588266425, now seen corresponding path program 1 times [2019-12-19 02:35:13,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:13,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272348030] [2019-12-19 02:35:13,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:13,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-19 02:35:13,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272348030] [2019-12-19 02:35:13,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:13,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:35:13,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194469193] [2019-12-19 02:35:13,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:35:13,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:13,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:35:13,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:35:13,592 INFO L87 Difference]: Start difference. First operand 76080 states and 270629 transitions. Second operand 3 states. [2019-12-19 02:35:13,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:13,940 INFO L93 Difference]: Finished difference Result 54416 states and 197410 transitions. [2019-12-19 02:35:13,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:35:13,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-19 02:35:13,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:14,057 INFO L225 Difference]: With dead ends: 54416 [2019-12-19 02:35:14,057 INFO L226 Difference]: Without dead ends: 54254 [2019-12-19 02:35:14,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:35:14,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54254 states. [2019-12-19 02:35:15,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54254 to 54214. [2019-12-19 02:35:15,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54214 states. [2019-12-19 02:35:15,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54214 states to 54214 states and 196825 transitions. [2019-12-19 02:35:15,572 INFO L78 Accepts]: Start accepts. Automaton has 54214 states and 196825 transitions. Word has length 70 [2019-12-19 02:35:15,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:15,572 INFO L462 AbstractCegarLoop]: Abstraction has 54214 states and 196825 transitions. [2019-12-19 02:35:15,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:35:15,572 INFO L276 IsEmpty]: Start isEmpty. Operand 54214 states and 196825 transitions. [2019-12-19 02:35:15,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 02:35:15,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:15,610 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:35:15,611 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:15,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:15,611 INFO L82 PathProgramCache]: Analyzing trace with hash 204738783, now seen corresponding path program 1 times [2019-12-19 02:35:15,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:15,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474030503] [2019-12-19 02:35:15,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:15,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:15,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:35:15,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474030503] [2019-12-19 02:35:15,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:15,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:35:15,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751364326] [2019-12-19 02:35:15,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:35:15,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:15,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:35:15,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:35:15,687 INFO L87 Difference]: Start difference. First operand 54214 states and 196825 transitions. Second operand 4 states. [2019-12-19 02:35:15,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:15,780 INFO L93 Difference]: Finished difference Result 13718 states and 43556 transitions. [2019-12-19 02:35:15,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:35:15,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-12-19 02:35:15,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:15,809 INFO L225 Difference]: With dead ends: 13718 [2019-12-19 02:35:15,810 INFO L226 Difference]: Without dead ends: 13240 [2019-12-19 02:35:15,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:35:15,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13240 states. [2019-12-19 02:35:16,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13240 to 13228. [2019-12-19 02:35:16,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13228 states. [2019-12-19 02:35:16,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13228 states to 13228 states and 42051 transitions. [2019-12-19 02:35:16,090 INFO L78 Accepts]: Start accepts. Automaton has 13228 states and 42051 transitions. Word has length 71 [2019-12-19 02:35:16,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:16,090 INFO L462 AbstractCegarLoop]: Abstraction has 13228 states and 42051 transitions. [2019-12-19 02:35:16,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:35:16,091 INFO L276 IsEmpty]: Start isEmpty. Operand 13228 states and 42051 transitions. [2019-12-19 02:35:16,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 02:35:16,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:16,103 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] [2019-12-19 02:35:16,104 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:16,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:16,104 INFO L82 PathProgramCache]: Analyzing trace with hash -977177849, now seen corresponding path program 1 times [2019-12-19 02:35:16,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:16,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990822789] [2019-12-19 02:35:16,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:16,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:35:16,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990822789] [2019-12-19 02:35:16,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:16,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:35:16,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307069203] [2019-12-19 02:35:16,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:35:16,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:16,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:35:16,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:35:16,207 INFO L87 Difference]: Start difference. First operand 13228 states and 42051 transitions. Second operand 4 states. [2019-12-19 02:35:16,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:16,449 INFO L93 Difference]: Finished difference Result 17806 states and 55643 transitions. [2019-12-19 02:35:16,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:35:16,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-19 02:35:16,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:16,475 INFO L225 Difference]: With dead ends: 17806 [2019-12-19 02:35:16,475 INFO L226 Difference]: Without dead ends: 17806 [2019-12-19 02:35:16,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:35:16,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17806 states. [2019-12-19 02:35:16,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17806 to 14044. [2019-12-19 02:35:16,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14044 states. [2019-12-19 02:35:16,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14044 states to 14044 states and 44351 transitions. [2019-12-19 02:35:16,681 INFO L78 Accepts]: Start accepts. Automaton has 14044 states and 44351 transitions. Word has length 80 [2019-12-19 02:35:16,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:16,683 INFO L462 AbstractCegarLoop]: Abstraction has 14044 states and 44351 transitions. [2019-12-19 02:35:16,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:35:16,683 INFO L276 IsEmpty]: Start isEmpty. Operand 14044 states and 44351 transitions. [2019-12-19 02:35:16,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 02:35:16,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:16,697 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] [2019-12-19 02:35:16,697 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:16,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:16,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1231914394, now seen corresponding path program 1 times [2019-12-19 02:35:16,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:16,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518971318] [2019-12-19 02:35:16,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:16,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:35:16,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518971318] [2019-12-19 02:35:16,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:16,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 02:35:16,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752579305] [2019-12-19 02:35:16,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 02:35:16,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:16,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 02:35:16,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:35:16,831 INFO L87 Difference]: Start difference. First operand 14044 states and 44351 transitions. Second operand 8 states. [2019-12-19 02:35:17,352 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-12-19 02:35:18,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:18,097 INFO L93 Difference]: Finished difference Result 15895 states and 49761 transitions. [2019-12-19 02:35:18,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-19 02:35:18,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 80 [2019-12-19 02:35:18,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:18,122 INFO L225 Difference]: With dead ends: 15895 [2019-12-19 02:35:18,122 INFO L226 Difference]: Without dead ends: 15847 [2019-12-19 02:35:18,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2019-12-19 02:35:18,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15847 states. [2019-12-19 02:35:18,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15847 to 14137. [2019-12-19 02:35:18,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14137 states. [2019-12-19 02:35:18,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14137 states to 14137 states and 44776 transitions. [2019-12-19 02:35:18,324 INFO L78 Accepts]: Start accepts. Automaton has 14137 states and 44776 transitions. Word has length 80 [2019-12-19 02:35:18,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:18,325 INFO L462 AbstractCegarLoop]: Abstraction has 14137 states and 44776 transitions. [2019-12-19 02:35:18,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 02:35:18,325 INFO L276 IsEmpty]: Start isEmpty. Operand 14137 states and 44776 transitions. [2019-12-19 02:35:18,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-19 02:35:18,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:18,338 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:35:18,339 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:18,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:18,339 INFO L82 PathProgramCache]: Analyzing trace with hash 631897787, now seen corresponding path program 1 times [2019-12-19 02:35:18,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:18,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993890199] [2019-12-19 02:35:18,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:18,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:35:18,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993890199] [2019-12-19 02:35:18,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:18,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 02:35:18,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126259727] [2019-12-19 02:35:18,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 02:35:18,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:18,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 02:35:18,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:35:18,454 INFO L87 Difference]: Start difference. First operand 14137 states and 44776 transitions. Second operand 8 states. [2019-12-19 02:35:20,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:20,928 INFO L93 Difference]: Finished difference Result 41333 states and 125772 transitions. [2019-12-19 02:35:20,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-19 02:35:20,928 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2019-12-19 02:35:20,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:20,990 INFO L225 Difference]: With dead ends: 41333 [2019-12-19 02:35:20,990 INFO L226 Difference]: Without dead ends: 40937 [2019-12-19 02:35:20,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-12-19 02:35:21,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40937 states. [2019-12-19 02:35:21,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40937 to 23564. [2019-12-19 02:35:21,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23564 states. [2019-12-19 02:35:21,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23564 states to 23564 states and 73197 transitions. [2019-12-19 02:35:21,952 INFO L78 Accepts]: Start accepts. Automaton has 23564 states and 73197 transitions. Word has length 83 [2019-12-19 02:35:21,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:21,952 INFO L462 AbstractCegarLoop]: Abstraction has 23564 states and 73197 transitions. [2019-12-19 02:35:21,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 02:35:21,953 INFO L276 IsEmpty]: Start isEmpty. Operand 23564 states and 73197 transitions. [2019-12-19 02:35:21,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-19 02:35:21,974 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:21,974 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:35:21,974 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:21,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:21,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1456691011, now seen corresponding path program 1 times [2019-12-19 02:35:21,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:21,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456724647] [2019-12-19 02:35:21,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:22,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:35:22,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456724647] [2019-12-19 02:35:22,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:22,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:35:22,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881280607] [2019-12-19 02:35:22,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:35:22,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:22,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:35:22,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:35:22,084 INFO L87 Difference]: Start difference. First operand 23564 states and 73197 transitions. Second operand 6 states. [2019-12-19 02:35:22,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:22,694 INFO L93 Difference]: Finished difference Result 24462 states and 75535 transitions. [2019-12-19 02:35:22,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:35:22,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-12-19 02:35:22,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:22,730 INFO L225 Difference]: With dead ends: 24462 [2019-12-19 02:35:22,730 INFO L226 Difference]: Without dead ends: 24462 [2019-12-19 02:35:22,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:35:22,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24462 states. [2019-12-19 02:35:22,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24462 to 23161. [2019-12-19 02:35:22,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23161 states. [2019-12-19 02:35:23,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23161 states to 23161 states and 71815 transitions. [2019-12-19 02:35:23,041 INFO L78 Accepts]: Start accepts. Automaton has 23161 states and 71815 transitions. Word has length 83 [2019-12-19 02:35:23,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:23,041 INFO L462 AbstractCegarLoop]: Abstraction has 23161 states and 71815 transitions. [2019-12-19 02:35:23,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:35:23,041 INFO L276 IsEmpty]: Start isEmpty. Operand 23161 states and 71815 transitions. [2019-12-19 02:35:23,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-19 02:35:23,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:23,060 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:35:23,061 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:23,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:23,061 INFO L82 PathProgramCache]: Analyzing trace with hash 902615998, now seen corresponding path program 1 times [2019-12-19 02:35:23,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:23,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739695680] [2019-12-19 02:35:23,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:23,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:35:23,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739695680] [2019-12-19 02:35:23,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:23,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:35:23,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870147651] [2019-12-19 02:35:23,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:35:23,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:23,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:35:23,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:35:23,163 INFO L87 Difference]: Start difference. First operand 23161 states and 71815 transitions. Second operand 7 states. [2019-12-19 02:35:23,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:23,756 INFO L93 Difference]: Finished difference Result 24549 states and 75617 transitions. [2019-12-19 02:35:23,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 02:35:23,757 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-12-19 02:35:23,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:23,791 INFO L225 Difference]: With dead ends: 24549 [2019-12-19 02:35:23,792 INFO L226 Difference]: Without dead ends: 24549 [2019-12-19 02:35:23,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 02:35:23,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24549 states. [2019-12-19 02:35:24,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24549 to 23487. [2019-12-19 02:35:24,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23487 states. [2019-12-19 02:35:24,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23487 states to 23487 states and 72627 transitions. [2019-12-19 02:35:24,103 INFO L78 Accepts]: Start accepts. Automaton has 23487 states and 72627 transitions. Word has length 83 [2019-12-19 02:35:24,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:24,103 INFO L462 AbstractCegarLoop]: Abstraction has 23487 states and 72627 transitions. [2019-12-19 02:35:24,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:35:24,104 INFO L276 IsEmpty]: Start isEmpty. Operand 23487 states and 72627 transitions. [2019-12-19 02:35:24,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-19 02:35:24,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:24,123 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:35:24,124 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:24,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:24,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1232381759, now seen corresponding path program 1 times [2019-12-19 02:35:24,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:24,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060932688] [2019-12-19 02:35:24,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:24,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:35:24,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060932688] [2019-12-19 02:35:24,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:24,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:35:24,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704877801] [2019-12-19 02:35:24,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:35:24,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:24,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:35:24,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:35:24,166 INFO L87 Difference]: Start difference. First operand 23487 states and 72627 transitions. Second operand 3 states. [2019-12-19 02:35:24,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:24,256 INFO L93 Difference]: Finished difference Result 16769 states and 51473 transitions. [2019-12-19 02:35:24,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:35:24,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-19 02:35:24,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:24,289 INFO L225 Difference]: With dead ends: 16769 [2019-12-19 02:35:24,289 INFO L226 Difference]: Without dead ends: 16769 [2019-12-19 02:35:24,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:35:24,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16769 states. [2019-12-19 02:35:24,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16769 to 16464. [2019-12-19 02:35:24,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16464 states. [2019-12-19 02:35:24,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16464 states to 16464 states and 50581 transitions. [2019-12-19 02:35:24,937 INFO L78 Accepts]: Start accepts. Automaton has 16464 states and 50581 transitions. Word has length 83 [2019-12-19 02:35:24,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:24,937 INFO L462 AbstractCegarLoop]: Abstraction has 16464 states and 50581 transitions. [2019-12-19 02:35:24,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:35:24,937 INFO L276 IsEmpty]: Start isEmpty. Operand 16464 states and 50581 transitions. [2019-12-19 02:35:24,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-19 02:35:24,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:24,951 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:35:24,952 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:24,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:24,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1707454838, now seen corresponding path program 1 times [2019-12-19 02:35:24,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:24,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095082024] [2019-12-19 02:35:24,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:25,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:35:25,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095082024] [2019-12-19 02:35:25,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:25,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:35:25,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873709339] [2019-12-19 02:35:25,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:35:25,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:25,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:35:25,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:35:25,055 INFO L87 Difference]: Start difference. First operand 16464 states and 50581 transitions. Second operand 5 states. [2019-12-19 02:35:25,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:25,170 INFO L93 Difference]: Finished difference Result 16430 states and 50511 transitions. [2019-12-19 02:35:25,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 02:35:25,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-12-19 02:35:25,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:25,196 INFO L225 Difference]: With dead ends: 16430 [2019-12-19 02:35:25,196 INFO L226 Difference]: Without dead ends: 16430 [2019-12-19 02:35:25,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:35:25,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16430 states. [2019-12-19 02:35:25,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16430 to 16430. [2019-12-19 02:35:25,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16430 states. [2019-12-19 02:35:25,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16430 states to 16430 states and 50511 transitions. [2019-12-19 02:35:25,422 INFO L78 Accepts]: Start accepts. Automaton has 16430 states and 50511 transitions. Word has length 84 [2019-12-19 02:35:25,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:25,422 INFO L462 AbstractCegarLoop]: Abstraction has 16430 states and 50511 transitions. [2019-12-19 02:35:25,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:35:25,422 INFO L276 IsEmpty]: Start isEmpty. Operand 16430 states and 50511 transitions. [2019-12-19 02:35:25,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-19 02:35:25,438 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:25,438 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:35:25,439 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:25,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:25,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1377689077, now seen corresponding path program 1 times [2019-12-19 02:35:25,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:25,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967430358] [2019-12-19 02:35:25,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:25,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:35:25,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967430358] [2019-12-19 02:35:25,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:25,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:35:25,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195322601] [2019-12-19 02:35:25,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:35:25,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:25,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:35:25,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:35:25,519 INFO L87 Difference]: Start difference. First operand 16430 states and 50511 transitions. Second operand 5 states. [2019-12-19 02:35:25,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:25,557 INFO L93 Difference]: Finished difference Result 2714 states and 6663 transitions. [2019-12-19 02:35:25,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 02:35:25,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-12-19 02:35:25,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:25,561 INFO L225 Difference]: With dead ends: 2714 [2019-12-19 02:35:25,561 INFO L226 Difference]: Without dead ends: 2328 [2019-12-19 02:35:25,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:35:25,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2328 states. [2019-12-19 02:35:25,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2328 to 2158. [2019-12-19 02:35:25,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2158 states. [2019-12-19 02:35:25,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2158 states to 2158 states and 5289 transitions. [2019-12-19 02:35:25,592 INFO L78 Accepts]: Start accepts. Automaton has 2158 states and 5289 transitions. Word has length 84 [2019-12-19 02:35:25,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:25,592 INFO L462 AbstractCegarLoop]: Abstraction has 2158 states and 5289 transitions. [2019-12-19 02:35:25,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:35:25,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2158 states and 5289 transitions. [2019-12-19 02:35:25,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:35:25,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:25,595 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] [2019-12-19 02:35:25,595 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:25,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:25,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1631061393, now seen corresponding path program 1 times [2019-12-19 02:35:25,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:25,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518185080] [2019-12-19 02:35:25,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:25,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:35:25,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518185080] [2019-12-19 02:35:25,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:25,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:35:25,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696066373] [2019-12-19 02:35:25,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:35:25,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:25,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:35:25,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:35:25,727 INFO L87 Difference]: Start difference. First operand 2158 states and 5289 transitions. Second operand 7 states. [2019-12-19 02:35:25,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:25,961 INFO L93 Difference]: Finished difference Result 2134 states and 5233 transitions. [2019-12-19 02:35:25,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:35:25,962 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-19 02:35:25,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:25,966 INFO L225 Difference]: With dead ends: 2134 [2019-12-19 02:35:25,966 INFO L226 Difference]: Without dead ends: 2134 [2019-12-19 02:35:25,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-19 02:35:25,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states. [2019-12-19 02:35:26,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 2042. [2019-12-19 02:35:26,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2042 states. [2019-12-19 02:35:26,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 5002 transitions. [2019-12-19 02:35:26,013 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 5002 transitions. Word has length 97 [2019-12-19 02:35:26,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:26,013 INFO L462 AbstractCegarLoop]: Abstraction has 2042 states and 5002 transitions. [2019-12-19 02:35:26,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:35:26,014 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 5002 transitions. [2019-12-19 02:35:26,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:35:26,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:26,018 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] [2019-12-19 02:35:26,018 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:26,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:26,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1270917992, now seen corresponding path program 1 times [2019-12-19 02:35:26,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:26,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174866970] [2019-12-19 02:35:26,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:26,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:35:26,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174866970] [2019-12-19 02:35:26,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:26,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:35:26,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664839405] [2019-12-19 02:35:26,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:35:26,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:26,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:35:26,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:35:26,081 INFO L87 Difference]: Start difference. First operand 2042 states and 5002 transitions. Second operand 4 states. [2019-12-19 02:35:26,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:26,260 INFO L93 Difference]: Finished difference Result 2397 states and 5799 transitions. [2019-12-19 02:35:26,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:35:26,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-19 02:35:26,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:26,265 INFO L225 Difference]: With dead ends: 2397 [2019-12-19 02:35:26,265 INFO L226 Difference]: Without dead ends: 2397 [2019-12-19 02:35:26,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:35:26,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2019-12-19 02:35:26,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 2121. [2019-12-19 02:35:26,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2121 states. [2019-12-19 02:35:26,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 5178 transitions. [2019-12-19 02:35:26,309 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 5178 transitions. Word has length 97 [2019-12-19 02:35:26,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:26,310 INFO L462 AbstractCegarLoop]: Abstraction has 2121 states and 5178 transitions. [2019-12-19 02:35:26,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:35:26,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 5178 transitions. [2019-12-19 02:35:26,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:35:26,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:26,315 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] [2019-12-19 02:35:26,315 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:26,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:26,316 INFO L82 PathProgramCache]: Analyzing trace with hash 2101365721, now seen corresponding path program 1 times [2019-12-19 02:35:26,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:26,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044526645] [2019-12-19 02:35:26,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:26,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-19 02:35:26,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044526645] [2019-12-19 02:35:26,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:26,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:35:26,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498987986] [2019-12-19 02:35:26,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:35:26,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:26,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:35:26,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:35:26,443 INFO L87 Difference]: Start difference. First operand 2121 states and 5178 transitions. Second operand 6 states. [2019-12-19 02:35:26,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:26,607 INFO L93 Difference]: Finished difference Result 2347 states and 5579 transitions. [2019-12-19 02:35:26,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:35:26,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-19 02:35:26,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:26,610 INFO L225 Difference]: With dead ends: 2347 [2019-12-19 02:35:26,611 INFO L226 Difference]: Without dead ends: 2302 [2019-12-19 02:35:26,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:35:26,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2019-12-19 02:35:26,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 2180. [2019-12-19 02:35:26,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2180 states. [2019-12-19 02:35:26,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 5243 transitions. [2019-12-19 02:35:26,642 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 5243 transitions. Word has length 97 [2019-12-19 02:35:26,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:26,643 INFO L462 AbstractCegarLoop]: Abstraction has 2180 states and 5243 transitions. [2019-12-19 02:35:26,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:35:26,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 5243 transitions. [2019-12-19 02:35:26,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:35:26,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:26,646 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] [2019-12-19 02:35:26,646 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:26,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:26,647 INFO L82 PathProgramCache]: Analyzing trace with hash 165705434, now seen corresponding path program 1 times [2019-12-19 02:35:26,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:26,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768320157] [2019-12-19 02:35:26,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:26,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:35:26,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768320157] [2019-12-19 02:35:26,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:26,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:35:26,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387305702] [2019-12-19 02:35:26,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:35:26,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:26,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:35:26,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:35:26,746 INFO L87 Difference]: Start difference. First operand 2180 states and 5243 transitions. Second operand 7 states. [2019-12-19 02:35:27,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:27,155 INFO L93 Difference]: Finished difference Result 3960 states and 9647 transitions. [2019-12-19 02:35:27,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 02:35:27,155 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-19 02:35:27,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:27,161 INFO L225 Difference]: With dead ends: 3960 [2019-12-19 02:35:27,161 INFO L226 Difference]: Without dead ends: 3960 [2019-12-19 02:35:27,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-19 02:35:27,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3960 states. [2019-12-19 02:35:27,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3960 to 2312. [2019-12-19 02:35:27,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2019-12-19 02:35:27,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 5516 transitions. [2019-12-19 02:35:27,191 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 5516 transitions. Word has length 97 [2019-12-19 02:35:27,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:27,191 INFO L462 AbstractCegarLoop]: Abstraction has 2312 states and 5516 transitions. [2019-12-19 02:35:27,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:35:27,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 5516 transitions. [2019-12-19 02:35:27,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:35:27,194 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:27,194 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] [2019-12-19 02:35:27,194 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:27,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:27,194 INFO L82 PathProgramCache]: Analyzing trace with hash 495471195, now seen corresponding path program 1 times [2019-12-19 02:35:27,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:27,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927798227] [2019-12-19 02:35:27,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:27,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:27,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:35:27,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927798227] [2019-12-19 02:35:27,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:27,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:35:27,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567292705] [2019-12-19 02:35:27,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:35:27,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:27,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:35:27,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:35:27,250 INFO L87 Difference]: Start difference. First operand 2312 states and 5516 transitions. Second operand 4 states. [2019-12-19 02:35:27,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:27,334 INFO L93 Difference]: Finished difference Result 2123 states and 5012 transitions. [2019-12-19 02:35:27,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:35:27,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-19 02:35:27,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:27,338 INFO L225 Difference]: With dead ends: 2123 [2019-12-19 02:35:27,338 INFO L226 Difference]: Without dead ends: 2123 [2019-12-19 02:35:27,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:35:27,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2019-12-19 02:35:27,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2008. [2019-12-19 02:35:27,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2008 states. [2019-12-19 02:35:27,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 2008 states and 4753 transitions. [2019-12-19 02:35:27,366 INFO L78 Accepts]: Start accepts. Automaton has 2008 states and 4753 transitions. Word has length 97 [2019-12-19 02:35:27,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:27,367 INFO L462 AbstractCegarLoop]: Abstraction has 2008 states and 4753 transitions. [2019-12-19 02:35:27,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:35:27,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2008 states and 4753 transitions. [2019-12-19 02:35:27,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:35:27,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:27,370 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] [2019-12-19 02:35:27,370 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:27,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:27,370 INFO L82 PathProgramCache]: Analyzing trace with hash -553018629, now seen corresponding path program 1 times [2019-12-19 02:35:27,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:27,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291096822] [2019-12-19 02:35:27,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:27,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:35:27,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291096822] [2019-12-19 02:35:27,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:27,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:35:27,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180425395] [2019-12-19 02:35:27,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:35:27,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:27,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:35:27,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:35:27,442 INFO L87 Difference]: Start difference. First operand 2008 states and 4753 transitions. Second operand 5 states. [2019-12-19 02:35:27,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:27,637 INFO L93 Difference]: Finished difference Result 2260 states and 5332 transitions. [2019-12-19 02:35:27,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:35:27,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-12-19 02:35:27,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:27,641 INFO L225 Difference]: With dead ends: 2260 [2019-12-19 02:35:27,641 INFO L226 Difference]: Without dead ends: 2242 [2019-12-19 02:35:27,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:35:27,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states. [2019-12-19 02:35:27,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 2035. [2019-12-19 02:35:27,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2019-12-19 02:35:27,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 4807 transitions. [2019-12-19 02:35:27,664 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 4807 transitions. Word has length 97 [2019-12-19 02:35:27,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:27,664 INFO L462 AbstractCegarLoop]: Abstraction has 2035 states and 4807 transitions. [2019-12-19 02:35:27,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:35:27,664 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 4807 transitions. [2019-12-19 02:35:27,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:35:27,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:27,667 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] [2019-12-19 02:35:27,667 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:27,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:27,667 INFO L82 PathProgramCache]: Analyzing trace with hash 691745852, now seen corresponding path program 1 times [2019-12-19 02:35:27,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:27,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315649074] [2019-12-19 02:35:27,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:27,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:35:27,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315649074] [2019-12-19 02:35:27,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:27,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:35:27,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304525747] [2019-12-19 02:35:27,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:35:27,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:27,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:35:27,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:35:27,754 INFO L87 Difference]: Start difference. First operand 2035 states and 4807 transitions. Second operand 5 states. [2019-12-19 02:35:27,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:27,800 INFO L93 Difference]: Finished difference Result 2892 states and 6988 transitions. [2019-12-19 02:35:27,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:35:27,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-12-19 02:35:27,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:27,804 INFO L225 Difference]: With dead ends: 2892 [2019-12-19 02:35:27,804 INFO L226 Difference]: Without dead ends: 2892 [2019-12-19 02:35:27,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:35:27,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2019-12-19 02:35:27,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 1903. [2019-12-19 02:35:27,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1903 states. [2019-12-19 02:35:27,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 4495 transitions. [2019-12-19 02:35:27,837 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 4495 transitions. Word has length 97 [2019-12-19 02:35:27,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:27,837 INFO L462 AbstractCegarLoop]: Abstraction has 1903 states and 4495 transitions. [2019-12-19 02:35:27,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:35:27,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 4495 transitions. [2019-12-19 02:35:27,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:35:27,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:27,840 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:35:27,840 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:27,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:27,841 INFO L82 PathProgramCache]: Analyzing trace with hash -821367206, now seen corresponding path program 1 times [2019-12-19 02:35:27,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:27,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020261950] [2019-12-19 02:35:27,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:27,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:35:27,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020261950] [2019-12-19 02:35:27,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:27,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:35:27,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579353330] [2019-12-19 02:35:27,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:35:27,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:27,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:35:27,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:35:27,941 INFO L87 Difference]: Start difference. First operand 1903 states and 4495 transitions. Second operand 6 states. [2019-12-19 02:35:28,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:28,180 INFO L93 Difference]: Finished difference Result 2124 states and 4900 transitions. [2019-12-19 02:35:28,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 02:35:28,181 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-19 02:35:28,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:28,185 INFO L225 Difference]: With dead ends: 2124 [2019-12-19 02:35:28,185 INFO L226 Difference]: Without dead ends: 2124 [2019-12-19 02:35:28,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-19 02:35:28,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2124 states. [2019-12-19 02:35:28,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2124 to 1939. [2019-12-19 02:35:28,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1939 states. [2019-12-19 02:35:28,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 4547 transitions. [2019-12-19 02:35:28,222 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 4547 transitions. Word has length 97 [2019-12-19 02:35:28,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:28,222 INFO L462 AbstractCegarLoop]: Abstraction has 1939 states and 4547 transitions. [2019-12-19 02:35:28,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:35:28,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 4547 transitions. [2019-12-19 02:35:28,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:35:28,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:28,225 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] [2019-12-19 02:35:28,226 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:28,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:28,226 INFO L82 PathProgramCache]: Analyzing trace with hash -491601445, now seen corresponding path program 1 times [2019-12-19 02:35:28,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:28,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868252141] [2019-12-19 02:35:28,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:28,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:35:28,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868252141] [2019-12-19 02:35:28,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:28,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 02:35:28,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195261236] [2019-12-19 02:35:28,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 02:35:28,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:28,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 02:35:28,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:35:28,406 INFO L87 Difference]: Start difference. First operand 1939 states and 4547 transitions. Second operand 8 states. [2019-12-19 02:35:28,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:28,555 INFO L93 Difference]: Finished difference Result 3285 states and 7781 transitions. [2019-12-19 02:35:28,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 02:35:28,555 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-19 02:35:28,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:28,558 INFO L225 Difference]: With dead ends: 3285 [2019-12-19 02:35:28,558 INFO L226 Difference]: Without dead ends: 1428 [2019-12-19 02:35:28,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-19 02:35:28,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-12-19 02:35:28,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1348. [2019-12-19 02:35:28,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2019-12-19 02:35:28,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 3203 transitions. [2019-12-19 02:35:28,827 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 3203 transitions. Word has length 97 [2019-12-19 02:35:28,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:28,827 INFO L462 AbstractCegarLoop]: Abstraction has 1348 states and 3203 transitions. [2019-12-19 02:35:28,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 02:35:28,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 3203 transitions. [2019-12-19 02:35:28,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:35:28,829 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:28,829 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] [2019-12-19 02:35:28,830 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:28,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:28,830 INFO L82 PathProgramCache]: Analyzing trace with hash 530847507, now seen corresponding path program 2 times [2019-12-19 02:35:28,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:28,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300360349] [2019-12-19 02:35:28,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 02:35:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 02:35:28,984 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 02:35:28,984 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 02:35:29,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 02:35:29 BasicIcfg [2019-12-19 02:35:29,194 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 02:35:29,196 INFO L168 Benchmark]: Toolchain (without parser) took 55262.44 ms. Allocated memory was 137.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 101.2 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 691.5 MB. Max. memory is 7.1 GB. [2019-12-19 02:35:29,196 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-19 02:35:29,201 INFO L168 Benchmark]: CACSL2BoogieTranslator took 775.89 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.8 MB in the beginning and 156.1 MB in the end (delta: -55.3 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-19 02:35:29,201 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.43 ms. Allocated memory is still 201.9 MB. Free memory was 156.1 MB in the beginning and 153.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-19 02:35:29,206 INFO L168 Benchmark]: Boogie Preprocessor took 36.97 ms. Allocated memory is still 201.9 MB. Free memory was 153.3 MB in the beginning and 150.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-19 02:35:29,207 INFO L168 Benchmark]: RCFGBuilder took 875.26 ms. Allocated memory is still 201.9 MB. Free memory was 150.6 MB in the beginning and 106.4 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-12-19 02:35:29,207 INFO L168 Benchmark]: TraceAbstraction took 53486.12 ms. Allocated memory was 201.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 105.7 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 632.0 MB. Max. memory is 7.1 GB. [2019-12-19 02:35:29,212 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.55 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 775.89 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.8 MB in the beginning and 156.1 MB in the end (delta: -55.3 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 80.43 ms. Allocated memory is still 201.9 MB. Free memory was 156.1 MB in the beginning and 153.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.97 ms. Allocated memory is still 201.9 MB. Free memory was 153.3 MB in the beginning and 150.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 875.26 ms. Allocated memory is still 201.9 MB. Free memory was 150.6 MB in the beginning and 106.4 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 53486.12 ms. Allocated memory was 201.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 105.7 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 632.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L698] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L703] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L704] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L705] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L706] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L707] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L708] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L709] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L710] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L711] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L712] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L713] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L714] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L715] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L716] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L718] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L720] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L721] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L722] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L788] 0 pthread_t t1091; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L789] FCALL, FORK 0 pthread_create(&t1091, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L790] 0 pthread_t t1092; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L791] FCALL, FORK 0 pthread_create(&t1092, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L746] 2 x$w_buff1 = x$w_buff0 [L747] 2 x$w_buff0 = 2 [L748] 2 x$w_buff1_used = x$w_buff0_used [L749] 2 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L751] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L752] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L753] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L754] 2 x$r_buff0_thd2 = (_Bool)1 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L726] 1 z = 1 [L729] 1 x = 1 VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1, z=1] [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1, z=1] [L732] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L733] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L734] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L734] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L735] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L735] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L736] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L736] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L739] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L766] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L767] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L768] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L769] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L770] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L797] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L797] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L797] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L797] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L799] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L800] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L801] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 x$flush_delayed = weak$$choice2 [L807] 0 x$mem_tmp = x VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L809] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L810] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L810] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L811] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L811] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L812] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L812] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L813] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L814] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L814] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L816] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L816] 0 x = x$flush_delayed ? x$mem_tmp : x [L817] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 53.1s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 20.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7515 SDtfs, 8673 SDslu, 17807 SDs, 0 SdLazy, 8023 SolverSat, 545 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 318 GetRequests, 79 SyntacticMatches, 19 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76080occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 27.2s AutomataMinimizationTime, 29 MinimizatonAttempts, 95781 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2356 NumberOfCodeBlocks, 2356 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2230 ConstructedInterpolants, 0 QuantifiedInterpolants, 450262 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...