/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix034_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 02:03:36,885 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 02:03:36,888 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 02:03:36,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 02:03:36,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 02:03:36,906 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 02:03:36,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 02:03:36,914 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 02:03:36,919 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 02:03:36,920 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 02:03:36,922 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 02:03:36,923 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 02:03:36,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 02:03:36,926 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 02:03:36,927 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 02:03:36,928 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 02:03:36,930 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 02:03:36,934 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 02:03:36,936 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 02:03:36,940 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 02:03:36,941 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 02:03:36,942 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 02:03:36,945 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 02:03:36,946 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 02:03:36,950 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 02:03:36,950 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 02:03:36,950 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 02:03:36,952 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 02:03:36,954 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 02:03:36,956 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 02:03:36,956 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 02:03:36,958 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 02:03:36,959 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 02:03:36,960 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 02:03:36,964 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 02:03:36,964 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 02:03:36,965 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 02:03:36,966 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 02:03:36,966 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 02:03:36,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 02:03:36,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 02:03:36,972 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-MCR.epf [2019-12-28 02:03:36,992 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 02:03:36,992 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 02:03:36,993 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 02:03:36,993 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 02:03:36,994 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 02:03:36,994 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 02:03:36,994 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 02:03:36,994 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 02:03:36,994 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 02:03:36,995 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 02:03:36,995 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 02:03:36,995 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 02:03:36,995 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 02:03:36,995 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 02:03:36,996 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 02:03:36,996 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 02:03:36,996 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 02:03:36,996 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 02:03:36,996 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 02:03:36,997 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 02:03:36,997 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 02:03:36,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 02:03:36,997 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 02:03:36,997 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 02:03:36,998 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 02:03:36,998 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 02:03:36,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 02:03:36,998 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 02:03:36,998 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 02:03:36,998 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 02:03:36,999 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 02:03:36,999 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 02:03:37,260 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 02:03:37,276 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 02:03:37,279 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 02:03:37,281 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 02:03:37,282 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 02:03:37,282 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_pso.opt.i [2019-12-28 02:03:37,342 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d2e3f073/8b457d950bac4cd9a5c4433269b3de6f/FLAGe0a9b833e [2019-12-28 02:03:37,860 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 02:03:37,860 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_pso.opt.i [2019-12-28 02:03:37,879 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d2e3f073/8b457d950bac4cd9a5c4433269b3de6f/FLAGe0a9b833e [2019-12-28 02:03:38,208 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d2e3f073/8b457d950bac4cd9a5c4433269b3de6f [2019-12-28 02:03:38,217 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 02:03:38,219 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 02:03:38,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 02:03:38,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 02:03:38,224 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 02:03:38,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:03:38" (1/1) ... [2019-12-28 02:03:38,227 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16e70531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:38, skipping insertion in model container [2019-12-28 02:03:38,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:03:38" (1/1) ... [2019-12-28 02:03:38,235 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 02:03:38,292 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 02:03:38,818 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 02:03:38,830 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 02:03:38,897 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 02:03:38,967 INFO L208 MainTranslator]: Completed translation [2019-12-28 02:03:38,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:38 WrapperNode [2019-12-28 02:03:38,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 02:03:38,969 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 02:03:38,969 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 02:03:38,969 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 02:03:38,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:38" (1/1) ... [2019-12-28 02:03:39,003 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:38" (1/1) ... [2019-12-28 02:03:39,034 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 02:03:39,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 02:03:39,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 02:03:39,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 02:03:39,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:38" (1/1) ... [2019-12-28 02:03:39,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:38" (1/1) ... [2019-12-28 02:03:39,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:38" (1/1) ... [2019-12-28 02:03:39,056 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:38" (1/1) ... [2019-12-28 02:03:39,066 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:38" (1/1) ... [2019-12-28 02:03:39,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:38" (1/1) ... [2019-12-28 02:03:39,073 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:38" (1/1) ... [2019-12-28 02:03:39,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 02:03:39,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 02:03:39,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 02:03:39,079 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 02:03:39,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 02:03:39,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 02:03:39,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 02:03:39,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 02:03:39,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 02:03:39,135 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 02:03:39,135 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 02:03:39,136 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 02:03:39,136 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 02:03:39,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 02:03:39,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 02:03:39,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 02:03:39,138 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-28 02:03:39,825 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 02:03:39,826 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 02:03:39,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:03:39 BoogieIcfgContainer [2019-12-28 02:03:39,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 02:03:39,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 02:03:39,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 02:03:39,833 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 02:03:39,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 02:03:38" (1/3) ... [2019-12-28 02:03:39,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3dbdd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:03:39, skipping insertion in model container [2019-12-28 02:03:39,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:38" (2/3) ... [2019-12-28 02:03:39,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3dbdd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:03:39, skipping insertion in model container [2019-12-28 02:03:39,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:03:39" (3/3) ... [2019-12-28 02:03:39,839 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_pso.opt.i [2019-12-28 02:03:39,849 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 02:03:39,850 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 02:03:39,856 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 02:03:39,857 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 02:03:39,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,894 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,895 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,919 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,919 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,919 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,920 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,920 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,931 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,931 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,931 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,937 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,938 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:39,958 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 02:03:39,979 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 02:03:39,979 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 02:03:39,979 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 02:03:39,979 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 02:03:39,980 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 02:03:39,980 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 02:03:39,980 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 02:03:39,980 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 02:03:39,994 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 137 places, 165 transitions [2019-12-28 02:03:41,375 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25977 states. [2019-12-28 02:03:41,377 INFO L276 IsEmpty]: Start isEmpty. Operand 25977 states. [2019-12-28 02:03:41,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-28 02:03:41,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:41,388 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] [2019-12-28 02:03:41,389 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:41,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:41,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1560542466, now seen corresponding path program 1 times [2019-12-28 02:03:41,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:41,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204168668] [2019-12-28 02:03:41,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:41,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:03:41,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204168668] [2019-12-28 02:03:41,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:41,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:03:41,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1526318301] [2019-12-28 02:03:41,755 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:41,765 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:41,787 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 40 transitions. [2019-12-28 02:03:41,788 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:41,792 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:03:41,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:03:41,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:41,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:03:41,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:03:41,811 INFO L87 Difference]: Start difference. First operand 25977 states. Second operand 4 states. [2019-12-28 02:03:42,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:42,373 INFO L93 Difference]: Finished difference Result 26617 states and 102122 transitions. [2019-12-28 02:03:42,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 02:03:42,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-28 02:03:42,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:42,596 INFO L225 Difference]: With dead ends: 26617 [2019-12-28 02:03:42,596 INFO L226 Difference]: Without dead ends: 20361 [2019-12-28 02:03:42,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:03:43,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20361 states. [2019-12-28 02:03:44,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20361 to 20361. [2019-12-28 02:03:44,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20361 states. [2019-12-28 02:03:44,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20361 states to 20361 states and 78426 transitions. [2019-12-28 02:03:44,597 INFO L78 Accepts]: Start accepts. Automaton has 20361 states and 78426 transitions. Word has length 40 [2019-12-28 02:03:44,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:44,598 INFO L462 AbstractCegarLoop]: Abstraction has 20361 states and 78426 transitions. [2019-12-28 02:03:44,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:03:44,599 INFO L276 IsEmpty]: Start isEmpty. Operand 20361 states and 78426 transitions. [2019-12-28 02:03:44,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-28 02:03:44,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:44,614 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:03:44,615 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:44,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:44,615 INFO L82 PathProgramCache]: Analyzing trace with hash 880832033, now seen corresponding path program 1 times [2019-12-28 02:03:44,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:44,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302895364] [2019-12-28 02:03:44,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:44,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:03:44,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302895364] [2019-12-28 02:03:44,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:44,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:03:44,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1761990039] [2019-12-28 02:03:44,794 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:44,800 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:44,806 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 48 transitions. [2019-12-28 02:03:44,806 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:44,807 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:03:44,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:03:44,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:44,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:03:44,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:03:44,810 INFO L87 Difference]: Start difference. First operand 20361 states and 78426 transitions. Second operand 5 states. [2019-12-28 02:03:45,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:45,557 INFO L93 Difference]: Finished difference Result 31839 states and 116043 transitions. [2019-12-28 02:03:45,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:03:45,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-28 02:03:45,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:46,725 INFO L225 Difference]: With dead ends: 31839 [2019-12-28 02:03:46,725 INFO L226 Difference]: Without dead ends: 31287 [2019-12-28 02:03:46,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:03:46,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31287 states. [2019-12-28 02:03:47,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31287 to 29706. [2019-12-28 02:03:47,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29706 states. [2019-12-28 02:03:47,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29706 states to 29706 states and 109520 transitions. [2019-12-28 02:03:47,788 INFO L78 Accepts]: Start accepts. Automaton has 29706 states and 109520 transitions. Word has length 48 [2019-12-28 02:03:47,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:47,790 INFO L462 AbstractCegarLoop]: Abstraction has 29706 states and 109520 transitions. [2019-12-28 02:03:47,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:03:47,791 INFO L276 IsEmpty]: Start isEmpty. Operand 29706 states and 109520 transitions. [2019-12-28 02:03:47,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-28 02:03:47,799 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:47,800 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:03:47,800 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:47,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:47,800 INFO L82 PathProgramCache]: Analyzing trace with hash 19573473, now seen corresponding path program 1 times [2019-12-28 02:03:47,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:47,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200883253] [2019-12-28 02:03:47,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:47,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:03:47,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200883253] [2019-12-28 02:03:47,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:47,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:03:47,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1931835482] [2019-12-28 02:03:47,928 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:47,935 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:47,945 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 121 transitions. [2019-12-28 02:03:47,945 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:48,025 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:03:48,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:03:48,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:48,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:03:48,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:03:48,027 INFO L87 Difference]: Start difference. First operand 29706 states and 109520 transitions. Second operand 6 states. [2019-12-28 02:03:48,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:48,888 INFO L93 Difference]: Finished difference Result 38697 states and 139692 transitions. [2019-12-28 02:03:48,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:03:48,888 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-12-28 02:03:48,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:49,045 INFO L225 Difference]: With dead ends: 38697 [2019-12-28 02:03:49,045 INFO L226 Difference]: Without dead ends: 38249 [2019-12-28 02:03:49,046 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 02:03:49,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38249 states. [2019-12-28 02:03:51,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38249 to 32952. [2019-12-28 02:03:51,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32952 states. [2019-12-28 02:03:51,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32952 states to 32952 states and 120529 transitions. [2019-12-28 02:03:51,703 INFO L78 Accepts]: Start accepts. Automaton has 32952 states and 120529 transitions. Word has length 49 [2019-12-28 02:03:51,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:51,707 INFO L462 AbstractCegarLoop]: Abstraction has 32952 states and 120529 transitions. [2019-12-28 02:03:51,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:03:51,707 INFO L276 IsEmpty]: Start isEmpty. Operand 32952 states and 120529 transitions. [2019-12-28 02:03:51,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-28 02:03:51,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:51,716 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:03:51,716 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:51,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:51,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1781202873, now seen corresponding path program 1 times [2019-12-28 02:03:51,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:51,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749072610] [2019-12-28 02:03:51,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:51,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:03:51,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749072610] [2019-12-28 02:03:51,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:51,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 02:03:51,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2087905904] [2019-12-28 02:03:51,792 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:51,799 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:51,811 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 139 transitions. [2019-12-28 02:03:51,811 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:51,869 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 02:03:51,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:03:51,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:51,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:03:51,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:03:51,872 INFO L87 Difference]: Start difference. First operand 32952 states and 120529 transitions. Second operand 5 states. [2019-12-28 02:03:52,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:52,149 INFO L93 Difference]: Finished difference Result 42413 states and 152020 transitions. [2019-12-28 02:03:52,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 02:03:52,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-28 02:03:52,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:52,274 INFO L225 Difference]: With dead ends: 42413 [2019-12-28 02:03:52,274 INFO L226 Difference]: Without dead ends: 42413 [2019-12-28 02:03:52,274 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 02:03:52,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42413 states. [2019-12-28 02:03:53,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42413 to 37666. [2019-12-28 02:03:53,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37666 states. [2019-12-28 02:03:53,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37666 states to 37666 states and 136333 transitions. [2019-12-28 02:03:53,732 INFO L78 Accepts]: Start accepts. Automaton has 37666 states and 136333 transitions. Word has length 51 [2019-12-28 02:03:53,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:53,732 INFO L462 AbstractCegarLoop]: Abstraction has 37666 states and 136333 transitions. [2019-12-28 02:03:53,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:03:53,733 INFO L276 IsEmpty]: Start isEmpty. Operand 37666 states and 136333 transitions. [2019-12-28 02:03:53,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 02:03:53,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:53,750 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:03:53,751 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:53,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:53,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1972041490, now seen corresponding path program 1 times [2019-12-28 02:03:53,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:53,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930669916] [2019-12-28 02:03:53,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:53,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:03:53,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930669916] [2019-12-28 02:03:53,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:53,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:03:53,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1799800230] [2019-12-28 02:03:53,836 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:53,844 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:53,863 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 116 states and 175 transitions. [2019-12-28 02:03:53,863 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:53,927 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 02:03:53,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 02:03:53,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:53,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 02:03:53,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:03:53,929 INFO L87 Difference]: Start difference. First operand 37666 states and 136333 transitions. Second operand 8 states. [2019-12-28 02:03:55,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:55,753 INFO L93 Difference]: Finished difference Result 48757 states and 172982 transitions. [2019-12-28 02:03:55,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 02:03:55,753 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-28 02:03:55,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:55,919 INFO L225 Difference]: With dead ends: 48757 [2019-12-28 02:03:55,919 INFO L226 Difference]: Without dead ends: 48237 [2019-12-28 02:03:55,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-28 02:03:56,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48237 states. [2019-12-28 02:03:57,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48237 to 38230. [2019-12-28 02:03:57,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38230 states. [2019-12-28 02:03:57,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38230 states to 38230 states and 138496 transitions. [2019-12-28 02:03:57,156 INFO L78 Accepts]: Start accepts. Automaton has 38230 states and 138496 transitions. Word has length 55 [2019-12-28 02:03:57,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:57,157 INFO L462 AbstractCegarLoop]: Abstraction has 38230 states and 138496 transitions. [2019-12-28 02:03:57,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 02:03:57,157 INFO L276 IsEmpty]: Start isEmpty. Operand 38230 states and 138496 transitions. [2019-12-28 02:03:57,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 02:03:57,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:57,172 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:03:57,172 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:57,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:57,173 INFO L82 PathProgramCache]: Analyzing trace with hash 305776006, now seen corresponding path program 1 times [2019-12-28 02:03:57,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:57,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003054273] [2019-12-28 02:03:57,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:57,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:03:57,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003054273] [2019-12-28 02:03:57,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:57,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:03:57,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [983346455] [2019-12-28 02:03:57,317 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:57,324 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:57,331 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 59 transitions. [2019-12-28 02:03:57,331 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:57,360 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 02:03:57,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 02:03:57,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:57,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 02:03:57,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:03:57,361 INFO L87 Difference]: Start difference. First operand 38230 states and 138496 transitions. Second operand 8 states. [2019-12-28 02:03:58,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:58,305 INFO L93 Difference]: Finished difference Result 53006 states and 189572 transitions. [2019-12-28 02:03:58,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 02:03:58,306 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-28 02:03:58,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:58,409 INFO L225 Difference]: With dead ends: 53006 [2019-12-28 02:03:58,409 INFO L226 Difference]: Without dead ends: 52030 [2019-12-28 02:03:58,410 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 02:03:58,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52030 states. [2019-12-28 02:03:59,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52030 to 48783. [2019-12-28 02:03:59,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48783 states. [2019-12-28 02:03:59,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48783 states to 48783 states and 175227 transitions. [2019-12-28 02:03:59,737 INFO L78 Accepts]: Start accepts. Automaton has 48783 states and 175227 transitions. Word has length 55 [2019-12-28 02:03:59,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:59,738 INFO L462 AbstractCegarLoop]: Abstraction has 48783 states and 175227 transitions. [2019-12-28 02:03:59,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 02:03:59,738 INFO L276 IsEmpty]: Start isEmpty. Operand 48783 states and 175227 transitions. [2019-12-28 02:03:59,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 02:03:59,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:59,755 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:03:59,755 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:59,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:59,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1491175353, now seen corresponding path program 1 times [2019-12-28 02:03:59,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:59,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877218835] [2019-12-28 02:03:59,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:59,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:03:59,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877218835] [2019-12-28 02:03:59,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:59,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 02:03:59,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1488555995] [2019-12-28 02:03:59,866 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:59,872 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:59,879 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 59 transitions. [2019-12-28 02:03:59,879 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:59,900 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 02:03:59,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 02:03:59,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:59,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 02:03:59,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:03:59,901 INFO L87 Difference]: Start difference. First operand 48783 states and 175227 transitions. Second operand 9 states. [2019-12-28 02:04:02,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:02,385 INFO L93 Difference]: Finished difference Result 70898 states and 244524 transitions. [2019-12-28 02:04:02,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 02:04:02,385 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-28 02:04:02,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:02,542 INFO L225 Difference]: With dead ends: 70898 [2019-12-28 02:04:02,542 INFO L226 Difference]: Without dead ends: 70898 [2019-12-28 02:04:02,543 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 02:04:02,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70898 states. [2019-12-28 02:04:03,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70898 to 57891. [2019-12-28 02:04:03,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57891 states. [2019-12-28 02:04:03,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57891 states to 57891 states and 203151 transitions. [2019-12-28 02:04:03,831 INFO L78 Accepts]: Start accepts. Automaton has 57891 states and 203151 transitions. Word has length 55 [2019-12-28 02:04:03,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:03,832 INFO L462 AbstractCegarLoop]: Abstraction has 57891 states and 203151 transitions. [2019-12-28 02:04:03,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 02:04:03,832 INFO L276 IsEmpty]: Start isEmpty. Operand 57891 states and 203151 transitions. [2019-12-28 02:04:03,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 02:04:03,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:03,845 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:03,845 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:03,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:03,846 INFO L82 PathProgramCache]: Analyzing trace with hash -603671672, now seen corresponding path program 1 times [2019-12-28 02:04:03,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:03,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373086987] [2019-12-28 02:04:03,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:03,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:04:03,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373086987] [2019-12-28 02:04:03,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:03,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 02:04:03,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2138590841] [2019-12-28 02:04:03,907 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:03,914 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:03,921 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 59 transitions. [2019-12-28 02:04:03,921 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:03,921 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:04:03,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 02:04:03,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:03,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 02:04:03,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 02:04:03,923 INFO L87 Difference]: Start difference. First operand 57891 states and 203151 transitions. Second operand 3 states. [2019-12-28 02:04:04,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:04,224 INFO L93 Difference]: Finished difference Result 43857 states and 152834 transitions. [2019-12-28 02:04:04,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 02:04:04,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-28 02:04:04,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:04,348 INFO L225 Difference]: With dead ends: 43857 [2019-12-28 02:04:04,349 INFO L226 Difference]: Without dead ends: 43353 [2019-12-28 02:04:04,349 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 02:04:04,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43353 states. [2019-12-28 02:04:05,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43353 to 41887. [2019-12-28 02:04:05,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41887 states. [2019-12-28 02:04:05,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41887 states to 41887 states and 146705 transitions. [2019-12-28 02:04:05,710 INFO L78 Accepts]: Start accepts. Automaton has 41887 states and 146705 transitions. Word has length 55 [2019-12-28 02:04:05,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:05,710 INFO L462 AbstractCegarLoop]: Abstraction has 41887 states and 146705 transitions. [2019-12-28 02:04:05,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 02:04:05,710 INFO L276 IsEmpty]: Start isEmpty. Operand 41887 states and 146705 transitions. [2019-12-28 02:04:05,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-28 02:04:05,721 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:05,721 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:05,721 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:05,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:05,721 INFO L82 PathProgramCache]: Analyzing trace with hash 129391878, now seen corresponding path program 1 times [2019-12-28 02:04:05,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:05,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572130129] [2019-12-28 02:04:05,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:05,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:04:05,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572130129] [2019-12-28 02:04:05,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:05,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:04:05,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1645685105] [2019-12-28 02:04:05,812 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:05,817 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:05,824 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 56 transitions. [2019-12-28 02:04:05,825 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:05,825 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:04:05,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:04:05,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:05,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:04:05,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:04:05,826 INFO L87 Difference]: Start difference. First operand 41887 states and 146705 transitions. Second operand 6 states. [2019-12-28 02:04:06,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:06,546 INFO L93 Difference]: Finished difference Result 54550 states and 184835 transitions. [2019-12-28 02:04:06,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:04:06,547 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-28 02:04:06,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:06,651 INFO L225 Difference]: With dead ends: 54550 [2019-12-28 02:04:06,651 INFO L226 Difference]: Without dead ends: 54550 [2019-12-28 02:04:06,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:04:06,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54550 states. [2019-12-28 02:04:09,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54550 to 45862. [2019-12-28 02:04:09,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45862 states. [2019-12-28 02:04:09,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45862 states to 45862 states and 158168 transitions. [2019-12-28 02:04:09,545 INFO L78 Accepts]: Start accepts. Automaton has 45862 states and 158168 transitions. Word has length 56 [2019-12-28 02:04:09,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:09,546 INFO L462 AbstractCegarLoop]: Abstraction has 45862 states and 158168 transitions. [2019-12-28 02:04:09,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:04:09,546 INFO L276 IsEmpty]: Start isEmpty. Operand 45862 states and 158168 transitions. [2019-12-28 02:04:09,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-28 02:04:09,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:09,556 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:09,556 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:09,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:09,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1016895559, now seen corresponding path program 1 times [2019-12-28 02:04:09,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:09,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479424114] [2019-12-28 02:04:09,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:09,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:04:09,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479424114] [2019-12-28 02:04:09,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:09,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:04:09,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1857857534] [2019-12-28 02:04:09,615 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:09,621 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:09,627 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 56 transitions. [2019-12-28 02:04:09,628 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:09,628 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:04:09,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:04:09,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:09,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:04:09,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:04:09,629 INFO L87 Difference]: Start difference. First operand 45862 states and 158168 transitions. Second operand 4 states. [2019-12-28 02:04:09,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:09,681 INFO L93 Difference]: Finished difference Result 8164 states and 24872 transitions. [2019-12-28 02:04:09,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 02:04:09,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-28 02:04:09,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:09,694 INFO L225 Difference]: With dead ends: 8164 [2019-12-28 02:04:09,694 INFO L226 Difference]: Without dead ends: 6755 [2019-12-28 02:04:09,694 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 02:04:09,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6755 states. [2019-12-28 02:04:09,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6755 to 6707. [2019-12-28 02:04:09,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6707 states. [2019-12-28 02:04:09,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6707 states to 6707 states and 20041 transitions. [2019-12-28 02:04:09,776 INFO L78 Accepts]: Start accepts. Automaton has 6707 states and 20041 transitions. Word has length 56 [2019-12-28 02:04:09,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:09,776 INFO L462 AbstractCegarLoop]: Abstraction has 6707 states and 20041 transitions. [2019-12-28 02:04:09,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:04:09,776 INFO L276 IsEmpty]: Start isEmpty. Operand 6707 states and 20041 transitions. [2019-12-28 02:04:09,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-28 02:04:09,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:09,780 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] [2019-12-28 02:04:09,780 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:09,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:09,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1220452560, now seen corresponding path program 1 times [2019-12-28 02:04:09,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:09,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443698682] [2019-12-28 02:04:09,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:09,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:04:09,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443698682] [2019-12-28 02:04:09,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:09,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:04:09,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [37795963] [2019-12-28 02:04:09,837 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:09,847 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:09,873 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 201 transitions. [2019-12-28 02:04:09,874 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:09,889 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:04:09,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:04:09,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:09,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:04:09,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:04:09,891 INFO L87 Difference]: Start difference. First operand 6707 states and 20041 transitions. Second operand 5 states. [2019-12-28 02:04:10,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:10,053 INFO L93 Difference]: Finished difference Result 7892 states and 23390 transitions. [2019-12-28 02:04:10,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 02:04:10,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-28 02:04:10,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:10,068 INFO L225 Difference]: With dead ends: 7892 [2019-12-28 02:04:10,068 INFO L226 Difference]: Without dead ends: 7892 [2019-12-28 02:04:10,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:04:10,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7892 states. [2019-12-28 02:04:10,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7892 to 7214. [2019-12-28 02:04:10,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7214 states. [2019-12-28 02:04:10,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7214 states to 7214 states and 21447 transitions. [2019-12-28 02:04:10,166 INFO L78 Accepts]: Start accepts. Automaton has 7214 states and 21447 transitions. Word has length 65 [2019-12-28 02:04:10,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:10,166 INFO L462 AbstractCegarLoop]: Abstraction has 7214 states and 21447 transitions. [2019-12-28 02:04:10,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:04:10,166 INFO L276 IsEmpty]: Start isEmpty. Operand 7214 states and 21447 transitions. [2019-12-28 02:04:10,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-28 02:04:10,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:10,171 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] [2019-12-28 02:04:10,171 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:10,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:10,171 INFO L82 PathProgramCache]: Analyzing trace with hash 522357775, now seen corresponding path program 1 times [2019-12-28 02:04:10,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:10,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894538960] [2019-12-28 02:04:10,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:10,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:04:10,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894538960] [2019-12-28 02:04:10,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:10,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:04:10,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2123536749] [2019-12-28 02:04:10,254 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:10,263 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:10,300 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 201 transitions. [2019-12-28 02:04:10,301 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:10,327 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:04:10,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:04:10,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:10,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:04:10,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:04:10,331 INFO L87 Difference]: Start difference. First operand 7214 states and 21447 transitions. Second operand 7 states. [2019-12-28 02:04:10,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:10,786 INFO L93 Difference]: Finished difference Result 9269 states and 27196 transitions. [2019-12-28 02:04:10,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 02:04:10,787 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-28 02:04:10,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:10,803 INFO L225 Difference]: With dead ends: 9269 [2019-12-28 02:04:10,803 INFO L226 Difference]: Without dead ends: 9221 [2019-12-28 02:04:10,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-28 02:04:10,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9221 states. [2019-12-28 02:04:10,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9221 to 8053. [2019-12-28 02:04:10,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8053 states. [2019-12-28 02:04:10,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8053 states to 8053 states and 23827 transitions. [2019-12-28 02:04:10,920 INFO L78 Accepts]: Start accepts. Automaton has 8053 states and 23827 transitions. Word has length 65 [2019-12-28 02:04:10,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:10,921 INFO L462 AbstractCegarLoop]: Abstraction has 8053 states and 23827 transitions. [2019-12-28 02:04:10,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:04:10,921 INFO L276 IsEmpty]: Start isEmpty. Operand 8053 states and 23827 transitions. [2019-12-28 02:04:10,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:04:10,927 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:10,927 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:10,927 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:10,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:10,927 INFO L82 PathProgramCache]: Analyzing trace with hash -136850981, now seen corresponding path program 1 times [2019-12-28 02:04:10,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:10,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543342666] [2019-12-28 02:04:10,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:11,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:04:11,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543342666] [2019-12-28 02:04:11,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:11,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:04:11,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2077361567] [2019-12-28 02:04:11,005 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:11,018 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:11,031 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 02:04:11,032 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:11,032 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:04:11,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:04:11,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:11,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:04:11,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:04:11,033 INFO L87 Difference]: Start difference. First operand 8053 states and 23827 transitions. Second operand 4 states. [2019-12-28 02:04:11,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:11,262 INFO L93 Difference]: Finished difference Result 10666 states and 31176 transitions. [2019-12-28 02:04:11,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 02:04:11,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-28 02:04:11,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:11,280 INFO L225 Difference]: With dead ends: 10666 [2019-12-28 02:04:11,280 INFO L226 Difference]: Without dead ends: 10666 [2019-12-28 02:04:11,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:04:11,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10666 states. [2019-12-28 02:04:11,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10666 to 9076. [2019-12-28 02:04:11,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9076 states. [2019-12-28 02:04:11,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9076 states to 9076 states and 26646 transitions. [2019-12-28 02:04:11,393 INFO L78 Accepts]: Start accepts. Automaton has 9076 states and 26646 transitions. Word has length 69 [2019-12-28 02:04:11,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:11,393 INFO L462 AbstractCegarLoop]: Abstraction has 9076 states and 26646 transitions. [2019-12-28 02:04:11,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:04:11,393 INFO L276 IsEmpty]: Start isEmpty. Operand 9076 states and 26646 transitions. [2019-12-28 02:04:11,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:04:11,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:11,401 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:11,401 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:11,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:11,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1107913500, now seen corresponding path program 1 times [2019-12-28 02:04:11,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:11,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803763724] [2019-12-28 02:04:11,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:11,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:04:11,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803763724] [2019-12-28 02:04:11,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:11,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:04:11,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1752391309] [2019-12-28 02:04:11,468 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:11,479 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:11,492 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 02:04:11,492 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:11,493 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:04:11,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:04:11,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:11,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:04:11,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:04:11,494 INFO L87 Difference]: Start difference. First operand 9076 states and 26646 transitions. Second operand 6 states. [2019-12-28 02:04:12,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:12,544 INFO L93 Difference]: Finished difference Result 17149 states and 50035 transitions. [2019-12-28 02:04:12,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 02:04:12,545 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-28 02:04:12,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:12,570 INFO L225 Difference]: With dead ends: 17149 [2019-12-28 02:04:12,571 INFO L226 Difference]: Without dead ends: 17149 [2019-12-28 02:04:12,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-28 02:04:12,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17149 states. [2019-12-28 02:04:12,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17149 to 12308. [2019-12-28 02:04:12,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12308 states. [2019-12-28 02:04:12,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12308 states to 12308 states and 35903 transitions. [2019-12-28 02:04:12,756 INFO L78 Accepts]: Start accepts. Automaton has 12308 states and 35903 transitions. Word has length 69 [2019-12-28 02:04:12,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:12,756 INFO L462 AbstractCegarLoop]: Abstraction has 12308 states and 35903 transitions. [2019-12-28 02:04:12,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:04:12,756 INFO L276 IsEmpty]: Start isEmpty. Operand 12308 states and 35903 transitions. [2019-12-28 02:04:12,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:04:12,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:12,769 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:12,769 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:12,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:12,770 INFO L82 PathProgramCache]: Analyzing trace with hash 597379323, now seen corresponding path program 1 times [2019-12-28 02:04:12,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:12,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347366406] [2019-12-28 02:04:12,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:12,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:04:12,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347366406] [2019-12-28 02:04:12,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:12,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 02:04:12,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1696108472] [2019-12-28 02:04:12,855 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:12,868 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:12,882 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 02:04:12,882 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:12,882 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:04:12,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:04:12,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:12,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:04:12,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:04:12,883 INFO L87 Difference]: Start difference. First operand 12308 states and 35903 transitions. Second operand 7 states. [2019-12-28 02:04:14,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:14,249 INFO L93 Difference]: Finished difference Result 17995 states and 52090 transitions. [2019-12-28 02:04:14,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-28 02:04:14,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-12-28 02:04:14,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:14,275 INFO L225 Difference]: With dead ends: 17995 [2019-12-28 02:04:14,275 INFO L226 Difference]: Without dead ends: 17638 [2019-12-28 02:04:14,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-12-28 02:04:14,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17638 states. [2019-12-28 02:04:14,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17638 to 15469. [2019-12-28 02:04:14,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15469 states. [2019-12-28 02:04:14,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15469 states to 15469 states and 45203 transitions. [2019-12-28 02:04:14,501 INFO L78 Accepts]: Start accepts. Automaton has 15469 states and 45203 transitions. Word has length 69 [2019-12-28 02:04:14,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:14,501 INFO L462 AbstractCegarLoop]: Abstraction has 15469 states and 45203 transitions. [2019-12-28 02:04:14,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:04:14,502 INFO L276 IsEmpty]: Start isEmpty. Operand 15469 states and 45203 transitions. [2019-12-28 02:04:14,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:04:14,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:14,516 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:14,516 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:14,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:14,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1199572036, now seen corresponding path program 1 times [2019-12-28 02:04:14,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:14,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158162561] [2019-12-28 02:04:14,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:14,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:04:14,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158162561] [2019-12-28 02:04:14,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:14,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:04:14,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [48871232] [2019-12-28 02:04:14,615 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:14,640 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:14,654 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 02:04:14,654 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:14,654 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:04:14,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:04:14,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:14,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:04:14,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:04:14,655 INFO L87 Difference]: Start difference. First operand 15469 states and 45203 transitions. Second operand 6 states. [2019-12-28 02:04:15,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:15,139 INFO L93 Difference]: Finished difference Result 15470 states and 44822 transitions. [2019-12-28 02:04:15,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:04:15,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-28 02:04:15,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:15,160 INFO L225 Difference]: With dead ends: 15470 [2019-12-28 02:04:15,160 INFO L226 Difference]: Without dead ends: 15470 [2019-12-28 02:04:15,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:04:15,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15470 states. [2019-12-28 02:04:15,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15470 to 15030. [2019-12-28 02:04:15,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15030 states. [2019-12-28 02:04:15,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15030 states to 15030 states and 43684 transitions. [2019-12-28 02:04:15,342 INFO L78 Accepts]: Start accepts. Automaton has 15030 states and 43684 transitions. Word has length 69 [2019-12-28 02:04:15,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:15,342 INFO L462 AbstractCegarLoop]: Abstraction has 15030 states and 43684 transitions. [2019-12-28 02:04:15,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:04:15,342 INFO L276 IsEmpty]: Start isEmpty. Operand 15030 states and 43684 transitions. [2019-12-28 02:04:15,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:04:15,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:15,351 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:15,351 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:15,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:15,351 INFO L82 PathProgramCache]: Analyzing trace with hash -969295843, now seen corresponding path program 1 times [2019-12-28 02:04:15,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:15,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326161559] [2019-12-28 02:04:15,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:15,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:04:15,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326161559] [2019-12-28 02:04:15,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:15,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:04:15,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1955288866] [2019-12-28 02:04:15,665 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:15,689 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:15,703 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 02:04:15,703 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:15,703 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:04:15,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:04:15,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:15,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:04:15,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:04:15,704 INFO L87 Difference]: Start difference. First operand 15030 states and 43684 transitions. Second operand 5 states. [2019-12-28 02:04:16,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:16,117 INFO L93 Difference]: Finished difference Result 19011 states and 54959 transitions. [2019-12-28 02:04:16,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 02:04:16,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-28 02:04:16,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:16,157 INFO L225 Difference]: With dead ends: 19011 [2019-12-28 02:04:16,157 INFO L226 Difference]: Without dead ends: 19011 [2019-12-28 02:04:16,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:04:16,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19011 states. [2019-12-28 02:04:16,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19011 to 16078. [2019-12-28 02:04:16,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16078 states. [2019-12-28 02:04:16,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16078 states to 16078 states and 46402 transitions. [2019-12-28 02:04:16,479 INFO L78 Accepts]: Start accepts. Automaton has 16078 states and 46402 transitions. Word has length 69 [2019-12-28 02:04:16,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:16,479 INFO L462 AbstractCegarLoop]: Abstraction has 16078 states and 46402 transitions. [2019-12-28 02:04:16,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:04:16,479 INFO L276 IsEmpty]: Start isEmpty. Operand 16078 states and 46402 transitions. [2019-12-28 02:04:16,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:04:16,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:16,493 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:16,493 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:16,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:16,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1479830020, now seen corresponding path program 1 times [2019-12-28 02:04:16,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:16,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8689884] [2019-12-28 02:04:16,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:16,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:04:16,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8689884] [2019-12-28 02:04:16,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:16,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:04:16,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [132085717] [2019-12-28 02:04:16,556 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:16,567 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:16,583 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 02:04:16,583 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:16,584 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:04:16,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:04:16,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:16,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:04:16,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:04:16,590 INFO L87 Difference]: Start difference. First operand 16078 states and 46402 transitions. Second operand 4 states. [2019-12-28 02:04:17,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:17,271 INFO L93 Difference]: Finished difference Result 19504 states and 56336 transitions. [2019-12-28 02:04:17,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 02:04:17,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-28 02:04:17,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:17,319 INFO L225 Difference]: With dead ends: 19504 [2019-12-28 02:04:17,319 INFO L226 Difference]: Without dead ends: 19129 [2019-12-28 02:04:17,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:04:17,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19129 states. [2019-12-28 02:04:17,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19129 to 15673. [2019-12-28 02:04:17,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15673 states. [2019-12-28 02:04:17,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15673 states to 15673 states and 45021 transitions. [2019-12-28 02:04:17,684 INFO L78 Accepts]: Start accepts. Automaton has 15673 states and 45021 transitions. Word has length 69 [2019-12-28 02:04:17,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:17,684 INFO L462 AbstractCegarLoop]: Abstraction has 15673 states and 45021 transitions. [2019-12-28 02:04:17,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:04:17,684 INFO L276 IsEmpty]: Start isEmpty. Operand 15673 states and 45021 transitions. [2019-12-28 02:04:17,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:04:17,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:17,700 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:17,701 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:17,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:17,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1018185917, now seen corresponding path program 1 times [2019-12-28 02:04:17,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:17,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105587330] [2019-12-28 02:04:17,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:17,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:04:17,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105587330] [2019-12-28 02:04:17,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:17,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 02:04:17,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1427477025] [2019-12-28 02:04:17,841 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:17,850 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:17,864 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 02:04:17,864 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:17,865 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:04:17,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:04:17,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:17,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:04:17,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:04:17,867 INFO L87 Difference]: Start difference. First operand 15673 states and 45021 transitions. Second operand 7 states. [2019-12-28 02:04:18,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:18,408 INFO L93 Difference]: Finished difference Result 18442 states and 51997 transitions. [2019-12-28 02:04:18,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 02:04:18,409 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-12-28 02:04:18,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:18,433 INFO L225 Difference]: With dead ends: 18442 [2019-12-28 02:04:18,433 INFO L226 Difference]: Without dead ends: 18442 [2019-12-28 02:04:18,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-12-28 02:04:18,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18442 states. [2019-12-28 02:04:18,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18442 to 13249. [2019-12-28 02:04:18,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13249 states. [2019-12-28 02:04:18,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13249 states to 13249 states and 37337 transitions. [2019-12-28 02:04:18,624 INFO L78 Accepts]: Start accepts. Automaton has 13249 states and 37337 transitions. Word has length 69 [2019-12-28 02:04:18,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:18,624 INFO L462 AbstractCegarLoop]: Abstraction has 13249 states and 37337 transitions. [2019-12-28 02:04:18,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:04:18,624 INFO L276 IsEmpty]: Start isEmpty. Operand 13249 states and 37337 transitions. [2019-12-28 02:04:18,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:04:18,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:18,633 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:18,633 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:18,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:18,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1905689598, now seen corresponding path program 1 times [2019-12-28 02:04:18,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:18,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36847339] [2019-12-28 02:04:18,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:18,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:04:18,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36847339] [2019-12-28 02:04:18,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:18,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:04:18,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2114332013] [2019-12-28 02:04:18,707 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:18,716 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:18,731 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 02:04:18,731 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:18,731 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:04:18,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:04:18,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:18,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:04:18,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:04:18,732 INFO L87 Difference]: Start difference. First operand 13249 states and 37337 transitions. Second operand 5 states. [2019-12-28 02:04:18,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:18,782 INFO L93 Difference]: Finished difference Result 4414 states and 10777 transitions. [2019-12-28 02:04:18,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 02:04:18,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-28 02:04:18,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:18,789 INFO L225 Difference]: With dead ends: 4414 [2019-12-28 02:04:18,789 INFO L226 Difference]: Without dead ends: 3669 [2019-12-28 02:04:18,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:04:18,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3669 states. [2019-12-28 02:04:18,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3669 to 2984. [2019-12-28 02:04:18,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2984 states. [2019-12-28 02:04:18,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2984 states to 2984 states and 7116 transitions. [2019-12-28 02:04:18,837 INFO L78 Accepts]: Start accepts. Automaton has 2984 states and 7116 transitions. Word has length 69 [2019-12-28 02:04:18,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:18,837 INFO L462 AbstractCegarLoop]: Abstraction has 2984 states and 7116 transitions. [2019-12-28 02:04:18,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:04:18,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2984 states and 7116 transitions. [2019-12-28 02:04:18,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 02:04:18,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:18,842 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:18,842 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:18,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:18,842 INFO L82 PathProgramCache]: Analyzing trace with hash -924760562, now seen corresponding path program 1 times [2019-12-28 02:04:18,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:18,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260105911] [2019-12-28 02:04:18,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:18,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:04:18,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260105911] [2019-12-28 02:04:18,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:18,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:04:18,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1038671583] [2019-12-28 02:04:18,943 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:18,961 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:19,023 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 137 states and 178 transitions. [2019-12-28 02:04:19,023 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:19,050 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 02:04:19,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 02:04:19,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:19,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 02:04:19,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:04:19,052 INFO L87 Difference]: Start difference. First operand 2984 states and 7116 transitions. Second operand 8 states. [2019-12-28 02:04:19,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:19,337 INFO L93 Difference]: Finished difference Result 3903 states and 9109 transitions. [2019-12-28 02:04:19,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 02:04:19,337 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 86 [2019-12-28 02:04:19,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:19,343 INFO L225 Difference]: With dead ends: 3903 [2019-12-28 02:04:19,344 INFO L226 Difference]: Without dead ends: 3815 [2019-12-28 02:04:19,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-28 02:04:19,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3815 states. [2019-12-28 02:04:19,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3815 to 2837. [2019-12-28 02:04:19,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2837 states. [2019-12-28 02:04:19,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2837 states to 2837 states and 6640 transitions. [2019-12-28 02:04:19,398 INFO L78 Accepts]: Start accepts. Automaton has 2837 states and 6640 transitions. Word has length 86 [2019-12-28 02:04:19,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:19,398 INFO L462 AbstractCegarLoop]: Abstraction has 2837 states and 6640 transitions. [2019-12-28 02:04:19,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 02:04:19,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2837 states and 6640 transitions. [2019-12-28 02:04:19,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 02:04:19,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:19,401 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:19,401 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:19,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:19,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1292997391, now seen corresponding path program 1 times [2019-12-28 02:04:19,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:19,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573824901] [2019-12-28 02:04:19,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:19,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:04:19,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573824901] [2019-12-28 02:04:19,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:19,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 02:04:19,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [829995999] [2019-12-28 02:04:19,526 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:19,543 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:19,605 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 137 states and 178 transitions. [2019-12-28 02:04:19,605 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:19,645 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:04:19,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 02:04:19,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:19,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 02:04:19,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:04:19,646 INFO L87 Difference]: Start difference. First operand 2837 states and 6640 transitions. Second operand 9 states. [2019-12-28 02:04:19,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:19,946 INFO L93 Difference]: Finished difference Result 5594 states and 13194 transitions. [2019-12-28 02:04:19,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 02:04:19,946 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-12-28 02:04:19,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:19,953 INFO L225 Difference]: With dead ends: 5594 [2019-12-28 02:04:19,953 INFO L226 Difference]: Without dead ends: 4907 [2019-12-28 02:04:19,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-12-28 02:04:19,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4907 states. [2019-12-28 02:04:19,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4907 to 3118. [2019-12-28 02:04:19,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3118 states. [2019-12-28 02:04:20,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 7335 transitions. [2019-12-28 02:04:20,001 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 7335 transitions. Word has length 86 [2019-12-28 02:04:20,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:20,001 INFO L462 AbstractCegarLoop]: Abstraction has 3118 states and 7335 transitions. [2019-12-28 02:04:20,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 02:04:20,002 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 7335 transitions. [2019-12-28 02:04:20,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 02:04:20,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:20,007 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:20,007 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:20,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:20,007 INFO L82 PathProgramCache]: Analyzing trace with hash 370955391, now seen corresponding path program 2 times [2019-12-28 02:04:20,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:20,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518191688] [2019-12-28 02:04:20,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:20,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:04:20,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518191688] [2019-12-28 02:04:20,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:20,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 02:04:20,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1859908696] [2019-12-28 02:04:20,156 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:20,176 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:20,227 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 178 transitions. [2019-12-28 02:04:20,227 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:20,345 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 02:04:20,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-28 02:04:20,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:20,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-28 02:04:20,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-28 02:04:20,346 INFO L87 Difference]: Start difference. First operand 3118 states and 7335 transitions. Second operand 12 states. [2019-12-28 02:04:21,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:21,893 INFO L93 Difference]: Finished difference Result 6735 states and 15845 transitions. [2019-12-28 02:04:21,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-28 02:04:21,893 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 86 [2019-12-28 02:04:21,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:21,898 INFO L225 Difference]: With dead ends: 6735 [2019-12-28 02:04:21,899 INFO L226 Difference]: Without dead ends: 3503 [2019-12-28 02:04:21,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=241, Invalid=461, Unknown=0, NotChecked=0, Total=702 [2019-12-28 02:04:21,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3503 states. [2019-12-28 02:04:21,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3503 to 2097. [2019-12-28 02:04:21,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2097 states. [2019-12-28 02:04:21,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 2097 states and 4954 transitions. [2019-12-28 02:04:21,935 INFO L78 Accepts]: Start accepts. Automaton has 2097 states and 4954 transitions. Word has length 86 [2019-12-28 02:04:21,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:21,935 INFO L462 AbstractCegarLoop]: Abstraction has 2097 states and 4954 transitions. [2019-12-28 02:04:21,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-28 02:04:21,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 4954 transitions. [2019-12-28 02:04:21,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 02:04:21,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:21,937 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:21,938 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:21,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:21,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1636502420, now seen corresponding path program 1 times [2019-12-28 02:04:21,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:21,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349019887] [2019-12-28 02:04:21,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:21,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:04:21,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349019887] [2019-12-28 02:04:21,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:21,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:04:21,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1782595321] [2019-12-28 02:04:21,991 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:22,009 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:22,068 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 128 states and 168 transitions. [2019-12-28 02:04:22,069 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:22,098 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-28 02:04:22,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:04:22,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:22,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:04:22,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:04:22,099 INFO L87 Difference]: Start difference. First operand 2097 states and 4954 transitions. Second operand 7 states. [2019-12-28 02:04:23,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:23,000 INFO L93 Difference]: Finished difference Result 3047 states and 6885 transitions. [2019-12-28 02:04:23,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 02:04:23,001 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-12-28 02:04:23,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:23,006 INFO L225 Difference]: With dead ends: 3047 [2019-12-28 02:04:23,006 INFO L226 Difference]: Without dead ends: 3025 [2019-12-28 02:04:23,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-28 02:04:23,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3025 states. [2019-12-28 02:04:23,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3025 to 2127. [2019-12-28 02:04:23,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2127 states. [2019-12-28 02:04:23,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 4849 transitions. [2019-12-28 02:04:23,052 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 4849 transitions. Word has length 86 [2019-12-28 02:04:23,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:23,053 INFO L462 AbstractCegarLoop]: Abstraction has 2127 states and 4849 transitions. [2019-12-28 02:04:23,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:04:23,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 4849 transitions. [2019-12-28 02:04:23,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 02:04:23,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:23,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:23,057 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:23,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:23,058 INFO L82 PathProgramCache]: Analyzing trace with hash -943400723, now seen corresponding path program 1 times [2019-12-28 02:04:23,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:23,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036658987] [2019-12-28 02:04:23,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:23,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:04:23,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036658987] [2019-12-28 02:04:23,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:23,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:04:23,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [338450670] [2019-12-28 02:04:23,184 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:23,204 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:23,259 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 128 states and 168 transitions. [2019-12-28 02:04:23,259 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:23,283 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 02:04:23,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:04:23,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:23,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:04:23,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:04:23,287 INFO L87 Difference]: Start difference. First operand 2127 states and 4849 transitions. Second operand 7 states. [2019-12-28 02:04:23,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:23,831 INFO L93 Difference]: Finished difference Result 2742 states and 6114 transitions. [2019-12-28 02:04:23,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 02:04:23,832 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-12-28 02:04:23,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:23,837 INFO L225 Difference]: With dead ends: 2742 [2019-12-28 02:04:23,837 INFO L226 Difference]: Without dead ends: 2742 [2019-12-28 02:04:23,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:04:23,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2742 states. [2019-12-28 02:04:23,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2742 to 2272. [2019-12-28 02:04:23,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2272 states. [2019-12-28 02:04:23,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 5114 transitions. [2019-12-28 02:04:23,884 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 5114 transitions. Word has length 86 [2019-12-28 02:04:23,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:23,884 INFO L462 AbstractCegarLoop]: Abstraction has 2272 states and 5114 transitions. [2019-12-28 02:04:23,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:04:23,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 5114 transitions. [2019-12-28 02:04:23,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 02:04:23,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:23,888 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:23,889 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:23,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:23,889 INFO L82 PathProgramCache]: Analyzing trace with hash -881687860, now seen corresponding path program 1 times [2019-12-28 02:04:23,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:23,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199416530] [2019-12-28 02:04:23,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:24,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:04:24,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199416530] [2019-12-28 02:04:24,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:24,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 02:04:24,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [871949568] [2019-12-28 02:04:24,056 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:24,075 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:24,146 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 135 states and 182 transitions. [2019-12-28 02:04:24,147 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:24,237 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 02:04:24,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 02:04:24,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:24,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 02:04:24,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-28 02:04:24,238 INFO L87 Difference]: Start difference. First operand 2272 states and 5114 transitions. Second operand 11 states. [2019-12-28 02:04:25,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:25,788 INFO L93 Difference]: Finished difference Result 2988 states and 6667 transitions. [2019-12-28 02:04:25,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-28 02:04:25,789 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 86 [2019-12-28 02:04:25,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:25,793 INFO L225 Difference]: With dead ends: 2988 [2019-12-28 02:04:25,793 INFO L226 Difference]: Without dead ends: 2988 [2019-12-28 02:04:25,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2019-12-28 02:04:25,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2988 states. [2019-12-28 02:04:25,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2988 to 2269. [2019-12-28 02:04:25,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2269 states. [2019-12-28 02:04:25,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2269 states to 2269 states and 5108 transitions. [2019-12-28 02:04:25,818 INFO L78 Accepts]: Start accepts. Automaton has 2269 states and 5108 transitions. Word has length 86 [2019-12-28 02:04:25,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:25,818 INFO L462 AbstractCegarLoop]: Abstraction has 2269 states and 5108 transitions. [2019-12-28 02:04:25,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 02:04:25,818 INFO L276 IsEmpty]: Start isEmpty. Operand 2269 states and 5108 transitions. [2019-12-28 02:04:25,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 02:04:25,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:25,820 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:25,820 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:25,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:25,821 INFO L82 PathProgramCache]: Analyzing trace with hash 5815821, now seen corresponding path program 3 times [2019-12-28 02:04:25,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:25,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553923708] [2019-12-28 02:04:25,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:25,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:04:25,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553923708] [2019-12-28 02:04:25,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:25,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-28 02:04:25,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1994701721] [2019-12-28 02:04:25,949 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:25,966 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:26,032 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 135 states and 182 transitions. [2019-12-28 02:04:26,032 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:26,065 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 02:04:26,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 02:04:26,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:26,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 02:04:26,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-28 02:04:26,066 INFO L87 Difference]: Start difference. First operand 2269 states and 5108 transitions. Second operand 11 states. [2019-12-28 02:04:26,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:26,907 INFO L93 Difference]: Finished difference Result 4481 states and 9988 transitions. [2019-12-28 02:04:26,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-28 02:04:26,908 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 86 [2019-12-28 02:04:26,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:26,912 INFO L225 Difference]: With dead ends: 4481 [2019-12-28 02:04:26,913 INFO L226 Difference]: Without dead ends: 2991 [2019-12-28 02:04:26,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2019-12-28 02:04:26,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2019-12-28 02:04:26,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 2347. [2019-12-28 02:04:26,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2347 states. [2019-12-28 02:04:26,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 5202 transitions. [2019-12-28 02:04:26,936 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 5202 transitions. Word has length 86 [2019-12-28 02:04:26,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:26,936 INFO L462 AbstractCegarLoop]: Abstraction has 2347 states and 5202 transitions. [2019-12-28 02:04:26,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 02:04:26,936 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 5202 transitions. [2019-12-28 02:04:26,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 02:04:26,938 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:26,938 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:26,938 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:26,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:26,939 INFO L82 PathProgramCache]: Analyzing trace with hash 64546379, now seen corresponding path program 4 times [2019-12-28 02:04:26,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:26,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551190035] [2019-12-28 02:04:26,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 02:04:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 02:04:27,030 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 02:04:27,030 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 02:04:27,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 02:04:27 BasicIcfg [2019-12-28 02:04:27,217 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 02:04:27,219 INFO L168 Benchmark]: Toolchain (without parser) took 48999.97 ms. Allocated memory was 136.3 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 99.6 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 964.7 MB. Max. memory is 7.1 GB. [2019-12-28 02:04:27,219 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 136.3 MB. Free memory is still 119.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-28 02:04:27,220 INFO L168 Benchmark]: CACSL2BoogieTranslator took 748.13 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 99.2 MB in the beginning and 152.4 MB in the end (delta: -53.2 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-12-28 02:04:27,221 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.25 ms. Allocated memory is still 200.3 MB. Free memory was 152.4 MB in the beginning and 150.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-28 02:04:27,221 INFO L168 Benchmark]: Boogie Preprocessor took 44.42 ms. Allocated memory is still 200.3 MB. Free memory was 150.3 MB in the beginning and 148.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-28 02:04:27,221 INFO L168 Benchmark]: RCFGBuilder took 749.09 ms. Allocated memory is still 200.3 MB. Free memory was 148.2 MB in the beginning and 106.6 MB in the end (delta: 41.7 MB). Peak memory consumption was 41.7 MB. Max. memory is 7.1 GB. [2019-12-28 02:04:27,222 INFO L168 Benchmark]: TraceAbstraction took 47387.81 ms. Allocated memory was 200.3 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 105.5 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 906.6 MB. Max. memory is 7.1 GB. [2019-12-28 02:04:27,224 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.17 ms. Allocated memory is still 136.3 MB. Free memory is still 119.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 748.13 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 99.2 MB in the beginning and 152.4 MB in the end (delta: -53.2 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.25 ms. Allocated memory is still 200.3 MB. Free memory was 152.4 MB in the beginning and 150.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.42 ms. Allocated memory is still 200.3 MB. Free memory was 150.3 MB in the beginning and 148.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 749.09 ms. Allocated memory is still 200.3 MB. Free memory was 148.2 MB in the beginning and 106.6 MB in the end (delta: 41.7 MB). Peak memory consumption was 41.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 47387.81 ms. Allocated memory was 200.3 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 105.5 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 906.6 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] [L723] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L724] 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, z=0] [L725] 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, z=0] [L799] 0 pthread_t t903; 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, z=0] [L800] FCALL, FORK 0 pthread_create(&t903, ((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, z=0] [L801] 0 pthread_t t904; 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, z=0] [L802] FCALL, FORK 0 pthread_create(&t904, ((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, z=0] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 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, z=0] [L762] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L763] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L764] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L765] 2 x$r_buff0_thd2 = (_Bool)1 [L768] 2 y = 1 [L771] 2 __unbuffered_p1_EAX = y [L774] 2 __unbuffered_p1_EBX = z 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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L729] 1 z = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 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, z=1] [L736] 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, z=1] [L777] 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) [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used 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=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=1, z=1] [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 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 [!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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L736] 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) [L779] 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 [L780] EXPR 2 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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L780] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L781] 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 [L784] 2 __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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L737] 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=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, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L737] 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)) [L738] 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=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, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L738] 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)) [L739] 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=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, 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))=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L739] 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)) [L740] 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=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, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L740] 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)) [L741] 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=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, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] 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)) [L742] 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=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, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 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)) [L743] 1 __unbuffered_p0_EAX = 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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L744] EXPR 1 x$flush_delayed ? x$mem_tmp : 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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L744] 1 x = x$flush_delayed ? x$mem_tmp : x [L745] 1 x$flush_delayed = (_Bool)0 [L750] 1 __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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L804] 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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L809] 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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L810] 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 [L811] 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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L811] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L812] 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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L812] 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 [L815] 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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 47.0s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 22.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7567 SDtfs, 11031 SDslu, 21338 SDs, 0 SdLazy, 9118 SolverSat, 521 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 371 GetRequests, 110 SyntacticMatches, 16 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57891occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.4s AutomataMinimizationTime, 27 MinimizatonAttempts, 78145 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1890 NumberOfCodeBlocks, 1890 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1777 ConstructedInterpolants, 0 QuantifiedInterpolants, 359247 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...