/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-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:49:21,087 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:49:21,089 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:49:21,101 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:49:21,101 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:49:21,102 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:49:21,103 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:49:21,105 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:49:21,107 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:49:21,108 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:49:21,109 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:49:21,110 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:49:21,110 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:49:21,111 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:49:21,112 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:49:21,114 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:49:21,114 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:49:21,115 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:49:21,117 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:49:21,120 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:49:21,121 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:49:21,125 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:49:21,126 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:49:21,129 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:49:21,131 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:49:21,132 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:49:21,132 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:49:21,133 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:49:21,133 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:49:21,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:49:21,135 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:49:21,135 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:49:21,136 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:49:21,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:49:21,138 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:49:21,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:49:21,139 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:49:21,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:49:21,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:49:21,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:49:21,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:49:21,142 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-VariableLbe-MCR.epf [2019-12-27 21:49:21,156 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:49:21,156 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:49:21,157 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:49:21,158 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:49:21,158 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:49:21,158 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:49:21,158 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:49:21,158 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:49:21,159 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:49:21,159 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:49:21,159 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:49:21,159 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:49:21,159 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:49:21,160 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:49:21,160 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:49:21,160 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:49:21,160 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:49:21,160 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:49:21,160 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:49:21,161 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:49:21,161 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:49:21,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:49:21,161 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:49:21,161 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:49:21,162 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:49:21,162 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:49:21,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:49:21,162 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:49:21,162 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:49:21,163 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:49:21,163 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:49:21,163 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:49:21,433 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:49:21,452 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:49:21,455 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:49:21,457 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:49:21,458 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:49:21,458 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_rmo.oepc.i [2019-12-27 21:49:21,525 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ab58446b/6ca2b485ad0943709522d9d0ae951c73/FLAGa2b2bbc8a [2019-12-27 21:49:22,052 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:49:22,053 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_rmo.oepc.i [2019-12-27 21:49:22,078 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ab58446b/6ca2b485ad0943709522d9d0ae951c73/FLAGa2b2bbc8a [2019-12-27 21:49:22,351 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ab58446b/6ca2b485ad0943709522d9d0ae951c73 [2019-12-27 21:49:22,362 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:49:22,364 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:49:22,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:49:22,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:49:22,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:49:22,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:49:22" (1/1) ... [2019-12-27 21:49:22,373 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36de6da6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:22, skipping insertion in model container [2019-12-27 21:49:22,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:49:22" (1/1) ... [2019-12-27 21:49:22,381 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:49:22,426 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:49:23,013 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:49:23,025 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:49:23,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:49:23,214 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:49:23,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:23 WrapperNode [2019-12-27 21:49:23,214 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:49:23,215 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:49:23,215 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:49:23,217 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:49:23,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:23" (1/1) ... [2019-12-27 21:49:23,247 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:23" (1/1) ... [2019-12-27 21:49:23,293 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:49:23,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:49:23,296 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:49:23,296 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:49:23,306 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:23" (1/1) ... [2019-12-27 21:49:23,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:23" (1/1) ... [2019-12-27 21:49:23,312 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:23" (1/1) ... [2019-12-27 21:49:23,312 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:23" (1/1) ... [2019-12-27 21:49:23,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:23" (1/1) ... [2019-12-27 21:49:23,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:23" (1/1) ... [2019-12-27 21:49:23,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:23" (1/1) ... [2019-12-27 21:49:23,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:49:23,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:49:23,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:49:23,344 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:49:23,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:49:23,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:49:23,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:49:23,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:49:23,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:49:23,440 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:49:23,441 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:49:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:49:23,443 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:49:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:49:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:49:23,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:49:23,447 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 21:49:24,602 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:49:24,603 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:49:24,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:49:24 BoogieIcfgContainer [2019-12-27 21:49:24,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:49:24,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:49:24,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:49:24,609 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:49:24,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:49:22" (1/3) ... [2019-12-27 21:49:24,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697e4eea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:49:24, skipping insertion in model container [2019-12-27 21:49:24,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:23" (2/3) ... [2019-12-27 21:49:24,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697e4eea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:49:24, skipping insertion in model container [2019-12-27 21:49:24,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:49:24" (3/3) ... [2019-12-27 21:49:24,613 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi000_rmo.oepc.i [2019-12-27 21:49:24,623 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:49:24,624 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:49:24,632 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:49:24,633 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:49:24,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,677 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,677 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,678 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,678 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,679 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,688 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,688 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,732 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,732 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,732 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,742 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,744 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:24,760 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 21:49:24,780 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:49:24,780 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:49:24,780 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:49:24,781 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:49:24,781 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:49:24,781 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:49:24,781 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:49:24,781 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:49:24,799 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 231 places, 307 transitions [2019-12-27 21:49:24,801 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-12-27 21:49:24,940 INFO L132 PetriNetUnfolder]: 83/305 cut-off events. [2019-12-27 21:49:24,941 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:49:24,974 INFO L76 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 305 events. 83/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 726 event pairs. 0/220 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-12-27 21:49:25,060 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-12-27 21:49:25,218 INFO L132 PetriNetUnfolder]: 83/305 cut-off events. [2019-12-27 21:49:25,218 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:49:25,247 INFO L76 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 305 events. 83/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 726 event pairs. 0/220 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-12-27 21:49:25,298 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 41414 [2019-12-27 21:49:25,299 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:49:28,808 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 21:49:28,961 INFO L206 etLargeBlockEncoding]: Checked pairs total: 254260 [2019-12-27 21:49:28,961 INFO L214 etLargeBlockEncoding]: Total number of compositions: 128 [2019-12-27 21:49:28,964 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154 places, 192 transitions [2019-12-27 21:49:34,092 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 61532 states. [2019-12-27 21:49:34,094 INFO L276 IsEmpty]: Start isEmpty. Operand 61532 states. [2019-12-27 21:49:34,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 21:49:34,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:34,101 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 21:49:34,101 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:34,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:34,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1308418, now seen corresponding path program 1 times [2019-12-27 21:49:34,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:34,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243827103] [2019-12-27 21:49:34,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:34,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:49:34,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243827103] [2019-12-27 21:49:34,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:34,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:49:34,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [225776614] [2019-12-27 21:49:34,371 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:34,375 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:34,388 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 21:49:34,388 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:34,392 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:49:34,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:49:34,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:34,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:49:34,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:49:34,410 INFO L87 Difference]: Start difference. First operand 61532 states. Second operand 3 states. [2019-12-27 21:49:36,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:36,686 INFO L93 Difference]: Finished difference Result 61201 states and 218127 transitions. [2019-12-27 21:49:36,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:49:36,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 21:49:36,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:37,070 INFO L225 Difference]: With dead ends: 61201 [2019-12-27 21:49:37,070 INFO L226 Difference]: Without dead ends: 60135 [2019-12-27 21:49:37,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:49:38,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60135 states. [2019-12-27 21:49:39,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60135 to 60135. [2019-12-27 21:49:39,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60135 states. [2019-12-27 21:49:40,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60135 states to 60135 states and 214522 transitions. [2019-12-27 21:49:40,195 INFO L78 Accepts]: Start accepts. Automaton has 60135 states and 214522 transitions. Word has length 3 [2019-12-27 21:49:40,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:40,195 INFO L462 AbstractCegarLoop]: Abstraction has 60135 states and 214522 transitions. [2019-12-27 21:49:40,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:49:40,196 INFO L276 IsEmpty]: Start isEmpty. Operand 60135 states and 214522 transitions. [2019-12-27 21:49:40,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:49:40,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:40,201 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:49:40,201 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:40,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:40,202 INFO L82 PathProgramCache]: Analyzing trace with hash 2019764645, now seen corresponding path program 1 times [2019-12-27 21:49:40,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:40,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965686183] [2019-12-27 21:49:40,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:40,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:49:40,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965686183] [2019-12-27 21:49:40,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:40,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:49:40,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1051198801] [2019-12-27 21:49:40,319 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:40,321 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:40,324 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:49:40,324 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:40,325 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:49:40,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:49:40,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:40,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:49:40,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:49:40,327 INFO L87 Difference]: Start difference. First operand 60135 states and 214522 transitions. Second operand 4 states. [2019-12-27 21:49:43,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:43,371 INFO L93 Difference]: Finished difference Result 81270 states and 280051 transitions. [2019-12-27 21:49:43,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:49:43,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 21:49:43,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:43,721 INFO L225 Difference]: With dead ends: 81270 [2019-12-27 21:49:43,722 INFO L226 Difference]: Without dead ends: 81270 [2019-12-27 21:49:43,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:49:45,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81270 states. [2019-12-27 21:49:46,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81270 to 81072. [2019-12-27 21:49:46,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81072 states. [2019-12-27 21:49:46,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81072 states to 81072 states and 279514 transitions. [2019-12-27 21:49:46,907 INFO L78 Accepts]: Start accepts. Automaton has 81072 states and 279514 transitions. Word has length 11 [2019-12-27 21:49:46,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:46,907 INFO L462 AbstractCegarLoop]: Abstraction has 81072 states and 279514 transitions. [2019-12-27 21:49:46,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:49:46,907 INFO L276 IsEmpty]: Start isEmpty. Operand 81072 states and 279514 transitions. [2019-12-27 21:49:46,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:49:46,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:46,914 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:49:46,915 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:46,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:46,915 INFO L82 PathProgramCache]: Analyzing trace with hash -312179638, now seen corresponding path program 1 times [2019-12-27 21:49:46,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:46,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307918563] [2019-12-27 21:49:46,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:47,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:49:47,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307918563] [2019-12-27 21:49:47,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:47,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:49:47,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [995800869] [2019-12-27 21:49:47,022 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:47,023 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:47,025 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 21:49:47,025 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:47,026 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:49:47,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:49:47,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:47,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:49:47,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:49:47,027 INFO L87 Difference]: Start difference. First operand 81072 states and 279514 transitions. Second operand 4 states. [2019-12-27 21:49:50,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:50,096 INFO L93 Difference]: Finished difference Result 98023 states and 334543 transitions. [2019-12-27 21:49:50,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:49:50,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 21:49:50,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:50,354 INFO L225 Difference]: With dead ends: 98023 [2019-12-27 21:49:50,354 INFO L226 Difference]: Without dead ends: 98023 [2019-12-27 21:49:50,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:49:51,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98023 states. [2019-12-27 21:49:53,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98023 to 91419. [2019-12-27 21:49:53,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91419 states. [2019-12-27 21:49:53,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91419 states to 91419 states and 312836 transitions. [2019-12-27 21:49:53,346 INFO L78 Accepts]: Start accepts. Automaton has 91419 states and 312836 transitions. Word has length 14 [2019-12-27 21:49:53,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:53,347 INFO L462 AbstractCegarLoop]: Abstraction has 91419 states and 312836 transitions. [2019-12-27 21:49:53,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:49:53,347 INFO L276 IsEmpty]: Start isEmpty. Operand 91419 states and 312836 transitions. [2019-12-27 21:49:53,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 21:49:53,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:53,355 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] [2019-12-27 21:49:53,355 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:53,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:53,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1657200338, now seen corresponding path program 1 times [2019-12-27 21:49:53,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:53,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003576232] [2019-12-27 21:49:53,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:53,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:49:53,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003576232] [2019-12-27 21:49:53,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:53,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:49:53,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1323591552] [2019-12-27 21:49:53,483 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:53,486 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:53,489 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 25 transitions. [2019-12-27 21:49:53,489 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:53,490 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:49:53,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:49:53,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:53,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:49:53,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:49:53,492 INFO L87 Difference]: Start difference. First operand 91419 states and 312836 transitions. Second operand 4 states. [2019-12-27 21:49:53,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:53,549 INFO L93 Difference]: Finished difference Result 8836 states and 22781 transitions. [2019-12-27 21:49:53,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:49:53,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-27 21:49:53,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:53,558 INFO L225 Difference]: With dead ends: 8836 [2019-12-27 21:49:53,559 INFO L226 Difference]: Without dead ends: 7489 [2019-12-27 21:49:53,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:49:53,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7489 states. [2019-12-27 21:49:53,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7489 to 7481. [2019-12-27 21:49:53,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7481 states. [2019-12-27 21:49:53,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7481 states to 7481 states and 18430 transitions. [2019-12-27 21:49:53,680 INFO L78 Accepts]: Start accepts. Automaton has 7481 states and 18430 transitions. Word has length 20 [2019-12-27 21:49:53,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:53,681 INFO L462 AbstractCegarLoop]: Abstraction has 7481 states and 18430 transitions. [2019-12-27 21:49:53,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:49:53,681 INFO L276 IsEmpty]: Start isEmpty. Operand 7481 states and 18430 transitions. [2019-12-27 21:49:53,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 21:49:53,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:53,686 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:49:53,686 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:53,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:53,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1306986868, now seen corresponding path program 1 times [2019-12-27 21:49:53,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:53,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385854087] [2019-12-27 21:49:53,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:53,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:49:53,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385854087] [2019-12-27 21:49:53,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:53,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:49:53,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [795280419] [2019-12-27 21:49:53,773 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:53,778 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:53,784 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 30 transitions. [2019-12-27 21:49:53,785 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:53,785 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:49:53,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:49:53,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:53,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:49:53,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:49:53,787 INFO L87 Difference]: Start difference. First operand 7481 states and 18430 transitions. Second operand 5 states. [2019-12-27 21:49:54,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:54,316 INFO L93 Difference]: Finished difference Result 8567 states and 20880 transitions. [2019-12-27 21:49:54,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:49:54,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-27 21:49:54,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:54,329 INFO L225 Difference]: With dead ends: 8567 [2019-12-27 21:49:54,330 INFO L226 Difference]: Without dead ends: 8567 [2019-12-27 21:49:54,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:49:54,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8567 states. [2019-12-27 21:49:54,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8567 to 8465. [2019-12-27 21:49:54,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8465 states. [2019-12-27 21:49:54,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8465 states to 8465 states and 20682 transitions. [2019-12-27 21:49:54,439 INFO L78 Accepts]: Start accepts. Automaton has 8465 states and 20682 transitions. Word has length 30 [2019-12-27 21:49:54,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:54,440 INFO L462 AbstractCegarLoop]: Abstraction has 8465 states and 20682 transitions. [2019-12-27 21:49:54,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:49:54,440 INFO L276 IsEmpty]: Start isEmpty. Operand 8465 states and 20682 transitions. [2019-12-27 21:49:54,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 21:49:54,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:54,444 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:49:54,444 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:54,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:54,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1861858661, now seen corresponding path program 1 times [2019-12-27 21:49:54,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:54,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602151441] [2019-12-27 21:49:54,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:54,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:49:54,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602151441] [2019-12-27 21:49:54,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:54,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:49:54,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [832352209] [2019-12-27 21:49:54,493 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:54,500 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:54,507 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 32 states and 31 transitions. [2019-12-27 21:49:54,507 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:54,507 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:49:54,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:49:54,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:54,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:49:54,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:49:54,508 INFO L87 Difference]: Start difference. First operand 8465 states and 20682 transitions. Second operand 3 states. [2019-12-27 21:49:55,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:55,581 INFO L93 Difference]: Finished difference Result 12677 states and 29440 transitions. [2019-12-27 21:49:55,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:49:55,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-27 21:49:55,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:55,599 INFO L225 Difference]: With dead ends: 12677 [2019-12-27 21:49:55,600 INFO L226 Difference]: Without dead ends: 12677 [2019-12-27 21:49:55,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:49:55,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12677 states. [2019-12-27 21:49:55,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12677 to 11628. [2019-12-27 21:49:55,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11628 states. [2019-12-27 21:49:55,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11628 states to 11628 states and 27275 transitions. [2019-12-27 21:49:55,768 INFO L78 Accepts]: Start accepts. Automaton has 11628 states and 27275 transitions. Word has length 31 [2019-12-27 21:49:55,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:55,768 INFO L462 AbstractCegarLoop]: Abstraction has 11628 states and 27275 transitions. [2019-12-27 21:49:55,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:49:55,768 INFO L276 IsEmpty]: Start isEmpty. Operand 11628 states and 27275 transitions. [2019-12-27 21:49:55,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:49:55,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:55,772 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] [2019-12-27 21:49:55,772 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:55,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:55,773 INFO L82 PathProgramCache]: Analyzing trace with hash -483432237, now seen corresponding path program 1 times [2019-12-27 21:49:55,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:55,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755909597] [2019-12-27 21:49:55,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:55,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:55,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:49:55,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755909597] [2019-12-27 21:49:55,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:55,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:49:55,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1002744049] [2019-12-27 21:49:55,852 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:55,858 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:55,868 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 33 transitions. [2019-12-27 21:49:55,868 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:55,868 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:49:55,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:49:55,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:55,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:49:55,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:49:55,870 INFO L87 Difference]: Start difference. First operand 11628 states and 27275 transitions. Second operand 5 states. [2019-12-27 21:49:56,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:56,364 INFO L93 Difference]: Finished difference Result 13153 states and 30540 transitions. [2019-12-27 21:49:56,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:49:56,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-27 21:49:56,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:56,378 INFO L225 Difference]: With dead ends: 13153 [2019-12-27 21:49:56,378 INFO L226 Difference]: Without dead ends: 13153 [2019-12-27 21:49:56,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:49:56,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13153 states. [2019-12-27 21:49:56,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13153 to 11842. [2019-12-27 21:49:56,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11842 states. [2019-12-27 21:49:56,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11842 states to 11842 states and 27752 transitions. [2019-12-27 21:49:56,519 INFO L78 Accepts]: Start accepts. Automaton has 11842 states and 27752 transitions. Word has length 33 [2019-12-27 21:49:56,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:56,520 INFO L462 AbstractCegarLoop]: Abstraction has 11842 states and 27752 transitions. [2019-12-27 21:49:56,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:49:56,520 INFO L276 IsEmpty]: Start isEmpty. Operand 11842 states and 27752 transitions. [2019-12-27 21:49:56,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 21:49:56,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:56,528 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] [2019-12-27 21:49:56,528 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:56,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:56,529 INFO L82 PathProgramCache]: Analyzing trace with hash 2081393196, now seen corresponding path program 1 times [2019-12-27 21:49:56,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:56,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702577056] [2019-12-27 21:49:56,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:56,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:49:56,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702577056] [2019-12-27 21:49:56,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:56,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:49:56,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [125453691] [2019-12-27 21:49:56,644 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:56,652 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:56,670 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 86 transitions. [2019-12-27 21:49:56,670 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:56,771 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:49:56,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:49:56,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:56,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:49:56,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:49:56,772 INFO L87 Difference]: Start difference. First operand 11842 states and 27752 transitions. Second operand 8 states. [2019-12-27 21:49:58,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:58,217 INFO L93 Difference]: Finished difference Result 13957 states and 32244 transitions. [2019-12-27 21:49:58,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:49:58,219 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2019-12-27 21:49:58,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:58,236 INFO L225 Difference]: With dead ends: 13957 [2019-12-27 21:49:58,237 INFO L226 Difference]: Without dead ends: 13957 [2019-12-27 21:49:58,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:49:58,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13957 states. [2019-12-27 21:49:58,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13957 to 13295. [2019-12-27 21:49:58,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13295 states. [2019-12-27 21:49:58,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13295 states to 13295 states and 30887 transitions. [2019-12-27 21:49:58,392 INFO L78 Accepts]: Start accepts. Automaton has 13295 states and 30887 transitions. Word has length 42 [2019-12-27 21:49:58,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:58,392 INFO L462 AbstractCegarLoop]: Abstraction has 13295 states and 30887 transitions. [2019-12-27 21:49:58,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:49:58,392 INFO L276 IsEmpty]: Start isEmpty. Operand 13295 states and 30887 transitions. [2019-12-27 21:49:58,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 21:49:58,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:58,399 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] [2019-12-27 21:49:58,399 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:58,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:58,399 INFO L82 PathProgramCache]: Analyzing trace with hash 428477981, now seen corresponding path program 1 times [2019-12-27 21:49:58,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:58,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313804336] [2019-12-27 21:49:58,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:58,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:49:58,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313804336] [2019-12-27 21:49:58,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:58,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:49:58,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [939077110] [2019-12-27 21:49:58,511 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:58,519 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:58,529 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 44 states and 43 transitions. [2019-12-27 21:49:58,529 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:58,529 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:49:58,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:49:58,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:58,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:49:58,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:49:58,530 INFO L87 Difference]: Start difference. First operand 13295 states and 30887 transitions. Second operand 6 states. [2019-12-27 21:49:59,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:59,294 INFO L93 Difference]: Finished difference Result 15410 states and 35255 transitions. [2019-12-27 21:49:59,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:49:59,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-27 21:49:59,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:59,317 INFO L225 Difference]: With dead ends: 15410 [2019-12-27 21:49:59,317 INFO L226 Difference]: Without dead ends: 15385 [2019-12-27 21:49:59,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:49:59,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15385 states. [2019-12-27 21:49:59,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15385 to 14466. [2019-12-27 21:49:59,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14466 states. [2019-12-27 21:49:59,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14466 states to 14466 states and 33448 transitions. [2019-12-27 21:49:59,524 INFO L78 Accepts]: Start accepts. Automaton has 14466 states and 33448 transitions. Word has length 43 [2019-12-27 21:49:59,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:59,524 INFO L462 AbstractCegarLoop]: Abstraction has 14466 states and 33448 transitions. [2019-12-27 21:49:59,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:49:59,524 INFO L276 IsEmpty]: Start isEmpty. Operand 14466 states and 33448 transitions. [2019-12-27 21:49:59,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 21:49:59,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:59,532 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] [2019-12-27 21:49:59,532 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:59,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:59,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1666784848, now seen corresponding path program 1 times [2019-12-27 21:49:59,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:59,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411554444] [2019-12-27 21:49:59,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:59,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:49:59,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411554444] [2019-12-27 21:49:59,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:59,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:49:59,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [502874010] [2019-12-27 21:49:59,637 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:59,646 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:59,662 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 87 transitions. [2019-12-27 21:49:59,662 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:59,687 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:49:59,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:49:59,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:59,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:49:59,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:49:59,688 INFO L87 Difference]: Start difference. First operand 14466 states and 33448 transitions. Second operand 6 states. [2019-12-27 21:49:59,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:59,751 INFO L93 Difference]: Finished difference Result 3468 states and 7339 transitions. [2019-12-27 21:49:59,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:49:59,752 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-27 21:49:59,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:59,756 INFO L225 Difference]: With dead ends: 3468 [2019-12-27 21:49:59,756 INFO L226 Difference]: Without dead ends: 3184 [2019-12-27 21:49:59,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:49:59,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3184 states. [2019-12-27 21:49:59,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3184 to 3003. [2019-12-27 21:49:59,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3003 states. [2019-12-27 21:49:59,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3003 states to 3003 states and 6400 transitions. [2019-12-27 21:49:59,787 INFO L78 Accepts]: Start accepts. Automaton has 3003 states and 6400 transitions. Word has length 43 [2019-12-27 21:49:59,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:59,787 INFO L462 AbstractCegarLoop]: Abstraction has 3003 states and 6400 transitions. [2019-12-27 21:49:59,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:49:59,787 INFO L276 IsEmpty]: Start isEmpty. Operand 3003 states and 6400 transitions. [2019-12-27 21:49:59,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 21:49:59,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:59,791 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] [2019-12-27 21:49:59,792 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:59,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:59,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1149224758, now seen corresponding path program 1 times [2019-12-27 21:49:59,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:59,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052587619] [2019-12-27 21:49:59,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:59,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:49:59,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052587619] [2019-12-27 21:49:59,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:59,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:49:59,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1537207045] [2019-12-27 21:49:59,838 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:59,847 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:59,861 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 47 states and 46 transitions. [2019-12-27 21:49:59,861 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:59,861 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:49:59,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:49:59,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:59,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:49:59,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:49:59,863 INFO L87 Difference]: Start difference. First operand 3003 states and 6400 transitions. Second operand 3 states. [2019-12-27 21:49:59,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:59,933 INFO L93 Difference]: Finished difference Result 3346 states and 6732 transitions. [2019-12-27 21:49:59,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:49:59,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-12-27 21:49:59,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:59,937 INFO L225 Difference]: With dead ends: 3346 [2019-12-27 21:49:59,937 INFO L226 Difference]: Without dead ends: 3346 [2019-12-27 21:49:59,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:49:59,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states. [2019-12-27 21:49:59,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 2967. [2019-12-27 21:49:59,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2967 states. [2019-12-27 21:49:59,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2967 states to 2967 states and 6009 transitions. [2019-12-27 21:49:59,966 INFO L78 Accepts]: Start accepts. Automaton has 2967 states and 6009 transitions. Word has length 46 [2019-12-27 21:49:59,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:59,966 INFO L462 AbstractCegarLoop]: Abstraction has 2967 states and 6009 transitions. [2019-12-27 21:49:59,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:49:59,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2967 states and 6009 transitions. [2019-12-27 21:49:59,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-27 21:49:59,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:59,970 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:49:59,970 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:59,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:59,970 INFO L82 PathProgramCache]: Analyzing trace with hash -549380219, now seen corresponding path program 1 times [2019-12-27 21:49:59,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:59,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757636611] [2019-12-27 21:49:59,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:00,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:00,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757636611] [2019-12-27 21:50:00,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:00,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:50:00,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [673585471] [2019-12-27 21:50:00,084 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:00,095 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:00,113 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 49 transitions. [2019-12-27 21:50:00,114 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:00,114 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:50:00,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:50:00,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:00,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:50:00,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:50:00,116 INFO L87 Difference]: Start difference. First operand 2967 states and 6009 transitions. Second operand 6 states. [2019-12-27 21:50:00,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:00,502 INFO L93 Difference]: Finished difference Result 3202 states and 6432 transitions. [2019-12-27 21:50:00,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:50:00,502 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-12-27 21:50:00,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:00,508 INFO L225 Difference]: With dead ends: 3202 [2019-12-27 21:50:00,509 INFO L226 Difference]: Without dead ends: 3134 [2019-12-27 21:50:00,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:50:00,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3134 states. [2019-12-27 21:50:00,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3134 to 2882. [2019-12-27 21:50:00,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2882 states. [2019-12-27 21:50:00,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2882 states and 5827 transitions. [2019-12-27 21:50:00,553 INFO L78 Accepts]: Start accepts. Automaton has 2882 states and 5827 transitions. Word has length 49 [2019-12-27 21:50:00,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:00,553 INFO L462 AbstractCegarLoop]: Abstraction has 2882 states and 5827 transitions. [2019-12-27 21:50:00,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:50:00,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2882 states and 5827 transitions. [2019-12-27 21:50:00,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 21:50:00,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:00,560 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:00,561 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:00,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:00,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1384279063, now seen corresponding path program 1 times [2019-12-27 21:50:00,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:00,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006296650] [2019-12-27 21:50:00,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:00,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:00,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006296650] [2019-12-27 21:50:00,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:00,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:50:00,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [786363725] [2019-12-27 21:50:00,746 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:00,779 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:00,902 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 174 states and 251 transitions. [2019-12-27 21:50:00,902 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:00,905 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:50:00,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:50:00,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:00,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:50:00,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:50:00,906 INFO L87 Difference]: Start difference. First operand 2882 states and 5827 transitions. Second operand 5 states. [2019-12-27 21:50:01,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:01,129 INFO L93 Difference]: Finished difference Result 4499 states and 9108 transitions. [2019-12-27 21:50:01,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:50:01,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-12-27 21:50:01,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:01,134 INFO L225 Difference]: With dead ends: 4499 [2019-12-27 21:50:01,134 INFO L226 Difference]: Without dead ends: 4499 [2019-12-27 21:50:01,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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-27 21:50:01,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4499 states. [2019-12-27 21:50:01,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4499 to 3832. [2019-12-27 21:50:01,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3832 states. [2019-12-27 21:50:01,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3832 states to 3832 states and 7842 transitions. [2019-12-27 21:50:01,202 INFO L78 Accepts]: Start accepts. Automaton has 3832 states and 7842 transitions. Word has length 85 [2019-12-27 21:50:01,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:01,202 INFO L462 AbstractCegarLoop]: Abstraction has 3832 states and 7842 transitions. [2019-12-27 21:50:01,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:50:01,202 INFO L276 IsEmpty]: Start isEmpty. Operand 3832 states and 7842 transitions. [2019-12-27 21:50:01,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-27 21:50:01,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:01,207 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:01,207 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:01,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:01,207 INFO L82 PathProgramCache]: Analyzing trace with hash 2146217659, now seen corresponding path program 1 times [2019-12-27 21:50:01,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:01,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258179648] [2019-12-27 21:50:01,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:01,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:01,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258179648] [2019-12-27 21:50:01,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:01,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:50:01,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [566498776] [2019-12-27 21:50:01,337 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:01,368 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:01,511 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 176 states and 254 transitions. [2019-12-27 21:50:01,511 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:01,526 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:50:01,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:50:01,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:01,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:50:01,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:50:01,527 INFO L87 Difference]: Start difference. First operand 3832 states and 7842 transitions. Second operand 8 states. [2019-12-27 21:50:03,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:03,102 INFO L93 Difference]: Finished difference Result 5050 states and 10150 transitions. [2019-12-27 21:50:03,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 21:50:03,102 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 86 [2019-12-27 21:50:03,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:03,108 INFO L225 Difference]: With dead ends: 5050 [2019-12-27 21:50:03,108 INFO L226 Difference]: Without dead ends: 5050 [2019-12-27 21:50:03,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2019-12-27 21:50:03,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5050 states. [2019-12-27 21:50:03,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5050 to 3860. [2019-12-27 21:50:03,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3860 states. [2019-12-27 21:50:03,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3860 states to 3860 states and 7896 transitions. [2019-12-27 21:50:03,150 INFO L78 Accepts]: Start accepts. Automaton has 3860 states and 7896 transitions. Word has length 86 [2019-12-27 21:50:03,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:03,150 INFO L462 AbstractCegarLoop]: Abstraction has 3860 states and 7896 transitions. [2019-12-27 21:50:03,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:50:03,150 INFO L276 IsEmpty]: Start isEmpty. Operand 3860 states and 7896 transitions. [2019-12-27 21:50:03,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-27 21:50:03,157 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:03,157 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:03,157 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:03,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:03,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1248391185, now seen corresponding path program 2 times [2019-12-27 21:50:03,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:03,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428093497] [2019-12-27 21:50:03,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:03,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:03,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428093497] [2019-12-27 21:50:03,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:03,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:50:03,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1213257754] [2019-12-27 21:50:03,355 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:03,383 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:03,534 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 147 states and 201 transitions. [2019-12-27 21:50:03,534 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:03,592 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:50:03,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:50:03,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:03,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:50:03,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:50:03,594 INFO L87 Difference]: Start difference. First operand 3860 states and 7896 transitions. Second operand 10 states. [2019-12-27 21:50:04,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:04,905 INFO L93 Difference]: Finished difference Result 13842 states and 28136 transitions. [2019-12-27 21:50:04,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:50:04,906 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2019-12-27 21:50:04,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:04,917 INFO L225 Difference]: With dead ends: 13842 [2019-12-27 21:50:04,917 INFO L226 Difference]: Without dead ends: 10866 [2019-12-27 21:50:04,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2019-12-27 21:50:04,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10866 states. [2019-12-27 21:50:04,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10866 to 3987. [2019-12-27 21:50:04,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3987 states. [2019-12-27 21:50:04,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3987 states to 3987 states and 8127 transitions. [2019-12-27 21:50:04,981 INFO L78 Accepts]: Start accepts. Automaton has 3987 states and 8127 transitions. Word has length 86 [2019-12-27 21:50:04,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:04,982 INFO L462 AbstractCegarLoop]: Abstraction has 3987 states and 8127 transitions. [2019-12-27 21:50:04,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:50:04,982 INFO L276 IsEmpty]: Start isEmpty. Operand 3987 states and 8127 transitions. [2019-12-27 21:50:04,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-27 21:50:04,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:04,989 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:04,989 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:04,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:04,990 INFO L82 PathProgramCache]: Analyzing trace with hash -691364165, now seen corresponding path program 3 times [2019-12-27 21:50:04,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:04,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695865108] [2019-12-27 21:50:04,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:05,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:05,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695865108] [2019-12-27 21:50:05,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:05,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 21:50:05,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2071079808] [2019-12-27 21:50:05,226 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:05,255 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:05,401 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 202 transitions. [2019-12-27 21:50:05,401 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:05,460 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 21:50:05,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 21:50:05,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:05,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 21:50:05,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:50:05,461 INFO L87 Difference]: Start difference. First operand 3987 states and 8127 transitions. Second operand 13 states. [2019-12-27 21:50:08,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:08,029 INFO L93 Difference]: Finished difference Result 6426 states and 12845 transitions. [2019-12-27 21:50:08,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:50:08,029 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2019-12-27 21:50:08,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:08,037 INFO L225 Difference]: With dead ends: 6426 [2019-12-27 21:50:08,037 INFO L226 Difference]: Without dead ends: 6426 [2019-12-27 21:50:08,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-12-27 21:50:08,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6426 states. [2019-12-27 21:50:08,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6426 to 3753. [2019-12-27 21:50:08,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3753 states. [2019-12-27 21:50:08,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3753 states to 3753 states and 7639 transitions. [2019-12-27 21:50:08,083 INFO L78 Accepts]: Start accepts. Automaton has 3753 states and 7639 transitions. Word has length 86 [2019-12-27 21:50:08,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:08,083 INFO L462 AbstractCegarLoop]: Abstraction has 3753 states and 7639 transitions. [2019-12-27 21:50:08,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 21:50:08,083 INFO L276 IsEmpty]: Start isEmpty. Operand 3753 states and 7639 transitions. [2019-12-27 21:50:08,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-27 21:50:08,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:08,088 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:08,088 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:08,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:08,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1996283635, now seen corresponding path program 4 times [2019-12-27 21:50:08,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:08,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140882484] [2019-12-27 21:50:08,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:08,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:08,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140882484] [2019-12-27 21:50:08,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:08,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:50:08,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2035712589] [2019-12-27 21:50:08,247 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:08,269 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:08,435 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 173 transitions. [2019-12-27 21:50:08,435 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:08,463 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:50:08,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:50:08,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:08,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:50:08,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:50:08,465 INFO L87 Difference]: Start difference. First operand 3753 states and 7639 transitions. Second operand 10 states. [2019-12-27 21:50:09,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:09,556 INFO L93 Difference]: Finished difference Result 10857 states and 21899 transitions. [2019-12-27 21:50:09,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 21:50:09,557 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2019-12-27 21:50:09,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:09,565 INFO L225 Difference]: With dead ends: 10857 [2019-12-27 21:50:09,566 INFO L226 Difference]: Without dead ends: 8257 [2019-12-27 21:50:09,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2019-12-27 21:50:09,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8257 states. [2019-12-27 21:50:09,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8257 to 4142. [2019-12-27 21:50:09,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4142 states. [2019-12-27 21:50:09,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4142 states to 4142 states and 8372 transitions. [2019-12-27 21:50:09,628 INFO L78 Accepts]: Start accepts. Automaton has 4142 states and 8372 transitions. Word has length 86 [2019-12-27 21:50:09,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:09,628 INFO L462 AbstractCegarLoop]: Abstraction has 4142 states and 8372 transitions. [2019-12-27 21:50:09,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:50:09,629 INFO L276 IsEmpty]: Start isEmpty. Operand 4142 states and 8372 transitions. [2019-12-27 21:50:09,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-27 21:50:09,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:09,636 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:09,636 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:09,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:09,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1509475397, now seen corresponding path program 5 times [2019-12-27 21:50:09,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:09,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882070318] [2019-12-27 21:50:09,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:09,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:09,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882070318] [2019-12-27 21:50:09,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:09,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 21:50:09,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [476840326] [2019-12-27 21:50:09,819 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:09,840 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:09,978 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 164 transitions. [2019-12-27 21:50:09,978 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:10,052 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:50:10,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:50:10,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:10,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:50:10,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:50:10,053 INFO L87 Difference]: Start difference. First operand 4142 states and 8372 transitions. Second operand 11 states. [2019-12-27 21:50:12,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:12,248 INFO L93 Difference]: Finished difference Result 6365 states and 12603 transitions. [2019-12-27 21:50:12,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 21:50:12,249 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 86 [2019-12-27 21:50:12,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:12,256 INFO L225 Difference]: With dead ends: 6365 [2019-12-27 21:50:12,256 INFO L226 Difference]: Without dead ends: 6365 [2019-12-27 21:50:12,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-12-27 21:50:12,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6365 states. [2019-12-27 21:50:12,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6365 to 4286. [2019-12-27 21:50:12,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4286 states. [2019-12-27 21:50:12,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4286 states to 4286 states and 8651 transitions. [2019-12-27 21:50:12,307 INFO L78 Accepts]: Start accepts. Automaton has 4286 states and 8651 transitions. Word has length 86 [2019-12-27 21:50:12,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:12,307 INFO L462 AbstractCegarLoop]: Abstraction has 4286 states and 8651 transitions. [2019-12-27 21:50:12,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:50:12,307 INFO L276 IsEmpty]: Start isEmpty. Operand 4286 states and 8651 transitions. [2019-12-27 21:50:12,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-27 21:50:12,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:12,312 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:12,312 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:12,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:12,313 INFO L82 PathProgramCache]: Analyzing trace with hash 629468785, now seen corresponding path program 6 times [2019-12-27 21:50:12,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:12,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715034791] [2019-12-27 21:50:12,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:12,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:12,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715034791] [2019-12-27 21:50:12,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:12,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:50:12,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [238845638] [2019-12-27 21:50:12,443 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:12,462 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:12,677 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 145 transitions. [2019-12-27 21:50:12,677 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:12,677 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:50:12,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:50:12,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:12,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:50:12,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:50:12,679 INFO L87 Difference]: Start difference. First operand 4286 states and 8651 transitions. Second operand 5 states. [2019-12-27 21:50:12,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:12,766 INFO L93 Difference]: Finished difference Result 6993 states and 14012 transitions. [2019-12-27 21:50:12,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:50:12,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-12-27 21:50:12,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:12,771 INFO L225 Difference]: With dead ends: 6993 [2019-12-27 21:50:12,771 INFO L226 Difference]: Without dead ends: 2754 [2019-12-27 21:50:12,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:50:12,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2754 states. [2019-12-27 21:50:12,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2754 to 2628. [2019-12-27 21:50:12,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2628 states. [2019-12-27 21:50:12,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2628 states to 2628 states and 5211 transitions. [2019-12-27 21:50:12,797 INFO L78 Accepts]: Start accepts. Automaton has 2628 states and 5211 transitions. Word has length 86 [2019-12-27 21:50:12,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:12,797 INFO L462 AbstractCegarLoop]: Abstraction has 2628 states and 5211 transitions. [2019-12-27 21:50:12,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:50:12,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2628 states and 5211 transitions. [2019-12-27 21:50:12,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-27 21:50:12,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:12,800 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:12,800 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:12,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:12,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1577268337, now seen corresponding path program 7 times [2019-12-27 21:50:12,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:12,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351661859] [2019-12-27 21:50:12,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:12,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:12,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351661859] [2019-12-27 21:50:12,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:12,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:50:12,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1868243811] [2019-12-27 21:50:12,881 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:12,900 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:13,072 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 217 transitions. [2019-12-27 21:50:13,073 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:13,074 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:50:13,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:50:13,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:13,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:50:13,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:50:13,075 INFO L87 Difference]: Start difference. First operand 2628 states and 5211 transitions. Second operand 3 states. [2019-12-27 21:50:13,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:13,141 INFO L93 Difference]: Finished difference Result 2627 states and 5209 transitions. [2019-12-27 21:50:13,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:50:13,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-12-27 21:50:13,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:13,146 INFO L225 Difference]: With dead ends: 2627 [2019-12-27 21:50:13,147 INFO L226 Difference]: Without dead ends: 2627 [2019-12-27 21:50:13,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:50:13,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2627 states. [2019-12-27 21:50:13,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2627 to 2412. [2019-12-27 21:50:13,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2412 states. [2019-12-27 21:50:13,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2412 states to 2412 states and 4816 transitions. [2019-12-27 21:50:13,198 INFO L78 Accepts]: Start accepts. Automaton has 2412 states and 4816 transitions. Word has length 86 [2019-12-27 21:50:13,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:13,199 INFO L462 AbstractCegarLoop]: Abstraction has 2412 states and 4816 transitions. [2019-12-27 21:50:13,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:50:13,199 INFO L276 IsEmpty]: Start isEmpty. Operand 2412 states and 4816 transitions. [2019-12-27 21:50:13,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-27 21:50:13,205 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:13,205 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] [2019-12-27 21:50:13,206 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:13,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:13,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1160744719, now seen corresponding path program 1 times [2019-12-27 21:50:13,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:13,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606301437] [2019-12-27 21:50:13,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:13,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:13,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606301437] [2019-12-27 21:50:13,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:13,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 21:50:13,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1277651440] [2019-12-27 21:50:13,747 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:13,780 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:14,021 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 177 states and 263 transitions. [2019-12-27 21:50:14,021 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:14,129 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 21:50:14,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 21:50:14,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:14,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 21:50:14,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-12-27 21:50:14,130 INFO L87 Difference]: Start difference. First operand 2412 states and 4816 transitions. Second operand 21 states. [2019-12-27 21:50:15,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:15,209 INFO L93 Difference]: Finished difference Result 7596 states and 15182 transitions. [2019-12-27 21:50:15,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 21:50:15,210 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 87 [2019-12-27 21:50:15,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:15,218 INFO L225 Difference]: With dead ends: 7596 [2019-12-27 21:50:15,219 INFO L226 Difference]: Without dead ends: 7557 [2019-12-27 21:50:15,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 16 SyntacticMatches, 11 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=186, Invalid=936, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 21:50:15,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7557 states. [2019-12-27 21:50:15,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7557 to 4444. [2019-12-27 21:50:15,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4444 states. [2019-12-27 21:50:15,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4444 states to 4444 states and 8925 transitions. [2019-12-27 21:50:15,271 INFO L78 Accepts]: Start accepts. Automaton has 4444 states and 8925 transitions. Word has length 87 [2019-12-27 21:50:15,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:15,271 INFO L462 AbstractCegarLoop]: Abstraction has 4444 states and 8925 transitions. [2019-12-27 21:50:15,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 21:50:15,271 INFO L276 IsEmpty]: Start isEmpty. Operand 4444 states and 8925 transitions. [2019-12-27 21:50:15,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-27 21:50:15,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:15,278 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] [2019-12-27 21:50:15,278 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:15,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:15,278 INFO L82 PathProgramCache]: Analyzing trace with hash -4069085, now seen corresponding path program 2 times [2019-12-27 21:50:15,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:15,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493048853] [2019-12-27 21:50:15,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:50:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:50:15,430 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:50:15,431 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:50:15,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1293] [1293] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_50| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~main$tmp_guard1~0_17 0) (= |v_#valid_48| (store .cse0 |v_ULTIMATE.start_main_~#t1593~0.base_20| 1)) (= 0 v_~y$r_buff0_thd2~0_106) (= v_~y$r_buff0_thd1~0_24 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1593~0.base_20|) 0) (= 0 v_~weak$$choice0~0_9) (= 0 v_~y$r_buff1_thd2~0_59) (= |v_#NULL.offset_7| 0) (= v_~y$w_buff1_used~0_95 0) (= |v_ULTIMATE.start_main_~#t1593~0.offset_16| 0) (= 0 v_~y$w_buff0~0_45) (= v_~y$w_buff0_used~0_180 0) (= v_~y$read_delayed~0_6 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~y~0_46 0) (= 0 v_~__unbuffered_p1_EAX~0_9) (= v_~y$r_buff0_thd0~0_62 0) (= 0 v_~y$r_buff1_thd1~0_18) (= 0 v_~weak$$choice2~0_44) (= 0 |v_#NULL.base_7|) (= 0 v_~y$r_buff1_thd0~0_34) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1593~0.base_20| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1593~0.base_20|) |v_ULTIMATE.start_main_~#t1593~0.offset_16| 0)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1593~0.base_20|) (= 0 v_~y$flush_delayed~0_26) (= v_~y$mem_tmp~0_12 0) (= 0 v_~y$w_buff1~0_41) (= v_~x~0_12 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard0~0_11 0) (= v_~__unbuffered_p1_EBX~0_11 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1593~0.base_20| 4)) (= 0 v_~__unbuffered_cnt~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_10|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_10|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_14|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_13|, ULTIMATE.start_main_#t~nondet70=|v_ULTIMATE.start_main_#t~nondet70_8|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_12|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_13|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_12|, ~y$mem_tmp~0=v_~y$mem_tmp~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_12|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_24, ~y$flush_delayed~0=v_~y$flush_delayed~0_26, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_7|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_12|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_14|, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_14|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_12|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_12|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_13|, ULTIMATE.start_main_~#t1594~0.offset=|v_ULTIMATE.start_main_~#t1594~0.offset_15|, ~y$w_buff1~0=v_~y$w_buff1~0_41, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_13|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_106, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_34, ~x~0=v_~x~0_12, ULTIMATE.start_main_~#t1594~0.base=|v_ULTIMATE.start_main_~#t1594~0.base_19|, ULTIMATE.start_main_~#t1593~0.offset=|v_ULTIMATE.start_main_~#t1593~0.offset_16|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_180, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_10|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_13|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_10|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_14|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_14|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_18, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_12|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_23|, ~y$w_buff0~0=v_~y$w_buff0~0_45, ~y~0=v_~y~0_46, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_11, ULTIMATE.start_main_#t~nondet69=|v_ULTIMATE.start_main_#t~nondet69_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_8|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_12|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite76=|v_ULTIMATE.start_main_#t~ite76_13|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_13|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_59, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_14|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_13|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_62, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_17|, ~weak$$choice2~0=v_~weak$$choice2~0_44, ULTIMATE.start_main_~#t1593~0.base=|v_ULTIMATE.start_main_~#t1593~0.base_20|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~nondet70, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite73, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~ite90, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet62, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite75, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ULTIMATE.start_main_~#t1594~0.offset, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite80, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t1594~0.base, ULTIMATE.start_main_~#t1593~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite74, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite91, ~y$w_buff0~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet69, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_#t~ite78, #NULL.base, ULTIMATE.start_main_#t~ite76, ULTIMATE.start_main_#t~ite85, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ULTIMATE.start_main_~#t1593~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 21:50:15,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1259] [1259] L813-1-->L815: Formula: (and (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1594~0.base_10|) 0) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1594~0.base_10| 4)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1594~0.base_10| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1594~0.base_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1594~0.base_10|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1594~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1594~0.base_10|) |v_ULTIMATE.start_main_~#t1594~0.offset_9| 1)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t1594~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1594~0.base=|v_ULTIMATE.start_main_~#t1594~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1594~0.offset=|v_ULTIMATE.start_main_~#t1594~0.offset_9|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_11|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1594~0.base, ULTIMATE.start_main_~#t1594~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-27 21:50:15,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1182] [1182] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0~0_32 v_~y$w_buff1~0_29) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= 2 v_~y$w_buff0~0_31) (= v_~y$w_buff1_used~0_83 v_~y$w_buff0_used~0_153) (= v_~y$w_buff0_used~0_152 1) (= (mod v_~y$w_buff1_used~0_83 256) 0) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_153, ~y$w_buff0~0=v_~y$w_buff0~0_32, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_152, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_31, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 21:50:15,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1228] [1228] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1704471314 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite31_Out-1704471314| ~y~0_In-1704471314) .cse0) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite31_Out-1704471314| ~y$mem_tmp~0_In-1704471314)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1704471314, ~y$flush_delayed~0=~y$flush_delayed~0_In-1704471314, ~y~0=~y~0_In-1704471314} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1704471314, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-1704471314|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1704471314, ~y~0=~y~0_In-1704471314} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 21:50:15,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1224] [1224] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-2009904037 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite54_Out-2009904037| ~y$mem_tmp~0_In-2009904037) (not .cse0)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite54_Out-2009904037| ~y~0_In-2009904037)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-2009904037, ~y$flush_delayed~0=~y$flush_delayed~0_In-2009904037, ~y~0=~y~0_In-2009904037} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-2009904037, ~y$flush_delayed~0=~y$flush_delayed~0_In-2009904037, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-2009904037|, ~y~0=~y~0_In-2009904037} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-27 21:50:15,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1244] [1244] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-160899703 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-160899703 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-160899703|)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-160899703| ~y$w_buff0_used~0_In-160899703)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-160899703, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-160899703} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-160899703|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-160899703, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-160899703} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 21:50:15,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1220] [1220] L740-->L740-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1391070712 256))) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-1391070712 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1391070712 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1391070712 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1391070712|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-1391070712 |P0Thread1of1ForFork0_#t~ite6_Out-1391070712|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1391070712, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1391070712, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1391070712, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1391070712} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1391070712|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1391070712, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1391070712, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1391070712, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1391070712} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 21:50:15,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1209] [1209] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-947479669 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-947479669 256)))) (or (and (= ~y$r_buff0_thd1~0_Out-947479669 ~y$r_buff0_thd1~0_In-947479669) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~y$r_buff0_thd1~0_Out-947479669 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-947479669, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-947479669} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-947479669, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-947479669|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-947479669} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:50:15,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1219] [1219] L742-->L742-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In1321599765 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1321599765 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1321599765 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1321599765 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out1321599765| 0)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out1321599765| ~y$r_buff1_thd1~0_In1321599765) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1321599765, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1321599765, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1321599765, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1321599765} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1321599765, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1321599765, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1321599765|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1321599765, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1321599765} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 21:50:15,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1252] [1252] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_14, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 21:50:15,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1217] [1217] L790-2-->L790-5: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-1470204234 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite56_Out-1470204234| |P1Thread1of1ForFork1_#t~ite55_Out-1470204234|)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1470204234 256) 0))) (or (and (= ~y~0_In-1470204234 |P1Thread1of1ForFork1_#t~ite55_Out-1470204234|) (or .cse0 .cse1) .cse2) (and (= ~y$w_buff1~0_In-1470204234 |P1Thread1of1ForFork1_#t~ite55_Out-1470204234|) (not .cse0) .cse2 (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1470204234, ~y$w_buff1~0=~y$w_buff1~0_In-1470204234, ~y~0=~y~0_In-1470204234, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1470204234} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1470204234, ~y$w_buff1~0=~y$w_buff1~0_In-1470204234, P1Thread1of1ForFork1_#t~ite56=|P1Thread1of1ForFork1_#t~ite56_Out-1470204234|, P1Thread1of1ForFork1_#t~ite55=|P1Thread1of1ForFork1_#t~ite55_Out-1470204234|, ~y~0=~y~0_In-1470204234, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1470204234} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite56, P1Thread1of1ForFork1_#t~ite55] because there is no mapped edge [2019-12-27 21:50:15,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1240] [1240] L791-->L791-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1319137616 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1319137616 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite57_Out-1319137616| ~y$w_buff0_used~0_In-1319137616)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite57_Out-1319137616| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1319137616, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1319137616} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1319137616, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1319137616, P1Thread1of1ForFork1_#t~ite57=|P1Thread1of1ForFork1_#t~ite57_Out-1319137616|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite57] because there is no mapped edge [2019-12-27 21:50:15,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1210] [1210] L792-->L792-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In2067891877 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In2067891877 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In2067891877 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In2067891877 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite58_Out2067891877| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite58_Out2067891877| ~y$w_buff1_used~0_In2067891877) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2067891877, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2067891877, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2067891877, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2067891877} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2067891877, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2067891877, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2067891877, P1Thread1of1ForFork1_#t~ite58=|P1Thread1of1ForFork1_#t~ite58_Out2067891877|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2067891877} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite58] because there is no mapped edge [2019-12-27 21:50:15,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1218] [1218] L793-->L793-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1951184525 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1951184525 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In1951184525 |P1Thread1of1ForFork1_#t~ite59_Out1951184525|)) (and (= |P1Thread1of1ForFork1_#t~ite59_Out1951184525| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1951184525, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1951184525} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1951184525, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1951184525, P1Thread1of1ForFork1_#t~ite59=|P1Thread1of1ForFork1_#t~ite59_Out1951184525|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite59] because there is no mapped edge [2019-12-27 21:50:15,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1237] [1237] L794-->L794-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In1840390664 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1840390664 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In1840390664 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1840390664 256)))) (or (and (= ~y$r_buff1_thd2~0_In1840390664 |P1Thread1of1ForFork1_#t~ite60_Out1840390664|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite60_Out1840390664|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1840390664, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1840390664, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1840390664, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1840390664} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1840390664, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1840390664, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out1840390664|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1840390664, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1840390664} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-27 21:50:15,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1267] [1267] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= v_~y$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork1_#t~ite60_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_55, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 21:50:15,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1171] [1171] L819-->L821-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= (mod v_~y$r_buff0_thd0~0_52 256) 0) (= 0 (mod v_~y$w_buff0_used~0_147 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_147, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_147, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 21:50:15,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1233] [1233] L821-2-->L821-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-2122598480 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-2122598480 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-2122598480| ~y~0_In-2122598480) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite63_Out-2122598480| ~y$w_buff1~0_In-2122598480)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-2122598480, ~y~0=~y~0_In-2122598480, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2122598480, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2122598480} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-2122598480|, ~y$w_buff1~0=~y$w_buff1~0_In-2122598480, ~y~0=~y~0_In-2122598480, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2122598480, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2122598480} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-27 21:50:15,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1179] [1179] L821-4-->L822: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite63_7|) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_7|} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_6|, ~y~0=v_~y~0_31, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ~y~0, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-27 21:50:15,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1236] [1236] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1190844035 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1190844035 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite65_Out1190844035|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1190844035 |ULTIMATE.start_main_#t~ite65_Out1190844035|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1190844035, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1190844035} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1190844035, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1190844035, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out1190844035|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-27 21:50:15,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1246] [1246] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1472906254 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1472906254 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1472906254 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1472906254 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite66_Out-1472906254|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-1472906254 |ULTIMATE.start_main_#t~ite66_Out-1472906254|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1472906254, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1472906254, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1472906254, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1472906254} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1472906254, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1472906254, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-1472906254|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1472906254, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1472906254} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-27 21:50:15,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1226] [1226] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In881619845 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In881619845 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite67_Out881619845|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite67_Out881619845| ~y$r_buff0_thd0~0_In881619845) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In881619845, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In881619845} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In881619845, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In881619845, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out881619845|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-27 21:50:15,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1214] [1214] L825-->L825-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-151803220 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-151803220 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-151803220 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-151803220 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite68_Out-151803220|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd0~0_In-151803220 |ULTIMATE.start_main_#t~ite68_Out-151803220|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-151803220, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-151803220, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-151803220, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-151803220} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-151803220, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-151803220, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-151803220|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-151803220, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-151803220} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-27 21:50:15,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1216] [1216] L840-->L840-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1197722649 256)))) (or (and (= |ULTIMATE.start_main_#t~ite91_Out-1197722649| ~y~0_In-1197722649) .cse0) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite91_Out-1197722649| ~y$mem_tmp~0_In-1197722649)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1197722649, ~y$flush_delayed~0=~y$flush_delayed~0_In-1197722649, ~y~0=~y~0_In-1197722649} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1197722649, ULTIMATE.start_main_#t~ite91=|ULTIMATE.start_main_#t~ite91_Out-1197722649|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1197722649, ~y~0=~y~0_In-1197722649} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite91] because there is no mapped edge [2019-12-27 21:50:15,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1276] [1276] L840-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9| (mod v_~main$tmp_guard1~0_10 256)) (= 0 v_~y$flush_delayed~0_18) (= v_~y~0_38 |v_ULTIMATE.start_main_#t~ite91_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_11|, ~y$flush_delayed~0=v_~y$flush_delayed~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~y~0=v_~y~0_38, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite91, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:50:15,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:50:15 BasicIcfg [2019-12-27 21:50:15,669 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:50:15,673 INFO L168 Benchmark]: Toolchain (without parser) took 53309.84 ms. Allocated memory was 144.7 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 99.2 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 21:50:15,674 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 21:50:15,675 INFO L168 Benchmark]: CACSL2BoogieTranslator took 849.70 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 99.0 MB in the beginning and 153.9 MB in the end (delta: -54.9 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:50:15,675 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.61 ms. Allocated memory is still 202.4 MB. Free memory was 153.9 MB in the beginning and 150.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:50:15,677 INFO L168 Benchmark]: Boogie Preprocessor took 47.11 ms. Allocated memory is still 202.4 MB. Free memory was 150.5 MB in the beginning and 147.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:50:15,678 INFO L168 Benchmark]: RCFGBuilder took 1261.28 ms. Allocated memory was 202.4 MB in the beginning and 234.4 MB in the end (delta: 32.0 MB). Free memory was 147.2 MB in the beginning and 195.4 MB in the end (delta: -48.2 MB). Peak memory consumption was 67.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:50:15,679 INFO L168 Benchmark]: TraceAbstraction took 51063.72 ms. Allocated memory was 234.4 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 195.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 21:50:15,689 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.20 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 849.70 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 99.0 MB in the beginning and 153.9 MB in the end (delta: -54.9 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.61 ms. Allocated memory is still 202.4 MB. Free memory was 153.9 MB in the beginning and 150.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.11 ms. Allocated memory is still 202.4 MB. Free memory was 150.5 MB in the beginning and 147.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1261.28 ms. Allocated memory was 202.4 MB in the beginning and 234.4 MB in the end (delta: 32.0 MB). Free memory was 147.2 MB in the beginning and 195.4 MB in the end (delta: -48.2 MB). Peak memory consumption was 67.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 51063.72 ms. Allocated memory was 234.4 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 195.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 231 ProgramPointsBefore, 154 ProgramPointsAfterwards, 307 TransitionsBefore, 192 TransitionsAfterwards, 41414 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 67 ConcurrentYvCompositions, 41 ChoiceCompositions, 14327 VarBasedMoverChecksPositive, 294 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 254260 CheckedPairsTotal, 128 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t1593, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L815] FCALL, FORK 0 pthread_create(&t1594, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L729] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L730] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L731] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L732] 1 y$r_buff0_thd1 = (_Bool)1 [L735] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 y = 1 [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 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 [!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)=1, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 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) [L763] 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, 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))=2, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] 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)) [L764] 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, 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))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 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)) [L765] 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, 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))=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 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)) [L766] 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, 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))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L766] 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)) [L767] 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, 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))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 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)) [L768] 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, 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))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 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)) [L769] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y = y$flush_delayed ? y$mem_tmp : y [L771] 2 y$flush_delayed = (_Bool)0 [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 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 [!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)=1, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 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) [L779] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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))=2, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L779] 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)) [L780] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 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)) [L781] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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))=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 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)) [L782] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L782] 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)) [L783] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] 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)) [L784] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L784] 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)) [L785] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L790] 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=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 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) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 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 [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 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 [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 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 [L828] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 0 y$flush_delayed = weak$$choice2 [L831] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L833] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L834] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L835] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L836] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L837] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L838] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 225 locations, 2 error locations. Result: UNSAFE, OverallTime: 50.6s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 24.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7891 SDtfs, 7260 SDslu, 30016 SDs, 0 SdLazy, 12393 SolverSat, 345 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 309 GetRequests, 93 SyntacticMatches, 33 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91419occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.7s AutomataMinimizationTime, 21 MinimizatonAttempts, 32722 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1226 NumberOfCodeBlocks, 1226 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1118 ConstructedInterpolants, 0 QuantifiedInterpolants, 355230 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...