/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/mix009_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 00:32:34,642 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 00:32:34,645 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 00:32:34,657 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 00:32:34,657 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 00:32:34,658 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 00:32:34,660 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 00:32:34,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 00:32:34,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 00:32:34,664 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 00:32:34,665 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 00:32:34,667 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 00:32:34,667 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 00:32:34,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 00:32:34,669 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 00:32:34,670 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 00:32:34,671 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 00:32:34,672 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 00:32:34,674 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 00:32:34,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 00:32:34,678 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 00:32:34,679 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 00:32:34,680 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 00:32:34,681 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 00:32:34,683 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 00:32:34,683 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 00:32:34,683 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 00:32:34,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 00:32:34,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 00:32:34,686 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 00:32:34,686 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 00:32:34,687 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 00:32:34,688 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 00:32:34,688 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 00:32:34,689 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 00:32:34,690 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 00:32:34,690 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 00:32:34,690 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 00:32:34,691 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 00:32:34,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 00:32:34,692 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 00:32:34,693 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 00:32:34,707 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 00:32:34,708 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 00:32:34,709 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 00:32:34,709 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 00:32:34,709 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 00:32:34,709 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 00:32:34,710 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 00:32:34,710 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 00:32:34,710 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 00:32:34,710 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 00:32:34,710 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 00:32:34,711 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 00:32:34,711 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 00:32:34,711 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 00:32:34,711 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 00:32:34,711 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 00:32:34,711 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 00:32:34,712 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 00:32:34,712 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 00:32:34,712 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 00:32:34,712 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 00:32:34,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 00:32:34,713 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 00:32:34,713 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 00:32:34,713 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 00:32:34,713 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 00:32:34,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 00:32:34,714 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 00:32:34,714 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 00:32:34,714 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 00:32:34,988 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 00:32:35,000 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 00:32:35,004 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 00:32:35,005 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 00:32:35,006 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 00:32:35,007 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix009_rmo.oepc.i [2019-12-19 00:32:35,083 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1314f1577/fc55136d2cc342f997598b4343da1f71/FLAGbb31d0f23 [2019-12-19 00:32:35,682 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 00:32:35,683 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009_rmo.oepc.i [2019-12-19 00:32:35,696 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1314f1577/fc55136d2cc342f997598b4343da1f71/FLAGbb31d0f23 [2019-12-19 00:32:35,911 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1314f1577/fc55136d2cc342f997598b4343da1f71 [2019-12-19 00:32:35,923 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 00:32:35,925 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 00:32:35,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 00:32:35,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 00:32:35,931 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 00:32:35,932 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 12:32:35" (1/1) ... [2019-12-19 00:32:35,936 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 12:32:35, skipping insertion in model container [2019-12-19 00:32:35,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 12:32:35" (1/1) ... [2019-12-19 00:32:35,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 00:32:36,009 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 00:32:36,544 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 00:32:36,560 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 00:32:36,647 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 00:32:36,735 INFO L208 MainTranslator]: Completed translation [2019-12-19 00:32:36,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:32:36 WrapperNode [2019-12-19 00:32:36,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 00:32:36,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 00:32:36,737 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 00:32:36,737 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 00:32:36,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:32:36" (1/1) ... [2019-12-19 00:32:36,767 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:32:36" (1/1) ... [2019-12-19 00:32:36,802 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 00:32:36,802 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 00:32:36,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 00:32:36,803 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 00:32:36,811 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:32:36" (1/1) ... [2019-12-19 00:32:36,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:32:36" (1/1) ... [2019-12-19 00:32:36,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:32:36" (1/1) ... [2019-12-19 00:32:36,817 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:32:36" (1/1) ... [2019-12-19 00:32:36,828 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:32:36" (1/1) ... [2019-12-19 00:32:36,833 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:32:36" (1/1) ... [2019-12-19 00:32:36,836 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:32:36" (1/1) ... [2019-12-19 00:32:36,841 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 00:32:36,842 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 00:32:36,842 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 00:32:36,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 00:32:36,843 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:32:36" (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 00:32:36,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 00:32:36,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 00:32:36,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 00:32:36,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 00:32:36,934 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 00:32:36,934 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 00:32:36,934 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 00:32:36,934 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 00:32:36,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 00:32:36,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 00:32:36,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 00:32:36,937 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 00:32:37,713 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 00:32:37,714 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 00:32:37,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:32:37 BoogieIcfgContainer [2019-12-19 00:32:37,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 00:32:37,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 00:32:37,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 00:32:37,722 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 00:32:37,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 12:32:35" (1/3) ... [2019-12-19 00:32:37,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee61c5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 12:32:37, skipping insertion in model container [2019-12-19 00:32:37,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:32:36" (2/3) ... [2019-12-19 00:32:37,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee61c5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 12:32:37, skipping insertion in model container [2019-12-19 00:32:37,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:32:37" (3/3) ... [2019-12-19 00:32:37,728 INFO L109 eAbstractionObserver]: Analyzing ICFG mix009_rmo.oepc.i [2019-12-19 00:32:37,739 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 00:32:37,740 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 00:32:37,757 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 00:32:37,758 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 00:32:37,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,799 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,800 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,800 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,802 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,802 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,820 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,822 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,858 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,858 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,859 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,865 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,882 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:32:37,899 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 00:32:37,920 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 00:32:37,920 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 00:32:37,920 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 00:32:37,920 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 00:32:37,920 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 00:32:37,920 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 00:32:37,921 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 00:32:37,921 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 00:32:37,935 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 150 places, 184 transitions [2019-12-19 00:32:39,922 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32594 states. [2019-12-19 00:32:39,924 INFO L276 IsEmpty]: Start isEmpty. Operand 32594 states. [2019-12-19 00:32:39,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-19 00:32:39,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:39,933 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] [2019-12-19 00:32:39,934 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:39,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:39,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1842126657, now seen corresponding path program 1 times [2019-12-19 00:32:39,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:39,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565402430] [2019-12-19 00:32:39,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:40,262 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 00:32:40,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565402430] [2019-12-19 00:32:40,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:40,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:32:40,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634703914] [2019-12-19 00:32:40,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:32:40,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:40,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:32:40,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:32:40,294 INFO L87 Difference]: Start difference. First operand 32594 states. Second operand 4 states. [2019-12-19 00:32:42,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:42,104 INFO L93 Difference]: Finished difference Result 33594 states and 129571 transitions. [2019-12-19 00:32:42,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 00:32:42,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-19 00:32:42,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:42,371 INFO L225 Difference]: With dead ends: 33594 [2019-12-19 00:32:42,372 INFO L226 Difference]: Without dead ends: 25706 [2019-12-19 00:32:42,373 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 00:32:42,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25706 states. [2019-12-19 00:32:43,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25706 to 25706. [2019-12-19 00:32:43,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25706 states. [2019-12-19 00:32:43,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25706 states to 25706 states and 99587 transitions. [2019-12-19 00:32:43,684 INFO L78 Accepts]: Start accepts. Automaton has 25706 states and 99587 transitions. Word has length 37 [2019-12-19 00:32:43,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:43,685 INFO L462 AbstractCegarLoop]: Abstraction has 25706 states and 99587 transitions. [2019-12-19 00:32:43,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:32:43,685 INFO L276 IsEmpty]: Start isEmpty. Operand 25706 states and 99587 transitions. [2019-12-19 00:32:43,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-19 00:32:43,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:43,700 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:43,701 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:43,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:43,702 INFO L82 PathProgramCache]: Analyzing trace with hash 994831418, now seen corresponding path program 1 times [2019-12-19 00:32:43,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:43,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724157986] [2019-12-19 00:32:43,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:43,899 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 00:32:43,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724157986] [2019-12-19 00:32:43,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:43,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:32:43,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135423547] [2019-12-19 00:32:43,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:32:43,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:43,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:32:43,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:32:43,903 INFO L87 Difference]: Start difference. First operand 25706 states and 99587 transitions. Second operand 5 states. [2019-12-19 00:32:45,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:45,133 INFO L93 Difference]: Finished difference Result 41084 states and 150434 transitions. [2019-12-19 00:32:45,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:32:45,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-19 00:32:45,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:45,322 INFO L225 Difference]: With dead ends: 41084 [2019-12-19 00:32:45,322 INFO L226 Difference]: Without dead ends: 40548 [2019-12-19 00:32:45,323 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 00:32:46,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40548 states. [2019-12-19 00:32:48,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40548 to 38928. [2019-12-19 00:32:48,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38928 states. [2019-12-19 00:32:48,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38928 states to 38928 states and 143584 transitions. [2019-12-19 00:32:48,207 INFO L78 Accepts]: Start accepts. Automaton has 38928 states and 143584 transitions. Word has length 49 [2019-12-19 00:32:48,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:48,209 INFO L462 AbstractCegarLoop]: Abstraction has 38928 states and 143584 transitions. [2019-12-19 00:32:48,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:32:48,210 INFO L276 IsEmpty]: Start isEmpty. Operand 38928 states and 143584 transitions. [2019-12-19 00:32:48,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-19 00:32:48,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:48,219 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:48,219 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:48,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:48,220 INFO L82 PathProgramCache]: Analyzing trace with hash -351997153, now seen corresponding path program 1 times [2019-12-19 00:32:48,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:48,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314190294] [2019-12-19 00:32:48,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:48,314 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 00:32:48,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314190294] [2019-12-19 00:32:48,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:48,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:32:48,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740658848] [2019-12-19 00:32:48,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:32:48,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:48,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:32:48,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:32:48,319 INFO L87 Difference]: Start difference. First operand 38928 states and 143584 transitions. Second operand 5 states. [2019-12-19 00:32:48,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:48,942 INFO L93 Difference]: Finished difference Result 49781 states and 180636 transitions. [2019-12-19 00:32:48,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:32:48,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-12-19 00:32:48,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:50,719 INFO L225 Difference]: With dead ends: 49781 [2019-12-19 00:32:50,719 INFO L226 Difference]: Without dead ends: 49277 [2019-12-19 00:32:50,719 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 00:32:51,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49277 states. [2019-12-19 00:32:52,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49277 to 42680. [2019-12-19 00:32:52,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42680 states. [2019-12-19 00:32:52,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42680 states to 42680 states and 156595 transitions. [2019-12-19 00:32:52,121 INFO L78 Accepts]: Start accepts. Automaton has 42680 states and 156595 transitions. Word has length 50 [2019-12-19 00:32:52,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:52,122 INFO L462 AbstractCegarLoop]: Abstraction has 42680 states and 156595 transitions. [2019-12-19 00:32:52,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:32:52,122 INFO L276 IsEmpty]: Start isEmpty. Operand 42680 states and 156595 transitions. [2019-12-19 00:32:52,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-19 00:32:52,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:52,132 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] [2019-12-19 00:32:52,132 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:52,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:52,132 INFO L82 PathProgramCache]: Analyzing trace with hash 2004382981, now seen corresponding path program 1 times [2019-12-19 00:32:52,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:52,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087478148] [2019-12-19 00:32:52,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:52,227 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 00:32:52,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087478148] [2019-12-19 00:32:52,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:52,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 00:32:52,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238974009] [2019-12-19 00:32:52,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 00:32:52,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:52,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 00:32:52,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:32:52,229 INFO L87 Difference]: Start difference. First operand 42680 states and 156595 transitions. Second operand 3 states. [2019-12-19 00:32:52,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:52,597 INFO L93 Difference]: Finished difference Result 61090 states and 221433 transitions. [2019-12-19 00:32:52,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 00:32:52,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-19 00:32:52,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:52,780 INFO L225 Difference]: With dead ends: 61090 [2019-12-19 00:32:52,781 INFO L226 Difference]: Without dead ends: 61090 [2019-12-19 00:32:52,781 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 00:32:53,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61090 states. [2019-12-19 00:32:56,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61090 to 48019. [2019-12-19 00:32:56,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48019 states. [2019-12-19 00:32:56,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48019 states to 48019 states and 174182 transitions. [2019-12-19 00:32:56,465 INFO L78 Accepts]: Start accepts. Automaton has 48019 states and 174182 transitions. Word has length 52 [2019-12-19 00:32:56,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:56,466 INFO L462 AbstractCegarLoop]: Abstraction has 48019 states and 174182 transitions. [2019-12-19 00:32:56,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 00:32:56,466 INFO L276 IsEmpty]: Start isEmpty. Operand 48019 states and 174182 transitions. [2019-12-19 00:32:56,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-19 00:32:56,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:56,482 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:32:56,482 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:56,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:56,482 INFO L82 PathProgramCache]: Analyzing trace with hash -189838484, now seen corresponding path program 1 times [2019-12-19 00:32:56,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:56,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142017047] [2019-12-19 00:32:56,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:56,643 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 00:32:56,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142017047] [2019-12-19 00:32:56,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:56,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:32:56,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040366577] [2019-12-19 00:32:56,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:32:56,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:56,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:32:56,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:32:56,646 INFO L87 Difference]: Start difference. First operand 48019 states and 174182 transitions. Second operand 6 states. [2019-12-19 00:32:57,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:57,497 INFO L93 Difference]: Finished difference Result 63759 states and 229382 transitions. [2019-12-19 00:32:57,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:32:57,498 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-19 00:32:57,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:57,635 INFO L225 Difference]: With dead ends: 63759 [2019-12-19 00:32:57,636 INFO L226 Difference]: Without dead ends: 63759 [2019-12-19 00:32:57,636 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 00:32:57,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63759 states. [2019-12-19 00:32:58,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63759 to 59952. [2019-12-19 00:32:58,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59952 states. [2019-12-19 00:33:02,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59952 states to 59952 states and 215675 transitions. [2019-12-19 00:33:02,050 INFO L78 Accepts]: Start accepts. Automaton has 59952 states and 215675 transitions. Word has length 56 [2019-12-19 00:33:02,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:33:02,050 INFO L462 AbstractCegarLoop]: Abstraction has 59952 states and 215675 transitions. [2019-12-19 00:33:02,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:33:02,050 INFO L276 IsEmpty]: Start isEmpty. Operand 59952 states and 215675 transitions. [2019-12-19 00:33:02,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-19 00:33:02,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:33:02,070 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] [2019-12-19 00:33:02,070 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:33:02,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:33:02,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1986789843, now seen corresponding path program 1 times [2019-12-19 00:33:02,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:33:02,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662531079] [2019-12-19 00:33:02,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:33:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:33:02,213 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 00:33:02,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662531079] [2019-12-19 00:33:02,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:33:02,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 00:33:02,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519566217] [2019-12-19 00:33:02,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 00:33:02,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:33:02,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 00:33:02,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:33:02,215 INFO L87 Difference]: Start difference. First operand 59952 states and 215675 transitions. Second operand 7 states. [2019-12-19 00:33:03,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:33:03,598 INFO L93 Difference]: Finished difference Result 83688 states and 290100 transitions. [2019-12-19 00:33:03,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 00:33:03,599 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-12-19 00:33:03,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:33:03,802 INFO L225 Difference]: With dead ends: 83688 [2019-12-19 00:33:03,803 INFO L226 Difference]: Without dead ends: 83688 [2019-12-19 00:33:03,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 00:33:04,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83688 states. [2019-12-19 00:33:05,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83688 to 71015. [2019-12-19 00:33:05,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71015 states. [2019-12-19 00:33:05,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71015 states to 71015 states and 249889 transitions. [2019-12-19 00:33:05,438 INFO L78 Accepts]: Start accepts. Automaton has 71015 states and 249889 transitions. Word has length 56 [2019-12-19 00:33:05,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:33:05,438 INFO L462 AbstractCegarLoop]: Abstraction has 71015 states and 249889 transitions. [2019-12-19 00:33:05,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 00:33:05,438 INFO L276 IsEmpty]: Start isEmpty. Operand 71015 states and 249889 transitions. [2019-12-19 00:33:05,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-19 00:33:05,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:33:05,452 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] [2019-12-19 00:33:05,452 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:33:05,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:33:05,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1099286162, now seen corresponding path program 1 times [2019-12-19 00:33:05,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:33:05,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474411399] [2019-12-19 00:33:05,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:33:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:33:05,552 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 00:33:05,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474411399] [2019-12-19 00:33:05,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:33:05,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:33:05,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133375835] [2019-12-19 00:33:05,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:33:05,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:33:05,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:33:05,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:33:05,556 INFO L87 Difference]: Start difference. First operand 71015 states and 249889 transitions. Second operand 4 states. [2019-12-19 00:33:05,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:33:05,639 INFO L93 Difference]: Finished difference Result 12162 states and 37832 transitions. [2019-12-19 00:33:05,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 00:33:05,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-19 00:33:05,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:33:05,660 INFO L225 Difference]: With dead ends: 12162 [2019-12-19 00:33:05,660 INFO L226 Difference]: Without dead ends: 10677 [2019-12-19 00:33:05,661 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 00:33:06,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10677 states. [2019-12-19 00:33:06,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10677 to 10628. [2019-12-19 00:33:06,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10628 states. [2019-12-19 00:33:06,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10628 states to 10628 states and 32594 transitions. [2019-12-19 00:33:06,220 INFO L78 Accepts]: Start accepts. Automaton has 10628 states and 32594 transitions. Word has length 56 [2019-12-19 00:33:06,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:33:06,221 INFO L462 AbstractCegarLoop]: Abstraction has 10628 states and 32594 transitions. [2019-12-19 00:33:06,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:33:06,221 INFO L276 IsEmpty]: Start isEmpty. Operand 10628 states and 32594 transitions. [2019-12-19 00:33:06,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-19 00:33:06,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:33:06,223 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] [2019-12-19 00:33:06,223 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:33:06,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:33:06,223 INFO L82 PathProgramCache]: Analyzing trace with hash -541236016, now seen corresponding path program 1 times [2019-12-19 00:33:06,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:33:06,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236830155] [2019-12-19 00:33:06,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:33:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:33:06,293 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 00:33:06,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236830155] [2019-12-19 00:33:06,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:33:06,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:33:06,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248881544] [2019-12-19 00:33:06,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:33:06,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:33:06,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:33:06,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:33:06,295 INFO L87 Difference]: Start difference. First operand 10628 states and 32594 transitions. Second operand 6 states. [2019-12-19 00:33:06,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:33:06,797 INFO L93 Difference]: Finished difference Result 13185 states and 39875 transitions. [2019-12-19 00:33:06,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 00:33:06,798 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-19 00:33:06,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:33:06,828 INFO L225 Difference]: With dead ends: 13185 [2019-12-19 00:33:06,828 INFO L226 Difference]: Without dead ends: 13122 [2019-12-19 00:33:06,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-19 00:33:06,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13122 states. [2019-12-19 00:33:07,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13122 to 11051. [2019-12-19 00:33:07,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11051 states. [2019-12-19 00:33:07,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11051 states to 11051 states and 33788 transitions. [2019-12-19 00:33:07,065 INFO L78 Accepts]: Start accepts. Automaton has 11051 states and 33788 transitions. Word has length 56 [2019-12-19 00:33:07,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:33:07,066 INFO L462 AbstractCegarLoop]: Abstraction has 11051 states and 33788 transitions. [2019-12-19 00:33:07,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:33:07,066 INFO L276 IsEmpty]: Start isEmpty. Operand 11051 states and 33788 transitions. [2019-12-19 00:33:07,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-19 00:33:07,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:33:07,070 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] [2019-12-19 00:33:07,070 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:33:07,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:33:07,070 INFO L82 PathProgramCache]: Analyzing trace with hash 227053228, now seen corresponding path program 1 times [2019-12-19 00:33:07,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:33:07,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98640648] [2019-12-19 00:33:07,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:33:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:33:07,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:33:07,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98640648] [2019-12-19 00:33:07,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:33:07,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:33:07,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668393195] [2019-12-19 00:33:07,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:33:07,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:33:07,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:33:07,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:33:07,147 INFO L87 Difference]: Start difference. First operand 11051 states and 33788 transitions. Second operand 4 states. [2019-12-19 00:33:07,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:33:07,271 INFO L93 Difference]: Finished difference Result 12865 states and 39394 transitions. [2019-12-19 00:33:07,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 00:33:07,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-19 00:33:07,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:33:07,289 INFO L225 Difference]: With dead ends: 12865 [2019-12-19 00:33:07,289 INFO L226 Difference]: Without dead ends: 12865 [2019-12-19 00:33:07,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:33:07,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12865 states. [2019-12-19 00:33:07,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12865 to 11696. [2019-12-19 00:33:07,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11696 states. [2019-12-19 00:33:07,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11696 states to 11696 states and 35765 transitions. [2019-12-19 00:33:07,450 INFO L78 Accepts]: Start accepts. Automaton has 11696 states and 35765 transitions. Word has length 64 [2019-12-19 00:33:07,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:33:07,450 INFO L462 AbstractCegarLoop]: Abstraction has 11696 states and 35765 transitions. [2019-12-19 00:33:07,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:33:07,450 INFO L276 IsEmpty]: Start isEmpty. Operand 11696 states and 35765 transitions. [2019-12-19 00:33:07,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-19 00:33:07,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:33:07,454 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] [2019-12-19 00:33:07,454 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:33:07,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:33:07,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1969863563, now seen corresponding path program 1 times [2019-12-19 00:33:07,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:33:07,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992229764] [2019-12-19 00:33:07,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:33:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:33:07,530 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 00:33:07,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992229764] [2019-12-19 00:33:07,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:33:07,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:33:07,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836652592] [2019-12-19 00:33:07,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:33:07,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:33:07,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:33:07,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:33:07,533 INFO L87 Difference]: Start difference. First operand 11696 states and 35765 transitions. Second operand 6 states. [2019-12-19 00:33:07,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:33:07,962 INFO L93 Difference]: Finished difference Result 14222 states and 42863 transitions. [2019-12-19 00:33:07,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 00:33:07,962 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-19 00:33:07,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:33:07,982 INFO L225 Difference]: With dead ends: 14222 [2019-12-19 00:33:07,982 INFO L226 Difference]: Without dead ends: 14161 [2019-12-19 00:33:07,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 00:33:08,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14161 states. [2019-12-19 00:33:08,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14161 to 13464. [2019-12-19 00:33:08,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13464 states. [2019-12-19 00:33:08,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13464 states to 13464 states and 40782 transitions. [2019-12-19 00:33:08,163 INFO L78 Accepts]: Start accepts. Automaton has 13464 states and 40782 transitions. Word has length 64 [2019-12-19 00:33:08,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:33:08,166 INFO L462 AbstractCegarLoop]: Abstraction has 13464 states and 40782 transitions. [2019-12-19 00:33:08,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:33:08,166 INFO L276 IsEmpty]: Start isEmpty. Operand 13464 states and 40782 transitions. [2019-12-19 00:33:08,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 00:33:08,179 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:33:08,180 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 00:33:08,180 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:33:08,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:33:08,180 INFO L82 PathProgramCache]: Analyzing trace with hash -509623810, now seen corresponding path program 1 times [2019-12-19 00:33:08,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:33:08,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951438616] [2019-12-19 00:33:08,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:33:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:33:08,249 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 00:33:08,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951438616] [2019-12-19 00:33:08,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:33:08,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:33:08,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122627093] [2019-12-19 00:33:08,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:33:08,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:33:08,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:33:08,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:33:08,253 INFO L87 Difference]: Start difference. First operand 13464 states and 40782 transitions. Second operand 4 states. [2019-12-19 00:33:08,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:33:08,678 INFO L93 Difference]: Finished difference Result 16506 states and 49374 transitions. [2019-12-19 00:33:08,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 00:33:08,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-19 00:33:08,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:33:08,710 INFO L225 Difference]: With dead ends: 16506 [2019-12-19 00:33:08,710 INFO L226 Difference]: Without dead ends: 16506 [2019-12-19 00:33:08,710 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 00:33:08,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16506 states. [2019-12-19 00:33:08,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16506 to 14985. [2019-12-19 00:33:08,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14985 states. [2019-12-19 00:33:09,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14985 states to 14985 states and 44963 transitions. [2019-12-19 00:33:09,039 INFO L78 Accepts]: Start accepts. Automaton has 14985 states and 44963 transitions. Word has length 68 [2019-12-19 00:33:09,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:33:09,039 INFO L462 AbstractCegarLoop]: Abstraction has 14985 states and 44963 transitions. [2019-12-19 00:33:09,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:33:09,040 INFO L276 IsEmpty]: Start isEmpty. Operand 14985 states and 44963 transitions. [2019-12-19 00:33:09,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 00:33:09,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:33:09,051 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 00:33:09,051 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:33:09,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:33:09,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1708134143, now seen corresponding path program 1 times [2019-12-19 00:33:09,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:33:09,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081698983] [2019-12-19 00:33:09,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:33:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:33:09,088 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 00:33:09,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081698983] [2019-12-19 00:33:09,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:33:09,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 00:33:09,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759896817] [2019-12-19 00:33:09,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 00:33:09,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:33:09,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 00:33:09,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:33:09,090 INFO L87 Difference]: Start difference. First operand 14985 states and 44963 transitions. Second operand 3 states. [2019-12-19 00:33:09,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:33:09,347 INFO L93 Difference]: Finished difference Result 15533 states and 46406 transitions. [2019-12-19 00:33:09,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 00:33:09,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-19 00:33:09,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:33:09,377 INFO L225 Difference]: With dead ends: 15533 [2019-12-19 00:33:09,377 INFO L226 Difference]: Without dead ends: 15533 [2019-12-19 00:33:09,377 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 00:33:09,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15533 states. [2019-12-19 00:33:09,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15533 to 15279. [2019-12-19 00:33:09,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15279 states. [2019-12-19 00:33:09,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15279 states to 15279 states and 45731 transitions. [2019-12-19 00:33:09,599 INFO L78 Accepts]: Start accepts. Automaton has 15279 states and 45731 transitions. Word has length 68 [2019-12-19 00:33:09,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:33:09,599 INFO L462 AbstractCegarLoop]: Abstraction has 15279 states and 45731 transitions. [2019-12-19 00:33:09,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 00:33:09,599 INFO L276 IsEmpty]: Start isEmpty. Operand 15279 states and 45731 transitions. [2019-12-19 00:33:09,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 00:33:09,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:33:09,608 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 00:33:09,608 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:33:09,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:33:09,608 INFO L82 PathProgramCache]: Analyzing trace with hash 387298804, now seen corresponding path program 1 times [2019-12-19 00:33:09,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:33:09,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374049678] [2019-12-19 00:33:09,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:33:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:33:09,699 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 00:33:09,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374049678] [2019-12-19 00:33:09,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:33:09,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:33:09,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387869305] [2019-12-19 00:33:09,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:33:09,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:33:09,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:33:09,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:33:09,702 INFO L87 Difference]: Start difference. First operand 15279 states and 45731 transitions. Second operand 6 states. [2019-12-19 00:33:10,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:33:10,281 INFO L93 Difference]: Finished difference Result 16276 states and 48106 transitions. [2019-12-19 00:33:10,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:33:10,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-19 00:33:10,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:33:10,303 INFO L225 Difference]: With dead ends: 16276 [2019-12-19 00:33:10,303 INFO L226 Difference]: Without dead ends: 16276 [2019-12-19 00:33:10,304 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 00:33:10,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16276 states. [2019-12-19 00:33:10,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16276 to 15852. [2019-12-19 00:33:10,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15852 states. [2019-12-19 00:33:10,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15852 states to 15852 states and 47028 transitions. [2019-12-19 00:33:10,504 INFO L78 Accepts]: Start accepts. Automaton has 15852 states and 47028 transitions. Word has length 70 [2019-12-19 00:33:10,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:33:10,505 INFO L462 AbstractCegarLoop]: Abstraction has 15852 states and 47028 transitions. [2019-12-19 00:33:10,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:33:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 15852 states and 47028 transitions. [2019-12-19 00:33:10,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 00:33:10,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:33:10,514 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 00:33:10,514 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:33:10,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:33:10,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1689910539, now seen corresponding path program 1 times [2019-12-19 00:33:10,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:33:10,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806401793] [2019-12-19 00:33:10,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:33:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:33:10,603 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 00:33:10,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806401793] [2019-12-19 00:33:10,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:33:10,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:33:10,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303451519] [2019-12-19 00:33:10,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:33:10,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:33:10,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:33:10,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:33:10,606 INFO L87 Difference]: Start difference. First operand 15852 states and 47028 transitions. Second operand 6 states. [2019-12-19 00:33:11,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:33:11,225 INFO L93 Difference]: Finished difference Result 18163 states and 52356 transitions. [2019-12-19 00:33:11,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 00:33:11,225 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-19 00:33:11,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:33:11,250 INFO L225 Difference]: With dead ends: 18163 [2019-12-19 00:33:11,250 INFO L226 Difference]: Without dead ends: 18163 [2019-12-19 00:33:11,251 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 00:33:11,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18163 states. [2019-12-19 00:33:11,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18163 to 16544. [2019-12-19 00:33:11,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16544 states. [2019-12-19 00:33:11,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16544 states to 16544 states and 48248 transitions. [2019-12-19 00:33:11,471 INFO L78 Accepts]: Start accepts. Automaton has 16544 states and 48248 transitions. Word has length 70 [2019-12-19 00:33:11,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:33:11,472 INFO L462 AbstractCegarLoop]: Abstraction has 16544 states and 48248 transitions. [2019-12-19 00:33:11,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:33:11,472 INFO L276 IsEmpty]: Start isEmpty. Operand 16544 states and 48248 transitions. [2019-12-19 00:33:11,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 00:33:11,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:33:11,482 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:33:11,482 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:33:11,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:33:11,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1478559626, now seen corresponding path program 1 times [2019-12-19 00:33:11,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:33:11,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089531904] [2019-12-19 00:33:11,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:33:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:33:11,553 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 00:33:11,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089531904] [2019-12-19 00:33:11,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:33:11,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:33:11,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142319025] [2019-12-19 00:33:11,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:33:11,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:33:11,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:33:11,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:33:11,555 INFO L87 Difference]: Start difference. First operand 16544 states and 48248 transitions. Second operand 5 states. [2019-12-19 00:33:12,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:33:12,124 INFO L93 Difference]: Finished difference Result 22580 states and 65579 transitions. [2019-12-19 00:33:12,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:33:12,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-12-19 00:33:12,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:33:12,154 INFO L225 Difference]: With dead ends: 22580 [2019-12-19 00:33:12,155 INFO L226 Difference]: Without dead ends: 22580 [2019-12-19 00:33:12,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 00:33:12,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22580 states. [2019-12-19 00:33:12,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22580 to 17714. [2019-12-19 00:33:12,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17714 states. [2019-12-19 00:33:12,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17714 states to 17714 states and 51596 transitions. [2019-12-19 00:33:12,413 INFO L78 Accepts]: Start accepts. Automaton has 17714 states and 51596 transitions. Word has length 70 [2019-12-19 00:33:12,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:33:12,413 INFO L462 AbstractCegarLoop]: Abstraction has 17714 states and 51596 transitions. [2019-12-19 00:33:12,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:33:12,413 INFO L276 IsEmpty]: Start isEmpty. Operand 17714 states and 51596 transitions. [2019-12-19 00:33:12,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 00:33:12,423 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:33:12,423 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 00:33:12,423 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:33:12,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:33:12,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1008953207, now seen corresponding path program 1 times [2019-12-19 00:33:12,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:33:12,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242251572] [2019-12-19 00:33:12,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:33:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:33:12,500 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 00:33:12,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242251572] [2019-12-19 00:33:12,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:33:12,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:33:12,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669036643] [2019-12-19 00:33:12,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:33:12,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:33:12,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:33:12,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:33:12,503 INFO L87 Difference]: Start difference. First operand 17714 states and 51596 transitions. Second operand 4 states. [2019-12-19 00:33:13,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:33:13,151 INFO L93 Difference]: Finished difference Result 24941 states and 73085 transitions. [2019-12-19 00:33:13,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 00:33:13,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-12-19 00:33:13,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:33:13,186 INFO L225 Difference]: With dead ends: 24941 [2019-12-19 00:33:13,187 INFO L226 Difference]: Without dead ends: 24806 [2019-12-19 00:33:13,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:33:13,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24806 states. [2019-12-19 00:33:13,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24806 to 22748. [2019-12-19 00:33:13,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22748 states. [2019-12-19 00:33:13,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22748 states to 22748 states and 66715 transitions. [2019-12-19 00:33:13,736 INFO L78 Accepts]: Start accepts. Automaton has 22748 states and 66715 transitions. Word has length 70 [2019-12-19 00:33:13,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:33:13,736 INFO L462 AbstractCegarLoop]: Abstraction has 22748 states and 66715 transitions. [2019-12-19 00:33:13,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:33:13,736 INFO L276 IsEmpty]: Start isEmpty. Operand 22748 states and 66715 transitions. [2019-12-19 00:33:13,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 00:33:13,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:33:13,748 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 00:33:13,748 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:33:13,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:33:13,749 INFO L82 PathProgramCache]: Analyzing trace with hash -787998152, now seen corresponding path program 1 times [2019-12-19 00:33:13,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:33:13,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861752039] [2019-12-19 00:33:13,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:33:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:33:13,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:33:13,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861752039] [2019-12-19 00:33:13,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:33:13,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 00:33:13,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564226076] [2019-12-19 00:33:13,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 00:33:13,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:33:13,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 00:33:13,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:33:13,873 INFO L87 Difference]: Start difference. First operand 22748 states and 66715 transitions. Second operand 7 states. [2019-12-19 00:33:14,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:33:14,466 INFO L93 Difference]: Finished difference Result 19571 states and 54510 transitions. [2019-12-19 00:33:14,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 00:33:14,466 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-12-19 00:33:14,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:33:14,501 INFO L225 Difference]: With dead ends: 19571 [2019-12-19 00:33:14,501 INFO L226 Difference]: Without dead ends: 19571 [2019-12-19 00:33:14,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-12-19 00:33:14,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19571 states. [2019-12-19 00:33:14,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19571 to 16689. [2019-12-19 00:33:14,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16689 states. [2019-12-19 00:33:14,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16689 states to 16689 states and 46333 transitions. [2019-12-19 00:33:14,837 INFO L78 Accepts]: Start accepts. Automaton has 16689 states and 46333 transitions. Word has length 70 [2019-12-19 00:33:14,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:33:14,837 INFO L462 AbstractCegarLoop]: Abstraction has 16689 states and 46333 transitions. [2019-12-19 00:33:14,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 00:33:14,837 INFO L276 IsEmpty]: Start isEmpty. Operand 16689 states and 46333 transitions. [2019-12-19 00:33:14,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 00:33:14,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:33:14,847 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 00:33:14,848 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:33:14,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:33:14,848 INFO L82 PathProgramCache]: Analyzing trace with hash 99505529, now seen corresponding path program 1 times [2019-12-19 00:33:14,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:33:14,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065721379] [2019-12-19 00:33:14,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:33:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:33:14,951 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 00:33:14,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065721379] [2019-12-19 00:33:14,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:33:14,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:33:14,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036357056] [2019-12-19 00:33:14,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:33:14,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:33:14,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:33:14,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:33:14,956 INFO L87 Difference]: Start difference. First operand 16689 states and 46333 transitions. Second operand 5 states. [2019-12-19 00:33:15,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:33:15,012 INFO L93 Difference]: Finished difference Result 5337 states and 12605 transitions. [2019-12-19 00:33:15,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 00:33:15,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-12-19 00:33:15,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:33:15,019 INFO L225 Difference]: With dead ends: 5337 [2019-12-19 00:33:15,019 INFO L226 Difference]: Without dead ends: 4650 [2019-12-19 00:33:15,019 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 00:33:15,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4650 states. [2019-12-19 00:33:15,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4650 to 4325. [2019-12-19 00:33:15,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4325 states. [2019-12-19 00:33:15,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4325 states to 4325 states and 9952 transitions. [2019-12-19 00:33:15,066 INFO L78 Accepts]: Start accepts. Automaton has 4325 states and 9952 transitions. Word has length 70 [2019-12-19 00:33:15,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:33:15,067 INFO L462 AbstractCegarLoop]: Abstraction has 4325 states and 9952 transitions. [2019-12-19 00:33:15,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:33:15,067 INFO L276 IsEmpty]: Start isEmpty. Operand 4325 states and 9952 transitions. [2019-12-19 00:33:15,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 00:33:15,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:33:15,071 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:33:15,071 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:33:15,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:33:15,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1027808388, now seen corresponding path program 1 times [2019-12-19 00:33:15,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:33:15,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792329241] [2019-12-19 00:33:15,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:33:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:33:15,116 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 00:33:15,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792329241] [2019-12-19 00:33:15,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:33:15,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 00:33:15,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764254274] [2019-12-19 00:33:15,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 00:33:15,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:33:15,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 00:33:15,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:33:15,119 INFO L87 Difference]: Start difference. First operand 4325 states and 9952 transitions. Second operand 3 states. [2019-12-19 00:33:15,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:33:15,150 INFO L93 Difference]: Finished difference Result 5345 states and 12117 transitions. [2019-12-19 00:33:15,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 00:33:15,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-19 00:33:15,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:33:15,157 INFO L225 Difference]: With dead ends: 5345 [2019-12-19 00:33:15,157 INFO L226 Difference]: Without dead ends: 5345 [2019-12-19 00:33:15,158 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 00:33:15,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5345 states. [2019-12-19 00:33:15,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5345 to 4260. [2019-12-19 00:33:15,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4260 states. [2019-12-19 00:33:15,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4260 states to 4260 states and 9560 transitions. [2019-12-19 00:33:15,204 INFO L78 Accepts]: Start accepts. Automaton has 4260 states and 9560 transitions. Word has length 70 [2019-12-19 00:33:15,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:33:15,204 INFO L462 AbstractCegarLoop]: Abstraction has 4260 states and 9560 transitions. [2019-12-19 00:33:15,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 00:33:15,204 INFO L276 IsEmpty]: Start isEmpty. Operand 4260 states and 9560 transitions. [2019-12-19 00:33:15,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-19 00:33:15,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:33:15,208 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] [2019-12-19 00:33:15,208 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:33:15,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:33:15,209 INFO L82 PathProgramCache]: Analyzing trace with hash -812209841, now seen corresponding path program 1 times [2019-12-19 00:33:15,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:33:15,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732808559] [2019-12-19 00:33:15,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:33:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:33:15,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:33:15,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732808559] [2019-12-19 00:33:15,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:33:15,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:33:15,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44976154] [2019-12-19 00:33:15,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:33:15,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:33:15,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:33:15,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:33:15,262 INFO L87 Difference]: Start difference. First operand 4260 states and 9560 transitions. Second operand 5 states. [2019-12-19 00:33:15,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:33:15,469 INFO L93 Difference]: Finished difference Result 5299 states and 11944 transitions. [2019-12-19 00:33:15,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 00:33:15,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-12-19 00:33:15,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:33:15,476 INFO L225 Difference]: With dead ends: 5299 [2019-12-19 00:33:15,476 INFO L226 Difference]: Without dead ends: 5299 [2019-12-19 00:33:15,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-19 00:33:15,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5299 states. [2019-12-19 00:33:15,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5299 to 4888. [2019-12-19 00:33:15,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4888 states. [2019-12-19 00:33:15,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4888 states to 4888 states and 10968 transitions. [2019-12-19 00:33:15,525 INFO L78 Accepts]: Start accepts. Automaton has 4888 states and 10968 transitions. Word has length 76 [2019-12-19 00:33:15,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:33:15,525 INFO L462 AbstractCegarLoop]: Abstraction has 4888 states and 10968 transitions. [2019-12-19 00:33:15,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:33:15,525 INFO L276 IsEmpty]: Start isEmpty. Operand 4888 states and 10968 transitions. [2019-12-19 00:33:15,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-19 00:33:15,530 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:33:15,530 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] [2019-12-19 00:33:15,530 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:33:15,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:33:15,531 INFO L82 PathProgramCache]: Analyzing trace with hash 930600494, now seen corresponding path program 1 times [2019-12-19 00:33:15,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:33:15,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923118963] [2019-12-19 00:33:15,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:33:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:33:15,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:33:15,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923118963] [2019-12-19 00:33:15,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:33:15,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 00:33:15,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281095111] [2019-12-19 00:33:15,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 00:33:15,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:33:15,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 00:33:15,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:33:15,599 INFO L87 Difference]: Start difference. First operand 4888 states and 10968 transitions. Second operand 7 states. [2019-12-19 00:33:16,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:33:16,053 INFO L93 Difference]: Finished difference Result 5520 states and 12289 transitions. [2019-12-19 00:33:16,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 00:33:16,053 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2019-12-19 00:33:16,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:33:16,060 INFO L225 Difference]: With dead ends: 5520 [2019-12-19 00:33:16,060 INFO L226 Difference]: Without dead ends: 5467 [2019-12-19 00:33:16,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-19 00:33:16,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5467 states. [2019-12-19 00:33:16,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5467 to 4912. [2019-12-19 00:33:16,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4912 states. [2019-12-19 00:33:16,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4912 states to 4912 states and 10945 transitions. [2019-12-19 00:33:16,111 INFO L78 Accepts]: Start accepts. Automaton has 4912 states and 10945 transitions. Word has length 76 [2019-12-19 00:33:16,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:33:16,111 INFO L462 AbstractCegarLoop]: Abstraction has 4912 states and 10945 transitions. [2019-12-19 00:33:16,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 00:33:16,111 INFO L276 IsEmpty]: Start isEmpty. Operand 4912 states and 10945 transitions. [2019-12-19 00:33:16,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 00:33:16,116 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:33:16,116 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 00:33:16,116 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:33:16,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:33:16,117 INFO L82 PathProgramCache]: Analyzing trace with hash 513999619, now seen corresponding path program 1 times [2019-12-19 00:33:16,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:33:16,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32760879] [2019-12-19 00:33:16,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:33:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:33:16,181 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 00:33:16,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32760879] [2019-12-19 00:33:16,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:33:16,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:33:16,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137595982] [2019-12-19 00:33:16,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:33:16,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:33:16,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:33:16,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:33:16,184 INFO L87 Difference]: Start difference. First operand 4912 states and 10945 transitions. Second operand 4 states. [2019-12-19 00:33:16,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:33:16,317 INFO L93 Difference]: Finished difference Result 5854 states and 12960 transitions. [2019-12-19 00:33:16,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 00:33:16,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-19 00:33:16,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:33:16,325 INFO L225 Difference]: With dead ends: 5854 [2019-12-19 00:33:16,326 INFO L226 Difference]: Without dead ends: 5854 [2019-12-19 00:33:16,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:33:16,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5854 states. [2019-12-19 00:33:16,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5854 to 5244. [2019-12-19 00:33:16,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5244 states. [2019-12-19 00:33:16,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5244 states to 5244 states and 11647 transitions. [2019-12-19 00:33:16,390 INFO L78 Accepts]: Start accepts. Automaton has 5244 states and 11647 transitions. Word has length 97 [2019-12-19 00:33:16,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:33:16,390 INFO L462 AbstractCegarLoop]: Abstraction has 5244 states and 11647 transitions. [2019-12-19 00:33:16,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:33:16,390 INFO L276 IsEmpty]: Start isEmpty. Operand 5244 states and 11647 transitions. [2019-12-19 00:33:16,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 00:33:16,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:33:16,396 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:33:16,396 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:33:16,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:33:16,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1028011755, now seen corresponding path program 1 times [2019-12-19 00:33:16,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:33:16,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558166094] [2019-12-19 00:33:16,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:33:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:33:16,476 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 00:33:16,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558166094] [2019-12-19 00:33:16,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:33:16,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:33:16,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277772213] [2019-12-19 00:33:16,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:33:16,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:33:16,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:33:16,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:33:16,485 INFO L87 Difference]: Start difference. First operand 5244 states and 11647 transitions. Second operand 6 states. [2019-12-19 00:33:17,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:33:17,237 INFO L93 Difference]: Finished difference Result 7912 states and 17668 transitions. [2019-12-19 00:33:17,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 00:33:17,237 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-12-19 00:33:17,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:33:17,247 INFO L225 Difference]: With dead ends: 7912 [2019-12-19 00:33:17,247 INFO L226 Difference]: Without dead ends: 7912 [2019-12-19 00:33:17,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-19 00:33:17,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7912 states. [2019-12-19 00:33:17,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7912 to 6039. [2019-12-19 00:33:17,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6039 states. [2019-12-19 00:33:17,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6039 states to 6039 states and 13543 transitions. [2019-12-19 00:33:17,318 INFO L78 Accepts]: Start accepts. Automaton has 6039 states and 13543 transitions. Word has length 99 [2019-12-19 00:33:17,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:33:17,318 INFO L462 AbstractCegarLoop]: Abstraction has 6039 states and 13543 transitions. [2019-12-19 00:33:17,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:33:17,318 INFO L276 IsEmpty]: Start isEmpty. Operand 6039 states and 13543 transitions. [2019-12-19 00:33:17,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 00:33:17,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:33:17,325 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:33:17,325 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:33:17,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:33:17,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1016695628, now seen corresponding path program 1 times [2019-12-19 00:33:17,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:33:17,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799847130] [2019-12-19 00:33:17,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:33:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:33:17,411 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 00:33:17,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799847130] [2019-12-19 00:33:17,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:33:17,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 00:33:17,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175883577] [2019-12-19 00:33:17,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 00:33:17,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:33:17,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 00:33:17,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:33:17,414 INFO L87 Difference]: Start difference. First operand 6039 states and 13543 transitions. Second operand 7 states. [2019-12-19 00:33:18,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:33:18,602 INFO L93 Difference]: Finished difference Result 8510 states and 18883 transitions. [2019-12-19 00:33:18,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-19 00:33:18,602 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2019-12-19 00:33:18,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:33:18,613 INFO L225 Difference]: With dead ends: 8510 [2019-12-19 00:33:18,613 INFO L226 Difference]: Without dead ends: 8430 [2019-12-19 00:33:18,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-12-19 00:33:18,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8430 states. [2019-12-19 00:33:18,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8430 to 7002. [2019-12-19 00:33:18,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7002 states. [2019-12-19 00:33:18,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7002 states to 7002 states and 15651 transitions. [2019-12-19 00:33:18,693 INFO L78 Accepts]: Start accepts. Automaton has 7002 states and 15651 transitions. Word has length 99 [2019-12-19 00:33:18,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:33:18,693 INFO L462 AbstractCegarLoop]: Abstraction has 7002 states and 15651 transitions. [2019-12-19 00:33:18,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 00:33:18,693 INFO L276 IsEmpty]: Start isEmpty. Operand 7002 states and 15651 transitions. [2019-12-19 00:33:18,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 00:33:18,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:33:18,702 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:33:18,703 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:33:18,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:33:18,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1201062325, now seen corresponding path program 1 times [2019-12-19 00:33:18,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:33:18,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914603760] [2019-12-19 00:33:18,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:33:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:33:18,830 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 00:33:18,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914603760] [2019-12-19 00:33:18,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:33:18,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:33:18,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704907543] [2019-12-19 00:33:18,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:33:18,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:33:18,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:33:18,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:33:18,832 INFO L87 Difference]: Start difference. First operand 7002 states and 15651 transitions. Second operand 6 states. [2019-12-19 00:33:19,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:33:19,058 INFO L93 Difference]: Finished difference Result 6225 states and 13653 transitions. [2019-12-19 00:33:19,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 00:33:19,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-12-19 00:33:19,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:33:19,065 INFO L225 Difference]: With dead ends: 6225 [2019-12-19 00:33:19,065 INFO L226 Difference]: Without dead ends: 6189 [2019-12-19 00:33:19,065 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 00:33:19,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6189 states. [2019-12-19 00:33:19,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6189 to 5424. [2019-12-19 00:33:19,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5424 states. [2019-12-19 00:33:19,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5424 states to 5424 states and 11934 transitions. [2019-12-19 00:33:19,121 INFO L78 Accepts]: Start accepts. Automaton has 5424 states and 11934 transitions. Word has length 99 [2019-12-19 00:33:19,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:33:19,122 INFO L462 AbstractCegarLoop]: Abstraction has 5424 states and 11934 transitions. [2019-12-19 00:33:19,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:33:19,122 INFO L276 IsEmpty]: Start isEmpty. Operand 5424 states and 11934 transitions. [2019-12-19 00:33:19,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 00:33:19,129 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:33:19,129 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:33:19,129 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:33:19,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:33:19,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1192417937, now seen corresponding path program 1 times [2019-12-19 00:33:19,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:33:19,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024992201] [2019-12-19 00:33:19,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:33:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:33:19,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:33:19,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024992201] [2019-12-19 00:33:19,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:33:19,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:33:19,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917028137] [2019-12-19 00:33:19,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:33:19,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:33:19,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:33:19,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:33:19,204 INFO L87 Difference]: Start difference. First operand 5424 states and 11934 transitions. Second operand 5 states. [2019-12-19 00:33:19,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:33:19,328 INFO L93 Difference]: Finished difference Result 5914 states and 12996 transitions. [2019-12-19 00:33:19,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 00:33:19,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-12-19 00:33:19,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:33:19,336 INFO L225 Difference]: With dead ends: 5914 [2019-12-19 00:33:19,336 INFO L226 Difference]: Without dead ends: 5914 [2019-12-19 00:33:19,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:33:19,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5914 states. [2019-12-19 00:33:19,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5914 to 4663. [2019-12-19 00:33:19,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4663 states. [2019-12-19 00:33:19,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4663 states to 4663 states and 10258 transitions. [2019-12-19 00:33:19,392 INFO L78 Accepts]: Start accepts. Automaton has 4663 states and 10258 transitions. Word has length 99 [2019-12-19 00:33:19,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:33:19,392 INFO L462 AbstractCegarLoop]: Abstraction has 4663 states and 10258 transitions. [2019-12-19 00:33:19,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:33:19,392 INFO L276 IsEmpty]: Start isEmpty. Operand 4663 states and 10258 transitions. [2019-12-19 00:33:19,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 00:33:19,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:33:19,396 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:33:19,397 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:33:19,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:33:19,397 INFO L82 PathProgramCache]: Analyzing trace with hash -2077057360, now seen corresponding path program 1 times [2019-12-19 00:33:19,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:33:19,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015447672] [2019-12-19 00:33:19,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:33:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:33:19,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:33:19,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015447672] [2019-12-19 00:33:19,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:33:19,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:33:19,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033373368] [2019-12-19 00:33:19,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:33:19,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:33:19,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:33:19,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:33:19,486 INFO L87 Difference]: Start difference. First operand 4663 states and 10258 transitions. Second operand 5 states. [2019-12-19 00:33:19,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:33:19,883 INFO L93 Difference]: Finished difference Result 5588 states and 12229 transitions. [2019-12-19 00:33:19,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 00:33:19,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-12-19 00:33:19,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:33:19,890 INFO L225 Difference]: With dead ends: 5588 [2019-12-19 00:33:19,891 INFO L226 Difference]: Without dead ends: 5528 [2019-12-19 00:33:19,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 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 00:33:19,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5528 states. [2019-12-19 00:33:19,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5528 to 5222. [2019-12-19 00:33:19,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5222 states. [2019-12-19 00:33:19,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5222 states to 5222 states and 11466 transitions. [2019-12-19 00:33:19,943 INFO L78 Accepts]: Start accepts. Automaton has 5222 states and 11466 transitions. Word has length 99 [2019-12-19 00:33:19,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:33:19,943 INFO L462 AbstractCegarLoop]: Abstraction has 5222 states and 11466 transitions. [2019-12-19 00:33:19,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:33:19,944 INFO L276 IsEmpty]: Start isEmpty. Operand 5222 states and 11466 transitions. [2019-12-19 00:33:19,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 00:33:19,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:33:19,948 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:33:19,949 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:33:19,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:33:19,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1963173391, now seen corresponding path program 1 times [2019-12-19 00:33:19,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:33:19,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601605904] [2019-12-19 00:33:19,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:33:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:33:20,017 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 00:33:20,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601605904] [2019-12-19 00:33:20,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:33:20,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:33:20,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392353661] [2019-12-19 00:33:20,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:33:20,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:33:20,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:33:20,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:33:20,019 INFO L87 Difference]: Start difference. First operand 5222 states and 11466 transitions. Second operand 5 states. [2019-12-19 00:33:20,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:33:20,265 INFO L93 Difference]: Finished difference Result 6154 states and 13387 transitions. [2019-12-19 00:33:20,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:33:20,265 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-12-19 00:33:20,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:33:20,272 INFO L225 Difference]: With dead ends: 6154 [2019-12-19 00:33:20,273 INFO L226 Difference]: Without dead ends: 6096 [2019-12-19 00:33:20,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 00:33:20,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6096 states. [2019-12-19 00:33:20,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6096 to 4963. [2019-12-19 00:33:20,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4963 states. [2019-12-19 00:33:20,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4963 states to 4963 states and 10944 transitions. [2019-12-19 00:33:20,327 INFO L78 Accepts]: Start accepts. Automaton has 4963 states and 10944 transitions. Word has length 99 [2019-12-19 00:33:20,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:33:20,327 INFO L462 AbstractCegarLoop]: Abstraction has 4963 states and 10944 transitions. [2019-12-19 00:33:20,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:33:20,327 INFO L276 IsEmpty]: Start isEmpty. Operand 4963 states and 10944 transitions. [2019-12-19 00:33:20,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 00:33:20,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:33:20,332 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:33:20,332 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:33:20,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:33:20,332 INFO L82 PathProgramCache]: Analyzing trace with hash 579065745, now seen corresponding path program 2 times [2019-12-19 00:33:20,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:33:20,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412047326] [2019-12-19 00:33:20,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:33:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:33:20,450 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 00:33:20,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412047326] [2019-12-19 00:33:20,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:33:20,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:33:20,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638141444] [2019-12-19 00:33:20,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:33:20,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:33:20,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:33:20,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:33:20,452 INFO L87 Difference]: Start difference. First operand 4963 states and 10944 transitions. Second operand 6 states. [2019-12-19 00:33:20,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:33:20,651 INFO L93 Difference]: Finished difference Result 5219 states and 11466 transitions. [2019-12-19 00:33:20,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:33:20,652 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-12-19 00:33:20,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:33:20,657 INFO L225 Difference]: With dead ends: 5219 [2019-12-19 00:33:20,657 INFO L226 Difference]: Without dead ends: 5219 [2019-12-19 00:33:20,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 00:33:20,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5219 states. [2019-12-19 00:33:20,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5219 to 4905. [2019-12-19 00:33:20,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4905 states. [2019-12-19 00:33:20,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4905 states to 4905 states and 10818 transitions. [2019-12-19 00:33:20,710 INFO L78 Accepts]: Start accepts. Automaton has 4905 states and 10818 transitions. Word has length 99 [2019-12-19 00:33:20,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:33:20,711 INFO L462 AbstractCegarLoop]: Abstraction has 4905 states and 10818 transitions. [2019-12-19 00:33:20,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:33:20,711 INFO L276 IsEmpty]: Start isEmpty. Operand 4905 states and 10818 transitions. [2019-12-19 00:33:20,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 00:33:20,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:33:20,715 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:33:20,715 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:33:20,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:33:20,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1461100972, now seen corresponding path program 1 times [2019-12-19 00:33:20,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:33:20,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061635013] [2019-12-19 00:33:20,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:33:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:33:20,862 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 00:33:20,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061635013] [2019-12-19 00:33:20,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:33:20,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 00:33:20,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373002793] [2019-12-19 00:33:20,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 00:33:20,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:33:20,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 00:33:20,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-19 00:33:20,865 INFO L87 Difference]: Start difference. First operand 4905 states and 10818 transitions. Second operand 8 states. [2019-12-19 00:33:21,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:33:21,453 INFO L93 Difference]: Finished difference Result 5693 states and 12426 transitions. [2019-12-19 00:33:21,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-19 00:33:21,453 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2019-12-19 00:33:21,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:33:21,460 INFO L225 Difference]: With dead ends: 5693 [2019-12-19 00:33:21,461 INFO L226 Difference]: Without dead ends: 5693 [2019-12-19 00:33:21,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-12-19 00:33:21,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5693 states. [2019-12-19 00:33:21,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5693 to 5213. [2019-12-19 00:33:21,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5213 states. [2019-12-19 00:33:21,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5213 states to 5213 states and 11437 transitions. [2019-12-19 00:33:21,568 INFO L78 Accepts]: Start accepts. Automaton has 5213 states and 11437 transitions. Word has length 99 [2019-12-19 00:33:21,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:33:21,568 INFO L462 AbstractCegarLoop]: Abstraction has 5213 states and 11437 transitions. [2019-12-19 00:33:21,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 00:33:21,568 INFO L276 IsEmpty]: Start isEmpty. Operand 5213 states and 11437 transitions. [2019-12-19 00:33:21,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 00:33:21,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:33:21,576 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:33:21,576 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:33:21,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:33:21,577 INFO L82 PathProgramCache]: Analyzing trace with hash -573597291, now seen corresponding path program 1 times [2019-12-19 00:33:21,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:33:21,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632186934] [2019-12-19 00:33:21,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:33:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:33:21,721 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 00:33:21,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632186934] [2019-12-19 00:33:21,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:33:21,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 00:33:21,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913453147] [2019-12-19 00:33:21,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 00:33:21,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:33:21,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 00:33:21,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:33:21,723 INFO L87 Difference]: Start difference. First operand 5213 states and 11437 transitions. Second operand 7 states. [2019-12-19 00:33:21,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:33:21,823 INFO L93 Difference]: Finished difference Result 8304 states and 18320 transitions. [2019-12-19 00:33:21,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 00:33:21,823 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2019-12-19 00:33:21,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:33:21,828 INFO L225 Difference]: With dead ends: 8304 [2019-12-19 00:33:21,828 INFO L226 Difference]: Without dead ends: 3273 [2019-12-19 00:33:21,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-19 00:33:21,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3273 states. [2019-12-19 00:33:21,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3273 to 3273. [2019-12-19 00:33:21,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3273 states. [2019-12-19 00:33:21,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3273 states to 3273 states and 7226 transitions. [2019-12-19 00:33:21,872 INFO L78 Accepts]: Start accepts. Automaton has 3273 states and 7226 transitions. Word has length 99 [2019-12-19 00:33:21,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:33:21,872 INFO L462 AbstractCegarLoop]: Abstraction has 3273 states and 7226 transitions. [2019-12-19 00:33:21,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 00:33:21,872 INFO L276 IsEmpty]: Start isEmpty. Operand 3273 states and 7226 transitions. [2019-12-19 00:33:21,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 00:33:21,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:33:21,877 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:33:21,878 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:33:21,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:33:21,878 INFO L82 PathProgramCache]: Analyzing trace with hash 790630937, now seen corresponding path program 2 times [2019-12-19 00:33:21,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:33:21,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21132354] [2019-12-19 00:33:21,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:33:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 00:33:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 00:33:22,009 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 00:33:22,009 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 00:33:22,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 12:33:22 BasicIcfg [2019-12-19 00:33:22,241 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 00:33:22,244 INFO L168 Benchmark]: Toolchain (without parser) took 46319.26 ms. Allocated memory was 144.7 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 100.7 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 802.1 MB. Max. memory is 7.1 GB. [2019-12-19 00:33:22,245 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-19 00:33:22,245 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.01 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.3 MB in the beginning and 157.3 MB in the end (delta: -57.0 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. [2019-12-19 00:33:22,246 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.14 ms. Allocated memory is still 202.4 MB. Free memory was 157.3 MB in the beginning and 155.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-19 00:33:22,246 INFO L168 Benchmark]: Boogie Preprocessor took 39.34 ms. Allocated memory is still 202.4 MB. Free memory was 155.3 MB in the beginning and 152.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 00:33:22,247 INFO L168 Benchmark]: RCFGBuilder took 874.03 ms. Allocated memory is still 202.4 MB. Free memory was 152.6 MB in the beginning and 107.8 MB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. [2019-12-19 00:33:22,251 INFO L168 Benchmark]: TraceAbstraction took 44523.28 ms. Allocated memory was 202.4 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 107.8 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 751.4 MB. Max. memory is 7.1 GB. [2019-12-19 00:33:22,253 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 809.01 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.3 MB in the beginning and 157.3 MB in the end (delta: -57.0 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.14 ms. Allocated memory is still 202.4 MB. Free memory was 157.3 MB in the beginning and 155.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.34 ms. Allocated memory is still 202.4 MB. Free memory was 155.3 MB in the beginning and 152.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 874.03 ms. Allocated memory is still 202.4 MB. Free memory was 152.6 MB in the beginning and 107.8 MB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 44523.28 ms. Allocated memory was 202.4 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 107.8 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 751.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L700] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L702] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L703] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L704] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L706] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L708] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L710] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L711] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L712] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L713] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L714] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L715] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L716] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L717] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L718] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L719] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L720] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L721] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L722] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L723] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L724] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L725] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L726] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 0 pthread_t t249; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] FCALL, FORK 0 pthread_create(&t249, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L730] 1 z$w_buff1 = z$w_buff0 [L731] 1 z$w_buff0 = 1 [L732] 1 z$w_buff1_used = z$w_buff0_used [L733] 1 z$w_buff0_used = (_Bool)1 [L810] 0 pthread_t t250; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] FCALL, FORK 0 pthread_create(&t250, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L735] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L736] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L737] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 [L744] 1 __unbuffered_p0_EAX = x [L747] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 [L767] 2 __unbuffered_p1_EAX = y [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 z$flush_delayed = weak$$choice2 [L773] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L775] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L776] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L777] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L780] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L751] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L753] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L754] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 2 z = z$flush_delayed ? z$mem_tmp : z [L783] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L786] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L786] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L787] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L788] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L789] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L790] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L790] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L818] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L821] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L824] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 144 locations, 2 error locations. Result: UNSAFE, OverallTime: 44.0s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 19.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8827 SDtfs, 10398 SDslu, 17444 SDs, 0 SdLazy, 7345 SolverSat, 522 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 294 GetRequests, 81 SyntacticMatches, 18 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71015occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 19.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 65914 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2405 NumberOfCodeBlocks, 2405 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2275 ConstructedInterpolants, 0 QuantifiedInterpolants, 431655 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...