/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/rfi003_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 03:45:10,950 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 03:45:10,952 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 03:45:10,965 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 03:45:10,966 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 03:45:10,967 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 03:45:10,968 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 03:45:10,970 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 03:45:10,972 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 03:45:10,973 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 03:45:10,974 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 03:45:10,975 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 03:45:10,975 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 03:45:10,976 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 03:45:10,977 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 03:45:10,978 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 03:45:10,979 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 03:45:10,980 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 03:45:10,982 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 03:45:10,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 03:45:10,985 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 03:45:10,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 03:45:10,988 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 03:45:10,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 03:45:10,991 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 03:45:10,991 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 03:45:10,991 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 03:45:10,992 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 03:45:10,992 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 03:45:10,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 03:45:10,994 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 03:45:10,994 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 03:45:10,995 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 03:45:10,996 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 03:45:10,997 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 03:45:10,997 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 03:45:10,998 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 03:45:10,998 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 03:45:10,998 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 03:45:10,999 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 03:45:11,000 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 03:45:11,000 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 03:45:11,015 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 03:45:11,015 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 03:45:11,018 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 03:45:11,018 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 03:45:11,018 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 03:45:11,019 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 03:45:11,019 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 03:45:11,020 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 03:45:11,020 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 03:45:11,020 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 03:45:11,020 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 03:45:11,020 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 03:45:11,021 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 03:45:11,021 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 03:45:11,021 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 03:45:11,021 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 03:45:11,021 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 03:45:11,021 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 03:45:11,023 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 03:45:11,023 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 03:45:11,023 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 03:45:11,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 03:45:11,024 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 03:45:11,024 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 03:45:11,024 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 03:45:11,024 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 03:45:11,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 03:45:11,025 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 03:45:11,025 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 03:45:11,025 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 03:45:11,026 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 03:45:11,027 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 03:45:11,323 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 03:45:11,337 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 03:45:11,341 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 03:45:11,343 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 03:45:11,343 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 03:45:11,344 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.opt.i [2019-12-28 03:45:11,418 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0b7bd57c/c4274c0227e94f4fa8ab17b1e1707dd4/FLAGc92555021 [2019-12-28 03:45:12,060 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 03:45:12,061 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_power.opt.i [2019-12-28 03:45:12,088 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0b7bd57c/c4274c0227e94f4fa8ab17b1e1707dd4/FLAGc92555021 [2019-12-28 03:45:12,248 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0b7bd57c/c4274c0227e94f4fa8ab17b1e1707dd4 [2019-12-28 03:45:12,259 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 03:45:12,261 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 03:45:12,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 03:45:12,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 03:45:12,266 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 03:45:12,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:45:12" (1/1) ... [2019-12-28 03:45:12,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e50f93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:45:12, skipping insertion in model container [2019-12-28 03:45:12,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:45:12" (1/1) ... [2019-12-28 03:45:12,279 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 03:45:12,336 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 03:45:12,912 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:45:12,930 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 03:45:13,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:45:13,118 INFO L208 MainTranslator]: Completed translation [2019-12-28 03:45:13,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:45:13 WrapperNode [2019-12-28 03:45:13,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 03:45:13,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 03:45:13,119 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 03:45:13,119 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 03:45:13,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:45:13" (1/1) ... [2019-12-28 03:45:13,151 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:45:13" (1/1) ... [2019-12-28 03:45:13,183 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 03:45:13,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 03:45:13,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 03:45:13,184 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 03:45:13,192 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:45:13" (1/1) ... [2019-12-28 03:45:13,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:45:13" (1/1) ... [2019-12-28 03:45:13,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:45:13" (1/1) ... [2019-12-28 03:45:13,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:45:13" (1/1) ... [2019-12-28 03:45:13,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:45:13" (1/1) ... [2019-12-28 03:45:13,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:45:13" (1/1) ... [2019-12-28 03:45:13,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:45:13" (1/1) ... [2019-12-28 03:45:13,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 03:45:13,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 03:45:13,220 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 03:45:13,220 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 03:45:13,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:45:13" (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 03:45:13,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 03:45:13,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 03:45:13,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 03:45:13,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 03:45:13,283 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 03:45:13,284 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 03:45:13,284 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 03:45:13,284 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 03:45:13,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 03:45:13,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 03:45:13,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 03:45:13,287 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 03:45:14,003 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 03:45:14,004 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 03:45:14,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:45:14 BoogieIcfgContainer [2019-12-28 03:45:14,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 03:45:14,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 03:45:14,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 03:45:14,010 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 03:45:14,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 03:45:12" (1/3) ... [2019-12-28 03:45:14,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28085e51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:45:14, skipping insertion in model container [2019-12-28 03:45:14,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:45:13" (2/3) ... [2019-12-28 03:45:14,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28085e51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:45:14, skipping insertion in model container [2019-12-28 03:45:14,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:45:14" (3/3) ... [2019-12-28 03:45:14,014 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_power.opt.i [2019-12-28 03:45:14,024 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 03:45:14,024 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 03:45:14,032 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 03:45:14,033 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 03:45:14,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,077 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,078 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,102 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,102 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,102 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,103 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,103 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,114 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,115 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,115 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,121 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,122 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:14,144 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 03:45:14,167 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 03:45:14,168 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 03:45:14,168 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 03:45:14,168 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 03:45:14,168 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 03:45:14,168 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 03:45:14,169 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 03:45:14,169 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 03:45:14,184 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 136 places, 164 transitions [2019-12-28 03:45:16,426 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25976 states. [2019-12-28 03:45:16,428 INFO L276 IsEmpty]: Start isEmpty. Operand 25976 states. [2019-12-28 03:45:16,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-28 03:45:16,438 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:16,439 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:45:16,440 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:16,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:16,447 INFO L82 PathProgramCache]: Analyzing trace with hash 2111627556, now seen corresponding path program 1 times [2019-12-28 03:45:16,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:16,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867348080] [2019-12-28 03:45:16,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:16,754 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 03:45:16,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867348080] [2019-12-28 03:45:16,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:16,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:45:16,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1066284772] [2019-12-28 03:45:16,760 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:16,767 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:16,792 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 39 transitions. [2019-12-28 03:45:16,793 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:16,797 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:45:16,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:45:16,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:16,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:45:16,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:45:16,815 INFO L87 Difference]: Start difference. First operand 25976 states. Second operand 4 states. [2019-12-28 03:45:17,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:17,445 INFO L93 Difference]: Finished difference Result 26616 states and 102121 transitions. [2019-12-28 03:45:17,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:45:17,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-28 03:45:17,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:18,462 INFO L225 Difference]: With dead ends: 26616 [2019-12-28 03:45:18,463 INFO L226 Difference]: Without dead ends: 20360 [2019-12-28 03:45:18,465 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 03:45:18,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20360 states. [2019-12-28 03:45:19,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20360 to 20360. [2019-12-28 03:45:19,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20360 states. [2019-12-28 03:45:19,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20360 states to 20360 states and 78425 transitions. [2019-12-28 03:45:19,510 INFO L78 Accepts]: Start accepts. Automaton has 20360 states and 78425 transitions. Word has length 39 [2019-12-28 03:45:19,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:19,510 INFO L462 AbstractCegarLoop]: Abstraction has 20360 states and 78425 transitions. [2019-12-28 03:45:19,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:45:19,511 INFO L276 IsEmpty]: Start isEmpty. Operand 20360 states and 78425 transitions. [2019-12-28 03:45:19,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-28 03:45:19,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:19,524 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:45:19,524 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:19,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:19,525 INFO L82 PathProgramCache]: Analyzing trace with hash 341542856, now seen corresponding path program 1 times [2019-12-28 03:45:19,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:19,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565021556] [2019-12-28 03:45:19,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:19,760 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 03:45:19,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565021556] [2019-12-28 03:45:19,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:19,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:45:19,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1024934114] [2019-12-28 03:45:19,771 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:19,777 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:19,786 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 47 transitions. [2019-12-28 03:45:19,787 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:19,788 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:45:19,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:45:19,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:19,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:45:19,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:45:19,792 INFO L87 Difference]: Start difference. First operand 20360 states and 78425 transitions. Second operand 5 states. [2019-12-28 03:45:20,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:20,852 INFO L93 Difference]: Finished difference Result 31838 states and 116042 transitions. [2019-12-28 03:45:20,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:45:20,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-28 03:45:20,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:20,999 INFO L225 Difference]: With dead ends: 31838 [2019-12-28 03:45:20,999 INFO L226 Difference]: Without dead ends: 31286 [2019-12-28 03:45:21,001 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 03:45:21,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31286 states. [2019-12-28 03:45:22,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31286 to 29705. [2019-12-28 03:45:22,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29705 states. [2019-12-28 03:45:23,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29705 states to 29705 states and 109519 transitions. [2019-12-28 03:45:23,019 INFO L78 Accepts]: Start accepts. Automaton has 29705 states and 109519 transitions. Word has length 47 [2019-12-28 03:45:23,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:23,021 INFO L462 AbstractCegarLoop]: Abstraction has 29705 states and 109519 transitions. [2019-12-28 03:45:23,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:45:23,021 INFO L276 IsEmpty]: Start isEmpty. Operand 29705 states and 109519 transitions. [2019-12-28 03:45:23,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-28 03:45:23,031 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:23,031 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 03:45:23,031 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:23,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:23,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1959299271, now seen corresponding path program 1 times [2019-12-28 03:45:23,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:23,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096224894] [2019-12-28 03:45:23,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:23,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:45:23,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096224894] [2019-12-28 03:45:23,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:23,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:45:23,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [282845714] [2019-12-28 03:45:23,158 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:23,165 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:23,175 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 85 states and 120 transitions. [2019-12-28 03:45:23,175 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:23,238 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:45:23,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:45:23,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:23,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:45:23,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:45:23,239 INFO L87 Difference]: Start difference. First operand 29705 states and 109519 transitions. Second operand 6 states. [2019-12-28 03:45:24,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:24,105 INFO L93 Difference]: Finished difference Result 38696 states and 139691 transitions. [2019-12-28 03:45:24,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:45:24,106 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-12-28 03:45:24,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:24,306 INFO L225 Difference]: With dead ends: 38696 [2019-12-28 03:45:24,306 INFO L226 Difference]: Without dead ends: 38248 [2019-12-28 03:45:24,306 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 03:45:24,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38248 states. [2019-12-28 03:45:26,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38248 to 32951. [2019-12-28 03:45:26,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32951 states. [2019-12-28 03:45:26,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32951 states to 32951 states and 120528 transitions. [2019-12-28 03:45:26,767 INFO L78 Accepts]: Start accepts. Automaton has 32951 states and 120528 transitions. Word has length 48 [2019-12-28 03:45:26,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:26,768 INFO L462 AbstractCegarLoop]: Abstraction has 32951 states and 120528 transitions. [2019-12-28 03:45:26,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:45:26,768 INFO L276 IsEmpty]: Start isEmpty. Operand 32951 states and 120528 transitions. [2019-12-28 03:45:26,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-28 03:45:26,777 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:26,777 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:45:26,777 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:26,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:26,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1720517523, now seen corresponding path program 1 times [2019-12-28 03:45:26,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:26,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946207429] [2019-12-28 03:45:26,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:26,831 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 03:45:26,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946207429] [2019-12-28 03:45:26,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:26,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:45:26,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [492167630] [2019-12-28 03:45:26,833 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:26,839 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:26,851 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 138 transitions. [2019-12-28 03:45:26,851 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:26,925 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 03:45:26,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:45:26,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:26,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:45:26,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:45:26,928 INFO L87 Difference]: Start difference. First operand 32951 states and 120528 transitions. Second operand 5 states. [2019-12-28 03:45:27,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:27,248 INFO L93 Difference]: Finished difference Result 42412 states and 152019 transitions. [2019-12-28 03:45:27,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:45:27,249 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-12-28 03:45:27,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:27,394 INFO L225 Difference]: With dead ends: 42412 [2019-12-28 03:45:27,395 INFO L226 Difference]: Without dead ends: 42412 [2019-12-28 03:45:27,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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 03:45:28,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42412 states. [2019-12-28 03:45:28,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42412 to 37665. [2019-12-28 03:45:28,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37665 states. [2019-12-28 03:45:28,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37665 states to 37665 states and 136332 transitions. [2019-12-28 03:45:28,874 INFO L78 Accepts]: Start accepts. Automaton has 37665 states and 136332 transitions. Word has length 50 [2019-12-28 03:45:28,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:28,875 INFO L462 AbstractCegarLoop]: Abstraction has 37665 states and 136332 transitions. [2019-12-28 03:45:28,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:45:28,875 INFO L276 IsEmpty]: Start isEmpty. Operand 37665 states and 136332 transitions. [2019-12-28 03:45:28,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 03:45:28,893 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:28,893 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:45:28,893 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:28,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:28,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1662860822, now seen corresponding path program 1 times [2019-12-28 03:45:28,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:28,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322756407] [2019-12-28 03:45:28,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:28,978 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 03:45:28,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322756407] [2019-12-28 03:45:28,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:28,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:45:28,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [273150949] [2019-12-28 03:45:28,979 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:28,986 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:29,005 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 115 states and 174 transitions. [2019-12-28 03:45:29,005 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:30,136 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 03:45:30,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:45:30,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:30,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:45:30,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:45:30,138 INFO L87 Difference]: Start difference. First operand 37665 states and 136332 transitions. Second operand 8 states. [2019-12-28 03:45:30,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:30,907 INFO L93 Difference]: Finished difference Result 48756 states and 172981 transitions. [2019-12-28 03:45:30,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 03:45:30,907 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-28 03:45:30,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:31,049 INFO L225 Difference]: With dead ends: 48756 [2019-12-28 03:45:31,050 INFO L226 Difference]: Without dead ends: 48236 [2019-12-28 03:45:31,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-28 03:45:31,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48236 states. [2019-12-28 03:45:32,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48236 to 38229. [2019-12-28 03:45:32,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38229 states. [2019-12-28 03:45:32,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38229 states to 38229 states and 138495 transitions. [2019-12-28 03:45:32,318 INFO L78 Accepts]: Start accepts. Automaton has 38229 states and 138495 transitions. Word has length 54 [2019-12-28 03:45:32,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:32,318 INFO L462 AbstractCegarLoop]: Abstraction has 38229 states and 138495 transitions. [2019-12-28 03:45:32,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:45:32,318 INFO L276 IsEmpty]: Start isEmpty. Operand 38229 states and 138495 transitions. [2019-12-28 03:45:32,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 03:45:32,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:32,333 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:45:32,333 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:32,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:32,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1119592545, now seen corresponding path program 1 times [2019-12-28 03:45:32,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:32,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871001721] [2019-12-28 03:45:32,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:32,383 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 03:45:32,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871001721] [2019-12-28 03:45:32,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:32,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:45:32,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1027797234] [2019-12-28 03:45:32,385 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:32,390 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:32,399 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 58 transitions. [2019-12-28 03:45:32,399 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:32,400 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:45:32,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:45:32,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:32,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:45:32,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:45:32,401 INFO L87 Difference]: Start difference. First operand 38229 states and 138495 transitions. Second operand 3 states. [2019-12-28 03:45:32,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:32,842 INFO L93 Difference]: Finished difference Result 42347 states and 153425 transitions. [2019-12-28 03:45:32,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:45:32,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-28 03:45:32,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:32,941 INFO L225 Difference]: With dead ends: 42347 [2019-12-28 03:45:32,941 INFO L226 Difference]: Without dead ends: 42347 [2019-12-28 03:45:32,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:45:33,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42347 states. [2019-12-28 03:45:33,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42347 to 40235. [2019-12-28 03:45:33,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40235 states. [2019-12-28 03:45:34,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40235 states to 40235 states and 145783 transitions. [2019-12-28 03:45:34,086 INFO L78 Accepts]: Start accepts. Automaton has 40235 states and 145783 transitions. Word has length 54 [2019-12-28 03:45:34,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:34,086 INFO L462 AbstractCegarLoop]: Abstraction has 40235 states and 145783 transitions. [2019-12-28 03:45:34,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:45:34,087 INFO L276 IsEmpty]: Start isEmpty. Operand 40235 states and 145783 transitions. [2019-12-28 03:45:34,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 03:45:34,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:34,100 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:45:34,100 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:34,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:34,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1661323295, now seen corresponding path program 1 times [2019-12-28 03:45:34,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:34,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426406495] [2019-12-28 03:45:34,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:34,256 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 03:45:34,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426406495] [2019-12-28 03:45:34,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:34,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:45:34,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [104521180] [2019-12-28 03:45:34,258 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:34,263 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:34,271 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 58 transitions. [2019-12-28 03:45:34,271 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:34,294 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:45:34,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:45:34,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:34,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:45:34,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:45:34,295 INFO L87 Difference]: Start difference. First operand 40235 states and 145783 transitions. Second operand 8 states. [2019-12-28 03:45:35,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:35,214 INFO L93 Difference]: Finished difference Result 54445 states and 194725 transitions. [2019-12-28 03:45:35,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 03:45:35,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-28 03:45:35,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:35,332 INFO L225 Difference]: With dead ends: 54445 [2019-12-28 03:45:35,332 INFO L226 Difference]: Without dead ends: 53469 [2019-12-28 03:45:35,332 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 03:45:35,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53469 states. [2019-12-28 03:45:36,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53469 to 48782. [2019-12-28 03:45:36,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48782 states. [2019-12-28 03:45:36,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48782 states to 48782 states and 175226 transitions. [2019-12-28 03:45:36,675 INFO L78 Accepts]: Start accepts. Automaton has 48782 states and 175226 transitions. Word has length 54 [2019-12-28 03:45:36,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:36,675 INFO L462 AbstractCegarLoop]: Abstraction has 48782 states and 175226 transitions. [2019-12-28 03:45:36,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:45:36,675 INFO L276 IsEmpty]: Start isEmpty. Operand 48782 states and 175226 transitions. [2019-12-28 03:45:36,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 03:45:36,688 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:36,689 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:45:36,689 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:36,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:36,689 INFO L82 PathProgramCache]: Analyzing trace with hash -135628064, now seen corresponding path program 1 times [2019-12-28 03:45:36,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:36,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890499315] [2019-12-28 03:45:36,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:36,805 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 03:45:36,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890499315] [2019-12-28 03:45:36,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:36,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:45:36,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1111514115] [2019-12-28 03:45:36,806 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:36,812 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:36,818 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 58 transitions. [2019-12-28 03:45:36,818 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:36,847 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:45:36,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 03:45:36,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:36,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 03:45:36,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:45:36,848 INFO L87 Difference]: Start difference. First operand 48782 states and 175226 transitions. Second operand 9 states. [2019-12-28 03:45:38,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:38,336 INFO L93 Difference]: Finished difference Result 70897 states and 244523 transitions. [2019-12-28 03:45:38,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 03:45:38,337 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-28 03:45:38,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:38,489 INFO L225 Difference]: With dead ends: 70897 [2019-12-28 03:45:38,489 INFO L226 Difference]: Without dead ends: 70897 [2019-12-28 03:45:38,490 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 03:45:38,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70897 states. [2019-12-28 03:45:41,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70897 to 57890. [2019-12-28 03:45:41,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57890 states. [2019-12-28 03:45:41,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57890 states to 57890 states and 203150 transitions. [2019-12-28 03:45:41,977 INFO L78 Accepts]: Start accepts. Automaton has 57890 states and 203150 transitions. Word has length 54 [2019-12-28 03:45:41,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:41,977 INFO L462 AbstractCegarLoop]: Abstraction has 57890 states and 203150 transitions. [2019-12-28 03:45:41,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 03:45:41,978 INFO L276 IsEmpty]: Start isEmpty. Operand 57890 states and 203150 transitions. [2019-12-28 03:45:41,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 03:45:41,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:41,991 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:45:41,992 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:41,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:41,992 INFO L82 PathProgramCache]: Analyzing trace with hash 751875617, now seen corresponding path program 1 times [2019-12-28 03:45:41,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:41,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503331419] [2019-12-28 03:45:41,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:42,064 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 03:45:42,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503331419] [2019-12-28 03:45:42,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:42,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:45:42,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1508707784] [2019-12-28 03:45:42,065 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:42,072 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:42,080 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 58 transitions. [2019-12-28 03:45:42,080 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:42,081 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:45:42,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:45:42,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:42,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:45:42,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:45:42,082 INFO L87 Difference]: Start difference. First operand 57890 states and 203150 transitions. Second operand 3 states. [2019-12-28 03:45:42,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:42,262 INFO L93 Difference]: Finished difference Result 43856 states and 152833 transitions. [2019-12-28 03:45:42,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:45:42,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-28 03:45:42,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:42,348 INFO L225 Difference]: With dead ends: 43856 [2019-12-28 03:45:42,348 INFO L226 Difference]: Without dead ends: 43352 [2019-12-28 03:45:42,348 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 03:45:42,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43352 states. [2019-12-28 03:45:42,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43352 to 41886. [2019-12-28 03:45:42,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41886 states. [2019-12-28 03:45:43,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41886 states to 41886 states and 146704 transitions. [2019-12-28 03:45:43,613 INFO L78 Accepts]: Start accepts. Automaton has 41886 states and 146704 transitions. Word has length 54 [2019-12-28 03:45:43,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:43,613 INFO L462 AbstractCegarLoop]: Abstraction has 41886 states and 146704 transitions. [2019-12-28 03:45:43,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:45:43,613 INFO L276 IsEmpty]: Start isEmpty. Operand 41886 states and 146704 transitions. [2019-12-28 03:45:43,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 03:45:43,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:43,625 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 03:45:43,625 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:43,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:43,625 INFO L82 PathProgramCache]: Analyzing trace with hash 807428207, now seen corresponding path program 1 times [2019-12-28 03:45:43,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:43,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127556492] [2019-12-28 03:45:43,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:43,717 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 03:45:43,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127556492] [2019-12-28 03:45:43,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:43,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:45:43,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [973875611] [2019-12-28 03:45:43,718 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:43,723 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:43,728 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 56 states and 55 transitions. [2019-12-28 03:45:43,729 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:43,729 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:45:43,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:45:43,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:43,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:45:43,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:45:43,730 INFO L87 Difference]: Start difference. First operand 41886 states and 146704 transitions. Second operand 6 states. [2019-12-28 03:45:44,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:44,354 INFO L93 Difference]: Finished difference Result 54549 states and 184834 transitions. [2019-12-28 03:45:44,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:45:44,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-28 03:45:44,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:44,461 INFO L225 Difference]: With dead ends: 54549 [2019-12-28 03:45:44,461 INFO L226 Difference]: Without dead ends: 54549 [2019-12-28 03:45:44,462 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 03:45:44,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54549 states. [2019-12-28 03:45:45,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54549 to 45861. [2019-12-28 03:45:45,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45861 states. [2019-12-28 03:45:45,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45861 states to 45861 states and 158167 transitions. [2019-12-28 03:45:45,314 INFO L78 Accepts]: Start accepts. Automaton has 45861 states and 158167 transitions. Word has length 55 [2019-12-28 03:45:45,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:45,315 INFO L462 AbstractCegarLoop]: Abstraction has 45861 states and 158167 transitions. [2019-12-28 03:45:45,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:45:45,315 INFO L276 IsEmpty]: Start isEmpty. Operand 45861 states and 158167 transitions. [2019-12-28 03:45:45,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 03:45:45,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:45,325 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:45:45,325 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:45,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:45,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1694931888, now seen corresponding path program 1 times [2019-12-28 03:45:45,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:45,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117358468] [2019-12-28 03:45:45,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:45,797 WARN L192 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2019-12-28 03:45:45,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:45:45,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117358468] [2019-12-28 03:45:45,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:45,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:45:45,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [556851383] [2019-12-28 03:45:45,804 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:45,809 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:45,816 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 56 states and 55 transitions. [2019-12-28 03:45:45,816 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:45,817 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:45:45,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:45:45,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:45,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:45:45,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:45:45,818 INFO L87 Difference]: Start difference. First operand 45861 states and 158167 transitions. Second operand 4 states. [2019-12-28 03:45:45,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:45,888 INFO L93 Difference]: Finished difference Result 8163 states and 24871 transitions. [2019-12-28 03:45:45,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:45:45,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-28 03:45:45,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:45,904 INFO L225 Difference]: With dead ends: 8163 [2019-12-28 03:45:45,904 INFO L226 Difference]: Without dead ends: 6754 [2019-12-28 03:45:45,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:45:45,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6754 states. [2019-12-28 03:45:46,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6754 to 6706. [2019-12-28 03:45:46,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6706 states. [2019-12-28 03:45:46,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6706 states to 6706 states and 20040 transitions. [2019-12-28 03:45:46,043 INFO L78 Accepts]: Start accepts. Automaton has 6706 states and 20040 transitions. Word has length 55 [2019-12-28 03:45:46,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:46,044 INFO L462 AbstractCegarLoop]: Abstraction has 6706 states and 20040 transitions. [2019-12-28 03:45:46,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:45:46,044 INFO L276 IsEmpty]: Start isEmpty. Operand 6706 states and 20040 transitions. [2019-12-28 03:45:46,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-28 03:45:46,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:46,056 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:45:46,056 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:46,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:46,057 INFO L82 PathProgramCache]: Analyzing trace with hash -2058299368, now seen corresponding path program 1 times [2019-12-28 03:45:46,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:46,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639058951] [2019-12-28 03:45:46,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:46,151 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 03:45:46,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639058951] [2019-12-28 03:45:46,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:46,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:45:46,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1713034542] [2019-12-28 03:45:46,153 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:46,163 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:46,192 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 200 transitions. [2019-12-28 03:45:46,192 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:46,213 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:45:46,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:45:46,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:46,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:45:46,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:45:46,214 INFO L87 Difference]: Start difference. First operand 6706 states and 20040 transitions. Second operand 5 states. [2019-12-28 03:45:46,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:46,372 INFO L93 Difference]: Finished difference Result 7891 states and 23389 transitions. [2019-12-28 03:45:46,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:45:46,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-28 03:45:46,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:46,385 INFO L225 Difference]: With dead ends: 7891 [2019-12-28 03:45:46,385 INFO L226 Difference]: Without dead ends: 7891 [2019-12-28 03:45:46,385 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 03:45:46,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7891 states. [2019-12-28 03:45:46,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7891 to 7213. [2019-12-28 03:45:46,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7213 states. [2019-12-28 03:45:46,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7213 states to 7213 states and 21446 transitions. [2019-12-28 03:45:46,484 INFO L78 Accepts]: Start accepts. Automaton has 7213 states and 21446 transitions. Word has length 64 [2019-12-28 03:45:46,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:46,484 INFO L462 AbstractCegarLoop]: Abstraction has 7213 states and 21446 transitions. [2019-12-28 03:45:46,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:45:46,484 INFO L276 IsEmpty]: Start isEmpty. Operand 7213 states and 21446 transitions. [2019-12-28 03:45:46,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-28 03:45:46,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:46,489 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:45:46,489 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:46,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:46,490 INFO L82 PathProgramCache]: Analyzing trace with hash -315489033, now seen corresponding path program 1 times [2019-12-28 03:45:46,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:46,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653861395] [2019-12-28 03:45:46,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:46,560 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 03:45:46,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653861395] [2019-12-28 03:45:46,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:46,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:45:46,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [465186239] [2019-12-28 03:45:46,561 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:46,571 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:46,600 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 200 transitions. [2019-12-28 03:45:46,600 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:46,620 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:45:46,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:45:46,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:46,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:45:46,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:45:46,622 INFO L87 Difference]: Start difference. First operand 7213 states and 21446 transitions. Second operand 7 states. [2019-12-28 03:45:47,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:47,057 INFO L93 Difference]: Finished difference Result 9268 states and 27195 transitions. [2019-12-28 03:45:47,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 03:45:47,058 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-28 03:45:47,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:47,077 INFO L225 Difference]: With dead ends: 9268 [2019-12-28 03:45:47,077 INFO L226 Difference]: Without dead ends: 9220 [2019-12-28 03:45:47,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-28 03:45:47,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9220 states. [2019-12-28 03:45:47,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9220 to 8052. [2019-12-28 03:45:47,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8052 states. [2019-12-28 03:45:47,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8052 states to 8052 states and 23826 transitions. [2019-12-28 03:45:47,232 INFO L78 Accepts]: Start accepts. Automaton has 8052 states and 23826 transitions. Word has length 64 [2019-12-28 03:45:47,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:47,233 INFO L462 AbstractCegarLoop]: Abstraction has 8052 states and 23826 transitions. [2019-12-28 03:45:47,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:45:47,233 INFO L276 IsEmpty]: Start isEmpty. Operand 8052 states and 23826 transitions. [2019-12-28 03:45:47,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 03:45:47,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:47,242 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:45:47,242 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:47,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:47,243 INFO L82 PathProgramCache]: Analyzing trace with hash 502763189, now seen corresponding path program 1 times [2019-12-28 03:45:47,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:47,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98874063] [2019-12-28 03:45:47,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:47,335 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 03:45:47,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98874063] [2019-12-28 03:45:47,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:47,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:45:47,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [978285678] [2019-12-28 03:45:47,337 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:47,356 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:47,375 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 69 states and 68 transitions. [2019-12-28 03:45:47,376 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:47,376 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:45:47,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:45:47,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:47,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:45:47,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:45:47,378 INFO L87 Difference]: Start difference. First operand 8052 states and 23826 transitions. Second operand 4 states. [2019-12-28 03:45:47,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:47,718 INFO L93 Difference]: Finished difference Result 10665 states and 31175 transitions. [2019-12-28 03:45:47,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:45:47,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-28 03:45:47,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:47,745 INFO L225 Difference]: With dead ends: 10665 [2019-12-28 03:45:47,745 INFO L226 Difference]: Without dead ends: 10665 [2019-12-28 03:45:47,747 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 03:45:47,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10665 states. [2019-12-28 03:45:47,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10665 to 9075. [2019-12-28 03:45:47,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9075 states. [2019-12-28 03:45:47,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9075 states to 9075 states and 26645 transitions. [2019-12-28 03:45:47,949 INFO L78 Accepts]: Start accepts. Automaton has 9075 states and 26645 transitions. Word has length 68 [2019-12-28 03:45:47,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:47,949 INFO L462 AbstractCegarLoop]: Abstraction has 9075 states and 26645 transitions. [2019-12-28 03:45:47,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:45:47,949 INFO L276 IsEmpty]: Start isEmpty. Operand 9075 states and 26645 transitions. [2019-12-28 03:45:47,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 03:45:47,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:47,959 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:45:47,960 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:47,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:47,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1747527670, now seen corresponding path program 1 times [2019-12-28 03:45:47,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:47,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522833244] [2019-12-28 03:45:47,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:48,093 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 03:45:48,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522833244] [2019-12-28 03:45:48,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:48,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:45:48,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1538500172] [2019-12-28 03:45:48,094 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:48,105 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:48,118 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 69 states and 68 transitions. [2019-12-28 03:45:48,119 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:48,119 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:45:48,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:45:48,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:48,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:45:48,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:45:48,120 INFO L87 Difference]: Start difference. First operand 9075 states and 26645 transitions. Second operand 6 states. [2019-12-28 03:45:48,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:48,673 INFO L93 Difference]: Finished difference Result 10385 states and 29896 transitions. [2019-12-28 03:45:48,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:45:48,674 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-28 03:45:48,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:48,687 INFO L225 Difference]: With dead ends: 10385 [2019-12-28 03:45:48,687 INFO L226 Difference]: Without dead ends: 10385 [2019-12-28 03:45:48,688 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 03:45:48,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10385 states. [2019-12-28 03:45:48,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10385 to 10082. [2019-12-28 03:45:48,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10082 states. [2019-12-28 03:45:48,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10082 states to 10082 states and 29119 transitions. [2019-12-28 03:45:48,822 INFO L78 Accepts]: Start accepts. Automaton has 10082 states and 29119 transitions. Word has length 68 [2019-12-28 03:45:48,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:48,823 INFO L462 AbstractCegarLoop]: Abstraction has 10082 states and 29119 transitions. [2019-12-28 03:45:48,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:45:48,823 INFO L276 IsEmpty]: Start isEmpty. Operand 10082 states and 29119 transitions. [2019-12-28 03:45:48,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 03:45:48,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:48,835 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:45:48,835 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:48,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:48,835 INFO L82 PathProgramCache]: Analyzing trace with hash -329681673, now seen corresponding path program 1 times [2019-12-28 03:45:48,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:48,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681019985] [2019-12-28 03:45:48,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:48,943 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 03:45:48,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681019985] [2019-12-28 03:45:48,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:48,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:45:48,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1665232025] [2019-12-28 03:45:48,947 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:48,972 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:49,044 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 69 states and 68 transitions. [2019-12-28 03:45:49,044 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:49,045 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:45:49,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:45:49,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:49,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:45:49,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:45:49,046 INFO L87 Difference]: Start difference. First operand 10082 states and 29119 transitions. Second operand 6 states. [2019-12-28 03:45:49,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:49,467 INFO L93 Difference]: Finished difference Result 11999 states and 33626 transitions. [2019-12-28 03:45:49,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 03:45:49,468 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-28 03:45:49,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:49,483 INFO L225 Difference]: With dead ends: 11999 [2019-12-28 03:45:49,483 INFO L226 Difference]: Without dead ends: 11999 [2019-12-28 03:45:49,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:45:49,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11999 states. [2019-12-28 03:45:49,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11999 to 10301. [2019-12-28 03:45:49,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10301 states. [2019-12-28 03:45:49,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10301 states to 10301 states and 29171 transitions. [2019-12-28 03:45:49,613 INFO L78 Accepts]: Start accepts. Automaton has 10301 states and 29171 transitions. Word has length 68 [2019-12-28 03:45:49,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:49,614 INFO L462 AbstractCegarLoop]: Abstraction has 10301 states and 29171 transitions. [2019-12-28 03:45:49,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:45:49,614 INFO L276 IsEmpty]: Start isEmpty. Operand 10301 states and 29171 transitions. [2019-12-28 03:45:49,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 03:45:49,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:49,621 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:45:49,621 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:49,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:49,622 INFO L82 PathProgramCache]: Analyzing trace with hash -118330760, now seen corresponding path program 1 times [2019-12-28 03:45:49,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:49,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389496102] [2019-12-28 03:45:49,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:49,718 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 03:45:49,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389496102] [2019-12-28 03:45:49,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:49,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:45:49,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1877785919] [2019-12-28 03:45:49,719 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:49,745 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:49,758 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 69 states and 68 transitions. [2019-12-28 03:45:49,759 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:49,759 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:45:49,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:45:49,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:49,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:45:49,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:45:49,760 INFO L87 Difference]: Start difference. First operand 10301 states and 29171 transitions. Second operand 5 states. [2019-12-28 03:45:50,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:50,049 INFO L93 Difference]: Finished difference Result 12576 states and 35464 transitions. [2019-12-28 03:45:50,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 03:45:50,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-28 03:45:50,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:50,066 INFO L225 Difference]: With dead ends: 12576 [2019-12-28 03:45:50,066 INFO L226 Difference]: Without dead ends: 12576 [2019-12-28 03:45:50,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:45:50,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12576 states. [2019-12-28 03:45:50,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12576 to 11076. [2019-12-28 03:45:50,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11076 states. [2019-12-28 03:45:50,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11076 states to 11076 states and 31105 transitions. [2019-12-28 03:45:50,210 INFO L78 Accepts]: Start accepts. Automaton has 11076 states and 31105 transitions. Word has length 68 [2019-12-28 03:45:50,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:50,210 INFO L462 AbstractCegarLoop]: Abstraction has 11076 states and 31105 transitions. [2019-12-28 03:45:50,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:45:50,211 INFO L276 IsEmpty]: Start isEmpty. Operand 11076 states and 31105 transitions. [2019-12-28 03:45:50,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 03:45:50,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:50,218 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:45:50,218 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:50,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:50,219 INFO L82 PathProgramCache]: Analyzing trace with hash -628864937, now seen corresponding path program 1 times [2019-12-28 03:45:50,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:50,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031647004] [2019-12-28 03:45:50,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:50,328 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 03:45:50,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031647004] [2019-12-28 03:45:50,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:50,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:45:50,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2124427419] [2019-12-28 03:45:50,329 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:50,339 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:50,353 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 69 states and 68 transitions. [2019-12-28 03:45:50,353 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:50,354 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:45:50,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:45:50,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:50,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:45:50,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:45:50,355 INFO L87 Difference]: Start difference. First operand 11076 states and 31105 transitions. Second operand 6 states. [2019-12-28 03:45:51,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:51,214 INFO L93 Difference]: Finished difference Result 17070 states and 47866 transitions. [2019-12-28 03:45:51,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:45:51,214 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-28 03:45:51,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:51,237 INFO L225 Difference]: With dead ends: 17070 [2019-12-28 03:45:51,238 INFO L226 Difference]: Without dead ends: 17070 [2019-12-28 03:45:51,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:45:51,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17070 states. [2019-12-28 03:45:51,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17070 to 14148. [2019-12-28 03:45:51,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14148 states. [2019-12-28 03:45:51,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14148 states to 14148 states and 39930 transitions. [2019-12-28 03:45:51,435 INFO L78 Accepts]: Start accepts. Automaton has 14148 states and 39930 transitions. Word has length 68 [2019-12-28 03:45:51,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:51,435 INFO L462 AbstractCegarLoop]: Abstraction has 14148 states and 39930 transitions. [2019-12-28 03:45:51,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:45:51,435 INFO L276 IsEmpty]: Start isEmpty. Operand 14148 states and 39930 transitions. [2019-12-28 03:45:51,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 03:45:51,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:51,444 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:45:51,444 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:51,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:51,444 INFO L82 PathProgramCache]: Analyzing trace with hash 258638744, now seen corresponding path program 1 times [2019-12-28 03:45:51,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:51,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667114806] [2019-12-28 03:45:51,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:51,511 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 03:45:51,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667114806] [2019-12-28 03:45:51,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:51,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:45:51,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1162995522] [2019-12-28 03:45:51,512 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:51,522 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:51,536 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 69 states and 68 transitions. [2019-12-28 03:45:51,536 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:51,537 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:45:51,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:45:51,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:51,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:45:51,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:45:51,539 INFO L87 Difference]: Start difference. First operand 14148 states and 39930 transitions. Second operand 4 states. [2019-12-28 03:45:52,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:52,019 INFO L93 Difference]: Finished difference Result 14460 states and 40606 transitions. [2019-12-28 03:45:52,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:45:52,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-28 03:45:52,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:52,038 INFO L225 Difference]: With dead ends: 14460 [2019-12-28 03:45:52,038 INFO L226 Difference]: Without dead ends: 13986 [2019-12-28 03:45:52,039 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 03:45:52,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13986 states. [2019-12-28 03:45:52,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13986 to 13425. [2019-12-28 03:45:52,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13425 states. [2019-12-28 03:45:52,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13425 states to 13425 states and 37675 transitions. [2019-12-28 03:45:52,207 INFO L78 Accepts]: Start accepts. Automaton has 13425 states and 37675 transitions. Word has length 68 [2019-12-28 03:45:52,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:52,207 INFO L462 AbstractCegarLoop]: Abstraction has 13425 states and 37675 transitions. [2019-12-28 03:45:52,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:45:52,207 INFO L276 IsEmpty]: Start isEmpty. Operand 13425 states and 37675 transitions. [2019-12-28 03:45:52,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 03:45:52,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:52,215 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:45:52,216 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:52,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:52,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1869151000, now seen corresponding path program 1 times [2019-12-28 03:45:52,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:52,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831154220] [2019-12-28 03:45:52,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:52,378 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 03:45:52,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831154220] [2019-12-28 03:45:52,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:52,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 03:45:52,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1027856321] [2019-12-28 03:45:52,380 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:52,392 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:52,406 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 69 states and 68 transitions. [2019-12-28 03:45:52,406 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:52,406 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:45:52,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 03:45:52,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:52,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 03:45:52,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:45:52,408 INFO L87 Difference]: Start difference. First operand 13425 states and 37675 transitions. Second operand 9 states. [2019-12-28 03:45:53,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:53,173 INFO L93 Difference]: Finished difference Result 19154 states and 53543 transitions. [2019-12-28 03:45:53,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 03:45:53,174 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-12-28 03:45:53,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:53,200 INFO L225 Difference]: With dead ends: 19154 [2019-12-28 03:45:53,201 INFO L226 Difference]: Without dead ends: 19154 [2019-12-28 03:45:53,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-28 03:45:53,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19154 states. [2019-12-28 03:45:53,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19154 to 15590. [2019-12-28 03:45:53,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15590 states. [2019-12-28 03:45:53,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15590 states to 15590 states and 43630 transitions. [2019-12-28 03:45:53,426 INFO L78 Accepts]: Start accepts. Automaton has 15590 states and 43630 transitions. Word has length 68 [2019-12-28 03:45:53,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:53,426 INFO L462 AbstractCegarLoop]: Abstraction has 15590 states and 43630 transitions. [2019-12-28 03:45:53,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 03:45:53,426 INFO L276 IsEmpty]: Start isEmpty. Operand 15590 states and 43630 transitions. [2019-12-28 03:45:53,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 03:45:53,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:53,436 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:45:53,436 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:53,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:53,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1538312615, now seen corresponding path program 1 times [2019-12-28 03:45:53,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:53,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929074920] [2019-12-28 03:45:53,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:53,560 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 03:45:53,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929074920] [2019-12-28 03:45:53,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:53,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:45:53,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1459882507] [2019-12-28 03:45:53,561 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:53,571 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:53,584 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 69 states and 68 transitions. [2019-12-28 03:45:53,584 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:53,585 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:45:53,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:45:53,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:53,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:45:53,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:45:53,586 INFO L87 Difference]: Start difference. First operand 15590 states and 43630 transitions. Second operand 5 states. [2019-12-28 03:45:53,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:53,637 INFO L93 Difference]: Finished difference Result 4904 states and 11471 transitions. [2019-12-28 03:45:53,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 03:45:53,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-28 03:45:53,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:53,643 INFO L225 Difference]: With dead ends: 4904 [2019-12-28 03:45:53,643 INFO L226 Difference]: Without dead ends: 4032 [2019-12-28 03:45:53,643 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 03:45:53,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4032 states. [2019-12-28 03:45:53,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4032 to 3409. [2019-12-28 03:45:53,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3409 states. [2019-12-28 03:45:53,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 7848 transitions. [2019-12-28 03:45:53,679 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 7848 transitions. Word has length 68 [2019-12-28 03:45:53,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:53,680 INFO L462 AbstractCegarLoop]: Abstraction has 3409 states and 7848 transitions. [2019-12-28 03:45:53,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:45:53,680 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 7848 transitions. [2019-12-28 03:45:53,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-28 03:45:53,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:53,686 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] [2019-12-28 03:45:53,686 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:53,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:53,686 INFO L82 PathProgramCache]: Analyzing trace with hash 814821392, now seen corresponding path program 1 times [2019-12-28 03:45:53,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:53,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468391812] [2019-12-28 03:45:53,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:53,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:53,753 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 03:45:53,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468391812] [2019-12-28 03:45:53,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:53,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:45:53,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1804127005] [2019-12-28 03:45:53,754 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:53,772 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:53,835 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 131 states and 175 transitions. [2019-12-28 03:45:53,835 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:53,836 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:45:53,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:45:53,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:53,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:45:53,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:45:53,837 INFO L87 Difference]: Start difference. First operand 3409 states and 7848 transitions. Second operand 4 states. [2019-12-28 03:45:53,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:53,872 INFO L93 Difference]: Finished difference Result 3364 states and 7725 transitions. [2019-12-28 03:45:53,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:45:53,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-12-28 03:45:53,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:53,877 INFO L225 Difference]: With dead ends: 3364 [2019-12-28 03:45:53,878 INFO L226 Difference]: Without dead ends: 3364 [2019-12-28 03:45:53,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:45:53,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3364 states. [2019-12-28 03:45:53,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3364 to 2982. [2019-12-28 03:45:53,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2982 states. [2019-12-28 03:45:53,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2982 states to 2982 states and 6852 transitions. [2019-12-28 03:45:53,913 INFO L78 Accepts]: Start accepts. Automaton has 2982 states and 6852 transitions. Word has length 85 [2019-12-28 03:45:53,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:53,914 INFO L462 AbstractCegarLoop]: Abstraction has 2982 states and 6852 transitions. [2019-12-28 03:45:53,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:45:53,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2982 states and 6852 transitions. [2019-12-28 03:45:53,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-28 03:45:53,917 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:53,917 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] [2019-12-28 03:45:53,917 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:53,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:53,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1492664144, now seen corresponding path program 1 times [2019-12-28 03:45:53,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:53,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007940928] [2019-12-28 03:45:53,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:54,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:45:54,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007940928] [2019-12-28 03:45:54,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:54,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 03:45:54,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [370781319] [2019-12-28 03:45:54,052 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:54,070 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:54,128 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 131 states and 175 transitions. [2019-12-28 03:45:54,128 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:54,208 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-28 03:45:54,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 03:45:54,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:54,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 03:45:54,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-28 03:45:54,209 INFO L87 Difference]: Start difference. First operand 2982 states and 6852 transitions. Second operand 11 states. [2019-12-28 03:45:55,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:55,794 INFO L93 Difference]: Finished difference Result 4025 states and 9104 transitions. [2019-12-28 03:45:55,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-28 03:45:55,794 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2019-12-28 03:45:55,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:55,800 INFO L225 Difference]: With dead ends: 4025 [2019-12-28 03:45:55,800 INFO L226 Difference]: Without dead ends: 4003 [2019-12-28 03:45:55,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2019-12-28 03:45:55,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4003 states. [2019-12-28 03:45:55,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4003 to 3165. [2019-12-28 03:45:55,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3165 states. [2019-12-28 03:45:55,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3165 states to 3165 states and 7225 transitions. [2019-12-28 03:45:55,836 INFO L78 Accepts]: Start accepts. Automaton has 3165 states and 7225 transitions. Word has length 85 [2019-12-28 03:45:55,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:55,836 INFO L462 AbstractCegarLoop]: Abstraction has 3165 states and 7225 transitions. [2019-12-28 03:45:55,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 03:45:55,836 INFO L276 IsEmpty]: Start isEmpty. Operand 3165 states and 7225 transitions. [2019-12-28 03:45:55,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-28 03:45:55,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:55,840 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:45:55,840 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:55,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:55,840 INFO L82 PathProgramCache]: Analyzing trace with hash -605160463, now seen corresponding path program 1 times [2019-12-28 03:45:55,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:55,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698766340] [2019-12-28 03:45:55,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:56,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 03:45:56,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698766340] [2019-12-28 03:45:56,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:56,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 03:45:56,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [777223579] [2019-12-28 03:45:56,005 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:56,023 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:56,084 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 131 states and 175 transitions. [2019-12-28 03:45:56,084 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:56,085 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:45:56,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 03:45:56,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:56,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 03:45:56,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:45:56,086 INFO L87 Difference]: Start difference. First operand 3165 states and 7225 transitions. Second operand 9 states. [2019-12-28 03:45:56,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:56,677 INFO L93 Difference]: Finished difference Result 11435 states and 26306 transitions. [2019-12-28 03:45:56,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-28 03:45:56,677 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-12-28 03:45:56,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:56,686 INFO L225 Difference]: With dead ends: 11435 [2019-12-28 03:45:56,686 INFO L226 Difference]: Without dead ends: 7337 [2019-12-28 03:45:56,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-12-28 03:45:56,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7337 states. [2019-12-28 03:45:56,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7337 to 3288. [2019-12-28 03:45:56,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3288 states. [2019-12-28 03:45:56,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 3288 states and 7466 transitions. [2019-12-28 03:45:56,736 INFO L78 Accepts]: Start accepts. Automaton has 3288 states and 7466 transitions. Word has length 85 [2019-12-28 03:45:56,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:56,736 INFO L462 AbstractCegarLoop]: Abstraction has 3288 states and 7466 transitions. [2019-12-28 03:45:56,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 03:45:56,736 INFO L276 IsEmpty]: Start isEmpty. Operand 3288 states and 7466 transitions. [2019-12-28 03:45:56,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-28 03:45:56,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:56,742 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] [2019-12-28 03:45:56,742 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:56,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:56,742 INFO L82 PathProgramCache]: Analyzing trace with hash -779070116, now seen corresponding path program 1 times [2019-12-28 03:45:56,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:56,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616013028] [2019-12-28 03:45:56,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:56,863 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 03:45:56,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616013028] [2019-12-28 03:45:56,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:56,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:45:56,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1823024180] [2019-12-28 03:45:56,864 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:56,882 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:56,973 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 116 states and 145 transitions. [2019-12-28 03:45:56,973 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:56,997 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:45:56,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:45:56,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:56,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:45:56,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:45:56,999 INFO L87 Difference]: Start difference. First operand 3288 states and 7466 transitions. Second operand 8 states. [2019-12-28 03:45:57,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:57,399 INFO L93 Difference]: Finished difference Result 3762 states and 8460 transitions. [2019-12-28 03:45:57,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 03:45:57,400 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-12-28 03:45:57,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:57,405 INFO L225 Difference]: With dead ends: 3762 [2019-12-28 03:45:57,406 INFO L226 Difference]: Without dead ends: 3686 [2019-12-28 03:45:57,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-12-28 03:45:57,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3686 states. [2019-12-28 03:45:57,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3686 to 3182. [2019-12-28 03:45:57,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3182 states. [2019-12-28 03:45:57,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3182 states to 3182 states and 7161 transitions. [2019-12-28 03:45:57,439 INFO L78 Accepts]: Start accepts. Automaton has 3182 states and 7161 transitions. Word has length 85 [2019-12-28 03:45:57,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:57,440 INFO L462 AbstractCegarLoop]: Abstraction has 3182 states and 7161 transitions. [2019-12-28 03:45:57,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:45:57,440 INFO L276 IsEmpty]: Start isEmpty. Operand 3182 states and 7161 transitions. [2019-12-28 03:45:57,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-28 03:45:57,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:57,443 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] [2019-12-28 03:45:57,443 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:57,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:57,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1438687837, now seen corresponding path program 2 times [2019-12-28 03:45:57,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:57,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320475624] [2019-12-28 03:45:57,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:57,562 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 03:45:57,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320475624] [2019-12-28 03:45:57,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:57,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:45:57,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1672911686] [2019-12-28 03:45:57,563 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:57,579 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:57,625 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 116 states and 145 transitions. [2019-12-28 03:45:57,626 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:57,626 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:45:57,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:45:57,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:57,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:45:57,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:45:57,628 INFO L87 Difference]: Start difference. First operand 3182 states and 7161 transitions. Second operand 7 states. [2019-12-28 03:45:57,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:57,713 INFO L93 Difference]: Finished difference Result 5397 states and 12204 transitions. [2019-12-28 03:45:57,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 03:45:57,713 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-12-28 03:45:57,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:57,717 INFO L225 Difference]: With dead ends: 5397 [2019-12-28 03:45:57,717 INFO L226 Difference]: Without dead ends: 2304 [2019-12-28 03:45:57,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-28 03:45:57,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2019-12-28 03:45:57,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 2304. [2019-12-28 03:45:57,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2304 states. [2019-12-28 03:45:57,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 2304 states and 5189 transitions. [2019-12-28 03:45:57,749 INFO L78 Accepts]: Start accepts. Automaton has 2304 states and 5189 transitions. Word has length 85 [2019-12-28 03:45:57,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:57,749 INFO L462 AbstractCegarLoop]: Abstraction has 2304 states and 5189 transitions. [2019-12-28 03:45:57,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:45:57,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2304 states and 5189 transitions. [2019-12-28 03:45:57,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-28 03:45:57,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:57,753 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] [2019-12-28 03:45:57,753 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:57,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:57,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1677225695, now seen corresponding path program 3 times [2019-12-28 03:45:57,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:57,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301339933] [2019-12-28 03:45:57,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:57,847 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 03:45:57,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301339933] [2019-12-28 03:45:57,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:57,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:45:57,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [640798475] [2019-12-28 03:45:57,848 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:57,863 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:57,910 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 112 states and 135 transitions. [2019-12-28 03:45:57,911 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:57,911 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:45:57,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:45:57,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:57,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:45:57,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:45:57,912 INFO L87 Difference]: Start difference. First operand 2304 states and 5189 transitions. Second operand 5 states. [2019-12-28 03:45:57,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:57,974 INFO L93 Difference]: Finished difference Result 2429 states and 5444 transitions. [2019-12-28 03:45:57,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:45:57,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-12-28 03:45:57,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:57,979 INFO L225 Difference]: With dead ends: 2429 [2019-12-28 03:45:57,980 INFO L226 Difference]: Without dead ends: 2429 [2019-12-28 03:45:57,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 03:45:57,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2429 states. [2019-12-28 03:45:58,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2429 to 2388. [2019-12-28 03:45:58,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2388 states. [2019-12-28 03:45:58,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 5359 transitions. [2019-12-28 03:45:58,028 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 5359 transitions. Word has length 85 [2019-12-28 03:45:58,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:58,029 INFO L462 AbstractCegarLoop]: Abstraction has 2388 states and 5359 transitions. [2019-12-28 03:45:58,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:45:58,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 5359 transitions. [2019-12-28 03:45:58,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-28 03:45:58,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:58,033 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] [2019-12-28 03:45:58,033 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:58,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:58,033 INFO L82 PathProgramCache]: Analyzing trace with hash -641388152, now seen corresponding path program 1 times [2019-12-28 03:45:58,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:58,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112673122] [2019-12-28 03:45:58,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 03:45:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 03:45:58,149 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 03:45:58,150 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 03:45:58,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 03:45:58 BasicIcfg [2019-12-28 03:45:58,397 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 03:45:58,400 INFO L168 Benchmark]: Toolchain (without parser) took 46138.83 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.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-28 03:45:58,404 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-28 03:45:58,405 INFO L168 Benchmark]: CACSL2BoogieTranslator took 856.68 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 153.1 MB in the end (delta: -54.0 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-28 03:45:58,413 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.29 ms. Allocated memory is still 200.3 MB. Free memory was 153.1 MB in the beginning and 150.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-28 03:45:58,414 INFO L168 Benchmark]: Boogie Preprocessor took 36.61 ms. Allocated memory is still 200.3 MB. Free memory was 150.4 MB in the beginning and 148.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 03:45:58,414 INFO L168 Benchmark]: RCFGBuilder took 784.92 ms. Allocated memory is still 200.3 MB. Free memory was 148.3 MB in the beginning and 107.4 MB in the end (delta: 40.9 MB). Peak memory consumption was 40.9 MB. Max. memory is 7.1 GB. [2019-12-28 03:45:58,415 INFO L168 Benchmark]: TraceAbstraction took 44390.73 ms. Allocated memory was 200.3 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 106.7 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 986.1 MB. Max. memory is 7.1 GB. [2019-12-28 03:45:58,419 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.27 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 856.68 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 153.1 MB in the end (delta: -54.0 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.29 ms. Allocated memory is still 200.3 MB. Free memory was 153.1 MB in the beginning and 150.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.61 ms. Allocated memory is still 200.3 MB. Free memory was 150.4 MB in the beginning and 148.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 784.92 ms. Allocated memory is still 200.3 MB. Free memory was 148.3 MB in the beginning and 107.4 MB in the end (delta: 40.9 MB). Peak memory consumption was 40.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 44390.73 ms. Allocated memory was 200.3 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 106.7 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 986.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L707] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L708] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L709] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L710] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L711] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L712] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L713] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L714] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L715] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L716] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L717] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L718] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L719] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L723] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L799] 0 pthread_t t1635; 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] [L800] FCALL, FORK 0 pthread_create(&t1635, ((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] [L801] 0 pthread_t t1636; 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] [L802] FCALL, FORK 0 pthread_create(&t1636, ((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] [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] [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 = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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] [L727] 1 y = 2 [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=1, 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=2] [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=1, 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=2] [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) [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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [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=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=2] [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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=2] [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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=2] [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=1, 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=2] [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=1, 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=2] [L744] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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$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=2] [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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=2] [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=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=2] [L804] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=2] [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=1, 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=2] [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=1, 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=2] [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=1, 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=2] [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=1, 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=2] [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=1, 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=2] [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=1, 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=2] [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=1, 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=2] [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 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=2] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=2] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 130 locations, 2 error locations. Result: UNSAFE, OverallTime: 43.9s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 16.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7266 SDtfs, 9325 SDslu, 17695 SDs, 0 SdLazy, 6902 SolverSat, 465 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 299 GetRequests, 96 SyntacticMatches, 12 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57890occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 18.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 72061 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1831 NumberOfCodeBlocks, 1831 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1719 ConstructedInterpolants, 0 QuantifiedInterpolants, 350736 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...