/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/rfi010_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 04:07:35,302 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 04:07:35,306 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 04:07:35,325 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 04:07:35,325 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 04:07:35,327 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 04:07:35,329 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 04:07:35,339 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 04:07:35,341 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 04:07:35,342 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 04:07:35,343 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 04:07:35,345 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 04:07:35,345 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 04:07:35,346 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 04:07:35,348 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 04:07:35,349 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 04:07:35,350 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 04:07:35,351 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 04:07:35,353 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 04:07:35,355 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 04:07:35,356 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 04:07:35,357 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 04:07:35,358 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 04:07:35,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 04:07:35,361 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 04:07:35,361 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 04:07:35,362 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 04:07:35,362 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 04:07:35,363 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 04:07:35,364 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 04:07:35,364 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 04:07:35,365 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 04:07:35,366 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 04:07:35,366 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 04:07:35,367 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 04:07:35,368 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 04:07:35,368 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 04:07:35,368 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 04:07:35,369 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 04:07:35,369 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 04:07:35,370 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 04:07:35,371 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-19 04:07:35,385 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 04:07:35,385 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 04:07:35,387 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 04:07:35,387 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 04:07:35,387 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 04:07:35,387 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 04:07:35,387 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 04:07:35,388 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 04:07:35,388 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 04:07:35,388 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 04:07:35,388 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 04:07:35,388 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 04:07:35,389 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 04:07:35,389 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 04:07:35,389 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 04:07:35,389 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 04:07:35,389 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 04:07:35,390 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 04:07:35,390 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 04:07:35,390 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 04:07:35,390 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 04:07:35,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 04:07:35,391 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 04:07:35,391 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 04:07:35,391 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 04:07:35,391 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 04:07:35,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 04:07:35,392 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 04:07:35,392 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 04:07:35,393 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 04:07:35,695 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 04:07:35,712 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 04:07:35,715 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 04:07:35,716 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 04:07:35,716 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 04:07:35,717 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi010_tso.oepc.i [2019-12-19 04:07:35,778 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1beaf1d7/ee5376819a1b4741aeef3c80104d81b0/FLAGf752f17da [2019-12-19 04:07:36,334 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 04:07:36,335 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi010_tso.oepc.i [2019-12-19 04:07:36,349 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1beaf1d7/ee5376819a1b4741aeef3c80104d81b0/FLAGf752f17da [2019-12-19 04:07:36,585 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1beaf1d7/ee5376819a1b4741aeef3c80104d81b0 [2019-12-19 04:07:36,594 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 04:07:36,596 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 04:07:36,597 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 04:07:36,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 04:07:36,601 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 04:07:36,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 04:07:36" (1/1) ... [2019-12-19 04:07:36,605 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45be7259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:07:36, skipping insertion in model container [2019-12-19 04:07:36,605 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 04:07:36" (1/1) ... [2019-12-19 04:07:36,613 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 04:07:36,668 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 04:07:37,217 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 04:07:37,238 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 04:07:37,342 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 04:07:37,426 INFO L208 MainTranslator]: Completed translation [2019-12-19 04:07:37,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:07:37 WrapperNode [2019-12-19 04:07:37,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 04:07:37,428 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 04:07:37,428 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 04:07:37,428 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 04:07:37,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:07:37" (1/1) ... [2019-12-19 04:07:37,462 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:07:37" (1/1) ... [2019-12-19 04:07:37,499 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 04:07:37,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 04:07:37,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 04:07:37,504 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 04:07:37,514 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:07:37" (1/1) ... [2019-12-19 04:07:37,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:07:37" (1/1) ... [2019-12-19 04:07:37,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:07:37" (1/1) ... [2019-12-19 04:07:37,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:07:37" (1/1) ... [2019-12-19 04:07:37,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:07:37" (1/1) ... [2019-12-19 04:07:37,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:07:37" (1/1) ... [2019-12-19 04:07:37,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:07:37" (1/1) ... [2019-12-19 04:07:37,545 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 04:07:37,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 04:07:37,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 04:07:37,546 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 04:07:37,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:07:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 04:07:37,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 04:07:37,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 04:07:37,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 04:07:37,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 04:07:37,651 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 04:07:37,651 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 04:07:37,651 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 04:07:37,652 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 04:07:37,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 04:07:37,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 04:07:37,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 04:07:37,655 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-19 04:07:38,719 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 04:07:38,719 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 04:07:38,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 04:07:38 BoogieIcfgContainer [2019-12-19 04:07:38,721 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 04:07:38,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 04:07:38,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 04:07:38,725 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 04:07:38,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 04:07:36" (1/3) ... [2019-12-19 04:07:38,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d29cd9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 04:07:38, skipping insertion in model container [2019-12-19 04:07:38,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:07:37" (2/3) ... [2019-12-19 04:07:38,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d29cd9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 04:07:38, skipping insertion in model container [2019-12-19 04:07:38,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 04:07:38" (3/3) ... [2019-12-19 04:07:38,729 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi010_tso.oepc.i [2019-12-19 04:07:38,738 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 04:07:38,738 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 04:07:38,746 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 04:07:38,747 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 04:07:38,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,791 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,792 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,833 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,833 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,834 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,834 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,834 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,862 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,863 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,871 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,872 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,874 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:07:38,891 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 04:07:38,913 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 04:07:38,913 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 04:07:38,913 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 04:07:38,913 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 04:07:38,914 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 04:07:38,914 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 04:07:38,914 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 04:07:38,914 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 04:07:38,930 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 178 places, 227 transitions [2019-12-19 04:07:47,862 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80072 states. [2019-12-19 04:07:47,864 INFO L276 IsEmpty]: Start isEmpty. Operand 80072 states. [2019-12-19 04:07:47,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-19 04:07:47,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:47,878 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:07:47,878 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:47,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:47,885 INFO L82 PathProgramCache]: Analyzing trace with hash 71050137, now seen corresponding path program 1 times [2019-12-19 04:07:47,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:47,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133921071] [2019-12-19 04:07:47,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:48,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:07:48,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133921071] [2019-12-19 04:07:48,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:48,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:07:48,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501410441] [2019-12-19 04:07:48,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:07:48,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:48,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:07:48,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:07:48,252 INFO L87 Difference]: Start difference. First operand 80072 states. Second operand 4 states. [2019-12-19 04:07:50,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:50,438 INFO L93 Difference]: Finished difference Result 80712 states and 324637 transitions. [2019-12-19 04:07:50,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 04:07:50,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-19 04:07:50,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:50,883 INFO L225 Difference]: With dead ends: 80712 [2019-12-19 04:07:50,883 INFO L226 Difference]: Without dead ends: 59000 [2019-12-19 04:07:50,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:07:53,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59000 states. [2019-12-19 04:07:55,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59000 to 59000. [2019-12-19 04:07:55,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59000 states. [2019-12-19 04:07:55,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59000 states to 59000 states and 240125 transitions. [2019-12-19 04:07:55,776 INFO L78 Accepts]: Start accepts. Automaton has 59000 states and 240125 transitions. Word has length 39 [2019-12-19 04:07:55,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:55,777 INFO L462 AbstractCegarLoop]: Abstraction has 59000 states and 240125 transitions. [2019-12-19 04:07:55,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:07:55,777 INFO L276 IsEmpty]: Start isEmpty. Operand 59000 states and 240125 transitions. [2019-12-19 04:07:55,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-19 04:07:55,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:55,786 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-19 04:07:55,787 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:55,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:55,787 INFO L82 PathProgramCache]: Analyzing trace with hash -256602995, now seen corresponding path program 1 times [2019-12-19 04:07:55,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:55,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323061309] [2019-12-19 04:07:55,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:55,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:07:55,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323061309] [2019-12-19 04:07:55,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:55,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:07:55,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120976823] [2019-12-19 04:07:55,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:07:55,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:55,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:07:55,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:07:55,937 INFO L87 Difference]: Start difference. First operand 59000 states and 240125 transitions. Second operand 5 states. [2019-12-19 04:07:59,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:59,041 INFO L93 Difference]: Finished difference Result 95594 states and 363716 transitions. [2019-12-19 04:07:59,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:07:59,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-19 04:07:59,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:59,790 INFO L225 Difference]: With dead ends: 95594 [2019-12-19 04:07:59,790 INFO L226 Difference]: Without dead ends: 95042 [2019-12-19 04:07:59,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:08:01,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95042 states. [2019-12-19 04:08:05,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95042 to 93164. [2019-12-19 04:08:05,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93164 states. [2019-12-19 04:08:06,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93164 states to 93164 states and 356302 transitions. [2019-12-19 04:08:06,220 INFO L78 Accepts]: Start accepts. Automaton has 93164 states and 356302 transitions. Word has length 47 [2019-12-19 04:08:06,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:08:06,222 INFO L462 AbstractCegarLoop]: Abstraction has 93164 states and 356302 transitions. [2019-12-19 04:08:06,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:08:06,222 INFO L276 IsEmpty]: Start isEmpty. Operand 93164 states and 356302 transitions. [2019-12-19 04:08:06,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-19 04:08:06,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:08:06,233 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-19 04:08:06,234 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:08:06,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:08:06,234 INFO L82 PathProgramCache]: Analyzing trace with hash -85893698, now seen corresponding path program 1 times [2019-12-19 04:08:06,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:08:06,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027677957] [2019-12-19 04:08:06,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:08:06,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:08:06,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:08:06,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027677957] [2019-12-19 04:08:06,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:08:06,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:08:06,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289149073] [2019-12-19 04:08:06,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:08:06,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:08:06,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:08:06,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:08:06,352 INFO L87 Difference]: Start difference. First operand 93164 states and 356302 transitions. Second operand 5 states. [2019-12-19 04:08:10,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:08:10,571 INFO L93 Difference]: Finished difference Result 118508 states and 442883 transitions. [2019-12-19 04:08:10,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:08:10,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-19 04:08:10,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:08:11,031 INFO L225 Difference]: With dead ends: 118508 [2019-12-19 04:08:11,031 INFO L226 Difference]: Without dead ends: 118060 [2019-12-19 04:08:11,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:08:12,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118060 states. [2019-12-19 04:08:14,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118060 to 104153. [2019-12-19 04:08:14,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104153 states. [2019-12-19 04:08:14,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104153 states to 104153 states and 394236 transitions. [2019-12-19 04:08:14,991 INFO L78 Accepts]: Start accepts. Automaton has 104153 states and 394236 transitions. Word has length 48 [2019-12-19 04:08:14,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:08:14,992 INFO L462 AbstractCegarLoop]: Abstraction has 104153 states and 394236 transitions. [2019-12-19 04:08:14,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:08:14,992 INFO L276 IsEmpty]: Start isEmpty. Operand 104153 states and 394236 transitions. [2019-12-19 04:08:15,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-19 04:08:15,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:08:15,001 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:08:15,001 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:08:15,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:08:15,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1345260124, now seen corresponding path program 1 times [2019-12-19 04:08:15,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:08:15,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060639780] [2019-12-19 04:08:15,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:08:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:08:15,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:08:15,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060639780] [2019-12-19 04:08:15,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:08:15,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:08:15,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220004353] [2019-12-19 04:08:15,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:08:15,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:08:15,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:08:15,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:08:15,052 INFO L87 Difference]: Start difference. First operand 104153 states and 394236 transitions. Second operand 3 states. [2019-12-19 04:08:19,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:08:19,966 INFO L93 Difference]: Finished difference Result 170911 states and 627058 transitions. [2019-12-19 04:08:19,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:08:19,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-19 04:08:19,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:08:20,379 INFO L225 Difference]: With dead ends: 170911 [2019-12-19 04:08:20,379 INFO L226 Difference]: Without dead ends: 170911 [2019-12-19 04:08:20,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:08:22,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170911 states. [2019-12-19 04:08:24,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170911 to 157189. [2019-12-19 04:08:24,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157189 states. [2019-12-19 04:08:26,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157189 states to 157189 states and 581290 transitions. [2019-12-19 04:08:26,293 INFO L78 Accepts]: Start accepts. Automaton has 157189 states and 581290 transitions. Word has length 50 [2019-12-19 04:08:26,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:08:26,293 INFO L462 AbstractCegarLoop]: Abstraction has 157189 states and 581290 transitions. [2019-12-19 04:08:26,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:08:26,293 INFO L276 IsEmpty]: Start isEmpty. Operand 157189 states and 581290 transitions. [2019-12-19 04:08:26,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 04:08:26,328 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:08:26,328 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-19 04:08:26,328 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:08:26,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:08:26,329 INFO L82 PathProgramCache]: Analyzing trace with hash 246072175, now seen corresponding path program 1 times [2019-12-19 04:08:26,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:08:26,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837548654] [2019-12-19 04:08:26,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:08:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:08:26,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:08:26,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837548654] [2019-12-19 04:08:26,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:08:26,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:08:26,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207152968] [2019-12-19 04:08:26,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:08:26,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:08:26,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:08:26,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:08:26,473 INFO L87 Difference]: Start difference. First operand 157189 states and 581290 transitions. Second operand 6 states. [2019-12-19 04:08:29,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:08:29,270 INFO L93 Difference]: Finished difference Result 212573 states and 766172 transitions. [2019-12-19 04:08:29,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 04:08:29,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-19 04:08:29,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:08:29,823 INFO L225 Difference]: With dead ends: 212573 [2019-12-19 04:08:29,823 INFO L226 Difference]: Without dead ends: 212053 [2019-12-19 04:08:29,823 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-19 04:08:32,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212053 states. [2019-12-19 04:08:40,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212053 to 157971. [2019-12-19 04:08:40,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157971 states. [2019-12-19 04:08:42,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157971 states to 157971 states and 584227 transitions. [2019-12-19 04:08:42,077 INFO L78 Accepts]: Start accepts. Automaton has 157971 states and 584227 transitions. Word has length 54 [2019-12-19 04:08:42,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:08:42,078 INFO L462 AbstractCegarLoop]: Abstraction has 157971 states and 584227 transitions. [2019-12-19 04:08:42,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:08:42,078 INFO L276 IsEmpty]: Start isEmpty. Operand 157971 states and 584227 transitions. [2019-12-19 04:08:42,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 04:08:42,104 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:08:42,104 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-19 04:08:42,104 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:08:42,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:08:42,105 INFO L82 PathProgramCache]: Analyzing trace with hash 104351519, now seen corresponding path program 1 times [2019-12-19 04:08:42,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:08:42,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923263237] [2019-12-19 04:08:42,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:08:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:08:42,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:08:42,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923263237] [2019-12-19 04:08:42,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:08:42,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:08:42,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4939653] [2019-12-19 04:08:42,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:08:42,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:08:42,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:08:42,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:08:42,220 INFO L87 Difference]: Start difference. First operand 157971 states and 584227 transitions. Second operand 7 states. [2019-12-19 04:08:49,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:08:49,941 INFO L93 Difference]: Finished difference Result 264420 states and 941443 transitions. [2019-12-19 04:08:49,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 04:08:49,942 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-19 04:08:49,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:08:50,642 INFO L225 Difference]: With dead ends: 264420 [2019-12-19 04:08:50,643 INFO L226 Difference]: Without dead ends: 264420 [2019-12-19 04:08:50,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 04:08:53,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264420 states. [2019-12-19 04:08:56,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264420 to 196980. [2019-12-19 04:08:56,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196980 states. [2019-12-19 04:08:57,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196980 states to 196980 states and 717858 transitions. [2019-12-19 04:08:57,379 INFO L78 Accepts]: Start accepts. Automaton has 196980 states and 717858 transitions. Word has length 54 [2019-12-19 04:08:57,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:08:57,379 INFO L462 AbstractCegarLoop]: Abstraction has 196980 states and 717858 transitions. [2019-12-19 04:08:57,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:08:57,379 INFO L276 IsEmpty]: Start isEmpty. Operand 196980 states and 717858 transitions. [2019-12-19 04:08:57,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 04:08:57,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:08:57,407 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-19 04:08:57,407 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:08:57,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:08:57,408 INFO L82 PathProgramCache]: Analyzing trace with hash 991855200, now seen corresponding path program 1 times [2019-12-19 04:08:57,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:08:57,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911457477] [2019-12-19 04:08:57,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:08:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:08:57,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:08:57,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911457477] [2019-12-19 04:08:57,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:08:57,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:08:57,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594219268] [2019-12-19 04:08:57,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:08:57,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:08:57,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:08:57,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:08:57,493 INFO L87 Difference]: Start difference. First operand 196980 states and 717858 transitions. Second operand 4 states. [2019-12-19 04:08:57,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:08:57,674 INFO L93 Difference]: Finished difference Result 30610 states and 95534 transitions. [2019-12-19 04:08:57,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:08:57,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-19 04:08:57,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:08:57,737 INFO L225 Difference]: With dead ends: 30610 [2019-12-19 04:08:57,737 INFO L226 Difference]: Without dead ends: 24312 [2019-12-19 04:08:57,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:08:57,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24312 states. [2019-12-19 04:08:59,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24312 to 24065. [2019-12-19 04:08:59,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24065 states. [2019-12-19 04:08:59,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24065 states to 24065 states and 73043 transitions. [2019-12-19 04:08:59,533 INFO L78 Accepts]: Start accepts. Automaton has 24065 states and 73043 transitions. Word has length 54 [2019-12-19 04:08:59,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:08:59,533 INFO L462 AbstractCegarLoop]: Abstraction has 24065 states and 73043 transitions. [2019-12-19 04:08:59,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:08:59,533 INFO L276 IsEmpty]: Start isEmpty. Operand 24065 states and 73043 transitions. [2019-12-19 04:08:59,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-19 04:08:59,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:08:59,540 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:08:59,540 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:08:59,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:08:59,540 INFO L82 PathProgramCache]: Analyzing trace with hash -274013666, now seen corresponding path program 1 times [2019-12-19 04:08:59,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:08:59,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326735497] [2019-12-19 04:08:59,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:08:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:08:59,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:08:59,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326735497] [2019-12-19 04:08:59,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:08:59,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:08:59,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653667015] [2019-12-19 04:08:59,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:08:59,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:08:59,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:08:59,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:08:59,604 INFO L87 Difference]: Start difference. First operand 24065 states and 73043 transitions. Second operand 4 states. [2019-12-19 04:08:59,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:08:59,905 INFO L93 Difference]: Finished difference Result 30645 states and 93922 transitions. [2019-12-19 04:08:59,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:08:59,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-19 04:08:59,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:08:59,953 INFO L225 Difference]: With dead ends: 30645 [2019-12-19 04:08:59,953 INFO L226 Difference]: Without dead ends: 30645 [2019-12-19 04:08:59,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:09:00,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30645 states. [2019-12-19 04:09:00,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30645 to 27294. [2019-12-19 04:09:00,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27294 states. [2019-12-19 04:09:00,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27294 states to 27294 states and 83105 transitions. [2019-12-19 04:09:00,359 INFO L78 Accepts]: Start accepts. Automaton has 27294 states and 83105 transitions. Word has length 64 [2019-12-19 04:09:00,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:09:00,359 INFO L462 AbstractCegarLoop]: Abstraction has 27294 states and 83105 transitions. [2019-12-19 04:09:00,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:09:00,359 INFO L276 IsEmpty]: Start isEmpty. Operand 27294 states and 83105 transitions. [2019-12-19 04:09:00,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-19 04:09:00,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:09:00,367 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:09:00,367 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:09:00,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:09:00,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1468796669, now seen corresponding path program 1 times [2019-12-19 04:09:00,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:09:00,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126577605] [2019-12-19 04:09:00,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:09:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:09:00,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:09:00,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126577605] [2019-12-19 04:09:00,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:09:00,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:09:00,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500212742] [2019-12-19 04:09:00,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:09:00,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:09:00,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:09:00,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:09:00,469 INFO L87 Difference]: Start difference. First operand 27294 states and 83105 transitions. Second operand 6 states. [2019-12-19 04:09:01,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:09:01,300 INFO L93 Difference]: Finished difference Result 37354 states and 111263 transitions. [2019-12-19 04:09:01,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-19 04:09:01,300 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-19 04:09:01,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:09:01,354 INFO L225 Difference]: With dead ends: 37354 [2019-12-19 04:09:01,355 INFO L226 Difference]: Without dead ends: 37306 [2019-12-19 04:09:01,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-12-19 04:09:01,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37306 states. [2019-12-19 04:09:02,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37306 to 31311. [2019-12-19 04:09:02,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31311 states. [2019-12-19 04:09:02,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31311 states to 31311 states and 94045 transitions. [2019-12-19 04:09:02,271 INFO L78 Accepts]: Start accepts. Automaton has 31311 states and 94045 transitions. Word has length 64 [2019-12-19 04:09:02,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:09:02,271 INFO L462 AbstractCegarLoop]: Abstraction has 31311 states and 94045 transitions. [2019-12-19 04:09:02,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:09:02,271 INFO L276 IsEmpty]: Start isEmpty. Operand 31311 states and 94045 transitions. [2019-12-19 04:09:02,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 04:09:02,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:09:02,285 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:09:02,285 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:09:02,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:09:02,286 INFO L82 PathProgramCache]: Analyzing trace with hash -466486930, now seen corresponding path program 1 times [2019-12-19 04:09:02,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:09:02,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927687182] [2019-12-19 04:09:02,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:09:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:09:02,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:09:02,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927687182] [2019-12-19 04:09:02,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:09:02,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:09:02,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696065127] [2019-12-19 04:09:02,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:09:02,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:09:02,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:09:02,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:09:02,337 INFO L87 Difference]: Start difference. First operand 31311 states and 94045 transitions. Second operand 3 states. [2019-12-19 04:09:02,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:09:02,500 INFO L93 Difference]: Finished difference Result 35437 states and 104776 transitions. [2019-12-19 04:09:02,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:09:02,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-19 04:09:02,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:09:02,548 INFO L225 Difference]: With dead ends: 35437 [2019-12-19 04:09:02,549 INFO L226 Difference]: Without dead ends: 35437 [2019-12-19 04:09:02,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:09:02,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35437 states. [2019-12-19 04:09:02,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35437 to 30985. [2019-12-19 04:09:02,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30985 states. [2019-12-19 04:09:02,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30985 states to 30985 states and 90960 transitions. [2019-12-19 04:09:02,964 INFO L78 Accepts]: Start accepts. Automaton has 30985 states and 90960 transitions. Word has length 70 [2019-12-19 04:09:02,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:09:02,964 INFO L462 AbstractCegarLoop]: Abstraction has 30985 states and 90960 transitions. [2019-12-19 04:09:02,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:09:02,965 INFO L276 IsEmpty]: Start isEmpty. Operand 30985 states and 90960 transitions. [2019-12-19 04:09:02,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 04:09:02,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:09:02,980 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:09:02,980 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:09:02,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:09:02,980 INFO L82 PathProgramCache]: Analyzing trace with hash 334384880, now seen corresponding path program 1 times [2019-12-19 04:09:02,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:09:02,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093207073] [2019-12-19 04:09:02,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:09:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:09:03,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:09:03,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093207073] [2019-12-19 04:09:03,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:09:03,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 04:09:03,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579221719] [2019-12-19 04:09:03,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 04:09:03,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:09:03,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 04:09:03,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:09:03,098 INFO L87 Difference]: Start difference. First operand 30985 states and 90960 transitions. Second operand 8 states. [2019-12-19 04:09:04,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:09:04,917 INFO L93 Difference]: Finished difference Result 40973 states and 119239 transitions. [2019-12-19 04:09:04,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 04:09:04,917 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2019-12-19 04:09:04,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:09:05,002 INFO L225 Difference]: With dead ends: 40973 [2019-12-19 04:09:05,003 INFO L226 Difference]: Without dead ends: 40973 [2019-12-19 04:09:05,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-19 04:09:05,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40973 states. [2019-12-19 04:09:05,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40973 to 34967. [2019-12-19 04:09:05,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34967 states. [2019-12-19 04:09:05,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34967 states to 34967 states and 102897 transitions. [2019-12-19 04:09:05,545 INFO L78 Accepts]: Start accepts. Automaton has 34967 states and 102897 transitions. Word has length 71 [2019-12-19 04:09:05,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:09:05,545 INFO L462 AbstractCegarLoop]: Abstraction has 34967 states and 102897 transitions. [2019-12-19 04:09:05,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 04:09:05,545 INFO L276 IsEmpty]: Start isEmpty. Operand 34967 states and 102897 transitions. [2019-12-19 04:09:05,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 04:09:05,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:09:05,559 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:09:05,560 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:09:05,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:09:05,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1221888561, now seen corresponding path program 1 times [2019-12-19 04:09:05,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:09:05,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796342079] [2019-12-19 04:09:05,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:09:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:09:05,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:09:05,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796342079] [2019-12-19 04:09:05,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:09:05,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:09:05,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238747485] [2019-12-19 04:09:05,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:09:05,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:09:05,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:09:05,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:09:05,663 INFO L87 Difference]: Start difference. First operand 34967 states and 102897 transitions. Second operand 5 states. [2019-12-19 04:09:05,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:09:05,742 INFO L93 Difference]: Finished difference Result 11717 states and 29266 transitions. [2019-12-19 04:09:05,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 04:09:05,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-19 04:09:05,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:09:05,757 INFO L225 Difference]: With dead ends: 11717 [2019-12-19 04:09:05,758 INFO L226 Difference]: Without dead ends: 10136 [2019-12-19 04:09:05,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:09:05,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10136 states. [2019-12-19 04:09:05,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10136 to 7516. [2019-12-19 04:09:05,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7516 states. [2019-12-19 04:09:05,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7516 states to 7516 states and 18693 transitions. [2019-12-19 04:09:05,860 INFO L78 Accepts]: Start accepts. Automaton has 7516 states and 18693 transitions. Word has length 71 [2019-12-19 04:09:05,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:09:05,861 INFO L462 AbstractCegarLoop]: Abstraction has 7516 states and 18693 transitions. [2019-12-19 04:09:05,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:09:05,861 INFO L276 IsEmpty]: Start isEmpty. Operand 7516 states and 18693 transitions. [2019-12-19 04:09:05,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 04:09:05,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:09:05,868 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:09:05,868 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:09:05,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:09:05,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1322286815, now seen corresponding path program 1 times [2019-12-19 04:09:05,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:09:05,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864924104] [2019-12-19 04:09:05,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:09:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:09:05,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:09:05,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864924104] [2019-12-19 04:09:05,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:09:05,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:09:05,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597613578] [2019-12-19 04:09:05,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:09:05,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:09:05,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:09:05,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:09:05,951 INFO L87 Difference]: Start difference. First operand 7516 states and 18693 transitions. Second operand 4 states. [2019-12-19 04:09:06,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:09:06,227 INFO L93 Difference]: Finished difference Result 8668 states and 21186 transitions. [2019-12-19 04:09:06,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 04:09:06,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-19 04:09:06,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:09:06,238 INFO L225 Difference]: With dead ends: 8668 [2019-12-19 04:09:06,239 INFO L226 Difference]: Without dead ends: 8668 [2019-12-19 04:09:06,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:09:06,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8668 states. [2019-12-19 04:09:06,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8668 to 8269. [2019-12-19 04:09:06,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8269 states. [2019-12-19 04:09:06,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8269 states to 8269 states and 20327 transitions. [2019-12-19 04:09:06,331 INFO L78 Accepts]: Start accepts. Automaton has 8269 states and 20327 transitions. Word has length 99 [2019-12-19 04:09:06,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:09:06,332 INFO L462 AbstractCegarLoop]: Abstraction has 8269 states and 20327 transitions. [2019-12-19 04:09:06,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:09:06,332 INFO L276 IsEmpty]: Start isEmpty. Operand 8269 states and 20327 transitions. [2019-12-19 04:09:06,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 04:09:06,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:09:06,342 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:09:06,343 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:09:06,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:09:06,343 INFO L82 PathProgramCache]: Analyzing trace with hash -754922528, now seen corresponding path program 1 times [2019-12-19 04:09:06,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:09:06,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594219599] [2019-12-19 04:09:06,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:09:06,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:09:06,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:09:06,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594219599] [2019-12-19 04:09:06,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:09:06,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:09:06,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388112335] [2019-12-19 04:09:06,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:09:06,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:09:06,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:09:06,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:09:06,411 INFO L87 Difference]: Start difference. First operand 8269 states and 20327 transitions. Second operand 3 states. [2019-12-19 04:09:06,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:09:06,782 INFO L93 Difference]: Finished difference Result 11444 states and 27681 transitions. [2019-12-19 04:09:06,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:09:06,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-12-19 04:09:06,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:09:06,794 INFO L225 Difference]: With dead ends: 11444 [2019-12-19 04:09:06,794 INFO L226 Difference]: Without dead ends: 11444 [2019-12-19 04:09:06,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:09:06,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11444 states. [2019-12-19 04:09:06,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11444 to 10312. [2019-12-19 04:09:06,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10312 states. [2019-12-19 04:09:06,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10312 states to 10312 states and 25151 transitions. [2019-12-19 04:09:06,916 INFO L78 Accepts]: Start accepts. Automaton has 10312 states and 25151 transitions. Word has length 99 [2019-12-19 04:09:06,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:09:06,916 INFO L462 AbstractCegarLoop]: Abstraction has 10312 states and 25151 transitions. [2019-12-19 04:09:06,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:09:06,916 INFO L276 IsEmpty]: Start isEmpty. Operand 10312 states and 25151 transitions. [2019-12-19 04:09:06,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 04:09:06,927 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:09:06,927 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:09:06,927 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:09:06,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:09:06,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1377648498, now seen corresponding path program 2 times [2019-12-19 04:09:06,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:09:06,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543362386] [2019-12-19 04:09:06,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:09:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:09:07,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:09:07,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543362386] [2019-12-19 04:09:07,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:09:07,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:09:07,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844238767] [2019-12-19 04:09:07,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:09:07,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:09:07,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:09:07,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:09:07,027 INFO L87 Difference]: Start difference. First operand 10312 states and 25151 transitions. Second operand 5 states. [2019-12-19 04:09:07,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:09:07,521 INFO L93 Difference]: Finished difference Result 12118 states and 28952 transitions. [2019-12-19 04:09:07,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:09:07,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-12-19 04:09:07,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:09:07,538 INFO L225 Difference]: With dead ends: 12118 [2019-12-19 04:09:07,539 INFO L226 Difference]: Without dead ends: 12118 [2019-12-19 04:09:07,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:09:07,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12118 states. [2019-12-19 04:09:07,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12118 to 10898. [2019-12-19 04:09:07,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10898 states. [2019-12-19 04:09:07,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10898 states to 10898 states and 26367 transitions. [2019-12-19 04:09:07,707 INFO L78 Accepts]: Start accepts. Automaton has 10898 states and 26367 transitions. Word has length 99 [2019-12-19 04:09:07,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:09:07,707 INFO L462 AbstractCegarLoop]: Abstraction has 10898 states and 26367 transitions. [2019-12-19 04:09:07,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:09:07,707 INFO L276 IsEmpty]: Start isEmpty. Operand 10898 states and 26367 transitions. [2019-12-19 04:09:07,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 04:09:07,721 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:09:07,722 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:09:07,722 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:09:07,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:09:07,722 INFO L82 PathProgramCache]: Analyzing trace with hash -2088609024, now seen corresponding path program 3 times [2019-12-19 04:09:07,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:09:07,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930451928] [2019-12-19 04:09:07,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:09:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:09:07,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:09:07,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930451928] [2019-12-19 04:09:07,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:09:07,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:09:07,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878470630] [2019-12-19 04:09:07,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:09:07,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:09:07,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:09:07,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:09:07,816 INFO L87 Difference]: Start difference. First operand 10898 states and 26367 transitions. Second operand 6 states. [2019-12-19 04:09:08,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:09:08,436 INFO L93 Difference]: Finished difference Result 13301 states and 31605 transitions. [2019-12-19 04:09:08,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:09:08,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-12-19 04:09:08,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:09:08,451 INFO L225 Difference]: With dead ends: 13301 [2019-12-19 04:09:08,451 INFO L226 Difference]: Without dead ends: 13301 [2019-12-19 04:09:08,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:09:08,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13301 states. [2019-12-19 04:09:08,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13301 to 10682. [2019-12-19 04:09:08,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10682 states. [2019-12-19 04:09:08,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10682 states to 10682 states and 25401 transitions. [2019-12-19 04:09:08,581 INFO L78 Accepts]: Start accepts. Automaton has 10682 states and 25401 transitions. Word has length 99 [2019-12-19 04:09:08,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:09:08,582 INFO L462 AbstractCegarLoop]: Abstraction has 10682 states and 25401 transitions. [2019-12-19 04:09:08,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:09:08,582 INFO L276 IsEmpty]: Start isEmpty. Operand 10682 states and 25401 transitions. [2019-12-19 04:09:08,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-19 04:09:08,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:09:08,597 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:09:08,597 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:09:08,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:09:08,598 INFO L82 PathProgramCache]: Analyzing trace with hash -689041407, now seen corresponding path program 1 times [2019-12-19 04:09:08,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:09:08,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759741383] [2019-12-19 04:09:08,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:09:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:09:08,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:09:08,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759741383] [2019-12-19 04:09:08,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:09:08,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:09:08,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624608051] [2019-12-19 04:09:08,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:09:08,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:09:08,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:09:08,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:09:08,697 INFO L87 Difference]: Start difference. First operand 10682 states and 25401 transitions. Second operand 5 states. [2019-12-19 04:09:08,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:09:08,848 INFO L93 Difference]: Finished difference Result 12248 states and 29269 transitions. [2019-12-19 04:09:08,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 04:09:08,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-12-19 04:09:08,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:09:08,860 INFO L225 Difference]: With dead ends: 12248 [2019-12-19 04:09:08,861 INFO L226 Difference]: Without dead ends: 12248 [2019-12-19 04:09:08,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:09:08,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12248 states. [2019-12-19 04:09:08,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12248 to 10895. [2019-12-19 04:09:08,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10895 states. [2019-12-19 04:09:08,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10895 states to 10895 states and 25926 transitions. [2019-12-19 04:09:08,985 INFO L78 Accepts]: Start accepts. Automaton has 10895 states and 25926 transitions. Word has length 101 [2019-12-19 04:09:08,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:09:08,985 INFO L462 AbstractCegarLoop]: Abstraction has 10895 states and 25926 transitions. [2019-12-19 04:09:08,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:09:08,985 INFO L276 IsEmpty]: Start isEmpty. Operand 10895 states and 25926 transitions. [2019-12-19 04:09:08,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-19 04:09:08,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:09:08,996 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:09:08,996 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:09:08,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:09:08,996 INFO L82 PathProgramCache]: Analyzing trace with hash -943777952, now seen corresponding path program 1 times [2019-12-19 04:09:08,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:09:08,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550899915] [2019-12-19 04:09:08,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:09:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:09:09,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:09:09,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550899915] [2019-12-19 04:09:09,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:09:09,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:09:09,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685648946] [2019-12-19 04:09:09,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:09:09,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:09:09,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:09:09,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:09:09,093 INFO L87 Difference]: Start difference. First operand 10895 states and 25926 transitions. Second operand 6 states. [2019-12-19 04:09:09,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:09:09,589 INFO L93 Difference]: Finished difference Result 12159 states and 28599 transitions. [2019-12-19 04:09:09,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 04:09:09,590 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-12-19 04:09:09,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:09:09,612 INFO L225 Difference]: With dead ends: 12159 [2019-12-19 04:09:09,612 INFO L226 Difference]: Without dead ends: 12159 [2019-12-19 04:09:09,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-19 04:09:09,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12159 states. [2019-12-19 04:09:09,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12159 to 11047. [2019-12-19 04:09:09,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11047 states. [2019-12-19 04:09:09,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11047 states to 11047 states and 26252 transitions. [2019-12-19 04:09:09,944 INFO L78 Accepts]: Start accepts. Automaton has 11047 states and 26252 transitions. Word has length 101 [2019-12-19 04:09:09,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:09:09,944 INFO L462 AbstractCegarLoop]: Abstraction has 11047 states and 26252 transitions. [2019-12-19 04:09:09,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:09:09,945 INFO L276 IsEmpty]: Start isEmpty. Operand 11047 states and 26252 transitions. [2019-12-19 04:09:09,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-19 04:09:09,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:09:09,964 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:09:09,964 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:09:09,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:09:09,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1119204126, now seen corresponding path program 1 times [2019-12-19 04:09:09,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:09:09,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44025319] [2019-12-19 04:09:09,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:09:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:09:10,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:09:10,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44025319] [2019-12-19 04:09:10,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:09:10,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:09:10,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169157776] [2019-12-19 04:09:10,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:09:10,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:09:10,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:09:10,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:09:10,086 INFO L87 Difference]: Start difference. First operand 11047 states and 26252 transitions. Second operand 7 states. [2019-12-19 04:09:10,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:09:10,796 INFO L93 Difference]: Finished difference Result 14289 states and 33832 transitions. [2019-12-19 04:09:10,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 04:09:10,796 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2019-12-19 04:09:10,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:09:10,817 INFO L225 Difference]: With dead ends: 14289 [2019-12-19 04:09:10,817 INFO L226 Difference]: Without dead ends: 14289 [2019-12-19 04:09:10,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-19 04:09:10,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14289 states. [2019-12-19 04:09:11,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14289 to 11610. [2019-12-19 04:09:11,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11610 states. [2019-12-19 04:09:11,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11610 states to 11610 states and 27686 transitions. [2019-12-19 04:09:11,047 INFO L78 Accepts]: Start accepts. Automaton has 11610 states and 27686 transitions. Word has length 101 [2019-12-19 04:09:11,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:09:11,048 INFO L462 AbstractCegarLoop]: Abstraction has 11610 states and 27686 transitions. [2019-12-19 04:09:11,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:09:11,048 INFO L276 IsEmpty]: Start isEmpty. Operand 11610 states and 27686 transitions. [2019-12-19 04:09:11,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-19 04:09:11,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:09:11,066 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:09:11,066 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:09:11,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:09:11,067 INFO L82 PathProgramCache]: Analyzing trace with hash 2006707807, now seen corresponding path program 1 times [2019-12-19 04:09:11,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:09:11,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677714912] [2019-12-19 04:09:11,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:09:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:09:11,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:09:11,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677714912] [2019-12-19 04:09:11,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:09:11,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:09:11,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610880516] [2019-12-19 04:09:11,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:09:11,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:09:11,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:09:11,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:09:11,206 INFO L87 Difference]: Start difference. First operand 11610 states and 27686 transitions. Second operand 7 states. [2019-12-19 04:09:11,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:09:11,397 INFO L93 Difference]: Finished difference Result 13924 states and 33201 transitions. [2019-12-19 04:09:11,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:09:11,398 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2019-12-19 04:09:11,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:09:11,417 INFO L225 Difference]: With dead ends: 13924 [2019-12-19 04:09:11,417 INFO L226 Difference]: Without dead ends: 13924 [2019-12-19 04:09:11,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:09:11,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13924 states. [2019-12-19 04:09:11,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13924 to 12431. [2019-12-19 04:09:11,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12431 states. [2019-12-19 04:09:11,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12431 states to 12431 states and 29715 transitions. [2019-12-19 04:09:11,569 INFO L78 Accepts]: Start accepts. Automaton has 12431 states and 29715 transitions. Word has length 101 [2019-12-19 04:09:11,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:09:11,569 INFO L462 AbstractCegarLoop]: Abstraction has 12431 states and 29715 transitions. [2019-12-19 04:09:11,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:09:11,569 INFO L276 IsEmpty]: Start isEmpty. Operand 12431 states and 29715 transitions. [2019-12-19 04:09:11,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-19 04:09:11,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:09:11,580 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:09:11,580 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:09:11,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:09:11,580 INFO L82 PathProgramCache]: Analyzing trace with hash 762874655, now seen corresponding path program 1 times [2019-12-19 04:09:11,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:09:11,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13480883] [2019-12-19 04:09:11,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:09:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:09:11,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:09:11,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13480883] [2019-12-19 04:09:11,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:09:11,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:09:11,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947915204] [2019-12-19 04:09:11,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:09:11,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:09:11,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:09:11,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:09:11,722 INFO L87 Difference]: Start difference. First operand 12431 states and 29715 transitions. Second operand 6 states. [2019-12-19 04:09:11,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:09:11,934 INFO L93 Difference]: Finished difference Result 12350 states and 29382 transitions. [2019-12-19 04:09:11,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:09:11,934 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-12-19 04:09:11,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:09:11,948 INFO L225 Difference]: With dead ends: 12350 [2019-12-19 04:09:11,948 INFO L226 Difference]: Without dead ends: 12350 [2019-12-19 04:09:11,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:09:11,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12350 states. [2019-12-19 04:09:12,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12350 to 10951. [2019-12-19 04:09:12,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10951 states. [2019-12-19 04:09:12,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10951 states to 10951 states and 26225 transitions. [2019-12-19 04:09:12,085 INFO L78 Accepts]: Start accepts. Automaton has 10951 states and 26225 transitions. Word has length 101 [2019-12-19 04:09:12,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:09:12,086 INFO L462 AbstractCegarLoop]: Abstraction has 10951 states and 26225 transitions. [2019-12-19 04:09:12,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:09:12,086 INFO L276 IsEmpty]: Start isEmpty. Operand 10951 states and 26225 transitions. [2019-12-19 04:09:12,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-19 04:09:12,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:09:12,096 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:09:12,096 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:09:12,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:09:12,096 INFO L82 PathProgramCache]: Analyzing trace with hash 409106765, now seen corresponding path program 1 times [2019-12-19 04:09:12,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:09:12,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80144376] [2019-12-19 04:09:12,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:09:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:09:12,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:09:12,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80144376] [2019-12-19 04:09:12,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:09:12,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 04:09:12,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943318171] [2019-12-19 04:09:12,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 04:09:12,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:09:12,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 04:09:12,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:09:12,232 INFO L87 Difference]: Start difference. First operand 10951 states and 26225 transitions. Second operand 8 states. [2019-12-19 04:09:14,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:09:14,290 INFO L93 Difference]: Finished difference Result 18824 states and 44079 transitions. [2019-12-19 04:09:14,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-19 04:09:14,290 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2019-12-19 04:09:14,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:09:14,313 INFO L225 Difference]: With dead ends: 18824 [2019-12-19 04:09:14,313 INFO L226 Difference]: Without dead ends: 18744 [2019-12-19 04:09:14,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2019-12-19 04:09:14,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18744 states. [2019-12-19 04:09:14,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18744 to 14378. [2019-12-19 04:09:14,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14378 states. [2019-12-19 04:09:14,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14378 states to 14378 states and 34317 transitions. [2019-12-19 04:09:14,491 INFO L78 Accepts]: Start accepts. Automaton has 14378 states and 34317 transitions. Word has length 103 [2019-12-19 04:09:14,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:09:14,491 INFO L462 AbstractCegarLoop]: Abstraction has 14378 states and 34317 transitions. [2019-12-19 04:09:14,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 04:09:14,491 INFO L276 IsEmpty]: Start isEmpty. Operand 14378 states and 34317 transitions. [2019-12-19 04:09:14,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-19 04:09:14,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:09:14,504 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:09:14,504 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:09:14,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:09:14,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1668102578, now seen corresponding path program 1 times [2019-12-19 04:09:14,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:09:14,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795899581] [2019-12-19 04:09:14,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:09:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:09:14,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:09:14,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795899581] [2019-12-19 04:09:14,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:09:14,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:09:14,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478323365] [2019-12-19 04:09:14,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:09:14,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:09:14,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:09:14,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:09:14,658 INFO L87 Difference]: Start difference. First operand 14378 states and 34317 transitions. Second operand 7 states. [2019-12-19 04:09:15,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:09:15,439 INFO L93 Difference]: Finished difference Result 18290 states and 42267 transitions. [2019-12-19 04:09:15,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 04:09:15,440 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2019-12-19 04:09:15,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:09:15,467 INFO L225 Difference]: With dead ends: 18290 [2019-12-19 04:09:15,468 INFO L226 Difference]: Without dead ends: 18290 [2019-12-19 04:09:15,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-19 04:09:15,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18290 states. [2019-12-19 04:09:15,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18290 to 15910. [2019-12-19 04:09:15,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15910 states. [2019-12-19 04:09:15,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15910 states to 15910 states and 37317 transitions. [2019-12-19 04:09:15,692 INFO L78 Accepts]: Start accepts. Automaton has 15910 states and 37317 transitions. Word has length 103 [2019-12-19 04:09:15,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:09:15,692 INFO L462 AbstractCegarLoop]: Abstraction has 15910 states and 37317 transitions. [2019-12-19 04:09:15,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:09:15,692 INFO L276 IsEmpty]: Start isEmpty. Operand 15910 states and 37317 transitions. [2019-12-19 04:09:15,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-19 04:09:15,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:09:15,708 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:09:15,708 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:09:15,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:09:15,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1456751665, now seen corresponding path program 1 times [2019-12-19 04:09:15,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:09:15,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593286526] [2019-12-19 04:09:15,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:09:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:09:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:09:15,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593286526] [2019-12-19 04:09:15,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:09:15,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:09:15,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132009822] [2019-12-19 04:09:15,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:09:15,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:09:15,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:09:15,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:09:15,852 INFO L87 Difference]: Start difference. First operand 15910 states and 37317 transitions. Second operand 7 states. [2019-12-19 04:09:16,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:09:16,191 INFO L93 Difference]: Finished difference Result 16472 states and 38509 transitions. [2019-12-19 04:09:16,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 04:09:16,191 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2019-12-19 04:09:16,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:09:16,210 INFO L225 Difference]: With dead ends: 16472 [2019-12-19 04:09:16,210 INFO L226 Difference]: Without dead ends: 16472 [2019-12-19 04:09:16,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-19 04:09:16,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16472 states. [2019-12-19 04:09:16,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16472 to 16351. [2019-12-19 04:09:16,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16351 states. [2019-12-19 04:09:16,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16351 states to 16351 states and 38273 transitions. [2019-12-19 04:09:16,396 INFO L78 Accepts]: Start accepts. Automaton has 16351 states and 38273 transitions. Word has length 103 [2019-12-19 04:09:16,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:09:16,396 INFO L462 AbstractCegarLoop]: Abstraction has 16351 states and 38273 transitions. [2019-12-19 04:09:16,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:09:16,396 INFO L276 IsEmpty]: Start isEmpty. Operand 16351 states and 38273 transitions. [2019-12-19 04:09:16,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-19 04:09:16,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:09:16,411 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:09:16,411 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:09:16,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:09:16,412 INFO L82 PathProgramCache]: Analyzing trace with hash -569247984, now seen corresponding path program 1 times [2019-12-19 04:09:16,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:09:16,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310549216] [2019-12-19 04:09:16,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:09:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:09:16,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:09:16,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310549216] [2019-12-19 04:09:16,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:09:16,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:09:16,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149391139] [2019-12-19 04:09:16,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:09:16,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:09:16,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:09:16,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:09:16,469 INFO L87 Difference]: Start difference. First operand 16351 states and 38273 transitions. Second operand 3 states. [2019-12-19 04:09:16,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:09:16,552 INFO L93 Difference]: Finished difference Result 19583 states and 45726 transitions. [2019-12-19 04:09:16,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:09:16,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-12-19 04:09:16,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:09:16,590 INFO L225 Difference]: With dead ends: 19583 [2019-12-19 04:09:16,590 INFO L226 Difference]: Without dead ends: 19583 [2019-12-19 04:09:16,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:09:16,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19583 states. [2019-12-19 04:09:17,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19583 to 19507. [2019-12-19 04:09:17,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19507 states. [2019-12-19 04:09:17,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19507 states to 19507 states and 45563 transitions. [2019-12-19 04:09:17,238 INFO L78 Accepts]: Start accepts. Automaton has 19507 states and 45563 transitions. Word has length 103 [2019-12-19 04:09:17,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:09:17,239 INFO L462 AbstractCegarLoop]: Abstraction has 19507 states and 45563 transitions. [2019-12-19 04:09:17,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:09:17,239 INFO L276 IsEmpty]: Start isEmpty. Operand 19507 states and 45563 transitions. [2019-12-19 04:09:17,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-19 04:09:17,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:09:17,270 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:09:17,270 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:09:17,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:09:17,270 INFO L82 PathProgramCache]: Analyzing trace with hash -218448047, now seen corresponding path program 1 times [2019-12-19 04:09:17,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:09:17,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319591381] [2019-12-19 04:09:17,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:09:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:09:17,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:09:17,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319591381] [2019-12-19 04:09:17,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:09:17,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-19 04:09:17,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892018523] [2019-12-19 04:09:17,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-19 04:09:17,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:09:17,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-19 04:09:17,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-19 04:09:17,479 INFO L87 Difference]: Start difference. First operand 19507 states and 45563 transitions. Second operand 11 states. [2019-12-19 04:09:18,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:09:18,042 INFO L93 Difference]: Finished difference Result 26782 states and 61957 transitions. [2019-12-19 04:09:18,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-19 04:09:18,042 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 103 [2019-12-19 04:09:18,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:09:18,070 INFO L225 Difference]: With dead ends: 26782 [2019-12-19 04:09:18,070 INFO L226 Difference]: Without dead ends: 24726 [2019-12-19 04:09:18,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-19 04:09:18,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24726 states. [2019-12-19 04:09:18,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24726 to 22935. [2019-12-19 04:09:18,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22935 states. [2019-12-19 04:09:18,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22935 states to 22935 states and 53604 transitions. [2019-12-19 04:09:18,341 INFO L78 Accepts]: Start accepts. Automaton has 22935 states and 53604 transitions. Word has length 103 [2019-12-19 04:09:18,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:09:18,341 INFO L462 AbstractCegarLoop]: Abstraction has 22935 states and 53604 transitions. [2019-12-19 04:09:18,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-19 04:09:18,342 INFO L276 IsEmpty]: Start isEmpty. Operand 22935 states and 53604 transitions. [2019-12-19 04:09:18,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-19 04:09:18,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:09:18,364 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:09:18,365 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:09:18,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:09:18,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1205242523, now seen corresponding path program 1 times [2019-12-19 04:09:18,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:09:18,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064326851] [2019-12-19 04:09:18,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:09:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:09:18,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:09:18,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064326851] [2019-12-19 04:09:18,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:09:18,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 04:09:18,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139895194] [2019-12-19 04:09:18,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 04:09:18,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:09:18,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 04:09:18,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:09:18,525 INFO L87 Difference]: Start difference. First operand 22935 states and 53604 transitions. Second operand 8 states. [2019-12-19 04:09:18,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:09:18,695 INFO L93 Difference]: Finished difference Result 23440 states and 54722 transitions. [2019-12-19 04:09:18,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:09:18,696 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2019-12-19 04:09:18,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:09:18,701 INFO L225 Difference]: With dead ends: 23440 [2019-12-19 04:09:18,702 INFO L226 Difference]: Without dead ends: 3440 [2019-12-19 04:09:18,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-19 04:09:18,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3440 states. [2019-12-19 04:09:18,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3440 to 3438. [2019-12-19 04:09:18,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3438 states. [2019-12-19 04:09:18,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 3438 states and 8134 transitions. [2019-12-19 04:09:18,735 INFO L78 Accepts]: Start accepts. Automaton has 3438 states and 8134 transitions. Word has length 103 [2019-12-19 04:09:18,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:09:18,735 INFO L462 AbstractCegarLoop]: Abstraction has 3438 states and 8134 transitions. [2019-12-19 04:09:18,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 04:09:18,736 INFO L276 IsEmpty]: Start isEmpty. Operand 3438 states and 8134 transitions. [2019-12-19 04:09:18,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-19 04:09:18,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:09:18,740 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:09:18,740 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:09:18,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:09:18,740 INFO L82 PathProgramCache]: Analyzing trace with hash 17628483, now seen corresponding path program 1 times [2019-12-19 04:09:18,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:09:18,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801585662] [2019-12-19 04:09:18,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:09:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:09:18,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:09:18,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801585662] [2019-12-19 04:09:18,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:09:18,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 04:09:18,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118637898] [2019-12-19 04:09:18,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 04:09:18,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:09:18,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 04:09:18,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:09:18,852 INFO L87 Difference]: Start difference. First operand 3438 states and 8134 transitions. Second operand 8 states. [2019-12-19 04:09:19,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:09:19,626 INFO L93 Difference]: Finished difference Result 4235 states and 9887 transitions. [2019-12-19 04:09:19,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 04:09:19,627 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2019-12-19 04:09:19,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:09:19,632 INFO L225 Difference]: With dead ends: 4235 [2019-12-19 04:09:19,633 INFO L226 Difference]: Without dead ends: 4199 [2019-12-19 04:09:19,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-19 04:09:19,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4199 states. [2019-12-19 04:09:19,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4199 to 3528. [2019-12-19 04:09:19,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3528 states. [2019-12-19 04:09:19,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3528 states to 3528 states and 8332 transitions. [2019-12-19 04:09:19,685 INFO L78 Accepts]: Start accepts. Automaton has 3528 states and 8332 transitions. Word has length 103 [2019-12-19 04:09:19,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:09:19,685 INFO L462 AbstractCegarLoop]: Abstraction has 3528 states and 8332 transitions. [2019-12-19 04:09:19,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 04:09:19,685 INFO L276 IsEmpty]: Start isEmpty. Operand 3528 states and 8332 transitions. [2019-12-19 04:09:19,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-19 04:09:19,688 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:09:19,688 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:09:19,688 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:09:19,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:09:19,689 INFO L82 PathProgramCache]: Analyzing trace with hash 368428420, now seen corresponding path program 2 times [2019-12-19 04:09:19,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:09:19,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132057880] [2019-12-19 04:09:19,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:09:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:09:19,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:09:19,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132057880] [2019-12-19 04:09:19,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:09:19,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-19 04:09:19,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661869442] [2019-12-19 04:09:19,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-19 04:09:19,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:09:19,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-19 04:09:19,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-19 04:09:19,830 INFO L87 Difference]: Start difference. First operand 3528 states and 8332 transitions. Second operand 11 states. [2019-12-19 04:09:20,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:09:20,354 INFO L93 Difference]: Finished difference Result 6508 states and 14933 transitions. [2019-12-19 04:09:20,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-19 04:09:20,355 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 103 [2019-12-19 04:09:20,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:09:20,360 INFO L225 Difference]: With dead ends: 6508 [2019-12-19 04:09:20,360 INFO L226 Difference]: Without dead ends: 4667 [2019-12-19 04:09:20,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2019-12-19 04:09:20,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4667 states. [2019-12-19 04:09:20,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4667 to 3566. [2019-12-19 04:09:20,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3566 states. [2019-12-19 04:09:20,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3566 states to 3566 states and 8355 transitions. [2019-12-19 04:09:20,399 INFO L78 Accepts]: Start accepts. Automaton has 3566 states and 8355 transitions. Word has length 103 [2019-12-19 04:09:20,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:09:20,399 INFO L462 AbstractCegarLoop]: Abstraction has 3566 states and 8355 transitions. [2019-12-19 04:09:20,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-19 04:09:20,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3566 states and 8355 transitions. [2019-12-19 04:09:20,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-19 04:09:20,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:09:20,403 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:09:20,403 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:09:20,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:09:20,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1899206436, now seen corresponding path program 3 times [2019-12-19 04:09:20,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:09:20,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901200933] [2019-12-19 04:09:20,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:09:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 04:09:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 04:09:20,500 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 04:09:20,501 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 04:09:20,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 04:09:20 BasicIcfg [2019-12-19 04:09:20,771 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 04:09:20,777 INFO L168 Benchmark]: Toolchain (without parser) took 104177.79 ms. Allocated memory was 137.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 101.3 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-19 04:09:20,778 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 137.9 MB. Free memory was 120.8 MB in the beginning and 120.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-19 04:09:20,779 INFO L168 Benchmark]: CACSL2BoogieTranslator took 830.19 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 100.8 MB in the beginning and 156.5 MB in the end (delta: -55.6 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. [2019-12-19 04:09:20,779 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.54 ms. Allocated memory is still 202.9 MB. Free memory was 156.5 MB in the beginning and 153.0 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-12-19 04:09:20,780 INFO L168 Benchmark]: Boogie Preprocessor took 41.39 ms. Allocated memory is still 202.9 MB. Free memory was 153.0 MB in the beginning and 150.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-19 04:09:20,780 INFO L168 Benchmark]: RCFGBuilder took 1175.55 ms. Allocated memory is still 202.9 MB. Free memory was 150.9 MB in the beginning and 97.6 MB in the end (delta: 53.4 MB). Peak memory consumption was 53.4 MB. Max. memory is 7.1 GB. [2019-12-19 04:09:20,781 INFO L168 Benchmark]: TraceAbstraction took 102049.20 ms. Allocated memory was 202.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 97.6 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-19 04:09:20,784 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.16 ms. Allocated memory is still 137.9 MB. Free memory was 120.8 MB in the beginning and 120.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 830.19 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 100.8 MB in the beginning and 156.5 MB in the end (delta: -55.6 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.54 ms. Allocated memory is still 202.9 MB. Free memory was 156.5 MB in the beginning and 153.0 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.39 ms. Allocated memory is still 202.9 MB. Free memory was 153.0 MB in the beginning and 150.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1175.55 ms. Allocated memory is still 202.9 MB. Free memory was 150.9 MB in the beginning and 97.6 MB in the end (delta: 53.4 MB). Peak memory consumption was 53.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 102049.20 ms. Allocated memory was 202.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 97.6 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L707] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L708] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L709] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L710] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L711] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L712] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L713] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L714] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L715] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L716] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L717] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L718] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L719] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L720] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L721] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L723] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 0 pthread_t t1773; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] FCALL, FORK 0 pthread_create(&t1773, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L811] 0 pthread_t t1774; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] FCALL, FORK 0 pthread_create(&t1774, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff1 = y$w_buff0 [L758] 2 y$w_buff0 = 1 [L759] 2 y$w_buff1_used = y$w_buff0_used [L760] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L763] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L764] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L765] 2 y$r_buff0_thd2 = (_Bool)1 [L768] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 2 y$flush_delayed = weak$$choice2 [L771] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L773] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L774] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L775] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L776] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L778] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 2 y = y$flush_delayed ? y$mem_tmp : y [L781] 2 y$flush_delayed = (_Bool)0 [L784] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 x = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 y$flush_delayed = weak$$choice2 [L735] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L737] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L738] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L739] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L787] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L742] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L787] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L788] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y = y$flush_delayed ? y$mem_tmp : y [L745] 1 y$flush_delayed = (_Bool)0 [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L789] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L818] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L818] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L818] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L818] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L819] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L820] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L825] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 172 locations, 2 error locations. Result: UNSAFE, OverallTime: 101.5s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 41.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11060 SDtfs, 12584 SDslu, 28884 SDs, 0 SdLazy, 9749 SolverSat, 623 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 322 GetRequests, 84 SyntacticMatches, 11 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196980occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 47.4s AutomataMinimizationTime, 29 MinimizatonAttempts, 197614 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2514 NumberOfCodeBlocks, 2514 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2382 ConstructedInterpolants, 0 QuantifiedInterpolants, 542341 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...