/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix012_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 00:37:38,742 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 00:37:38,745 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 00:37:38,762 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 00:37:38,762 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 00:37:38,764 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 00:37:38,766 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 00:37:38,775 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 00:37:38,778 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 00:37:38,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 00:37:38,784 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 00:37:38,785 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 00:37:38,786 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 00:37:38,787 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 00:37:38,790 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 00:37:38,791 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 00:37:38,793 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 00:37:38,793 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 00:37:38,794 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 00:37:38,799 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 00:37:38,804 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 00:37:38,807 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 00:37:38,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 00:37:38,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 00:37:38,812 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 00:37:38,812 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 00:37:38,812 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 00:37:38,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 00:37:38,815 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 00:37:38,816 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 00:37:38,816 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 00:37:38,817 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 00:37:38,818 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 00:37:38,819 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 00:37:38,820 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 00:37:38,820 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 00:37:38,821 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 00:37:38,822 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 00:37:38,822 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 00:37:38,823 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 00:37:38,824 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 00:37:38,825 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-MCR.epf [2019-12-28 00:37:38,854 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 00:37:38,855 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 00:37:38,856 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 00:37:38,856 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 00:37:38,856 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 00:37:38,856 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 00:37:38,860 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 00:37:38,860 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 00:37:38,860 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 00:37:38,860 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 00:37:38,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 00:37:38,861 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 00:37:38,861 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 00:37:38,861 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 00:37:38,861 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 00:37:38,862 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 00:37:38,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 00:37:38,862 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 00:37:38,862 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 00:37:38,862 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 00:37:38,865 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 00:37:38,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 00:37:38,865 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 00:37:38,865 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 00:37:38,866 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 00:37:38,866 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 00:37:38,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 00:37:38,866 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 00:37:38,866 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 00:37:38,867 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 00:37:38,867 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 00:37:38,867 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 00:37:39,137 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 00:37:39,150 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 00:37:39,153 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 00:37:39,155 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 00:37:39,155 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 00:37:39,156 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_tso.opt.i [2019-12-28 00:37:39,215 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d96b6055/10a5c655531b4c1180cc01de64f98500/FLAGb6e98424f [2019-12-28 00:37:39,717 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 00:37:39,718 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_tso.opt.i [2019-12-28 00:37:39,737 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d96b6055/10a5c655531b4c1180cc01de64f98500/FLAGb6e98424f [2019-12-28 00:37:40,035 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d96b6055/10a5c655531b4c1180cc01de64f98500 [2019-12-28 00:37:40,043 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 00:37:40,045 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 00:37:40,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 00:37:40,046 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 00:37:40,050 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 00:37:40,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 12:37:40" (1/1) ... [2019-12-28 00:37:40,054 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85f7a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:37:40, skipping insertion in model container [2019-12-28 00:37:40,054 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 12:37:40" (1/1) ... [2019-12-28 00:37:40,061 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 00:37:40,141 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 00:37:40,721 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 00:37:40,738 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 00:37:40,814 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 00:37:40,893 INFO L208 MainTranslator]: Completed translation [2019-12-28 00:37:40,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:37:40 WrapperNode [2019-12-28 00:37:40,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 00:37:40,894 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 00:37:40,895 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 00:37:40,895 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 00:37:40,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:37:40" (1/1) ... [2019-12-28 00:37:40,928 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:37:40" (1/1) ... [2019-12-28 00:37:40,964 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 00:37:40,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 00:37:40,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 00:37:40,965 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 00:37:40,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:37:40" (1/1) ... [2019-12-28 00:37:40,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:37:40" (1/1) ... [2019-12-28 00:37:40,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:37:40" (1/1) ... [2019-12-28 00:37:40,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:37:40" (1/1) ... [2019-12-28 00:37:40,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:37:40" (1/1) ... [2019-12-28 00:37:41,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:37:40" (1/1) ... [2019-12-28 00:37:41,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:37:40" (1/1) ... [2019-12-28 00:37:41,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 00:37:41,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 00:37:41,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 00:37:41,024 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 00:37:41,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:37:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 00:37:41,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 00:37:41,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 00:37:41,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 00:37:41,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 00:37:41,096 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 00:37:41,097 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 00:37:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 00:37:41,097 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 00:37:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 00:37:41,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 00:37:41,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 00:37:41,099 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-28 00:37:41,988 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 00:37:41,988 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 00:37:41,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 12:37:41 BoogieIcfgContainer [2019-12-28 00:37:41,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 00:37:41,991 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 00:37:41,991 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 00:37:41,994 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 00:37:41,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 12:37:40" (1/3) ... [2019-12-28 00:37:41,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f1a4ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 12:37:41, skipping insertion in model container [2019-12-28 00:37:41,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:37:40" (2/3) ... [2019-12-28 00:37:41,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f1a4ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 12:37:41, skipping insertion in model container [2019-12-28 00:37:41,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 12:37:41" (3/3) ... [2019-12-28 00:37:41,997 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_tso.opt.i [2019-12-28 00:37:42,006 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 00:37:42,006 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 00:37:42,013 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 00:37:42,014 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 00:37:42,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,056 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,057 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,082 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,082 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,083 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,083 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,083 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,118 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,120 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,129 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,130 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,133 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:42,150 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 00:37:42,172 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 00:37:42,172 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 00:37:42,172 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 00:37:42,172 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 00:37:42,173 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 00:37:42,173 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 00:37:42,173 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 00:37:42,173 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 00:37:42,188 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 178 places, 227 transitions [2019-12-28 00:37:50,666 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80072 states. [2019-12-28 00:37:50,668 INFO L276 IsEmpty]: Start isEmpty. Operand 80072 states. [2019-12-28 00:37:50,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-28 00:37:50,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:37:50,679 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:37:50,679 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:37:50,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:37:50,686 INFO L82 PathProgramCache]: Analyzing trace with hash 394985933, now seen corresponding path program 1 times [2019-12-28 00:37:50,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:37:50,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650444663] [2019-12-28 00:37:50,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:37:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:37:51,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:37:51,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650444663] [2019-12-28 00:37:51,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:37:51,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 00:37:51,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [837749451] [2019-12-28 00:37:51,056 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:37:51,072 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:37:51,122 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 39 transitions. [2019-12-28 00:37:51,123 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:37:51,141 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:37:51,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 00:37:51,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:37:51,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 00:37:51,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:37:51,184 INFO L87 Difference]: Start difference. First operand 80072 states. Second operand 4 states. [2019-12-28 00:37:53,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:37:53,462 INFO L93 Difference]: Finished difference Result 80712 states and 324637 transitions. [2019-12-28 00:37:53,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 00:37:53,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-28 00:37:53,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:37:53,906 INFO L225 Difference]: With dead ends: 80712 [2019-12-28 00:37:53,906 INFO L226 Difference]: Without dead ends: 59000 [2019-12-28 00:37:53,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:37:56,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59000 states. [2019-12-28 00:37:58,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59000 to 59000. [2019-12-28 00:37:58,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59000 states. [2019-12-28 00:37:58,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59000 states to 59000 states and 240125 transitions. [2019-12-28 00:37:58,489 INFO L78 Accepts]: Start accepts. Automaton has 59000 states and 240125 transitions. Word has length 39 [2019-12-28 00:37:58,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:37:58,489 INFO L462 AbstractCegarLoop]: Abstraction has 59000 states and 240125 transitions. [2019-12-28 00:37:58,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 00:37:58,489 INFO L276 IsEmpty]: Start isEmpty. Operand 59000 states and 240125 transitions. [2019-12-28 00:37:58,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-28 00:37:58,499 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:37:58,499 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:37:58,500 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:37:58,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:37:58,500 INFO L82 PathProgramCache]: Analyzing trace with hash 475443292, now seen corresponding path program 1 times [2019-12-28 00:37:58,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:37:58,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936632246] [2019-12-28 00:37:58,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:37:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:37:58,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:37:58,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936632246] [2019-12-28 00:37:58,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:37:58,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:37:58,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1170639969] [2019-12-28 00:37:58,624 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:37:58,629 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:37:58,639 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 47 transitions. [2019-12-28 00:37:58,639 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:37:58,639 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:37:58,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 00:37:58,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:37:58,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 00:37:58,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:37:58,642 INFO L87 Difference]: Start difference. First operand 59000 states and 240125 transitions. Second operand 5 states. [2019-12-28 00:38:01,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:38:01,881 INFO L93 Difference]: Finished difference Result 95594 states and 363716 transitions. [2019-12-28 00:38:01,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 00:38:01,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-28 00:38:01,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:38:02,395 INFO L225 Difference]: With dead ends: 95594 [2019-12-28 00:38:02,395 INFO L226 Difference]: Without dead ends: 95042 [2019-12-28 00:38:02,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:38:03,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95042 states. [2019-12-28 00:38:05,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95042 to 93164. [2019-12-28 00:38:05,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93164 states. [2019-12-28 00:38:10,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93164 states to 93164 states and 356302 transitions. [2019-12-28 00:38:10,151 INFO L78 Accepts]: Start accepts. Automaton has 93164 states and 356302 transitions. Word has length 47 [2019-12-28 00:38:10,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:38:10,153 INFO L462 AbstractCegarLoop]: Abstraction has 93164 states and 356302 transitions. [2019-12-28 00:38:10,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 00:38:10,153 INFO L276 IsEmpty]: Start isEmpty. Operand 93164 states and 356302 transitions. [2019-12-28 00:38:10,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-28 00:38:10,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:38:10,158 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:38:10,159 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:38:10,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:38:10,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1936431124, now seen corresponding path program 1 times [2019-12-28 00:38:10,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:38:10,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331843811] [2019-12-28 00:38:10,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:38:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:38:10,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:38:10,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331843811] [2019-12-28 00:38:10,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:38:10,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:38:10,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1260608295] [2019-12-28 00:38:10,286 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:38:10,293 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:38:10,302 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 85 states and 120 transitions. [2019-12-28 00:38:10,302 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:38:10,385 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 00:38:10,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 00:38:10,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:38:10,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 00:38:10,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:38:10,386 INFO L87 Difference]: Start difference. First operand 93164 states and 356302 transitions. Second operand 6 states. [2019-12-28 00:38:11,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:38:11,538 INFO L93 Difference]: Finished difference Result 118508 states and 442883 transitions. [2019-12-28 00:38:11,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 00:38:11,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-12-28 00:38:11,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:38:12,018 INFO L225 Difference]: With dead ends: 118508 [2019-12-28 00:38:12,018 INFO L226 Difference]: Without dead ends: 118060 [2019-12-28 00:38:12,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-28 00:38:14,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118060 states. [2019-12-28 00:38:16,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118060 to 104153. [2019-12-28 00:38:16,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104153 states. [2019-12-28 00:38:22,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104153 states to 104153 states and 394236 transitions. [2019-12-28 00:38:22,044 INFO L78 Accepts]: Start accepts. Automaton has 104153 states and 394236 transitions. Word has length 48 [2019-12-28 00:38:22,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:38:22,044 INFO L462 AbstractCegarLoop]: Abstraction has 104153 states and 394236 transitions. [2019-12-28 00:38:22,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 00:38:22,044 INFO L276 IsEmpty]: Start isEmpty. Operand 104153 states and 394236 transitions. [2019-12-28 00:38:22,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-28 00:38:22,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:38:22,057 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:38:22,057 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:38:22,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:38:22,057 INFO L82 PathProgramCache]: Analyzing trace with hash 2073003706, now seen corresponding path program 1 times [2019-12-28 00:38:22,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:38:22,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809072130] [2019-12-28 00:38:22,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:38:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:38:22,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:38:22,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809072130] [2019-12-28 00:38:22,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:38:22,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 00:38:22,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [60955793] [2019-12-28 00:38:22,124 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:38:22,130 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:38:22,141 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 138 transitions. [2019-12-28 00:38:22,141 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:38:22,185 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 00:38:22,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 00:38:22,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:38:22,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 00:38:22,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:38:22,186 INFO L87 Difference]: Start difference. First operand 104153 states and 394236 transitions. Second operand 5 states. [2019-12-28 00:38:23,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:38:23,667 INFO L93 Difference]: Finished difference Result 170911 states and 627058 transitions. [2019-12-28 00:38:23,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 00:38:23,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-12-28 00:38:23,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:38:24,110 INFO L225 Difference]: With dead ends: 170911 [2019-12-28 00:38:24,110 INFO L226 Difference]: Without dead ends: 170911 [2019-12-28 00:38:24,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:38:26,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170911 states. [2019-12-28 00:38:29,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170911 to 157189. [2019-12-28 00:38:29,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157189 states. [2019-12-28 00:38:30,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157189 states to 157189 states and 581290 transitions. [2019-12-28 00:38:30,934 INFO L78 Accepts]: Start accepts. Automaton has 157189 states and 581290 transitions. Word has length 50 [2019-12-28 00:38:30,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:38:30,934 INFO L462 AbstractCegarLoop]: Abstraction has 157189 states and 581290 transitions. [2019-12-28 00:38:30,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 00:38:30,935 INFO L276 IsEmpty]: Start isEmpty. Operand 157189 states and 581290 transitions. [2019-12-28 00:38:30,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 00:38:30,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:38:30,961 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:38:30,961 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:38:30,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:38:30,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1953618154, now seen corresponding path program 1 times [2019-12-28 00:38:30,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:38:30,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952077026] [2019-12-28 00:38:30,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:38:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:38:31,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:38:31,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952077026] [2019-12-28 00:38:31,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:38:31,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:38:31,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1073372167] [2019-12-28 00:38:31,101 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:38:31,107 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:38:31,113 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 58 transitions. [2019-12-28 00:38:31,113 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:38:31,136 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 00:38:31,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 00:38:31,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:38:31,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 00:38:31,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:38:31,137 INFO L87 Difference]: Start difference. First operand 157189 states and 581290 transitions. Second operand 8 states. [2019-12-28 00:38:38,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:38:38,496 INFO L93 Difference]: Finished difference Result 206906 states and 761911 transitions. [2019-12-28 00:38:38,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 00:38:38,497 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-28 00:38:38,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:38:39,061 INFO L225 Difference]: With dead ends: 206906 [2019-12-28 00:38:39,061 INFO L226 Difference]: Without dead ends: 206906 [2019-12-28 00:38:39,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-28 00:38:41,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206906 states. [2019-12-28 00:38:44,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206906 to 192884. [2019-12-28 00:38:44,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192884 states. [2019-12-28 00:38:45,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192884 states to 192884 states and 710317 transitions. [2019-12-28 00:38:45,185 INFO L78 Accepts]: Start accepts. Automaton has 192884 states and 710317 transitions. Word has length 54 [2019-12-28 00:38:45,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:38:45,186 INFO L462 AbstractCegarLoop]: Abstraction has 192884 states and 710317 transitions. [2019-12-28 00:38:45,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 00:38:45,186 INFO L276 IsEmpty]: Start isEmpty. Operand 192884 states and 710317 transitions. [2019-12-28 00:38:45,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 00:38:45,210 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:38:45,210 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:38:45,210 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:38:45,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:38:45,211 INFO L82 PathProgramCache]: Analyzing trace with hash 544397783, now seen corresponding path program 1 times [2019-12-28 00:38:45,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:38:45,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089624222] [2019-12-28 00:38:45,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:38:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:38:45,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:38:45,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089624222] [2019-12-28 00:38:45,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:38:45,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 00:38:45,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1194480943] [2019-12-28 00:38:45,365 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:38:45,372 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:38:45,378 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 58 transitions. [2019-12-28 00:38:45,379 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:38:45,403 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 00:38:45,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 00:38:45,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:38:45,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 00:38:45,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-28 00:38:45,404 INFO L87 Difference]: Start difference. First operand 192884 states and 710317 transitions. Second operand 9 states. [2019-12-28 00:38:52,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:38:52,702 INFO L93 Difference]: Finished difference Result 274751 states and 978647 transitions. [2019-12-28 00:38:52,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 00:38:52,703 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-28 00:38:52,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:38:53,394 INFO L225 Difference]: With dead ends: 274751 [2019-12-28 00:38:53,395 INFO L226 Difference]: Without dead ends: 274751 [2019-12-28 00:38:53,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-12-28 00:38:56,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274751 states. [2019-12-28 00:39:04,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274751 to 220590. [2019-12-28 00:39:04,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220590 states. [2019-12-28 00:39:05,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220590 states to 220590 states and 800215 transitions. [2019-12-28 00:39:05,020 INFO L78 Accepts]: Start accepts. Automaton has 220590 states and 800215 transitions. Word has length 54 [2019-12-28 00:39:05,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:39:05,021 INFO L462 AbstractCegarLoop]: Abstraction has 220590 states and 800215 transitions. [2019-12-28 00:39:05,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 00:39:05,021 INFO L276 IsEmpty]: Start isEmpty. Operand 220590 states and 800215 transitions. [2019-12-28 00:39:05,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 00:39:05,044 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:39:05,044 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:39:05,045 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:39:05,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:39:05,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1431901464, now seen corresponding path program 1 times [2019-12-28 00:39:05,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:39:05,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387709587] [2019-12-28 00:39:05,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:39:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:39:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:39:05,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387709587] [2019-12-28 00:39:05,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:39:05,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 00:39:05,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [858421532] [2019-12-28 00:39:05,147 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:39:05,154 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:39:05,161 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 58 transitions. [2019-12-28 00:39:05,161 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:39:05,162 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:39:05,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 00:39:05,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:39:05,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 00:39:05,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:39:05,163 INFO L87 Difference]: Start difference. First operand 220590 states and 800215 transitions. Second operand 4 states. [2019-12-28 00:39:05,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:39:05,332 INFO L93 Difference]: Finished difference Result 31777 states and 99086 transitions. [2019-12-28 00:39:05,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 00:39:05,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-28 00:39:05,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:39:05,373 INFO L225 Difference]: With dead ends: 31777 [2019-12-28 00:39:05,374 INFO L226 Difference]: Without dead ends: 25622 [2019-12-28 00:39:05,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:39:05,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25622 states. [2019-12-28 00:39:06,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25622 to 25381. [2019-12-28 00:39:06,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25381 states. [2019-12-28 00:39:06,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25381 states to 25381 states and 77035 transitions. [2019-12-28 00:39:06,956 INFO L78 Accepts]: Start accepts. Automaton has 25381 states and 77035 transitions. Word has length 54 [2019-12-28 00:39:06,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:39:06,956 INFO L462 AbstractCegarLoop]: Abstraction has 25381 states and 77035 transitions. [2019-12-28 00:39:06,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 00:39:06,957 INFO L276 IsEmpty]: Start isEmpty. Operand 25381 states and 77035 transitions. [2019-12-28 00:39:06,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 00:39:06,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:39:06,959 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:39:06,959 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:39:06,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:39:06,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1430831109, now seen corresponding path program 1 times [2019-12-28 00:39:06,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:39:06,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973140361] [2019-12-28 00:39:06,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:39:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:39:07,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:39:07,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973140361] [2019-12-28 00:39:07,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:39:07,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:39:07,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2080353396] [2019-12-28 00:39:07,064 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:39:07,071 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:39:07,089 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 115 states and 174 transitions. [2019-12-28 00:39:07,089 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:39:07,154 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 00:39:07,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 00:39:07,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:39:07,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 00:39:07,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:39:07,156 INFO L87 Difference]: Start difference. First operand 25381 states and 77035 transitions. Second operand 8 states. [2019-12-28 00:39:08,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:39:08,067 INFO L93 Difference]: Finished difference Result 30941 states and 92396 transitions. [2019-12-28 00:39:08,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 00:39:08,068 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-28 00:39:08,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:39:08,120 INFO L225 Difference]: With dead ends: 30941 [2019-12-28 00:39:08,120 INFO L226 Difference]: Without dead ends: 30854 [2019-12-28 00:39:08,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-12-28 00:39:08,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30854 states. [2019-12-28 00:39:08,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30854 to 25121. [2019-12-28 00:39:08,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25121 states. [2019-12-28 00:39:08,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25121 states to 25121 states and 76285 transitions. [2019-12-28 00:39:08,494 INFO L78 Accepts]: Start accepts. Automaton has 25121 states and 76285 transitions. Word has length 54 [2019-12-28 00:39:08,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:39:08,495 INFO L462 AbstractCegarLoop]: Abstraction has 25121 states and 76285 transitions. [2019-12-28 00:39:08,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 00:39:08,495 INFO L276 IsEmpty]: Start isEmpty. Operand 25121 states and 76285 transitions. [2019-12-28 00:39:08,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-28 00:39:08,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:39:08,502 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:39:08,502 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:39:08,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:39:08,502 INFO L82 PathProgramCache]: Analyzing trace with hash -628068145, now seen corresponding path program 1 times [2019-12-28 00:39:08,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:39:08,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289420580] [2019-12-28 00:39:08,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:39:08,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:39:08,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:39:08,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289420580] [2019-12-28 00:39:08,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:39:08,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:39:08,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1234286106] [2019-12-28 00:39:08,585 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:39:08,596 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:39:08,623 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 200 transitions. [2019-12-28 00:39:08,623 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:39:08,640 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 00:39:08,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 00:39:08,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:39:08,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 00:39:08,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 00:39:08,641 INFO L87 Difference]: Start difference. First operand 25121 states and 76285 transitions. Second operand 7 states. [2019-12-28 00:39:09,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:39:09,603 INFO L93 Difference]: Finished difference Result 35180 states and 104444 transitions. [2019-12-28 00:39:09,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-28 00:39:09,604 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-28 00:39:09,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:39:10,791 INFO L225 Difference]: With dead ends: 35180 [2019-12-28 00:39:10,792 INFO L226 Difference]: Without dead ends: 35132 [2019-12-28 00:39:10,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-28 00:39:10,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35132 states. [2019-12-28 00:39:11,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35132 to 29150. [2019-12-28 00:39:11,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29150 states. [2019-12-28 00:39:11,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29150 states to 29150 states and 87260 transitions. [2019-12-28 00:39:11,216 INFO L78 Accepts]: Start accepts. Automaton has 29150 states and 87260 transitions. Word has length 64 [2019-12-28 00:39:11,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:39:11,217 INFO L462 AbstractCegarLoop]: Abstraction has 29150 states and 87260 transitions. [2019-12-28 00:39:11,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 00:39:11,217 INFO L276 IsEmpty]: Start isEmpty. Operand 29150 states and 87260 transitions. [2019-12-28 00:39:11,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-28 00:39:11,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:39:11,229 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-28 00:39:11,230 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:39:11,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:39:11,230 INFO L82 PathProgramCache]: Analyzing trace with hash 858363584, now seen corresponding path program 1 times [2019-12-28 00:39:11,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:39:11,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775766951] [2019-12-28 00:39:11,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:39:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:39:11,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:39:11,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775766951] [2019-12-28 00:39:11,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:39:11,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 00:39:11,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [268011439] [2019-12-28 00:39:11,284 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:39:11,297 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:39:11,342 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 163 states and 254 transitions. [2019-12-28 00:39:11,342 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:39:11,379 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 00:39:11,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 00:39:11,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:39:11,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 00:39:11,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:39:11,381 INFO L87 Difference]: Start difference. First operand 29150 states and 87260 transitions. Second operand 5 states. [2019-12-28 00:39:11,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:39:11,675 INFO L93 Difference]: Finished difference Result 33632 states and 99254 transitions. [2019-12-28 00:39:11,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 00:39:11,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-12-28 00:39:11,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:39:11,752 INFO L225 Difference]: With dead ends: 33632 [2019-12-28 00:39:11,753 INFO L226 Difference]: Without dead ends: 33632 [2019-12-28 00:39:11,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:39:11,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33632 states. [2019-12-28 00:39:12,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33632 to 29420. [2019-12-28 00:39:12,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29420 states. [2019-12-28 00:39:12,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29420 states to 29420 states and 86243 transitions. [2019-12-28 00:39:12,238 INFO L78 Accepts]: Start accepts. Automaton has 29420 states and 86243 transitions. Word has length 70 [2019-12-28 00:39:12,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:39:12,238 INFO L462 AbstractCegarLoop]: Abstraction has 29420 states and 86243 transitions. [2019-12-28 00:39:12,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 00:39:12,238 INFO L276 IsEmpty]: Start isEmpty. Operand 29420 states and 86243 transitions. [2019-12-28 00:39:12,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 00:39:12,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:39:12,251 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:39:12,251 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:39:12,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:39:12,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1906256555, now seen corresponding path program 1 times [2019-12-28 00:39:12,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:39:12,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651849558] [2019-12-28 00:39:12,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:39:12,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:39:12,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:39:12,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651849558] [2019-12-28 00:39:12,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:39:12,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 00:39:12,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [449205176] [2019-12-28 00:39:12,335 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:39:12,348 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:39:14,227 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 85 states and 97 transitions. [2019-12-28 00:39:14,228 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:39:14,228 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:39:14,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 00:39:14,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:39:14,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 00:39:14,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 00:39:14,229 INFO L87 Difference]: Start difference. First operand 29420 states and 86243 transitions. Second operand 7 states. [2019-12-28 00:39:15,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:39:15,641 INFO L93 Difference]: Finished difference Result 41574 states and 121608 transitions. [2019-12-28 00:39:15,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 00:39:15,641 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-12-28 00:39:15,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:39:15,702 INFO L225 Difference]: With dead ends: 41574 [2019-12-28 00:39:15,702 INFO L226 Difference]: Without dead ends: 41361 [2019-12-28 00:39:15,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-28 00:39:15,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41361 states. [2019-12-28 00:39:16,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41361 to 37608. [2019-12-28 00:39:16,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37608 states. [2019-12-28 00:39:16,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37608 states to 37608 states and 110222 transitions. [2019-12-28 00:39:16,242 INFO L78 Accepts]: Start accepts. Automaton has 37608 states and 110222 transitions. Word has length 71 [2019-12-28 00:39:16,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:39:16,242 INFO L462 AbstractCegarLoop]: Abstraction has 37608 states and 110222 transitions. [2019-12-28 00:39:16,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 00:39:16,243 INFO L276 IsEmpty]: Start isEmpty. Operand 37608 states and 110222 transitions. [2019-12-28 00:39:16,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 00:39:16,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:39:16,259 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:39:16,260 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:39:16,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:39:16,260 INFO L82 PathProgramCache]: Analyzing trace with hash 591759382, now seen corresponding path program 1 times [2019-12-28 00:39:16,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:39:16,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251519343] [2019-12-28 00:39:16,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:39:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:39:16,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:39:16,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251519343] [2019-12-28 00:39:16,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:39:16,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 00:39:16,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1837373439] [2019-12-28 00:39:16,350 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:39:16,362 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:39:16,381 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 85 states and 97 transitions. [2019-12-28 00:39:16,381 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:39:16,381 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:39:16,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 00:39:16,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:39:16,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 00:39:16,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:39:16,382 INFO L87 Difference]: Start difference. First operand 37608 states and 110222 transitions. Second operand 8 states. [2019-12-28 00:39:17,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:39:17,988 INFO L93 Difference]: Finished difference Result 45174 states and 130617 transitions. [2019-12-28 00:39:17,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 00:39:17,988 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2019-12-28 00:39:17,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:39:18,054 INFO L225 Difference]: With dead ends: 45174 [2019-12-28 00:39:18,054 INFO L226 Difference]: Without dead ends: 45174 [2019-12-28 00:39:18,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-28 00:39:18,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45174 states. [2019-12-28 00:39:18,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45174 to 39735. [2019-12-28 00:39:18,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39735 states. [2019-12-28 00:39:18,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39735 states to 39735 states and 115957 transitions. [2019-12-28 00:39:18,627 INFO L78 Accepts]: Start accepts. Automaton has 39735 states and 115957 transitions. Word has length 71 [2019-12-28 00:39:18,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:39:18,627 INFO L462 AbstractCegarLoop]: Abstraction has 39735 states and 115957 transitions. [2019-12-28 00:39:18,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 00:39:18,628 INFO L276 IsEmpty]: Start isEmpty. Operand 39735 states and 115957 transitions. [2019-12-28 00:39:18,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 00:39:18,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:39:18,643 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:39:18,643 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:39:18,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:39:18,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1479263063, now seen corresponding path program 1 times [2019-12-28 00:39:18,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:39:18,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649914225] [2019-12-28 00:39:18,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:39:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:39:18,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:39:18,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649914225] [2019-12-28 00:39:18,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:39:18,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 00:39:18,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1855227650] [2019-12-28 00:39:18,704 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:39:18,717 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:39:18,736 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 85 states and 97 transitions. [2019-12-28 00:39:18,736 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:39:18,736 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:39:18,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 00:39:18,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:39:18,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 00:39:18,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 00:39:18,737 INFO L87 Difference]: Start difference. First operand 39735 states and 115957 transitions. Second operand 3 states. [2019-12-28 00:39:18,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:39:18,850 INFO L93 Difference]: Finished difference Result 32259 states and 92079 transitions. [2019-12-28 00:39:18,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 00:39:18,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-28 00:39:18,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:39:18,894 INFO L225 Difference]: With dead ends: 32259 [2019-12-28 00:39:18,894 INFO L226 Difference]: Without dead ends: 32103 [2019-12-28 00:39:18,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 00:39:18,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32103 states. [2019-12-28 00:39:19,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32103 to 30373. [2019-12-28 00:39:19,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30373 states. [2019-12-28 00:39:19,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30373 states to 30373 states and 86835 transitions. [2019-12-28 00:39:19,521 INFO L78 Accepts]: Start accepts. Automaton has 30373 states and 86835 transitions. Word has length 71 [2019-12-28 00:39:19,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:39:19,521 INFO L462 AbstractCegarLoop]: Abstraction has 30373 states and 86835 transitions. [2019-12-28 00:39:19,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 00:39:19,521 INFO L276 IsEmpty]: Start isEmpty. Operand 30373 states and 86835 transitions. [2019-12-28 00:39:19,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-28 00:39:19,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:39:19,533 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] [2019-12-28 00:39:19,533 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:39:19,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:39:19,533 INFO L82 PathProgramCache]: Analyzing trace with hash -626177418, now seen corresponding path program 1 times [2019-12-28 00:39:19,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:39:19,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705681140] [2019-12-28 00:39:19,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:39:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:39:19,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:39:19,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705681140] [2019-12-28 00:39:19,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:39:19,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 00:39:19,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [832529094] [2019-12-28 00:39:19,727 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:39:19,754 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:39:19,788 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 141 states and 208 transitions. [2019-12-28 00:39:19,788 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:39:19,879 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 00:39:19,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 00:39:19,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:39:19,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 00:39:19,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-28 00:39:19,880 INFO L87 Difference]: Start difference. First operand 30373 states and 86835 transitions. Second operand 10 states. [2019-12-28 00:39:21,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:39:21,733 INFO L93 Difference]: Finished difference Result 33879 states and 96034 transitions. [2019-12-28 00:39:21,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 00:39:21,734 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2019-12-28 00:39:21,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:39:21,815 INFO L225 Difference]: With dead ends: 33879 [2019-12-28 00:39:21,815 INFO L226 Difference]: Without dead ends: 33879 [2019-12-28 00:39:21,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-12-28 00:39:21,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33879 states. [2019-12-28 00:39:22,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33879 to 31309. [2019-12-28 00:39:22,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31309 states. [2019-12-28 00:39:22,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31309 states to 31309 states and 89292 transitions. [2019-12-28 00:39:22,520 INFO L78 Accepts]: Start accepts. Automaton has 31309 states and 89292 transitions. Word has length 72 [2019-12-28 00:39:22,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:39:22,521 INFO L462 AbstractCegarLoop]: Abstraction has 31309 states and 89292 transitions. [2019-12-28 00:39:22,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 00:39:22,521 INFO L276 IsEmpty]: Start isEmpty. Operand 31309 states and 89292 transitions. [2019-12-28 00:39:22,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-28 00:39:22,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:39:22,534 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] [2019-12-28 00:39:22,535 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:39:22,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:39:22,535 INFO L82 PathProgramCache]: Analyzing trace with hash 261326263, now seen corresponding path program 1 times [2019-12-28 00:39:22,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:39:22,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265626583] [2019-12-28 00:39:22,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:39:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:39:22,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-28 00:39:22,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265626583] [2019-12-28 00:39:22,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:39:22,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:39:22,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [755885868] [2019-12-28 00:39:22,604 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:39:22,617 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:39:22,649 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 141 states and 208 transitions. [2019-12-28 00:39:22,649 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:39:22,675 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 00:39:22,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 00:39:22,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:39:22,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 00:39:22,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:39:22,677 INFO L87 Difference]: Start difference. First operand 31309 states and 89292 transitions. Second operand 6 states. [2019-12-28 00:39:22,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:39:22,892 INFO L93 Difference]: Finished difference Result 10978 states and 27240 transitions. [2019-12-28 00:39:22,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 00:39:22,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-12-28 00:39:22,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:39:22,905 INFO L225 Difference]: With dead ends: 10978 [2019-12-28 00:39:22,906 INFO L226 Difference]: Without dead ends: 9559 [2019-12-28 00:39:22,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:39:22,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9559 states. [2019-12-28 00:39:22,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9559 to 7168. [2019-12-28 00:39:22,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7168 states. [2019-12-28 00:39:23,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7168 states to 7168 states and 17856 transitions. [2019-12-28 00:39:23,000 INFO L78 Accepts]: Start accepts. Automaton has 7168 states and 17856 transitions. Word has length 72 [2019-12-28 00:39:23,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:39:23,001 INFO L462 AbstractCegarLoop]: Abstraction has 7168 states and 17856 transitions. [2019-12-28 00:39:23,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 00:39:23,001 INFO L276 IsEmpty]: Start isEmpty. Operand 7168 states and 17856 transitions. [2019-12-28 00:39:23,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-28 00:39:23,009 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:39:23,009 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, 1, 1] [2019-12-28 00:39:23,010 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:39:23,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:39:23,010 INFO L82 PathProgramCache]: Analyzing trace with hash -48409166, now seen corresponding path program 1 times [2019-12-28 00:39:23,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:39:23,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220916332] [2019-12-28 00:39:23,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:39:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:39:23,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:39:23,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220916332] [2019-12-28 00:39:23,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:39:23,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:39:23,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1185052881] [2019-12-28 00:39:23,105 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:39:23,135 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:39:23,283 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 197 states and 291 transitions. [2019-12-28 00:39:23,284 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:39:23,285 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:39:23,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 00:39:23,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:39:23,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 00:39:23,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:39:23,286 INFO L87 Difference]: Start difference. First operand 7168 states and 17856 transitions. Second operand 5 states. [2019-12-28 00:39:23,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:39:23,888 INFO L93 Difference]: Finished difference Result 11992 states and 29891 transitions. [2019-12-28 00:39:23,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 00:39:23,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-12-28 00:39:23,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:39:23,909 INFO L225 Difference]: With dead ends: 11992 [2019-12-28 00:39:23,909 INFO L226 Difference]: Without dead ends: 11992 [2019-12-28 00:39:23,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-28 00:39:23,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11992 states. [2019-12-28 00:39:24,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11992 to 7168. [2019-12-28 00:39:24,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7168 states. [2019-12-28 00:39:24,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7168 states to 7168 states and 17856 transitions. [2019-12-28 00:39:24,014 INFO L78 Accepts]: Start accepts. Automaton has 7168 states and 17856 transitions. Word has length 101 [2019-12-28 00:39:24,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:39:24,014 INFO L462 AbstractCegarLoop]: Abstraction has 7168 states and 17856 transitions. [2019-12-28 00:39:24,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 00:39:24,015 INFO L276 IsEmpty]: Start isEmpty. Operand 7168 states and 17856 transitions. [2019-12-28 00:39:24,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-28 00:39:24,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:39:24,024 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, 1, 1] [2019-12-28 00:39:24,025 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:39:24,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:39:24,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1845360525, now seen corresponding path program 1 times [2019-12-28 00:39:24,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:39:24,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855399454] [2019-12-28 00:39:24,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:39:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:39:24,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:39:24,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855399454] [2019-12-28 00:39:24,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:39:24,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 00:39:24,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1282106841] [2019-12-28 00:39:24,104 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:39:24,132 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:39:24,265 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 197 states and 291 transitions. [2019-12-28 00:39:24,265 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:39:24,265 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:39:24,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 00:39:24,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:39:24,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 00:39:24,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:39:24,266 INFO L87 Difference]: Start difference. First operand 7168 states and 17856 transitions. Second operand 4 states. [2019-12-28 00:39:24,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:39:24,496 INFO L93 Difference]: Finished difference Result 8324 states and 20367 transitions. [2019-12-28 00:39:24,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 00:39:24,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-12-28 00:39:24,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:39:24,508 INFO L225 Difference]: With dead ends: 8324 [2019-12-28 00:39:24,508 INFO L226 Difference]: Without dead ends: 8324 [2019-12-28 00:39:24,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:39:24,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8324 states. [2019-12-28 00:39:24,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8324 to 7790. [2019-12-28 00:39:24,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7790 states. [2019-12-28 00:39:24,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7790 states to 7790 states and 19208 transitions. [2019-12-28 00:39:24,596 INFO L78 Accepts]: Start accepts. Automaton has 7790 states and 19208 transitions. Word has length 101 [2019-12-28 00:39:24,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:39:24,596 INFO L462 AbstractCegarLoop]: Abstraction has 7790 states and 19208 transitions. [2019-12-28 00:39:24,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 00:39:24,597 INFO L276 IsEmpty]: Start isEmpty. Operand 7790 states and 19208 transitions. [2019-12-28 00:39:24,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-28 00:39:24,603 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:39:24,603 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, 1, 1] [2019-12-28 00:39:24,604 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:39:24,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:39:24,604 INFO L82 PathProgramCache]: Analyzing trace with hash -600596044, now seen corresponding path program 1 times [2019-12-28 00:39:24,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:39:24,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936359725] [2019-12-28 00:39:24,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:39:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:39:24,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:39:24,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936359725] [2019-12-28 00:39:24,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:39:24,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 00:39:24,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1782761975] [2019-12-28 00:39:24,778 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:39:24,807 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:39:24,966 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 197 states and 291 transitions. [2019-12-28 00:39:24,967 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:39:25,011 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 00:39:25,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 00:39:25,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:39:25,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 00:39:25,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-28 00:39:25,012 INFO L87 Difference]: Start difference. First operand 7790 states and 19208 transitions. Second operand 9 states. [2019-12-28 00:39:27,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:39:27,068 INFO L93 Difference]: Finished difference Result 17476 states and 41501 transitions. [2019-12-28 00:39:27,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-28 00:39:27,069 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-12-28 00:39:27,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:39:27,089 INFO L225 Difference]: With dead ends: 17476 [2019-12-28 00:39:27,089 INFO L226 Difference]: Without dead ends: 17325 [2019-12-28 00:39:27,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2019-12-28 00:39:27,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17325 states. [2019-12-28 00:39:27,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17325 to 10295. [2019-12-28 00:39:27,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10295 states. [2019-12-28 00:39:27,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10295 states to 10295 states and 24742 transitions. [2019-12-28 00:39:27,248 INFO L78 Accepts]: Start accepts. Automaton has 10295 states and 24742 transitions. Word has length 101 [2019-12-28 00:39:27,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:39:27,248 INFO L462 AbstractCegarLoop]: Abstraction has 10295 states and 24742 transitions. [2019-12-28 00:39:27,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 00:39:27,249 INFO L276 IsEmpty]: Start isEmpty. Operand 10295 states and 24742 transitions. [2019-12-28 00:39:27,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-28 00:39:27,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:39:27,258 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, 1, 1] [2019-12-28 00:39:27,259 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:39:27,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:39:27,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1617161909, now seen corresponding path program 1 times [2019-12-28 00:39:27,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:39:27,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637973017] [2019-12-28 00:39:27,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:39:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:39:27,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:39:27,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637973017] [2019-12-28 00:39:27,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:39:27,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 00:39:27,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [696089009] [2019-12-28 00:39:27,374 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:39:27,403 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:39:27,532 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 197 states and 291 transitions. [2019-12-28 00:39:27,532 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:39:27,558 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 00:39:27,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 00:39:27,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:39:27,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 00:39:27,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-28 00:39:27,560 INFO L87 Difference]: Start difference. First operand 10295 states and 24742 transitions. Second operand 9 states. [2019-12-28 00:39:29,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:39:29,502 INFO L93 Difference]: Finished difference Result 18603 states and 43052 transitions. [2019-12-28 00:39:29,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-28 00:39:29,503 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-12-28 00:39:29,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:39:29,524 INFO L225 Difference]: With dead ends: 18603 [2019-12-28 00:39:29,524 INFO L226 Difference]: Without dead ends: 18603 [2019-12-28 00:39:29,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812 [2019-12-28 00:39:29,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18603 states. [2019-12-28 00:39:29,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18603 to 11386. [2019-12-28 00:39:29,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11386 states. [2019-12-28 00:39:29,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11386 states to 11386 states and 26587 transitions. [2019-12-28 00:39:29,699 INFO L78 Accepts]: Start accepts. Automaton has 11386 states and 26587 transitions. Word has length 101 [2019-12-28 00:39:29,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:39:29,699 INFO L462 AbstractCegarLoop]: Abstraction has 11386 states and 26587 transitions. [2019-12-28 00:39:29,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 00:39:29,700 INFO L276 IsEmpty]: Start isEmpty. Operand 11386 states and 26587 transitions. [2019-12-28 00:39:29,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-28 00:39:29,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:39:29,711 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, 1, 1] [2019-12-28 00:39:29,711 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:39:29,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:39:29,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1828512822, now seen corresponding path program 1 times [2019-12-28 00:39:29,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:39:29,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994673621] [2019-12-28 00:39:29,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:39:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:39:29,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:39:29,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994673621] [2019-12-28 00:39:29,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:39:29,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 00:39:29,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [101788393] [2019-12-28 00:39:29,852 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:39:29,872 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:39:30,011 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 197 states and 291 transitions. [2019-12-28 00:39:30,011 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:39:30,013 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 00:39:30,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 00:39:30,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:39:30,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 00:39:30,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-28 00:39:30,014 INFO L87 Difference]: Start difference. First operand 11386 states and 26587 transitions. Second operand 7 states. [2019-12-28 00:39:30,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:39:30,497 INFO L93 Difference]: Finished difference Result 11913 states and 27674 transitions. [2019-12-28 00:39:30,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 00:39:30,498 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2019-12-28 00:39:30,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:39:30,520 INFO L225 Difference]: With dead ends: 11913 [2019-12-28 00:39:30,520 INFO L226 Difference]: Without dead ends: 11913 [2019-12-28 00:39:30,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-28 00:39:30,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11913 states. [2019-12-28 00:39:30,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11913 to 11378. [2019-12-28 00:39:30,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11378 states. [2019-12-28 00:39:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11378 states to 11378 states and 26509 transitions. [2019-12-28 00:39:30,788 INFO L78 Accepts]: Start accepts. Automaton has 11378 states and 26509 transitions. Word has length 101 [2019-12-28 00:39:30,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:39:30,789 INFO L462 AbstractCegarLoop]: Abstraction has 11378 states and 26509 transitions. [2019-12-28 00:39:30,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 00:39:30,789 INFO L276 IsEmpty]: Start isEmpty. Operand 11378 states and 26509 transitions. [2019-12-28 00:39:30,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-28 00:39:30,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:39:30,808 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, 1, 1] [2019-12-28 00:39:30,808 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:39:30,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:39:30,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1578950793, now seen corresponding path program 1 times [2019-12-28 00:39:30,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:39:30,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853190776] [2019-12-28 00:39:30,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:39:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:39:30,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:39:30,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853190776] [2019-12-28 00:39:30,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:39:30,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:39:30,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [258475235] [2019-12-28 00:39:30,902 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:39:30,932 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:39:31,164 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 197 states and 291 transitions. [2019-12-28 00:39:31,165 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:39:31,176 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 00:39:31,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 00:39:31,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:39:31,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 00:39:31,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:39:31,177 INFO L87 Difference]: Start difference. First operand 11378 states and 26509 transitions. Second operand 6 states. [2019-12-28 00:39:31,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:39:31,707 INFO L93 Difference]: Finished difference Result 13869 states and 32258 transitions. [2019-12-28 00:39:31,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 00:39:31,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-12-28 00:39:31,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:39:31,725 INFO L225 Difference]: With dead ends: 13869 [2019-12-28 00:39:31,725 INFO L226 Difference]: Without dead ends: 13869 [2019-12-28 00:39:31,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:39:31,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13869 states. [2019-12-28 00:39:31,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13869 to 10952. [2019-12-28 00:39:31,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10952 states. [2019-12-28 00:39:31,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10952 states to 10952 states and 25507 transitions. [2019-12-28 00:39:31,862 INFO L78 Accepts]: Start accepts. Automaton has 10952 states and 25507 transitions. Word has length 101 [2019-12-28 00:39:31,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:39:31,862 INFO L462 AbstractCegarLoop]: Abstraction has 10952 states and 25507 transitions. [2019-12-28 00:39:31,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 00:39:31,862 INFO L276 IsEmpty]: Start isEmpty. Operand 10952 states and 25507 transitions. [2019-12-28 00:39:31,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-28 00:39:31,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:39:31,872 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, 1, 1] [2019-12-28 00:39:31,872 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:39:31,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:39:31,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1491278273, now seen corresponding path program 2 times [2019-12-28 00:39:31,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:39:31,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45942199] [2019-12-28 00:39:31,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:39:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:39:31,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:39:31,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45942199] [2019-12-28 00:39:31,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:39:31,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:39:31,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [707216804] [2019-12-28 00:39:31,946 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:39:31,966 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:39:32,115 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 210 states and 317 transitions. [2019-12-28 00:39:32,116 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:39:32,142 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 00:39:32,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 00:39:32,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:39:32,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 00:39:32,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:39:32,144 INFO L87 Difference]: Start difference. First operand 10952 states and 25507 transitions. Second operand 6 states. [2019-12-28 00:39:32,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:39:32,596 INFO L93 Difference]: Finished difference Result 12742 states and 29226 transitions. [2019-12-28 00:39:32,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 00:39:32,597 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-12-28 00:39:32,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:39:32,615 INFO L225 Difference]: With dead ends: 12742 [2019-12-28 00:39:32,616 INFO L226 Difference]: Without dead ends: 12742 [2019-12-28 00:39:32,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:39:32,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12742 states. [2019-12-28 00:39:32,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12742 to 11110. [2019-12-28 00:39:32,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11110 states. [2019-12-28 00:39:32,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11110 states to 11110 states and 25845 transitions. [2019-12-28 00:39:32,799 INFO L78 Accepts]: Start accepts. Automaton has 11110 states and 25845 transitions. Word has length 101 [2019-12-28 00:39:32,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:39:32,799 INFO L462 AbstractCegarLoop]: Abstraction has 11110 states and 25845 transitions. [2019-12-28 00:39:32,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 00:39:32,799 INFO L276 IsEmpty]: Start isEmpty. Operand 11110 states and 25845 transitions. [2019-12-28 00:39:32,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 00:39:32,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:39:32,809 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, 1, 1, 1, 1] [2019-12-28 00:39:32,810 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:39:32,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:39:32,810 INFO L82 PathProgramCache]: Analyzing trace with hash -378386724, now seen corresponding path program 1 times [2019-12-28 00:39:32,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:39:32,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040745813] [2019-12-28 00:39:32,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:39:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:39:32,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:39:32,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040745813] [2019-12-28 00:39:32,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:39:32,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 00:39:32,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1172135955] [2019-12-28 00:39:32,853 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:39:32,883 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:39:33,172 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 305 transitions. [2019-12-28 00:39:33,173 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:39:33,184 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-28 00:39:33,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 00:39:33,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:39:33,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 00:39:33,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:39:33,185 INFO L87 Difference]: Start difference. First operand 11110 states and 25845 transitions. Second operand 4 states. [2019-12-28 00:39:33,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:39:33,310 INFO L93 Difference]: Finished difference Result 14016 states and 32667 transitions. [2019-12-28 00:39:33,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 00:39:33,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-12-28 00:39:33,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:39:33,331 INFO L225 Difference]: With dead ends: 14016 [2019-12-28 00:39:33,331 INFO L226 Difference]: Without dead ends: 14016 [2019-12-28 00:39:33,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:39:33,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14016 states. [2019-12-28 00:39:33,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14016 to 13732. [2019-12-28 00:39:33,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13732 states. [2019-12-28 00:39:33,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13732 states to 13732 states and 31962 transitions. [2019-12-28 00:39:33,561 INFO L78 Accepts]: Start accepts. Automaton has 13732 states and 31962 transitions. Word has length 103 [2019-12-28 00:39:33,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:39:33,561 INFO L462 AbstractCegarLoop]: Abstraction has 13732 states and 31962 transitions. [2019-12-28 00:39:33,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 00:39:33,561 INFO L276 IsEmpty]: Start isEmpty. Operand 13732 states and 31962 transitions. [2019-12-28 00:39:33,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 00:39:33,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:39:33,580 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, 1, 1, 1, 1] [2019-12-28 00:39:33,580 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:39:33,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:39:33,580 INFO L82 PathProgramCache]: Analyzing trace with hash -27586787, now seen corresponding path program 1 times [2019-12-28 00:39:33,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:39:33,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222455385] [2019-12-28 00:39:33,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:39:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:39:33,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:39:33,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222455385] [2019-12-28 00:39:33,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:39:33,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-28 00:39:33,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [368424800] [2019-12-28 00:39:33,797 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:39:33,817 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:39:33,949 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 305 transitions. [2019-12-28 00:39:33,949 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:39:33,991 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-28 00:39:33,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-28 00:39:33,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:39:33,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-28 00:39:33,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-12-28 00:39:33,993 INFO L87 Difference]: Start difference. First operand 13732 states and 31962 transitions. Second operand 14 states. [2019-12-28 00:39:35,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:39:35,886 INFO L93 Difference]: Finished difference Result 25715 states and 59093 transitions. [2019-12-28 00:39:35,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-28 00:39:35,886 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2019-12-28 00:39:35,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:39:35,913 INFO L225 Difference]: With dead ends: 25715 [2019-12-28 00:39:35,914 INFO L226 Difference]: Without dead ends: 23453 [2019-12-28 00:39:35,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=254, Invalid=1468, Unknown=0, NotChecked=0, Total=1722 [2019-12-28 00:39:35,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23453 states. [2019-12-28 00:39:36,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23453 to 17191. [2019-12-28 00:39:36,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17191 states. [2019-12-28 00:39:36,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17191 states to 17191 states and 39998 transitions. [2019-12-28 00:39:36,223 INFO L78 Accepts]: Start accepts. Automaton has 17191 states and 39998 transitions. Word has length 103 [2019-12-28 00:39:36,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:39:36,224 INFO L462 AbstractCegarLoop]: Abstraction has 17191 states and 39998 transitions. [2019-12-28 00:39:36,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-28 00:39:36,224 INFO L276 IsEmpty]: Start isEmpty. Operand 17191 states and 39998 transitions. [2019-12-28 00:39:36,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 00:39:36,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:39:36,240 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, 1, 1, 1, 1] [2019-12-28 00:39:36,240 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:39:36,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:39:36,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1014381263, now seen corresponding path program 1 times [2019-12-28 00:39:36,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:39:36,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672397053] [2019-12-28 00:39:36,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:39:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:39:36,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:39:36,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672397053] [2019-12-28 00:39:36,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:39:36,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 00:39:36,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [186326003] [2019-12-28 00:39:36,352 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:39:36,374 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:39:36,524 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 195 states and 277 transitions. [2019-12-28 00:39:36,524 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:39:36,582 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 00:39:36,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 00:39:36,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:39:36,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 00:39:36,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-28 00:39:36,583 INFO L87 Difference]: Start difference. First operand 17191 states and 39998 transitions. Second operand 9 states. [2019-12-28 00:39:36,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:39:36,856 INFO L93 Difference]: Finished difference Result 18375 states and 42677 transitions. [2019-12-28 00:39:36,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 00:39:36,857 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-12-28 00:39:36,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:39:36,862 INFO L225 Difference]: With dead ends: 18375 [2019-12-28 00:39:36,863 INFO L226 Difference]: Without dead ends: 3585 [2019-12-28 00:39:36,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-12-28 00:39:36,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3585 states. [2019-12-28 00:39:36,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3585 to 2992. [2019-12-28 00:39:36,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2992 states. [2019-12-28 00:39:36,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2992 states to 2992 states and 7024 transitions. [2019-12-28 00:39:36,894 INFO L78 Accepts]: Start accepts. Automaton has 2992 states and 7024 transitions. Word has length 103 [2019-12-28 00:39:36,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:39:36,895 INFO L462 AbstractCegarLoop]: Abstraction has 2992 states and 7024 transitions. [2019-12-28 00:39:36,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 00:39:36,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2992 states and 7024 transitions. [2019-12-28 00:39:36,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 00:39:36,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:39:36,898 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, 1, 1, 1, 1] [2019-12-28 00:39:36,898 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:39:36,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:39:36,898 INFO L82 PathProgramCache]: Analyzing trace with hash 73356348, now seen corresponding path program 2 times [2019-12-28 00:39:36,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:39:36,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27042590] [2019-12-28 00:39:36,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:39:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 00:39:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 00:39:36,987 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 00:39:36,987 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 00:39:37,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 12:39:37 BasicIcfg [2019-12-28 00:39:37,196 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 00:39:37,203 INFO L168 Benchmark]: Toolchain (without parser) took 117153.41 ms. Allocated memory was 146.8 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 103.2 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 816.4 MB. Max. memory is 7.1 GB. [2019-12-28 00:39:37,204 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-28 00:39:37,204 INFO L168 Benchmark]: CACSL2BoogieTranslator took 848.09 ms. Allocated memory was 146.8 MB in the beginning and 233.8 MB in the end (delta: 87.0 MB). Free memory was 102.8 MB in the beginning and 196.9 MB in the end (delta: -94.2 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-28 00:39:37,207 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.20 ms. Allocated memory is still 233.8 MB. Free memory was 196.9 MB in the beginning and 193.3 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. [2019-12-28 00:39:37,207 INFO L168 Benchmark]: Boogie Preprocessor took 58.48 ms. Allocated memory is still 233.8 MB. Free memory was 193.3 MB in the beginning and 191.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-12-28 00:39:37,208 INFO L168 Benchmark]: RCFGBuilder took 966.01 ms. Allocated memory is still 233.8 MB. Free memory was 191.5 MB in the beginning and 138.1 MB in the end (delta: 53.4 MB). Peak memory consumption was 53.4 MB. Max. memory is 7.1 GB. [2019-12-28 00:39:37,208 INFO L168 Benchmark]: TraceAbstraction took 115205.77 ms. Allocated memory was 233.8 MB in the beginning and 3.0 GB in the end (delta: 2.7 GB). Free memory was 137.2 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 763.4 MB. Max. memory is 7.1 GB. [2019-12-28 00:39:37,213 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.24 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 848.09 ms. Allocated memory was 146.8 MB in the beginning and 233.8 MB in the end (delta: 87.0 MB). Free memory was 102.8 MB in the beginning and 196.9 MB in the end (delta: -94.2 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.20 ms. Allocated memory is still 233.8 MB. Free memory was 196.9 MB in the beginning and 193.3 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 58.48 ms. Allocated memory is still 233.8 MB. Free memory was 193.3 MB in the beginning and 191.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 966.01 ms. Allocated memory is still 233.8 MB. Free memory was 191.5 MB in the beginning and 138.1 MB in the end (delta: 53.4 MB). Peak memory consumption was 53.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 115205.77 ms. Allocated memory was 233.8 MB in the beginning and 3.0 GB in the end (delta: 2.7 GB). Free memory was 137.2 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 763.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L707] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L708] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L709] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L710] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L711] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L712] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L713] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L714] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L715] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L716] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L717] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L718] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L719] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L723] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L807] 0 pthread_t t319; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L808] FCALL, FORK 0 pthread_create(&t319, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L809] 0 pthread_t t320; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L810] FCALL, FORK 0 pthread_create(&t320, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L755] 2 x$w_buff1 = x$w_buff0 [L756] 2 x$w_buff0 = 1 [L757] 2 x$w_buff1_used = x$w_buff0_used [L758] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L760] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L761] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L762] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L763] 2 x$r_buff0_thd2 = (_Bool)1 [L766] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 2 x$flush_delayed = weak$$choice2 [L769] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L770] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L770] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L770] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L771] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L771] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L772] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L772] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L773] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L774] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L774] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L775] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L776] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] EXPR 2 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] 2 x = x$flush_delayed ? x$mem_tmp : x [L779] 2 x$flush_delayed = (_Bool)0 [L782] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L727] 1 y = 1 [L730] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L731] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L732] 1 x$flush_delayed = weak$$choice2 [L733] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L735] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L735] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L736] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L737] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L737] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L740] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L740] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L741] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 x = x$flush_delayed ? x$mem_tmp : x [L743] 1 x$flush_delayed = (_Bool)0 [L748] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L786] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L788] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L812] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L816] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L816] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L816] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L816] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L817] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L818] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L818] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L819] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L819] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L820] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L820] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L823] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 172 locations, 2 error locations. Result: UNSAFE, OverallTime: 114.8s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 43.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10146 SDtfs, 15995 SDslu, 32576 SDs, 0 SdLazy, 12624 SolverSat, 890 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 397 GetRequests, 143 SyntacticMatches, 15 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220590occurred 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: 53.9s AutomataMinimizationTime, 25 MinimizatonAttempts, 161569 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2010 NumberOfCodeBlocks, 2010 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1882 ConstructedInterpolants, 0 QuantifiedInterpolants, 394313 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...