/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 12:48:02,139 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 12:48:02,141 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 12:48:02,158 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 12:48:02,159 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 12:48:02,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 12:48:02,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 12:48:02,172 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 12:48:02,175 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 12:48:02,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 12:48:02,180 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 12:48:02,183 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 12:48:02,184 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 12:48:02,185 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 12:48:02,187 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 12:48:02,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 12:48:02,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 12:48:02,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 12:48:02,192 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 12:48:02,196 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 12:48:02,200 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 12:48:02,204 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 12:48:02,205 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 12:48:02,206 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 12:48:02,208 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 12:48:02,208 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 12:48:02,208 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 12:48:02,210 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 12:48:02,211 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 12:48:02,213 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 12:48:02,213 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 12:48:02,214 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 12:48:02,214 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 12:48:02,215 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 12:48:02,216 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 12:48:02,216 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 12:48:02,217 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 12:48:02,217 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 12:48:02,217 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 12:48:02,218 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 12:48:02,219 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 12:48:02,220 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-27 12:48:02,244 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 12:48:02,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 12:48:02,246 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 12:48:02,246 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 12:48:02,246 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 12:48:02,246 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 12:48:02,246 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 12:48:02,247 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 12:48:02,247 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 12:48:02,247 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 12:48:02,247 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 12:48:02,247 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 12:48:02,247 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 12:48:02,248 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 12:48:02,248 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 12:48:02,248 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 12:48:02,248 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 12:48:02,248 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 12:48:02,249 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 12:48:02,249 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 12:48:02,249 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 12:48:02,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 12:48:02,249 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 12:48:02,250 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 12:48:02,250 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 12:48:02,250 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 12:48:02,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 12:48:02,250 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 12:48:02,251 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 12:48:02,251 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 12:48:02,519 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 12:48:02,531 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 12:48:02,534 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 12:48:02,536 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 12:48:02,536 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 12:48:02,537 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc.i [2019-12-27 12:48:02,596 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da221f982/75f967e0d3eb4648b913faeb33e5b02a/FLAG253e965e1 [2019-12-27 12:48:03,166 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 12:48:03,166 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc.i [2019-12-27 12:48:03,181 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da221f982/75f967e0d3eb4648b913faeb33e5b02a/FLAG253e965e1 [2019-12-27 12:48:03,417 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da221f982/75f967e0d3eb4648b913faeb33e5b02a [2019-12-27 12:48:03,427 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 12:48:03,429 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 12:48:03,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 12:48:03,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 12:48:03,433 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 12:48:03,434 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:48:03" (1/1) ... [2019-12-27 12:48:03,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c1335d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:48:03, skipping insertion in model container [2019-12-27 12:48:03,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:48:03" (1/1) ... [2019-12-27 12:48:03,445 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 12:48:03,486 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 12:48:03,990 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 12:48:04,001 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 12:48:04,087 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 12:48:04,156 INFO L208 MainTranslator]: Completed translation [2019-12-27 12:48:04,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:48:04 WrapperNode [2019-12-27 12:48:04,157 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 12:48:04,158 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 12:48:04,158 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 12:48:04,158 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 12:48:04,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:48:04" (1/1) ... [2019-12-27 12:48:04,191 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:48:04" (1/1) ... [2019-12-27 12:48:04,231 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 12:48:04,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 12:48:04,232 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 12:48:04,232 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 12:48:04,242 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:48:04" (1/1) ... [2019-12-27 12:48:04,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:48:04" (1/1) ... [2019-12-27 12:48:04,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:48:04" (1/1) ... [2019-12-27 12:48:04,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:48:04" (1/1) ... [2019-12-27 12:48:04,262 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:48:04" (1/1) ... [2019-12-27 12:48:04,267 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:48:04" (1/1) ... [2019-12-27 12:48:04,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:48:04" (1/1) ... [2019-12-27 12:48:04,275 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 12:48:04,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 12:48:04,276 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 12:48:04,276 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 12:48:04,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:48:04" (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-27 12:48:04,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 12:48:04,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 12:48:04,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 12:48:04,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 12:48:04,343 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 12:48:04,346 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 12:48:04,346 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 12:48:04,347 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 12:48:04,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 12:48:04,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 12:48:04,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 12:48:04,350 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 12:48:05,029 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 12:48:05,029 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 12:48:05,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:48:05 BoogieIcfgContainer [2019-12-27 12:48:05,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 12:48:05,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 12:48:05,032 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 12:48:05,035 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 12:48:05,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 12:48:03" (1/3) ... [2019-12-27 12:48:05,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c78fe82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:48:05, skipping insertion in model container [2019-12-27 12:48:05,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:48:04" (2/3) ... [2019-12-27 12:48:05,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c78fe82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:48:05, skipping insertion in model container [2019-12-27 12:48:05,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:48:05" (3/3) ... [2019-12-27 12:48:05,039 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_power.oepc.i [2019-12-27 12:48:05,050 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 12:48:05,050 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 12:48:05,058 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 12:48:05,059 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 12:48:05,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,102 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,103 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,103 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,103 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,104 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,120 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,121 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,185 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,185 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,185 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,191 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,193 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:05,210 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 12:48:05,231 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 12:48:05,231 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 12:48:05,231 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 12:48:05,231 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 12:48:05,232 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 12:48:05,232 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 12:48:05,232 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 12:48:05,232 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 12:48:05,246 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 148 places, 182 transitions [2019-12-27 12:48:07,327 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32592 states. [2019-12-27 12:48:07,329 INFO L276 IsEmpty]: Start isEmpty. Operand 32592 states. [2019-12-27 12:48:07,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 12:48:07,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:48:07,338 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:48:07,339 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:48:07,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:48:07,345 INFO L82 PathProgramCache]: Analyzing trace with hash -495638015, now seen corresponding path program 1 times [2019-12-27 12:48:07,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:48:07,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742053534] [2019-12-27 12:48:07,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:48:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:48:07,665 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-27 12:48:07,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742053534] [2019-12-27 12:48:07,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:48:07,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:48:07,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348701835] [2019-12-27 12:48:07,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:48:07,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:48:07,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:48:07,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:48:07,702 INFO L87 Difference]: Start difference. First operand 32592 states. Second operand 4 states. [2019-12-27 12:48:09,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:48:09,125 INFO L93 Difference]: Finished difference Result 33592 states and 129569 transitions. [2019-12-27 12:48:09,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 12:48:09,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-27 12:48:09,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:48:09,413 INFO L225 Difference]: With dead ends: 33592 [2019-12-27 12:48:09,413 INFO L226 Difference]: Without dead ends: 25704 [2019-12-27 12:48:09,420 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-27 12:48:09,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25704 states. [2019-12-27 12:48:10,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25704 to 25704. [2019-12-27 12:48:10,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25704 states. [2019-12-27 12:48:10,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25704 states to 25704 states and 99585 transitions. [2019-12-27 12:48:10,943 INFO L78 Accepts]: Start accepts. Automaton has 25704 states and 99585 transitions. Word has length 35 [2019-12-27 12:48:10,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:48:10,944 INFO L462 AbstractCegarLoop]: Abstraction has 25704 states and 99585 transitions. [2019-12-27 12:48:10,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:48:10,944 INFO L276 IsEmpty]: Start isEmpty. Operand 25704 states and 99585 transitions. [2019-12-27 12:48:10,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 12:48:10,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:48:10,956 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-27 12:48:10,957 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:48:10,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:48:10,957 INFO L82 PathProgramCache]: Analyzing trace with hash 857898703, now seen corresponding path program 1 times [2019-12-27 12:48:10,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:48:10,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339282838] [2019-12-27 12:48:10,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:48:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:48:11,108 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-27 12:48:11,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339282838] [2019-12-27 12:48:11,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:48:11,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:48:11,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956024081] [2019-12-27 12:48:11,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:48:11,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:48:11,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:48:11,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:48:11,113 INFO L87 Difference]: Start difference. First operand 25704 states and 99585 transitions. Second operand 5 states. [2019-12-27 12:48:11,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:48:11,949 INFO L93 Difference]: Finished difference Result 41082 states and 150432 transitions. [2019-12-27 12:48:11,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:48:11,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-27 12:48:11,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:48:13,382 INFO L225 Difference]: With dead ends: 41082 [2019-12-27 12:48:13,382 INFO L226 Difference]: Without dead ends: 40546 [2019-12-27 12:48:13,383 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-27 12:48:13,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40546 states. [2019-12-27 12:48:14,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40546 to 38926. [2019-12-27 12:48:14,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38926 states. [2019-12-27 12:48:14,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38926 states to 38926 states and 143582 transitions. [2019-12-27 12:48:14,660 INFO L78 Accepts]: Start accepts. Automaton has 38926 states and 143582 transitions. Word has length 47 [2019-12-27 12:48:14,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:48:14,662 INFO L462 AbstractCegarLoop]: Abstraction has 38926 states and 143582 transitions. [2019-12-27 12:48:14,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:48:14,662 INFO L276 IsEmpty]: Start isEmpty. Operand 38926 states and 143582 transitions. [2019-12-27 12:48:14,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 12:48:14,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:48:14,669 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-27 12:48:14,669 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:48:14,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:48:14,669 INFO L82 PathProgramCache]: Analyzing trace with hash -838391431, now seen corresponding path program 1 times [2019-12-27 12:48:14,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:48:14,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731432139] [2019-12-27 12:48:14,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:48:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:48:14,822 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-27 12:48:14,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731432139] [2019-12-27 12:48:14,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:48:14,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:48:14,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053393382] [2019-12-27 12:48:14,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:48:14,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:48:14,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:48:14,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:48:14,824 INFO L87 Difference]: Start difference. First operand 38926 states and 143582 transitions. Second operand 5 states. [2019-12-27 12:48:15,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:48:15,616 INFO L93 Difference]: Finished difference Result 49779 states and 180634 transitions. [2019-12-27 12:48:15,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:48:15,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-27 12:48:15,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:48:15,920 INFO L225 Difference]: With dead ends: 49779 [2019-12-27 12:48:15,920 INFO L226 Difference]: Without dead ends: 49275 [2019-12-27 12:48:15,921 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-27 12:48:16,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49275 states. [2019-12-27 12:48:18,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49275 to 42678. [2019-12-27 12:48:18,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42678 states. [2019-12-27 12:48:18,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42678 states to 42678 states and 156593 transitions. [2019-12-27 12:48:18,874 INFO L78 Accepts]: Start accepts. Automaton has 42678 states and 156593 transitions. Word has length 48 [2019-12-27 12:48:18,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:48:18,874 INFO L462 AbstractCegarLoop]: Abstraction has 42678 states and 156593 transitions. [2019-12-27 12:48:18,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:48:18,875 INFO L276 IsEmpty]: Start isEmpty. Operand 42678 states and 156593 transitions. [2019-12-27 12:48:18,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 12:48:18,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:48:18,884 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-27 12:48:18,885 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:48:18,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:48:18,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1564050337, now seen corresponding path program 1 times [2019-12-27 12:48:18,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:48:18,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645704793] [2019-12-27 12:48:18,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:48:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:48:18,935 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-27 12:48:18,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645704793] [2019-12-27 12:48:18,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:48:18,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 12:48:18,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483200650] [2019-12-27 12:48:18,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 12:48:18,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:48:18,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 12:48:18,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:48:18,938 INFO L87 Difference]: Start difference. First operand 42678 states and 156593 transitions. Second operand 3 states. [2019-12-27 12:48:19,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:48:19,528 INFO L93 Difference]: Finished difference Result 61088 states and 221431 transitions. [2019-12-27 12:48:19,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 12:48:19,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-27 12:48:19,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:48:19,685 INFO L225 Difference]: With dead ends: 61088 [2019-12-27 12:48:19,685 INFO L226 Difference]: Without dead ends: 61088 [2019-12-27 12:48:19,686 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-27 12:48:19,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61088 states. [2019-12-27 12:48:22,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61088 to 48017. [2019-12-27 12:48:22,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48017 states. [2019-12-27 12:48:22,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48017 states to 48017 states and 174180 transitions. [2019-12-27 12:48:22,630 INFO L78 Accepts]: Start accepts. Automaton has 48017 states and 174180 transitions. Word has length 50 [2019-12-27 12:48:22,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:48:22,631 INFO L462 AbstractCegarLoop]: Abstraction has 48017 states and 174180 transitions. [2019-12-27 12:48:22,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 12:48:22,631 INFO L276 IsEmpty]: Start isEmpty. Operand 48017 states and 174180 transitions. [2019-12-27 12:48:22,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 12:48:22,644 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:48:22,644 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-27 12:48:22,645 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:48:22,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:48:22,645 INFO L82 PathProgramCache]: Analyzing trace with hash -473523742, now seen corresponding path program 1 times [2019-12-27 12:48:22,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:48:22,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877160720] [2019-12-27 12:48:22,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:48:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:48:22,820 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-27 12:48:22,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877160720] [2019-12-27 12:48:22,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:48:22,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:48:22,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889940209] [2019-12-27 12:48:22,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:48:22,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:48:22,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:48:22,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:48:22,822 INFO L87 Difference]: Start difference. First operand 48017 states and 174180 transitions. Second operand 6 states. [2019-12-27 12:48:24,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:48:24,053 INFO L93 Difference]: Finished difference Result 63757 states and 229380 transitions. [2019-12-27 12:48:24,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:48:24,054 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 12:48:24,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:48:24,224 INFO L225 Difference]: With dead ends: 63757 [2019-12-27 12:48:24,225 INFO L226 Difference]: Without dead ends: 63757 [2019-12-27 12:48:24,225 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-27 12:48:24,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63757 states. [2019-12-27 12:48:27,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63757 to 59950. [2019-12-27 12:48:27,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59950 states. [2019-12-27 12:48:27,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59950 states to 59950 states and 215673 transitions. [2019-12-27 12:48:27,340 INFO L78 Accepts]: Start accepts. Automaton has 59950 states and 215673 transitions. Word has length 54 [2019-12-27 12:48:27,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:48:27,341 INFO L462 AbstractCegarLoop]: Abstraction has 59950 states and 215673 transitions. [2019-12-27 12:48:27,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:48:27,341 INFO L276 IsEmpty]: Start isEmpty. Operand 59950 states and 215673 transitions. [2019-12-27 12:48:27,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 12:48:27,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:48:27,356 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-27 12:48:27,356 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:48:27,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:48:27,356 INFO L82 PathProgramCache]: Analyzing trace with hash 2024492195, now seen corresponding path program 1 times [2019-12-27 12:48:27,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:48:27,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519670104] [2019-12-27 12:48:27,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:48:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:48:27,427 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-27 12:48:27,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519670104] [2019-12-27 12:48:27,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:48:27,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 12:48:27,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923207441] [2019-12-27 12:48:27,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 12:48:27,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:48:27,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 12:48:27,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:48:27,430 INFO L87 Difference]: Start difference. First operand 59950 states and 215673 transitions. Second operand 3 states. [2019-12-27 12:48:27,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:48:27,705 INFO L93 Difference]: Finished difference Result 54022 states and 188919 transitions. [2019-12-27 12:48:27,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 12:48:27,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 12:48:27,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:48:27,822 INFO L225 Difference]: With dead ends: 54022 [2019-12-27 12:48:27,822 INFO L226 Difference]: Without dead ends: 54022 [2019-12-27 12:48:27,823 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-27 12:48:28,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54022 states. [2019-12-27 12:48:29,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54022 to 53407. [2019-12-27 12:48:29,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53407 states. [2019-12-27 12:48:29,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53407 states to 53407 states and 187038 transitions. [2019-12-27 12:48:29,242 INFO L78 Accepts]: Start accepts. Automaton has 53407 states and 187038 transitions. Word has length 54 [2019-12-27 12:48:29,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:48:29,243 INFO L462 AbstractCegarLoop]: Abstraction has 53407 states and 187038 transitions. [2019-12-27 12:48:29,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 12:48:29,243 INFO L276 IsEmpty]: Start isEmpty. Operand 53407 states and 187038 transitions. [2019-12-27 12:48:29,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 12:48:29,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:48:29,252 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-27 12:48:29,252 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:48:29,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:48:29,252 INFO L82 PathProgramCache]: Analyzing trace with hash 463621674, now seen corresponding path program 1 times [2019-12-27 12:48:29,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:48:29,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738452693] [2019-12-27 12:48:29,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:48:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:48:29,324 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-27 12:48:29,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738452693] [2019-12-27 12:48:29,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:48:29,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:48:29,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434697883] [2019-12-27 12:48:29,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:48:29,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:48:29,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:48:29,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:48:29,327 INFO L87 Difference]: Start difference. First operand 53407 states and 187038 transitions. Second operand 6 states. [2019-12-27 12:48:32,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:48:32,222 INFO L93 Difference]: Finished difference Result 68647 states and 237302 transitions. [2019-12-27 12:48:32,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 12:48:32,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 12:48:32,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:48:32,361 INFO L225 Difference]: With dead ends: 68647 [2019-12-27 12:48:32,362 INFO L226 Difference]: Without dead ends: 68079 [2019-12-27 12:48:32,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-27 12:48:32,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68079 states. [2019-12-27 12:48:33,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68079 to 53491. [2019-12-27 12:48:33,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53491 states. [2019-12-27 12:48:33,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53491 states to 53491 states and 187735 transitions. [2019-12-27 12:48:33,842 INFO L78 Accepts]: Start accepts. Automaton has 53491 states and 187735 transitions. Word has length 54 [2019-12-27 12:48:33,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:48:33,843 INFO L462 AbstractCegarLoop]: Abstraction has 53491 states and 187735 transitions. [2019-12-27 12:48:33,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:48:33,843 INFO L276 IsEmpty]: Start isEmpty. Operand 53491 states and 187735 transitions. [2019-12-27 12:48:33,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 12:48:33,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:48:33,854 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-27 12:48:33,854 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:48:33,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:48:33,854 INFO L82 PathProgramCache]: Analyzing trace with hash 68794998, now seen corresponding path program 1 times [2019-12-27 12:48:33,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:48:33,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163145275] [2019-12-27 12:48:33,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:48:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:48:33,919 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-27 12:48:33,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163145275] [2019-12-27 12:48:33,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:48:33,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:48:33,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666161866] [2019-12-27 12:48:33,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:48:33,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:48:33,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:48:33,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:48:33,921 INFO L87 Difference]: Start difference. First operand 53491 states and 187735 transitions. Second operand 4 states. [2019-12-27 12:48:33,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:48:33,978 INFO L93 Difference]: Finished difference Result 10213 states and 31247 transitions. [2019-12-27 12:48:33,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 12:48:33,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-27 12:48:33,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:48:33,991 INFO L225 Difference]: With dead ends: 10213 [2019-12-27 12:48:33,991 INFO L226 Difference]: Without dead ends: 8508 [2019-12-27 12:48:33,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:48:34,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8508 states. [2019-12-27 12:48:34,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8508 to 8460. [2019-12-27 12:48:34,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8460 states. [2019-12-27 12:48:34,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 25326 transitions. [2019-12-27 12:48:34,094 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 25326 transitions. Word has length 55 [2019-12-27 12:48:34,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:48:34,094 INFO L462 AbstractCegarLoop]: Abstraction has 8460 states and 25326 transitions. [2019-12-27 12:48:34,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:48:34,095 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 25326 transitions. [2019-12-27 12:48:34,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 12:48:34,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:48:34,098 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] [2019-12-27 12:48:34,098 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:48:34,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:48:34,098 INFO L82 PathProgramCache]: Analyzing trace with hash 2084137189, now seen corresponding path program 1 times [2019-12-27 12:48:34,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:48:34,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949252783] [2019-12-27 12:48:34,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:48:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:48:34,201 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-27 12:48:34,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949252783] [2019-12-27 12:48:34,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:48:34,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:48:34,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760536886] [2019-12-27 12:48:34,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:48:34,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:48:34,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:48:34,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:48:34,206 INFO L87 Difference]: Start difference. First operand 8460 states and 25326 transitions. Second operand 6 states. [2019-12-27 12:48:34,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:48:34,612 INFO L93 Difference]: Finished difference Result 10741 states and 31734 transitions. [2019-12-27 12:48:34,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 12:48:34,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-27 12:48:34,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:48:34,628 INFO L225 Difference]: With dead ends: 10741 [2019-12-27 12:48:34,628 INFO L226 Difference]: Without dead ends: 10680 [2019-12-27 12:48:34,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 12:48:34,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10680 states. [2019-12-27 12:48:34,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10680 to 9961. [2019-12-27 12:48:34,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9961 states. [2019-12-27 12:48:34,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9961 states to 9961 states and 29612 transitions. [2019-12-27 12:48:34,768 INFO L78 Accepts]: Start accepts. Automaton has 9961 states and 29612 transitions. Word has length 62 [2019-12-27 12:48:34,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:48:34,769 INFO L462 AbstractCegarLoop]: Abstraction has 9961 states and 29612 transitions. [2019-12-27 12:48:34,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:48:34,769 INFO L276 IsEmpty]: Start isEmpty. Operand 9961 states and 29612 transitions. [2019-12-27 12:48:34,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 12:48:34,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:48:34,774 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-27 12:48:34,774 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:48:34,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:48:34,774 INFO L82 PathProgramCache]: Analyzing trace with hash -761882474, now seen corresponding path program 1 times [2019-12-27 12:48:34,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:48:34,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839168575] [2019-12-27 12:48:34,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:48:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:48:34,839 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-27 12:48:34,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839168575] [2019-12-27 12:48:34,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:48:34,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:48:34,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930165906] [2019-12-27 12:48:34,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:48:34,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:48:34,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:48:34,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:48:34,841 INFO L87 Difference]: Start difference. First operand 9961 states and 29612 transitions. Second operand 4 states. [2019-12-27 12:48:35,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:48:35,154 INFO L93 Difference]: Finished difference Result 12779 states and 37556 transitions. [2019-12-27 12:48:35,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 12:48:35,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-27 12:48:35,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:48:35,171 INFO L225 Difference]: With dead ends: 12779 [2019-12-27 12:48:35,171 INFO L226 Difference]: Without dead ends: 12779 [2019-12-27 12:48:35,172 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-27 12:48:35,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12779 states. [2019-12-27 12:48:35,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12779 to 11120. [2019-12-27 12:48:35,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11120 states. [2019-12-27 12:48:35,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11120 states to 11120 states and 32800 transitions. [2019-12-27 12:48:35,312 INFO L78 Accepts]: Start accepts. Automaton has 11120 states and 32800 transitions. Word has length 68 [2019-12-27 12:48:35,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:48:35,313 INFO L462 AbstractCegarLoop]: Abstraction has 11120 states and 32800 transitions. [2019-12-27 12:48:35,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:48:35,313 INFO L276 IsEmpty]: Start isEmpty. Operand 11120 states and 32800 transitions. [2019-12-27 12:48:35,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 12:48:35,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:48:35,323 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-27 12:48:35,323 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:48:35,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:48:35,323 INFO L82 PathProgramCache]: Analyzing trace with hash 482882007, now seen corresponding path program 1 times [2019-12-27 12:48:35,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:48:35,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961212132] [2019-12-27 12:48:35,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:48:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:48:35,421 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-27 12:48:35,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961212132] [2019-12-27 12:48:35,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:48:35,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:48:35,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116515285] [2019-12-27 12:48:35,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:48:35,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:48:35,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:48:35,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:48:35,423 INFO L87 Difference]: Start difference. First operand 11120 states and 32800 transitions. Second operand 6 states. [2019-12-27 12:48:36,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:48:36,101 INFO L93 Difference]: Finished difference Result 12254 states and 35521 transitions. [2019-12-27 12:48:36,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:48:36,102 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 12:48:36,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:48:36,118 INFO L225 Difference]: With dead ends: 12254 [2019-12-27 12:48:36,118 INFO L226 Difference]: Without dead ends: 12254 [2019-12-27 12:48:36,118 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-27 12:48:36,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12254 states. [2019-12-27 12:48:36,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12254 to 11959. [2019-12-27 12:48:36,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11959 states. [2019-12-27 12:48:36,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11959 states to 11959 states and 34775 transitions. [2019-12-27 12:48:36,264 INFO L78 Accepts]: Start accepts. Automaton has 11959 states and 34775 transitions. Word has length 68 [2019-12-27 12:48:36,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:48:36,264 INFO L462 AbstractCegarLoop]: Abstraction has 11959 states and 34775 transitions. [2019-12-27 12:48:36,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:48:36,264 INFO L276 IsEmpty]: Start isEmpty. Operand 11959 states and 34775 transitions. [2019-12-27 12:48:36,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 12:48:36,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:48:36,272 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-27 12:48:36,272 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:48:36,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:48:36,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1594327336, now seen corresponding path program 1 times [2019-12-27 12:48:36,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:48:36,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829912188] [2019-12-27 12:48:36,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:48:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:48:36,529 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-27 12:48:36,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829912188] [2019-12-27 12:48:36,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:48:36,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:48:36,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037374266] [2019-12-27 12:48:36,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:48:36,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:48:36,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:48:36,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:48:36,531 INFO L87 Difference]: Start difference. First operand 11959 states and 34775 transitions. Second operand 6 states. [2019-12-27 12:48:37,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:48:37,052 INFO L93 Difference]: Finished difference Result 13808 states and 38964 transitions. [2019-12-27 12:48:37,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 12:48:37,053 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 12:48:37,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:48:37,081 INFO L225 Difference]: With dead ends: 13808 [2019-12-27 12:48:37,081 INFO L226 Difference]: Without dead ends: 13808 [2019-12-27 12:48:37,081 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-27 12:48:37,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13808 states. [2019-12-27 12:48:37,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13808 to 12522. [2019-12-27 12:48:37,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12522 states. [2019-12-27 12:48:37,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12522 states to 12522 states and 35774 transitions. [2019-12-27 12:48:37,302 INFO L78 Accepts]: Start accepts. Automaton has 12522 states and 35774 transitions. Word has length 68 [2019-12-27 12:48:37,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:48:37,302 INFO L462 AbstractCegarLoop]: Abstraction has 12522 states and 35774 transitions. [2019-12-27 12:48:37,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:48:37,302 INFO L276 IsEmpty]: Start isEmpty. Operand 12522 states and 35774 transitions. [2019-12-27 12:48:37,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 12:48:37,310 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:48:37,310 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-27 12:48:37,310 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:48:37,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:48:37,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1382976423, now seen corresponding path program 1 times [2019-12-27 12:48:37,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:48:37,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919729441] [2019-12-27 12:48:37,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:48:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:48:37,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:48:37,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919729441] [2019-12-27 12:48:37,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:48:37,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:48:37,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982761712] [2019-12-27 12:48:37,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:48:37,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:48:37,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:48:37,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:48:37,376 INFO L87 Difference]: Start difference. First operand 12522 states and 35774 transitions. Second operand 5 states. [2019-12-27 12:48:37,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:48:37,714 INFO L93 Difference]: Finished difference Result 16038 states and 45579 transitions. [2019-12-27 12:48:37,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 12:48:37,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-27 12:48:37,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:48:37,743 INFO L225 Difference]: With dead ends: 16038 [2019-12-27 12:48:37,743 INFO L226 Difference]: Without dead ends: 16038 [2019-12-27 12:48:37,744 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-27 12:48:37,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16038 states. [2019-12-27 12:48:37,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16038 to 14892. [2019-12-27 12:48:37,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14892 states. [2019-12-27 12:48:37,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14892 states to 14892 states and 42227 transitions. [2019-12-27 12:48:37,941 INFO L78 Accepts]: Start accepts. Automaton has 14892 states and 42227 transitions. Word has length 68 [2019-12-27 12:48:37,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:48:37,942 INFO L462 AbstractCegarLoop]: Abstraction has 14892 states and 42227 transitions. [2019-12-27 12:48:37,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:48:37,942 INFO L276 IsEmpty]: Start isEmpty. Operand 14892 states and 42227 transitions. [2019-12-27 12:48:37,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 12:48:37,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:48:37,951 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:48:37,951 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:48:37,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:48:37,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1893510600, now seen corresponding path program 1 times [2019-12-27 12:48:37,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:48:37,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215976162] [2019-12-27 12:48:37,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:48:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:48:38,007 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-27 12:48:38,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215976162] [2019-12-27 12:48:38,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:48:38,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:48:38,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80914422] [2019-12-27 12:48:38,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:48:38,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:48:38,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:48:38,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:48:38,009 INFO L87 Difference]: Start difference. First operand 14892 states and 42227 transitions. Second operand 4 states. [2019-12-27 12:48:38,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:48:38,552 INFO L93 Difference]: Finished difference Result 18321 states and 52088 transitions. [2019-12-27 12:48:38,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 12:48:38,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-27 12:48:38,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:48:38,577 INFO L225 Difference]: With dead ends: 18321 [2019-12-27 12:48:38,577 INFO L226 Difference]: Without dead ends: 18144 [2019-12-27 12:48:38,578 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-27 12:48:38,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18144 states. [2019-12-27 12:48:38,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18144 to 17301. [2019-12-27 12:48:38,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17301 states. [2019-12-27 12:48:38,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17301 states to 17301 states and 49086 transitions. [2019-12-27 12:48:38,802 INFO L78 Accepts]: Start accepts. Automaton has 17301 states and 49086 transitions. Word has length 68 [2019-12-27 12:48:38,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:48:38,803 INFO L462 AbstractCegarLoop]: Abstraction has 17301 states and 49086 transitions. [2019-12-27 12:48:38,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:48:38,803 INFO L276 IsEmpty]: Start isEmpty. Operand 17301 states and 49086 transitions. [2019-12-27 12:48:38,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 12:48:38,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:48:38,813 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-27 12:48:38,813 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:48:38,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:48:38,813 INFO L82 PathProgramCache]: Analyzing trace with hash 604505337, now seen corresponding path program 1 times [2019-12-27 12:48:38,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:48:38,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989727920] [2019-12-27 12:48:38,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:48:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:48:38,882 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-27 12:48:38,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989727920] [2019-12-27 12:48:38,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:48:38,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:48:38,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988400263] [2019-12-27 12:48:38,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:48:38,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:48:38,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:48:38,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:48:38,885 INFO L87 Difference]: Start difference. First operand 17301 states and 49086 transitions. Second operand 5 states. [2019-12-27 12:48:38,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:48:38,943 INFO L93 Difference]: Finished difference Result 5637 states and 13329 transitions. [2019-12-27 12:48:38,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 12:48:38,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-27 12:48:38,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:48:38,951 INFO L225 Difference]: With dead ends: 5637 [2019-12-27 12:48:38,951 INFO L226 Difference]: Without dead ends: 4851 [2019-12-27 12:48:38,953 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-27 12:48:38,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4851 states. [2019-12-27 12:48:39,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4851 to 4581. [2019-12-27 12:48:39,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4581 states. [2019-12-27 12:48:39,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4581 states to 4581 states and 10496 transitions. [2019-12-27 12:48:39,020 INFO L78 Accepts]: Start accepts. Automaton has 4581 states and 10496 transitions. Word has length 68 [2019-12-27 12:48:39,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:48:39,020 INFO L462 AbstractCegarLoop]: Abstraction has 4581 states and 10496 transitions. [2019-12-27 12:48:39,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:48:39,021 INFO L276 IsEmpty]: Start isEmpty. Operand 4581 states and 10496 transitions. [2019-12-27 12:48:39,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 12:48:39,031 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:48:39,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:48:39,031 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:48:39,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:48:39,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1513751510, now seen corresponding path program 1 times [2019-12-27 12:48:39,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:48:39,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375249932] [2019-12-27 12:48:39,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:48:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:48:39,068 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-27 12:48:39,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375249932] [2019-12-27 12:48:39,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:48:39,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 12:48:39,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348495940] [2019-12-27 12:48:39,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 12:48:39,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:48:39,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 12:48:39,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:48:39,073 INFO L87 Difference]: Start difference. First operand 4581 states and 10496 transitions. Second operand 3 states. [2019-12-27 12:48:39,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:48:39,110 INFO L93 Difference]: Finished difference Result 5732 states and 12928 transitions. [2019-12-27 12:48:39,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 12:48:39,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-27 12:48:39,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:48:39,118 INFO L225 Difference]: With dead ends: 5732 [2019-12-27 12:48:39,119 INFO L226 Difference]: Without dead ends: 5732 [2019-12-27 12:48:39,119 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-27 12:48:39,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5732 states. [2019-12-27 12:48:39,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5732 to 4541. [2019-12-27 12:48:39,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4541 states. [2019-12-27 12:48:39,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4541 states to 4541 states and 10113 transitions. [2019-12-27 12:48:39,188 INFO L78 Accepts]: Start accepts. Automaton has 4541 states and 10113 transitions. Word has length 68 [2019-12-27 12:48:39,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:48:39,188 INFO L462 AbstractCegarLoop]: Abstraction has 4541 states and 10113 transitions. [2019-12-27 12:48:39,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 12:48:39,188 INFO L276 IsEmpty]: Start isEmpty. Operand 4541 states and 10113 transitions. [2019-12-27 12:48:39,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 12:48:39,194 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:48:39,195 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] [2019-12-27 12:48:39,195 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:48:39,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:48:39,196 INFO L82 PathProgramCache]: Analyzing trace with hash -696243832, now seen corresponding path program 1 times [2019-12-27 12:48:39,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:48:39,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046174444] [2019-12-27 12:48:39,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:48:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:48:39,305 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-27 12:48:39,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046174444] [2019-12-27 12:48:39,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:48:39,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 12:48:39,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487791642] [2019-12-27 12:48:39,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 12:48:39,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:48:39,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 12:48:39,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:48:39,308 INFO L87 Difference]: Start difference. First operand 4541 states and 10113 transitions. Second operand 7 states. [2019-12-27 12:48:39,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:48:39,795 INFO L93 Difference]: Finished difference Result 5463 states and 12048 transitions. [2019-12-27 12:48:39,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 12:48:39,796 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-12-27 12:48:39,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:48:39,803 INFO L225 Difference]: With dead ends: 5463 [2019-12-27 12:48:39,803 INFO L226 Difference]: Without dead ends: 5410 [2019-12-27 12:48:39,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-27 12:48:39,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5410 states. [2019-12-27 12:48:39,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5410 to 4613. [2019-12-27 12:48:39,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4613 states. [2019-12-27 12:48:39,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4613 states to 4613 states and 10165 transitions. [2019-12-27 12:48:39,850 INFO L78 Accepts]: Start accepts. Automaton has 4613 states and 10165 transitions. Word has length 74 [2019-12-27 12:48:39,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:48:39,850 INFO L462 AbstractCegarLoop]: Abstraction has 4613 states and 10165 transitions. [2019-12-27 12:48:39,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 12:48:39,851 INFO L276 IsEmpty]: Start isEmpty. Operand 4613 states and 10165 transitions. [2019-12-27 12:48:39,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 12:48:39,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:48:39,855 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:48:39,855 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:48:39,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:48:39,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1799739819, now seen corresponding path program 1 times [2019-12-27 12:48:39,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:48:39,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249257439] [2019-12-27 12:48:39,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:48:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:48:39,929 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-27 12:48:39,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249257439] [2019-12-27 12:48:39,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:48:39,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:48:39,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490269019] [2019-12-27 12:48:39,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:48:39,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:48:39,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:48:39,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:48:39,931 INFO L87 Difference]: Start difference. First operand 4613 states and 10165 transitions. Second operand 5 states. [2019-12-27 12:48:40,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:48:40,256 INFO L93 Difference]: Finished difference Result 5630 states and 12352 transitions. [2019-12-27 12:48:40,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:48:40,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-27 12:48:40,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:48:40,263 INFO L225 Difference]: With dead ends: 5630 [2019-12-27 12:48:40,264 INFO L226 Difference]: Without dead ends: 5630 [2019-12-27 12:48:40,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 12:48:40,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5630 states. [2019-12-27 12:48:40,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5630 to 4745. [2019-12-27 12:48:40,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4745 states. [2019-12-27 12:48:40,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4745 states to 4745 states and 10455 transitions. [2019-12-27 12:48:40,315 INFO L78 Accepts]: Start accepts. Automaton has 4745 states and 10455 transitions. Word has length 95 [2019-12-27 12:48:40,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:48:40,315 INFO L462 AbstractCegarLoop]: Abstraction has 4745 states and 10455 transitions. [2019-12-27 12:48:40,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:48:40,315 INFO L276 IsEmpty]: Start isEmpty. Operand 4745 states and 10455 transitions. [2019-12-27 12:48:40,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 12:48:40,320 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:48:40,320 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:48:40,320 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:48:40,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:48:40,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1523385151, now seen corresponding path program 2 times [2019-12-27 12:48:40,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:48:40,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994675136] [2019-12-27 12:48:40,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:48:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:48:40,390 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-27 12:48:40,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994675136] [2019-12-27 12:48:40,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:48:40,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:48:40,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436216590] [2019-12-27 12:48:40,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:48:40,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:48:40,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:48:40,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:48:40,393 INFO L87 Difference]: Start difference. First operand 4745 states and 10455 transitions. Second operand 4 states. [2019-12-27 12:48:40,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:48:40,495 INFO L93 Difference]: Finished difference Result 5650 states and 12371 transitions. [2019-12-27 12:48:40,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 12:48:40,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-27 12:48:40,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:48:40,503 INFO L225 Difference]: With dead ends: 5650 [2019-12-27 12:48:40,503 INFO L226 Difference]: Without dead ends: 5650 [2019-12-27 12:48:40,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:48:40,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5650 states. [2019-12-27 12:48:40,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5650 to 4903. [2019-12-27 12:48:40,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4903 states. [2019-12-27 12:48:40,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4903 states to 4903 states and 10782 transitions. [2019-12-27 12:48:40,556 INFO L78 Accepts]: Start accepts. Automaton has 4903 states and 10782 transitions. Word has length 95 [2019-12-27 12:48:40,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:48:40,556 INFO L462 AbstractCegarLoop]: Abstraction has 4903 states and 10782 transitions. [2019-12-27 12:48:40,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:48:40,556 INFO L276 IsEmpty]: Start isEmpty. Operand 4903 states and 10782 transitions. [2019-12-27 12:48:40,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 12:48:40,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:48:40,561 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:48:40,561 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:48:40,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:48:40,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1360927908, now seen corresponding path program 1 times [2019-12-27 12:48:40,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:48:40,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553079210] [2019-12-27 12:48:40,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:48:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:48:40,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:48:40,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553079210] [2019-12-27 12:48:40,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:48:40,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:48:40,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51014541] [2019-12-27 12:48:40,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:48:40,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:48:40,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:48:40,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:48:40,625 INFO L87 Difference]: Start difference. First operand 4903 states and 10782 transitions. Second operand 4 states. [2019-12-27 12:48:40,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:48:40,731 INFO L93 Difference]: Finished difference Result 5334 states and 11749 transitions. [2019-12-27 12:48:40,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 12:48:40,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-27 12:48:40,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:48:40,739 INFO L225 Difference]: With dead ends: 5334 [2019-12-27 12:48:40,740 INFO L226 Difference]: Without dead ends: 5334 [2019-12-27 12:48:40,740 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-27 12:48:40,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5334 states. [2019-12-27 12:48:40,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5334 to 4974. [2019-12-27 12:48:40,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4974 states. [2019-12-27 12:48:40,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4974 states to 4974 states and 10933 transitions. [2019-12-27 12:48:40,795 INFO L78 Accepts]: Start accepts. Automaton has 4974 states and 10933 transitions. Word has length 97 [2019-12-27 12:48:40,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:48:40,795 INFO L462 AbstractCegarLoop]: Abstraction has 4974 states and 10933 transitions. [2019-12-27 12:48:40,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:48:40,795 INFO L276 IsEmpty]: Start isEmpty. Operand 4974 states and 10933 transitions. [2019-12-27 12:48:40,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 12:48:40,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:48:40,800 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 12:48:40,800 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:48:40,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:48:40,801 INFO L82 PathProgramCache]: Analyzing trace with hash 626553852, now seen corresponding path program 1 times [2019-12-27 12:48:40,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:48:40,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44658435] [2019-12-27 12:48:40,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:48:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:48:40,898 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-27 12:48:40,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44658435] [2019-12-27 12:48:40,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:48:40,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:48:40,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131437676] [2019-12-27 12:48:40,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:48:40,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:48:40,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:48:40,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:48:40,901 INFO L87 Difference]: Start difference. First operand 4974 states and 10933 transitions. Second operand 6 states. [2019-12-27 12:48:41,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:48:41,156 INFO L93 Difference]: Finished difference Result 5422 states and 11865 transitions. [2019-12-27 12:48:41,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 12:48:41,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-27 12:48:41,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:48:41,164 INFO L225 Difference]: With dead ends: 5422 [2019-12-27 12:48:41,164 INFO L226 Difference]: Without dead ends: 5422 [2019-12-27 12:48:41,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:48:41,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5422 states. [2019-12-27 12:48:41,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5422 to 4850. [2019-12-27 12:48:41,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4850 states. [2019-12-27 12:48:41,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4850 states to 4850 states and 10706 transitions. [2019-12-27 12:48:41,218 INFO L78 Accepts]: Start accepts. Automaton has 4850 states and 10706 transitions. Word has length 97 [2019-12-27 12:48:41,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:48:41,218 INFO L462 AbstractCegarLoop]: Abstraction has 4850 states and 10706 transitions. [2019-12-27 12:48:41,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:48:41,218 INFO L276 IsEmpty]: Start isEmpty. Operand 4850 states and 10706 transitions. [2019-12-27 12:48:41,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 12:48:41,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:48:41,224 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:48:41,224 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:48:41,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:48:41,225 INFO L82 PathProgramCache]: Analyzing trace with hash 956185055, now seen corresponding path program 1 times [2019-12-27 12:48:41,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:48:41,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794442955] [2019-12-27 12:48:41,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:48:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:48:41,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:48:41,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794442955] [2019-12-27 12:48:41,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:48:41,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:48:41,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845553951] [2019-12-27 12:48:41,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:48:41,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:48:41,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:48:41,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:48:41,296 INFO L87 Difference]: Start difference. First operand 4850 states and 10706 transitions. Second operand 4 states. [2019-12-27 12:48:41,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:48:41,577 INFO L93 Difference]: Finished difference Result 6097 states and 13389 transitions. [2019-12-27 12:48:41,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 12:48:41,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-27 12:48:41,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:48:41,585 INFO L225 Difference]: With dead ends: 6097 [2019-12-27 12:48:41,586 INFO L226 Difference]: Without dead ends: 6045 [2019-12-27 12:48:41,586 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-27 12:48:41,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6045 states. [2019-12-27 12:48:41,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6045 to 5760. [2019-12-27 12:48:41,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5760 states. [2019-12-27 12:48:41,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5760 states to 5760 states and 12675 transitions. [2019-12-27 12:48:41,644 INFO L78 Accepts]: Start accepts. Automaton has 5760 states and 12675 transitions. Word has length 97 [2019-12-27 12:48:41,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:48:41,644 INFO L462 AbstractCegarLoop]: Abstraction has 5760 states and 12675 transitions. [2019-12-27 12:48:41,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:48:41,644 INFO L276 IsEmpty]: Start isEmpty. Operand 5760 states and 12675 transitions. [2019-12-27 12:48:41,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 12:48:41,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:48:41,650 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:48:41,650 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:48:41,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:48:41,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1186461248, now seen corresponding path program 1 times [2019-12-27 12:48:41,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:48:41,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167248840] [2019-12-27 12:48:41,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:48:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:48:41,737 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-27 12:48:41,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167248840] [2019-12-27 12:48:41,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:48:41,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 12:48:41,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344297792] [2019-12-27 12:48:41,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 12:48:41,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:48:41,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 12:48:41,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:48:41,739 INFO L87 Difference]: Start difference. First operand 5760 states and 12675 transitions. Second operand 7 states. [2019-12-27 12:48:42,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:48:42,254 INFO L93 Difference]: Finished difference Result 7222 states and 15870 transitions. [2019-12-27 12:48:42,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 12:48:42,255 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-27 12:48:42,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:48:42,264 INFO L225 Difference]: With dead ends: 7222 [2019-12-27 12:48:42,264 INFO L226 Difference]: Without dead ends: 7222 [2019-12-27 12:48:42,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-27 12:48:42,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7222 states. [2019-12-27 12:48:42,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7222 to 6627. [2019-12-27 12:48:42,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6627 states. [2019-12-27 12:48:42,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6627 states to 6627 states and 14618 transitions. [2019-12-27 12:48:42,332 INFO L78 Accepts]: Start accepts. Automaton has 6627 states and 14618 transitions. Word has length 97 [2019-12-27 12:48:42,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:48:42,333 INFO L462 AbstractCegarLoop]: Abstraction has 6627 states and 14618 transitions. [2019-12-27 12:48:42,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 12:48:42,333 INFO L276 IsEmpty]: Start isEmpty. Operand 6627 states and 14618 transitions. [2019-12-27 12:48:42,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 12:48:42,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:48:42,339 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:48:42,339 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:48:42,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:48:42,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1121024288, now seen corresponding path program 1 times [2019-12-27 12:48:42,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:48:42,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827004860] [2019-12-27 12:48:42,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:48:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:48:42,505 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-27 12:48:42,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827004860] [2019-12-27 12:48:42,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:48:42,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 12:48:42,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509302237] [2019-12-27 12:48:42,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 12:48:42,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:48:42,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 12:48:42,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 12:48:42,507 INFO L87 Difference]: Start difference. First operand 6627 states and 14618 transitions. Second operand 9 states. [2019-12-27 12:48:43,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:48:43,349 INFO L93 Difference]: Finished difference Result 7510 states and 16372 transitions. [2019-12-27 12:48:43,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 12:48:43,349 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-12-27 12:48:43,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:48:43,363 INFO L225 Difference]: With dead ends: 7510 [2019-12-27 12:48:43,364 INFO L226 Difference]: Without dead ends: 7510 [2019-12-27 12:48:43,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-12-27 12:48:43,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7510 states. [2019-12-27 12:48:43,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7510 to 6475. [2019-12-27 12:48:43,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6475 states. [2019-12-27 12:48:43,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6475 states to 6475 states and 14189 transitions. [2019-12-27 12:48:43,505 INFO L78 Accepts]: Start accepts. Automaton has 6475 states and 14189 transitions. Word has length 97 [2019-12-27 12:48:43,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:48:43,506 INFO L462 AbstractCegarLoop]: Abstraction has 6475 states and 14189 transitions. [2019-12-27 12:48:43,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 12:48:43,506 INFO L276 IsEmpty]: Start isEmpty. Operand 6475 states and 14189 transitions. [2019-12-27 12:48:43,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 12:48:43,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:48:43,518 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:48:43,519 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:48:43,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:48:43,519 INFO L82 PathProgramCache]: Analyzing trace with hash -909673375, now seen corresponding path program 1 times [2019-12-27 12:48:43,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:48:43,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134672569] [2019-12-27 12:48:43,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:48:43,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:48:43,694 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-27 12:48:43,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134672569] [2019-12-27 12:48:43,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:48:43,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 12:48:43,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867386279] [2019-12-27 12:48:43,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 12:48:43,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:48:43,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 12:48:43,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-27 12:48:43,696 INFO L87 Difference]: Start difference. First operand 6475 states and 14189 transitions. Second operand 10 states. [2019-12-27 12:48:44,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:48:44,172 INFO L93 Difference]: Finished difference Result 20141 states and 44890 transitions. [2019-12-27 12:48:44,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 12:48:44,173 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-27 12:48:44,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:48:44,192 INFO L225 Difference]: With dead ends: 20141 [2019-12-27 12:48:44,193 INFO L226 Difference]: Without dead ends: 13208 [2019-12-27 12:48:44,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-27 12:48:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13208 states. [2019-12-27 12:48:44,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13208 to 6288. [2019-12-27 12:48:44,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6288 states. [2019-12-27 12:48:44,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6288 states to 6288 states and 13743 transitions. [2019-12-27 12:48:44,295 INFO L78 Accepts]: Start accepts. Automaton has 6288 states and 13743 transitions. Word has length 97 [2019-12-27 12:48:44,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:48:44,295 INFO L462 AbstractCegarLoop]: Abstraction has 6288 states and 13743 transitions. [2019-12-27 12:48:44,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 12:48:44,295 INFO L276 IsEmpty]: Start isEmpty. Operand 6288 states and 13743 transitions. [2019-12-27 12:48:44,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 12:48:44,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:48:44,305 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:48:44,305 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:48:44,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:48:44,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1579425151, now seen corresponding path program 2 times [2019-12-27 12:48:44,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:48:44,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077475237] [2019-12-27 12:48:44,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:48:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 12:48:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 12:48:44,396 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 12:48:44,396 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 12:48:44,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 12:48:44 BasicIcfg [2019-12-27 12:48:44,610 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 12:48:44,613 INFO L168 Benchmark]: Toolchain (without parser) took 41184.09 ms. Allocated memory was 145.8 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 101.8 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 765.6 MB. Max. memory is 7.1 GB. [2019-12-27 12:48:44,613 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 12:48:44,614 INFO L168 Benchmark]: CACSL2BoogieTranslator took 727.57 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.4 MB in the beginning and 157.5 MB in the end (delta: -56.1 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-27 12:48:44,615 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.57 ms. Allocated memory is still 203.4 MB. Free memory was 157.5 MB in the beginning and 154.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 12:48:44,615 INFO L168 Benchmark]: Boogie Preprocessor took 43.90 ms. Allocated memory is still 203.4 MB. Free memory was 154.9 MB in the beginning and 153.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 12:48:44,616 INFO L168 Benchmark]: RCFGBuilder took 754.91 ms. Allocated memory is still 203.4 MB. Free memory was 153.0 MB in the beginning and 108.7 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-12-27 12:48:44,616 INFO L168 Benchmark]: TraceAbstraction took 39578.92 ms. Allocated memory was 203.4 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 108.0 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 714.1 MB. Max. memory is 7.1 GB. [2019-12-27 12:48:44,619 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.18 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 727.57 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.4 MB in the beginning and 157.5 MB in the end (delta: -56.1 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.57 ms. Allocated memory is still 203.4 MB. Free memory was 157.5 MB in the beginning and 154.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.90 ms. Allocated memory is still 203.4 MB. Free memory was 154.9 MB in the beginning and 153.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 754.91 ms. Allocated memory is still 203.4 MB. Free memory was 153.0 MB in the beginning and 108.7 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 39578.92 ms. Allocated memory was 203.4 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 108.0 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 714.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L698] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L703] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L704] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L705] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L706] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L707] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L708] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L709] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L710] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L711] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L712] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L713] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L714] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L715] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L716] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L718] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L720] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L721] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L722] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L801] 0 pthread_t t1601; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t1601, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L726] 1 x$w_buff1 = x$w_buff0 [L727] 1 x$w_buff0 = 1 [L728] 1 x$w_buff1_used = x$w_buff0_used [L729] 1 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L803] 0 pthread_t t1602; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1602, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L731] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L732] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L733] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L734] 1 x$r_buff0_thd1 = (_Bool)1 [L737] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, z=0] [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, 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=1, z=0] [L754] 2 y = 2 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 x$flush_delayed = weak$$choice2 [L766] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=2, z=1] [L767] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=2, z=1] [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=2, z=1] [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L767] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L768] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L768] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L769] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L769] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L770] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L770] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L771] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L772] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L773] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L773] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L775] EXPR 2 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L775] 2 x = x$flush_delayed ? x$mem_tmp : x [L776] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L779] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2, z=1] [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2, z=1] [L779] 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) [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L780] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L781] 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 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L782] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L783] 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 [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L810] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L810] 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) [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L811] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L812] 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 [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L813] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L814] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L814] 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 [L817] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 39.1s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 17.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6930 SDtfs, 7173 SDslu, 15787 SDs, 0 SdLazy, 5709 SolverSat, 325 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 245 GetRequests, 68 SyntacticMatches, 16 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59950occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 59951 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1878 NumberOfCodeBlocks, 1878 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1756 ConstructedInterpolants, 0 QuantifiedInterpolants, 289158 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...