/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:05:49,015 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:05:49,017 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:05:49,030 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:05:49,030 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:05:49,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:05:49,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:05:49,034 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:05:49,036 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:05:49,037 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:05:49,038 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:05:49,039 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:05:49,039 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:05:49,040 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:05:49,041 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:05:49,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:05:49,043 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:05:49,044 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:05:49,046 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:05:49,048 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:05:49,050 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:05:49,051 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:05:49,052 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:05:49,053 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:05:49,056 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:05:49,058 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:05:49,058 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:05:49,059 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:05:49,059 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:05:49,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:05:49,062 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:05:49,063 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:05:49,065 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:05:49,066 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:05:49,067 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:05:49,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:05:49,068 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:05:49,068 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:05:49,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:05:49,073 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:05:49,077 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:05:49,078 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:05:49,101 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:05:49,101 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:05:49,104 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:05:49,104 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:05:49,104 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:05:49,104 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:05:49,105 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:05:49,105 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:05:49,105 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:05:49,105 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:05:49,106 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:05:49,107 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:05:49,107 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:05:49,107 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:05:49,107 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:05:49,108 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:05:49,108 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:05:49,108 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:05:49,108 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:05:49,108 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:05:49,109 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:05:49,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:05:49,109 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:05:49,110 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:05:49,110 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:05:49,110 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:05:49,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:05:49,110 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:05:49,110 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:05:49,111 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:05:49,399 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:05:49,412 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:05:49,416 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:05:49,417 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:05:49,417 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:05:49,418 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_tso.oepc.i [2019-12-18 14:05:49,480 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93a768e59/2fe165ff5974459087f15f099b301293/FLAGf4362381f [2019-12-18 14:05:50,064 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:05:50,064 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_tso.oepc.i [2019-12-18 14:05:50,086 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93a768e59/2fe165ff5974459087f15f099b301293/FLAGf4362381f [2019-12-18 14:05:50,341 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93a768e59/2fe165ff5974459087f15f099b301293 [2019-12-18 14:05:50,350 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:05:50,352 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:05:50,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:05:50,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:05:50,356 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:05:50,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:05:50" (1/1) ... [2019-12-18 14:05:50,363 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@127092cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:05:50, skipping insertion in model container [2019-12-18 14:05:50,363 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:05:50" (1/1) ... [2019-12-18 14:05:50,371 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:05:50,430 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:05:50,991 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:05:51,003 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:05:51,070 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:05:51,145 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:05:51,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:05:51 WrapperNode [2019-12-18 14:05:51,145 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:05:51,146 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:05:51,146 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:05:51,146 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:05:51,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:05:51" (1/1) ... [2019-12-18 14:05:51,183 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:05:51" (1/1) ... [2019-12-18 14:05:51,230 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:05:51,230 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:05:51,230 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:05:51,231 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:05:51,241 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:05:51" (1/1) ... [2019-12-18 14:05:51,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:05:51" (1/1) ... [2019-12-18 14:05:51,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:05:51" (1/1) ... [2019-12-18 14:05:51,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:05:51" (1/1) ... [2019-12-18 14:05:51,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:05:51" (1/1) ... [2019-12-18 14:05:51,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:05:51" (1/1) ... [2019-12-18 14:05:51,269 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:05:51" (1/1) ... [2019-12-18 14:05:51,276 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:05:51,277 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:05:51,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:05:51,277 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:05:51,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:05:51" (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-18 14:05:51,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:05:51,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:05:51,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:05:51,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:05:51,364 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:05:51,365 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:05:51,365 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:05:51,365 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:05:51,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:05:51,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:05:51,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:05:51,368 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 14:05:52,523 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:05:52,524 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:05:52,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:05:52 BoogieIcfgContainer [2019-12-18 14:05:52,525 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:05:52,527 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:05:52,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:05:52,531 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:05:52,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:05:50" (1/3) ... [2019-12-18 14:05:52,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7178df30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:05:52, skipping insertion in model container [2019-12-18 14:05:52,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:05:51" (2/3) ... [2019-12-18 14:05:52,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7178df30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:05:52, skipping insertion in model container [2019-12-18 14:05:52,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:05:52" (3/3) ... [2019-12-18 14:05:52,537 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi000_tso.oepc.i [2019-12-18 14:05:52,547 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:05:52,547 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:05:52,560 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:05:52,561 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:05:52,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,629 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,630 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,642 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,642 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,643 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,643 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,643 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,706 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,706 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,715 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,716 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,718 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:05:52,734 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 14:05:52,754 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:05:52,755 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:05:52,755 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:05:52,755 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:05:52,755 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:05:52,755 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:05:52,755 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:05:52,756 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:05:52,773 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 231 places, 307 transitions [2019-12-18 14:05:52,775 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-12-18 14:05:52,899 INFO L126 PetriNetUnfolder]: 83/305 cut-off events. [2019-12-18 14:05:52,900 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:05:52,937 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 708 event pairs. 6/226 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-12-18 14:05:53,027 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-12-18 14:05:53,109 INFO L126 PetriNetUnfolder]: 83/305 cut-off events. [2019-12-18 14:05:53,109 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:05:53,137 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 708 event pairs. 6/226 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-12-18 14:05:53,217 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 40114 [2019-12-18 14:05:53,218 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:05:59,532 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 14:05:59,638 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 14:05:59,703 INFO L206 etLargeBlockEncoding]: Checked pairs total: 232725 [2019-12-18 14:05:59,703 INFO L214 etLargeBlockEncoding]: Total number of compositions: 139 [2019-12-18 14:05:59,706 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 147 places, 184 transitions [2019-12-18 14:06:03,453 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 50078 states. [2019-12-18 14:06:03,455 INFO L276 IsEmpty]: Start isEmpty. Operand 50078 states. [2019-12-18 14:06:03,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 14:06:03,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:03,462 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 14:06:03,463 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:03,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:03,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1268502306, now seen corresponding path program 1 times [2019-12-18 14:06:03,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:03,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892121306] [2019-12-18 14:06:03,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:03,709 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-18 14:06:03,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892121306] [2019-12-18 14:06:03,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:03,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:06:03,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16636995] [2019-12-18 14:06:03,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:06:03,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:03,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:06:03,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:06:03,732 INFO L87 Difference]: Start difference. First operand 50078 states. Second operand 3 states. [2019-12-18 14:06:04,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:06:04,498 INFO L93 Difference]: Finished difference Result 50030 states and 178645 transitions. [2019-12-18 14:06:04,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:06:04,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 14:06:04,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:06:04,851 INFO L225 Difference]: With dead ends: 50030 [2019-12-18 14:06:04,852 INFO L226 Difference]: Without dead ends: 49055 [2019-12-18 14:06:04,853 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-18 14:06:07,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49055 states. [2019-12-18 14:06:08,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49055 to 49055. [2019-12-18 14:06:08,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49055 states. [2019-12-18 14:06:08,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49055 states to 49055 states and 175395 transitions. [2019-12-18 14:06:08,797 INFO L78 Accepts]: Start accepts. Automaton has 49055 states and 175395 transitions. Word has length 5 [2019-12-18 14:06:08,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:06:08,798 INFO L462 AbstractCegarLoop]: Abstraction has 49055 states and 175395 transitions. [2019-12-18 14:06:08,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:06:08,798 INFO L276 IsEmpty]: Start isEmpty. Operand 49055 states and 175395 transitions. [2019-12-18 14:06:08,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:06:08,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:08,804 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:06:08,804 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:08,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:08,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1198055303, now seen corresponding path program 1 times [2019-12-18 14:06:08,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:08,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790837674] [2019-12-18 14:06:08,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:08,994 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-18 14:06:08,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790837674] [2019-12-18 14:06:08,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:08,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:06:08,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734332230] [2019-12-18 14:06:08,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:06:08,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:08,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:06:08,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:06:08,998 INFO L87 Difference]: Start difference. First operand 49055 states and 175395 transitions. Second operand 4 states. [2019-12-18 14:06:11,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:06:11,755 INFO L93 Difference]: Finished difference Result 68649 states and 238459 transitions. [2019-12-18 14:06:11,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:06:11,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:06:11,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:06:12,080 INFO L225 Difference]: With dead ends: 68649 [2019-12-18 14:06:12,080 INFO L226 Difference]: Without dead ends: 68649 [2019-12-18 14:06:12,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:06:13,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68649 states. [2019-12-18 14:06:14,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68649 to 68283. [2019-12-18 14:06:14,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68283 states. [2019-12-18 14:06:15,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68283 states to 68283 states and 237431 transitions. [2019-12-18 14:06:15,092 INFO L78 Accepts]: Start accepts. Automaton has 68283 states and 237431 transitions. Word has length 11 [2019-12-18 14:06:15,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:06:15,092 INFO L462 AbstractCegarLoop]: Abstraction has 68283 states and 237431 transitions. [2019-12-18 14:06:15,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:06:15,092 INFO L276 IsEmpty]: Start isEmpty. Operand 68283 states and 237431 transitions. [2019-12-18 14:06:15,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:06:15,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:15,095 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:06:15,095 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:15,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:15,096 INFO L82 PathProgramCache]: Analyzing trace with hash -2038106739, now seen corresponding path program 1 times [2019-12-18 14:06:15,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:15,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570918301] [2019-12-18 14:06:15,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:15,212 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-18 14:06:15,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570918301] [2019-12-18 14:06:15,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:15,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:06:15,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474712161] [2019-12-18 14:06:15,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:06:15,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:15,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:06:15,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:06:15,215 INFO L87 Difference]: Start difference. First operand 68283 states and 237431 transitions. Second operand 4 states. [2019-12-18 14:06:16,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:06:16,000 INFO L93 Difference]: Finished difference Result 99934 states and 337703 transitions. [2019-12-18 14:06:16,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:06:16,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:06:16,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:06:19,127 INFO L225 Difference]: With dead ends: 99934 [2019-12-18 14:06:19,127 INFO L226 Difference]: Without dead ends: 99927 [2019-12-18 14:06:19,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:06:20,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99927 states. [2019-12-18 14:06:22,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99927 to 88377. [2019-12-18 14:06:22,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88377 states. [2019-12-18 14:06:22,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88377 states to 88377 states and 301889 transitions. [2019-12-18 14:06:22,486 INFO L78 Accepts]: Start accepts. Automaton has 88377 states and 301889 transitions. Word has length 11 [2019-12-18 14:06:22,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:06:22,486 INFO L462 AbstractCegarLoop]: Abstraction has 88377 states and 301889 transitions. [2019-12-18 14:06:22,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:06:22,487 INFO L276 IsEmpty]: Start isEmpty. Operand 88377 states and 301889 transitions. [2019-12-18 14:06:22,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 14:06:22,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:22,492 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:06:22,492 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:22,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:22,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1380914162, now seen corresponding path program 1 times [2019-12-18 14:06:22,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:22,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047479606] [2019-12-18 14:06:22,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:22,583 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-18 14:06:22,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047479606] [2019-12-18 14:06:22,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:22,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:06:22,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872679600] [2019-12-18 14:06:22,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:06:22,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:22,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:06:22,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:06:22,585 INFO L87 Difference]: Start difference. First operand 88377 states and 301889 transitions. Second operand 4 states. [2019-12-18 14:06:22,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:06:22,633 INFO L93 Difference]: Finished difference Result 8069 states and 20831 transitions. [2019-12-18 14:06:22,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:06:22,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 14:06:22,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:06:22,640 INFO L225 Difference]: With dead ends: 8069 [2019-12-18 14:06:22,641 INFO L226 Difference]: Without dead ends: 6481 [2019-12-18 14:06:22,641 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-18 14:06:22,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6481 states. [2019-12-18 14:06:22,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6481 to 6481. [2019-12-18 14:06:22,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6481 states. [2019-12-18 14:06:22,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6481 states to 6481 states and 15900 transitions. [2019-12-18 14:06:22,742 INFO L78 Accepts]: Start accepts. Automaton has 6481 states and 15900 transitions. Word has length 17 [2019-12-18 14:06:22,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:06:22,743 INFO L462 AbstractCegarLoop]: Abstraction has 6481 states and 15900 transitions. [2019-12-18 14:06:22,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:06:22,743 INFO L276 IsEmpty]: Start isEmpty. Operand 6481 states and 15900 transitions. [2019-12-18 14:06:22,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 14:06:22,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:22,745 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] [2019-12-18 14:06:22,745 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:22,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:22,746 INFO L82 PathProgramCache]: Analyzing trace with hash 160503652, now seen corresponding path program 1 times [2019-12-18 14:06:22,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:22,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440279555] [2019-12-18 14:06:22,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:22,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:06:22,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440279555] [2019-12-18 14:06:22,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:22,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:06:22,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702575580] [2019-12-18 14:06:22,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:06:22,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:22,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:06:22,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:06:22,865 INFO L87 Difference]: Start difference. First operand 6481 states and 15900 transitions. Second operand 5 states. [2019-12-18 14:06:22,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:06:22,915 INFO L93 Difference]: Finished difference Result 1835 states and 4003 transitions. [2019-12-18 14:06:22,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:06:22,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-18 14:06:22,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:06:22,918 INFO L225 Difference]: With dead ends: 1835 [2019-12-18 14:06:22,918 INFO L226 Difference]: Without dead ends: 1665 [2019-12-18 14:06:22,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:06:22,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2019-12-18 14:06:22,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1595. [2019-12-18 14:06:22,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1595 states. [2019-12-18 14:06:22,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 3499 transitions. [2019-12-18 14:06:22,936 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 3499 transitions. Word has length 23 [2019-12-18 14:06:22,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:06:22,936 INFO L462 AbstractCegarLoop]: Abstraction has 1595 states and 3499 transitions. [2019-12-18 14:06:22,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:06:22,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 3499 transitions. [2019-12-18 14:06:22,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-18 14:06:22,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:22,942 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] [2019-12-18 14:06:22,942 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:22,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:22,943 INFO L82 PathProgramCache]: Analyzing trace with hash -175598507, now seen corresponding path program 1 times [2019-12-18 14:06:22,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:22,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164078870] [2019-12-18 14:06:22,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:23,125 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-18 14:06:23,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164078870] [2019-12-18 14:06:23,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:23,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:06:23,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698341847] [2019-12-18 14:06:23,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:06:23,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:23,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:06:23,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:06:23,127 INFO L87 Difference]: Start difference. First operand 1595 states and 3499 transitions. Second operand 7 states. [2019-12-18 14:06:24,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:06:24,162 INFO L93 Difference]: Finished difference Result 2420 states and 5234 transitions. [2019-12-18 14:06:24,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:06:24,162 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-12-18 14:06:24,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:06:24,166 INFO L225 Difference]: With dead ends: 2420 [2019-12-18 14:06:24,166 INFO L226 Difference]: Without dead ends: 2420 [2019-12-18 14:06:24,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:06:24,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2019-12-18 14:06:24,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 1759. [2019-12-18 14:06:24,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1759 states. [2019-12-18 14:06:24,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 3873 transitions. [2019-12-18 14:06:24,187 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 3873 transitions. Word has length 83 [2019-12-18 14:06:24,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:06:24,187 INFO L462 AbstractCegarLoop]: Abstraction has 1759 states and 3873 transitions. [2019-12-18 14:06:24,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:06:24,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 3873 transitions. [2019-12-18 14:06:24,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-18 14:06:24,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:24,193 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] [2019-12-18 14:06:24,193 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:24,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:24,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1827081641, now seen corresponding path program 2 times [2019-12-18 14:06:24,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:24,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127988871] [2019-12-18 14:06:24,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:24,355 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-18 14:06:24,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127988871] [2019-12-18 14:06:24,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:24,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:06:24,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063424899] [2019-12-18 14:06:24,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:06:24,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:24,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:06:24,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:06:24,358 INFO L87 Difference]: Start difference. First operand 1759 states and 3873 transitions. Second operand 6 states. [2019-12-18 14:06:25,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:06:25,205 INFO L93 Difference]: Finished difference Result 2203 states and 4785 transitions. [2019-12-18 14:06:25,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 14:06:25,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-12-18 14:06:25,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:06:25,209 INFO L225 Difference]: With dead ends: 2203 [2019-12-18 14:06:25,209 INFO L226 Difference]: Without dead ends: 2203 [2019-12-18 14:06:25,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:06:25,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2203 states. [2019-12-18 14:06:25,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2203 to 1864. [2019-12-18 14:06:25,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1864 states. [2019-12-18 14:06:25,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 4089 transitions. [2019-12-18 14:06:25,231 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 4089 transitions. Word has length 83 [2019-12-18 14:06:25,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:06:25,232 INFO L462 AbstractCegarLoop]: Abstraction has 1864 states and 4089 transitions. [2019-12-18 14:06:25,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:06:25,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 4089 transitions. [2019-12-18 14:06:25,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-18 14:06:25,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:25,236 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] [2019-12-18 14:06:25,237 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:25,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:25,237 INFO L82 PathProgramCache]: Analyzing trace with hash 219474423, now seen corresponding path program 3 times [2019-12-18 14:06:25,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:25,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594490172] [2019-12-18 14:06:25,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:25,417 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-18 14:06:25,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594490172] [2019-12-18 14:06:25,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:25,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:06:25,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756375394] [2019-12-18 14:06:25,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:06:25,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:25,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:06:25,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:06:25,420 INFO L87 Difference]: Start difference. First operand 1864 states and 4089 transitions. Second operand 5 states. [2019-12-18 14:06:25,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:06:25,723 INFO L93 Difference]: Finished difference Result 2008 states and 4352 transitions. [2019-12-18 14:06:25,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:06:25,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-12-18 14:06:25,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:06:25,726 INFO L225 Difference]: With dead ends: 2008 [2019-12-18 14:06:25,727 INFO L226 Difference]: Without dead ends: 2008 [2019-12-18 14:06:25,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:06:25,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2019-12-18 14:06:25,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1903. [2019-12-18 14:06:25,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1903 states. [2019-12-18 14:06:25,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 4168 transitions. [2019-12-18 14:06:25,746 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 4168 transitions. Word has length 83 [2019-12-18 14:06:25,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:06:25,747 INFO L462 AbstractCegarLoop]: Abstraction has 1903 states and 4168 transitions. [2019-12-18 14:06:25,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:06:25,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 4168 transitions. [2019-12-18 14:06:25,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-18 14:06:25,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:25,751 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] [2019-12-18 14:06:25,751 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:25,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:25,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1940404291, now seen corresponding path program 4 times [2019-12-18 14:06:25,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:25,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103806160] [2019-12-18 14:06:25,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:25,833 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-18 14:06:25,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103806160] [2019-12-18 14:06:25,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:25,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:06:25,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323604312] [2019-12-18 14:06:25,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:06:25,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:25,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:06:25,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:06:25,836 INFO L87 Difference]: Start difference. First operand 1903 states and 4168 transitions. Second operand 4 states. [2019-12-18 14:06:26,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:06:26,219 INFO L93 Difference]: Finished difference Result 2669 states and 5838 transitions. [2019-12-18 14:06:26,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:06:26,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-12-18 14:06:26,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:06:26,224 INFO L225 Difference]: With dead ends: 2669 [2019-12-18 14:06:26,224 INFO L226 Difference]: Without dead ends: 2669 [2019-12-18 14:06:26,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:06:26,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2669 states. [2019-12-18 14:06:26,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2669 to 1999. [2019-12-18 14:06:26,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1999 states. [2019-12-18 14:06:26,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1999 states and 4329 transitions. [2019-12-18 14:06:26,250 INFO L78 Accepts]: Start accepts. Automaton has 1999 states and 4329 transitions. Word has length 83 [2019-12-18 14:06:26,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:06:26,250 INFO L462 AbstractCegarLoop]: Abstraction has 1999 states and 4329 transitions. [2019-12-18 14:06:26,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:06:26,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 4329 transitions. [2019-12-18 14:06:26,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-18 14:06:26,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:26,255 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] [2019-12-18 14:06:26,255 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:26,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:26,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1104508352, now seen corresponding path program 1 times [2019-12-18 14:06:26,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:26,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127703704] [2019-12-18 14:06:26,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:26,402 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-18 14:06:26,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127703704] [2019-12-18 14:06:26,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:26,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:06:26,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389239967] [2019-12-18 14:06:26,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 14:06:26,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:26,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 14:06:26,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:06:26,405 INFO L87 Difference]: Start difference. First operand 1999 states and 4329 transitions. Second operand 8 states. [2019-12-18 14:06:27,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:06:27,493 INFO L93 Difference]: Finished difference Result 2271 states and 4848 transitions. [2019-12-18 14:06:27,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 14:06:27,493 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2019-12-18 14:06:27,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:06:27,497 INFO L225 Difference]: With dead ends: 2271 [2019-12-18 14:06:27,498 INFO L226 Difference]: Without dead ends: 2271 [2019-12-18 14:06:27,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:06:27,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2271 states. [2019-12-18 14:06:27,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2271 to 1922. [2019-12-18 14:06:27,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1922 states. [2019-12-18 14:06:27,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 4165 transitions. [2019-12-18 14:06:27,528 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 4165 transitions. Word has length 84 [2019-12-18 14:06:27,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:06:27,528 INFO L462 AbstractCegarLoop]: Abstraction has 1922 states and 4165 transitions. [2019-12-18 14:06:27,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 14:06:27,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 4165 transitions. [2019-12-18 14:06:27,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-18 14:06:27,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:27,533 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] [2019-12-18 14:06:27,533 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:27,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:27,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1586153894, now seen corresponding path program 1 times [2019-12-18 14:06:27,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:27,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979151930] [2019-12-18 14:06:27,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:27,816 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-18 14:06:27,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979151930] [2019-12-18 14:06:27,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:27,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:06:27,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008528937] [2019-12-18 14:06:27,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:06:27,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:27,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:06:27,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:06:27,820 INFO L87 Difference]: Start difference. First operand 1922 states and 4165 transitions. Second operand 10 states. [2019-12-18 14:06:29,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:06:29,134 INFO L93 Difference]: Finished difference Result 3346 states and 7131 transitions. [2019-12-18 14:06:29,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 14:06:29,135 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2019-12-18 14:06:29,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:06:29,140 INFO L225 Difference]: With dead ends: 3346 [2019-12-18 14:06:29,141 INFO L226 Difference]: Without dead ends: 3346 [2019-12-18 14:06:29,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:06:29,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states. [2019-12-18 14:06:29,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 2214. [2019-12-18 14:06:29,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2214 states. [2019-12-18 14:06:29,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 4795 transitions. [2019-12-18 14:06:29,180 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 4795 transitions. Word has length 84 [2019-12-18 14:06:29,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:06:29,180 INFO L462 AbstractCegarLoop]: Abstraction has 2214 states and 4795 transitions. [2019-12-18 14:06:29,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:06:29,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 4795 transitions. [2019-12-18 14:06:29,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-18 14:06:29,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:29,184 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] [2019-12-18 14:06:29,185 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:29,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:29,185 INFO L82 PathProgramCache]: Analyzing trace with hash 791166708, now seen corresponding path program 2 times [2019-12-18 14:06:29,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:29,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704492279] [2019-12-18 14:06:29,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:29,327 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-18 14:06:29,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704492279] [2019-12-18 14:06:29,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:29,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:06:29,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141097134] [2019-12-18 14:06:29,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:06:29,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:29,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:06:29,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:06:29,329 INFO L87 Difference]: Start difference. First operand 2214 states and 4795 transitions. Second operand 7 states. [2019-12-18 14:06:30,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:06:30,237 INFO L93 Difference]: Finished difference Result 4473 states and 9586 transitions. [2019-12-18 14:06:30,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:06:30,237 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2019-12-18 14:06:30,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:06:30,244 INFO L225 Difference]: With dead ends: 4473 [2019-12-18 14:06:30,244 INFO L226 Difference]: Without dead ends: 4473 [2019-12-18 14:06:30,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:06:30,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4473 states. [2019-12-18 14:06:30,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4473 to 2349. [2019-12-18 14:06:30,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2349 states. [2019-12-18 14:06:30,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2349 states to 2349 states and 5119 transitions. [2019-12-18 14:06:30,275 INFO L78 Accepts]: Start accepts. Automaton has 2349 states and 5119 transitions. Word has length 84 [2019-12-18 14:06:30,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:06:30,275 INFO L462 AbstractCegarLoop]: Abstraction has 2349 states and 5119 transitions. [2019-12-18 14:06:30,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:06:30,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 5119 transitions. [2019-12-18 14:06:30,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-18 14:06:30,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:30,280 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] [2019-12-18 14:06:30,280 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:30,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:30,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1385714698, now seen corresponding path program 3 times [2019-12-18 14:06:30,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:30,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783236184] [2019-12-18 14:06:30,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:30,350 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-18 14:06:30,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783236184] [2019-12-18 14:06:30,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:30,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:06:30,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504926687] [2019-12-18 14:06:30,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:06:30,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:30,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:06:30,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:06:30,352 INFO L87 Difference]: Start difference. First operand 2349 states and 5119 transitions. Second operand 3 states. [2019-12-18 14:06:30,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:06:30,398 INFO L93 Difference]: Finished difference Result 2348 states and 5117 transitions. [2019-12-18 14:06:30,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:06:30,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-12-18 14:06:30,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:06:30,402 INFO L225 Difference]: With dead ends: 2348 [2019-12-18 14:06:30,402 INFO L226 Difference]: Without dead ends: 2348 [2019-12-18 14:06:30,403 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-18 14:06:30,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2019-12-18 14:06:30,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 2211. [2019-12-18 14:06:30,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2211 states. [2019-12-18 14:06:30,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 2211 states and 4860 transitions. [2019-12-18 14:06:30,437 INFO L78 Accepts]: Start accepts. Automaton has 2211 states and 4860 transitions. Word has length 84 [2019-12-18 14:06:30,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:06:30,437 INFO L462 AbstractCegarLoop]: Abstraction has 2211 states and 4860 transitions. [2019-12-18 14:06:30,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:06:30,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 4860 transitions. [2019-12-18 14:06:30,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-18 14:06:30,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:30,442 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-18 14:06:30,442 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:30,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:30,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1761939513, now seen corresponding path program 1 times [2019-12-18 14:06:30,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:30,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438945253] [2019-12-18 14:06:30,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:30,682 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-18 14:06:30,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438945253] [2019-12-18 14:06:30,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:30,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:06:30,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802896774] [2019-12-18 14:06:30,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:06:30,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:30,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:06:30,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:06:30,685 INFO L87 Difference]: Start difference. First operand 2211 states and 4860 transitions. Second operand 11 states. [2019-12-18 14:06:31,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:06:31,412 INFO L93 Difference]: Finished difference Result 3672 states and 7908 transitions. [2019-12-18 14:06:31,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 14:06:31,412 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2019-12-18 14:06:31,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:06:31,416 INFO L225 Difference]: With dead ends: 3672 [2019-12-18 14:06:31,416 INFO L226 Difference]: Without dead ends: 2397 [2019-12-18 14:06:31,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=205, Invalid=665, Unknown=0, NotChecked=0, Total=870 [2019-12-18 14:06:31,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2019-12-18 14:06:31,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 1729. [2019-12-18 14:06:31,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1729 states. [2019-12-18 14:06:31,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 3674 transitions. [2019-12-18 14:06:31,439 INFO L78 Accepts]: Start accepts. Automaton has 1729 states and 3674 transitions. Word has length 85 [2019-12-18 14:06:31,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:06:31,440 INFO L462 AbstractCegarLoop]: Abstraction has 1729 states and 3674 transitions. [2019-12-18 14:06:31,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:06:31,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 3674 transitions. [2019-12-18 14:06:31,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-18 14:06:31,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:31,442 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-18 14:06:31,442 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:31,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:31,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1370724916, now seen corresponding path program 1 times [2019-12-18 14:06:31,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:31,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663515962] [2019-12-18 14:06:31,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:31,699 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-18 14:06:31,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663515962] [2019-12-18 14:06:31,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:31,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 14:06:31,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37353362] [2019-12-18 14:06:31,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 14:06:31,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:31,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 14:06:31,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:06:31,701 INFO L87 Difference]: Start difference. First operand 1729 states and 3674 transitions. Second operand 15 states. [2019-12-18 14:06:32,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:06:32,892 INFO L93 Difference]: Finished difference Result 3494 states and 7422 transitions. [2019-12-18 14:06:32,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 14:06:32,892 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 86 [2019-12-18 14:06:32,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:06:32,898 INFO L225 Difference]: With dead ends: 3494 [2019-12-18 14:06:32,898 INFO L226 Difference]: Without dead ends: 3462 [2019-12-18 14:06:32,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=920, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 14:06:32,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3462 states. [2019-12-18 14:06:32,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3462 to 2748. [2019-12-18 14:06:32,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2748 states. [2019-12-18 14:06:32,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2748 states to 2748 states and 5920 transitions. [2019-12-18 14:06:32,943 INFO L78 Accepts]: Start accepts. Automaton has 2748 states and 5920 transitions. Word has length 86 [2019-12-18 14:06:32,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:06:32,943 INFO L462 AbstractCegarLoop]: Abstraction has 2748 states and 5920 transitions. [2019-12-18 14:06:32,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 14:06:32,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2748 states and 5920 transitions. [2019-12-18 14:06:32,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-18 14:06:32,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:32,949 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-18 14:06:32,949 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:32,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:32,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1543760090, now seen corresponding path program 2 times [2019-12-18 14:06:32,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:32,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583685662] [2019-12-18 14:06:32,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:33,044 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-18 14:06:33,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583685662] [2019-12-18 14:06:33,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:33,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:06:33,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704389614] [2019-12-18 14:06:33,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:06:33,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:33,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:06:33,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:06:33,046 INFO L87 Difference]: Start difference. First operand 2748 states and 5920 transitions. Second operand 5 states. [2019-12-18 14:06:33,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:06:33,315 INFO L93 Difference]: Finished difference Result 4388 states and 9472 transitions. [2019-12-18 14:06:33,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:06:33,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-12-18 14:06:33,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:06:33,321 INFO L225 Difference]: With dead ends: 4388 [2019-12-18 14:06:33,321 INFO L226 Difference]: Without dead ends: 4388 [2019-12-18 14:06:33,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:06:33,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4388 states. [2019-12-18 14:06:33,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4388 to 3521. [2019-12-18 14:06:33,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3521 states. [2019-12-18 14:06:33,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3521 states to 3521 states and 7576 transitions. [2019-12-18 14:06:33,362 INFO L78 Accepts]: Start accepts. Automaton has 3521 states and 7576 transitions. Word has length 86 [2019-12-18 14:06:33,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:06:33,363 INFO L462 AbstractCegarLoop]: Abstraction has 3521 states and 7576 transitions. [2019-12-18 14:06:33,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:06:33,363 INFO L276 IsEmpty]: Start isEmpty. Operand 3521 states and 7576 transitions. [2019-12-18 14:06:33,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-18 14:06:33,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:33,369 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-18 14:06:33,370 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:33,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:33,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1563899026, now seen corresponding path program 1 times [2019-12-18 14:06:33,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:33,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734855032] [2019-12-18 14:06:33,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:33,461 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-18 14:06:33,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734855032] [2019-12-18 14:06:33,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:33,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:06:33,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052087700] [2019-12-18 14:06:33,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:06:33,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:33,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:06:33,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:06:33,464 INFO L87 Difference]: Start difference. First operand 3521 states and 7576 transitions. Second operand 6 states. [2019-12-18 14:06:33,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:06:33,844 INFO L93 Difference]: Finished difference Result 3751 states and 7964 transitions. [2019-12-18 14:06:33,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:06:33,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-12-18 14:06:33,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:06:33,850 INFO L225 Difference]: With dead ends: 3751 [2019-12-18 14:06:33,851 INFO L226 Difference]: Without dead ends: 3669 [2019-12-18 14:06:33,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:06:33,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3669 states. [2019-12-18 14:06:33,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3669 to 3584. [2019-12-18 14:06:33,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3584 states. [2019-12-18 14:06:33,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 7664 transitions. [2019-12-18 14:06:33,932 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 7664 transitions. Word has length 87 [2019-12-18 14:06:33,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:06:33,933 INFO L462 AbstractCegarLoop]: Abstraction has 3584 states and 7664 transitions. [2019-12-18 14:06:33,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:06:33,933 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 7664 transitions. [2019-12-18 14:06:33,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-18 14:06:33,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:33,942 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-18 14:06:33,942 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:33,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:33,943 INFO L82 PathProgramCache]: Analyzing trace with hash -126478383, now seen corresponding path program 1 times [2019-12-18 14:06:33,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:33,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254769816] [2019-12-18 14:06:33,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:34,677 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-18 14:06:34,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254769816] [2019-12-18 14:06:34,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:34,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 14:06:34,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015362602] [2019-12-18 14:06:34,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 14:06:34,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:34,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 14:06:34,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-12-18 14:06:34,685 INFO L87 Difference]: Start difference. First operand 3584 states and 7664 transitions. Second operand 17 states. [2019-12-18 14:06:36,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:06:36,715 INFO L93 Difference]: Finished difference Result 6680 states and 14389 transitions. [2019-12-18 14:06:36,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 14:06:36,715 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2019-12-18 14:06:36,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:06:36,724 INFO L225 Difference]: With dead ends: 6680 [2019-12-18 14:06:36,724 INFO L226 Difference]: Without dead ends: 6646 [2019-12-18 14:06:36,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=294, Invalid=1428, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 14:06:36,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6646 states. [2019-12-18 14:06:36,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6646 to 4788. [2019-12-18 14:06:36,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4788 states. [2019-12-18 14:06:36,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4788 states to 4788 states and 10420 transitions. [2019-12-18 14:06:36,779 INFO L78 Accepts]: Start accepts. Automaton has 4788 states and 10420 transitions. Word has length 87 [2019-12-18 14:06:36,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:06:36,780 INFO L462 AbstractCegarLoop]: Abstraction has 4788 states and 10420 transitions. [2019-12-18 14:06:36,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 14:06:36,780 INFO L276 IsEmpty]: Start isEmpty. Operand 4788 states and 10420 transitions. [2019-12-18 14:06:36,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-18 14:06:36,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:36,786 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 14:06:36,786 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:36,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:36,786 INFO L82 PathProgramCache]: Analyzing trace with hash -436099747, now seen corresponding path program 1 times [2019-12-18 14:06:36,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:36,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858409218] [2019-12-18 14:06:36,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:36,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:06:36,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858409218] [2019-12-18 14:06:36,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:36,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:06:36,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854083557] [2019-12-18 14:06:36,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:06:36,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:36,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:06:36,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:06:36,837 INFO L87 Difference]: Start difference. First operand 4788 states and 10420 transitions. Second operand 3 states. [2019-12-18 14:06:36,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:06:36,927 INFO L93 Difference]: Finished difference Result 5701 states and 11900 transitions. [2019-12-18 14:06:36,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:06:36,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-12-18 14:06:36,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:06:36,934 INFO L225 Difference]: With dead ends: 5701 [2019-12-18 14:06:36,935 INFO L226 Difference]: Without dead ends: 5701 [2019-12-18 14:06:36,936 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-18 14:06:36,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5701 states. [2019-12-18 14:06:36,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5701 to 5073. [2019-12-18 14:06:36,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5073 states. [2019-12-18 14:06:36,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5073 states to 5073 states and 10720 transitions. [2019-12-18 14:06:36,986 INFO L78 Accepts]: Start accepts. Automaton has 5073 states and 10720 transitions. Word has length 87 [2019-12-18 14:06:36,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:06:36,986 INFO L462 AbstractCegarLoop]: Abstraction has 5073 states and 10720 transitions. [2019-12-18 14:06:36,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:06:36,986 INFO L276 IsEmpty]: Start isEmpty. Operand 5073 states and 10720 transitions. [2019-12-18 14:06:36,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-18 14:06:36,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:36,992 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-18 14:06:36,992 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:36,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:36,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1973430413, now seen corresponding path program 2 times [2019-12-18 14:06:36,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:36,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542740418] [2019-12-18 14:06:36,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:37,381 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-18 14:06:37,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542740418] [2019-12-18 14:06:37,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:37,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:06:37,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190985671] [2019-12-18 14:06:37,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:06:37,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:37,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:06:37,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:06:37,385 INFO L87 Difference]: Start difference. First operand 5073 states and 10720 transitions. Second operand 11 states. [2019-12-18 14:06:38,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:06:38,474 INFO L93 Difference]: Finished difference Result 7797 states and 16453 transitions. [2019-12-18 14:06:38,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 14:06:38,474 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 87 [2019-12-18 14:06:38,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:06:38,483 INFO L225 Difference]: With dead ends: 7797 [2019-12-18 14:06:38,483 INFO L226 Difference]: Without dead ends: 7727 [2019-12-18 14:06:38,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-12-18 14:06:38,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7727 states. [2019-12-18 14:06:38,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7727 to 5806. [2019-12-18 14:06:38,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5806 states. [2019-12-18 14:06:38,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5806 states to 5806 states and 12259 transitions. [2019-12-18 14:06:38,549 INFO L78 Accepts]: Start accepts. Automaton has 5806 states and 12259 transitions. Word has length 87 [2019-12-18 14:06:38,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:06:38,549 INFO L462 AbstractCegarLoop]: Abstraction has 5806 states and 12259 transitions. [2019-12-18 14:06:38,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:06:38,550 INFO L276 IsEmpty]: Start isEmpty. Operand 5806 states and 12259 transitions. [2019-12-18 14:06:38,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-18 14:06:38,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:38,557 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-18 14:06:38,557 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:38,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:38,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1151333618, now seen corresponding path program 1 times [2019-12-18 14:06:38,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:38,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720106709] [2019-12-18 14:06:38,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:39,200 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-18 14:06:39,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720106709] [2019-12-18 14:06:39,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:39,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 14:06:39,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258231655] [2019-12-18 14:06:39,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 14:06:39,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:39,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 14:06:39,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-12-18 14:06:39,202 INFO L87 Difference]: Start difference. First operand 5806 states and 12259 transitions. Second operand 19 states. [2019-12-18 14:06:42,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:06:42,963 INFO L93 Difference]: Finished difference Result 9762 states and 20495 transitions. [2019-12-18 14:06:42,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-18 14:06:42,964 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 87 [2019-12-18 14:06:42,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:06:42,975 INFO L225 Difference]: With dead ends: 9762 [2019-12-18 14:06:42,975 INFO L226 Difference]: Without dead ends: 9626 [2019-12-18 14:06:42,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=248, Invalid=1644, Unknown=0, NotChecked=0, Total=1892 [2019-12-18 14:06:42,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9626 states. [2019-12-18 14:06:43,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9626 to 6002. [2019-12-18 14:06:43,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6002 states. [2019-12-18 14:06:43,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6002 states to 6002 states and 12698 transitions. [2019-12-18 14:06:43,049 INFO L78 Accepts]: Start accepts. Automaton has 6002 states and 12698 transitions. Word has length 87 [2019-12-18 14:06:43,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:06:43,049 INFO L462 AbstractCegarLoop]: Abstraction has 6002 states and 12698 transitions. [2019-12-18 14:06:43,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 14:06:43,050 INFO L276 IsEmpty]: Start isEmpty. Operand 6002 states and 12698 transitions. [2019-12-18 14:06:43,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-18 14:06:43,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:43,057 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:06:43,057 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:43,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:43,057 INFO L82 PathProgramCache]: Analyzing trace with hash -766393236, now seen corresponding path program 2 times [2019-12-18 14:06:43,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:43,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039995334] [2019-12-18 14:06:43,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:06:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:06:43,201 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:06:43,202 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:06:43,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1305] [1305] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_52| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1597~0.base_28|) (= 0 v_~__unbuffered_p1_EAX~0_80) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1597~0.base_28| 4) |v_#length_17|) (= v_~y$r_buff1_thd1~0_174 0) (= 0 |v_ULTIMATE.start_main_~#t1597~0.offset_20|) (= v_~y$r_buff0_thd0~0_406 0) (= 0 v_~y$w_buff0~0_222) (= v_~y~0_511 0) (= 0 v_~y$r_buff0_thd2~0_640) (= v_~main$tmp_guard0~0_27 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1597~0.base_28|)) (= 0 v_~weak$$choice0~0_258) (= v_~y$mem_tmp~0_281 0) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_621 0) (= v_~x~0_48 0) (= 0 v_~y$r_buff1_thd2~0_481) (= v_~__unbuffered_p1_EBX~0_44 0) (= v_~y$flush_delayed~0_437 0) (= v_~weak$$choice2~0_358 0) (= |v_#valid_50| (store .cse0 |v_ULTIMATE.start_main_~#t1597~0.base_28| 1)) (= v_~y$r_buff0_thd1~0_95 0) (= |v_#NULL.offset_5| 0) (= 0 v_~__unbuffered_cnt~0_58) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1597~0.base_28| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1597~0.base_28|) |v_ULTIMATE.start_main_~#t1597~0.offset_20| 0)) |v_#memory_int_17|) (= v_~y$r_buff1_thd0~0_395 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$w_buff0_used~0_1083 0) (= v_~y$w_buff1~0_235 0) (= 0 |v_#NULL.base_5|) (= 0 v_~main$tmp_guard1~0_116) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1597~0.offset=|v_ULTIMATE.start_main_~#t1597~0.offset_20|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_200|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_296|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_37|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_29|, ULTIMATE.start_main_#t~nondet70=|v_ULTIMATE.start_main_#t~nondet70_172|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_26|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_63|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_46|, ~y$mem_tmp~0=v_~y$mem_tmp~0_281, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_80, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_49|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_95, ~y$flush_delayed~0=v_~y$flush_delayed~0_437, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_17|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_121|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_86|, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_100|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_34|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_27|, ~weak$$choice0~0=v_~weak$$choice0~0_258, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_45|, ~y$w_buff1~0=v_~y$w_buff1~0_235, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_130|, ~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_640, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_395, ~x~0=v_~x~0_48, ULTIMATE.start_main_~#t1597~0.base=|v_ULTIMATE.start_main_~#t1597~0.base_28|, ~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_1083, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_116, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_34|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_46|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_42|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_36|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_60|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_174, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_48|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_259|, ~y$w_buff0~0=v_~y$w_buff0~0_222, ~y~0=v_~y~0_511, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_44, ULTIMATE.start_main_#t~nondet69=|v_ULTIMATE.start_main_#t~nondet69_172|, ULTIMATE.start_main_~#t1598~0.base=|v_ULTIMATE.start_main_~#t1598~0.base_18|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_8|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_118|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite76=|v_ULTIMATE.start_main_#t~ite76_81|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_31|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_481, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_72|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_190|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_406, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_17|, ~weak$$choice2~0=v_~weak$$choice2~0_358, ULTIMATE.start_main_~#t1598~0.offset=|v_ULTIMATE.start_main_~#t1598~0.offset_15|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_621} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1597~0.offset, #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, ~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_~#t1597~0.base, ~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, ULTIMATE.start_main_~#t1598~0.base, ~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_~#t1598~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 14:06:43,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1266] [1266] L813-1-->L815: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1598~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1598~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1598~0.base_13|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1598~0.base_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1598~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1598~0.base_13|) |v_ULTIMATE.start_main_~#t1598~0.offset_11| 1)) |v_#memory_int_11|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1598~0.base_13| 1) |v_#valid_27|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1598~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1598~0.base=|v_ULTIMATE.start_main_~#t1598~0.base_13|, #length=|v_#length_11|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|, ULTIMATE.start_main_~#t1598~0.offset=|v_ULTIMATE.start_main_~#t1598~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1598~0.base, #length, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_~#t1598~0.offset] because there is no mapped edge [2019-12-18 14:06:43,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1162] [1162] L4-->L762: Formula: (and (= v_~y$r_buff0_thd2~0_126 v_~y$r_buff1_thd2~0_73) (= 1 v_~y$r_buff0_thd2~0_125) (= v_~y~0_65 v_~y$mem_tmp~0_35) (= v_~weak$$choice2~0_74 v_~y$flush_delayed~0_44) (= v_~y$r_buff0_thd1~0_15 v_~y$r_buff1_thd1~0_11) (= v_~weak$$choice2~0_74 |v_P1Thread1of1ForFork1_#t~nondet10_8|) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 0)) (= v_~weak$$choice0~0_30 |v_P1Thread1of1ForFork1_#t~nondet9_8|) (= v_~y$r_buff0_thd0~0_77 v_~y$r_buff1_thd0~0_69)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_77, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_126, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15, P1Thread1of1ForFork1_#t~nondet9=|v_P1Thread1of1ForFork1_#t~nondet9_8|, ~y~0=v_~y~0_65, P1Thread1of1ForFork1_#t~nondet10=|v_P1Thread1of1ForFork1_#t~nondet10_8|} OutVars{P1Thread1of1ForFork1_#t~nondet9=|v_P1Thread1of1ForFork1_#t~nondet9_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_73, P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~weak$$choice0~0=v_~weak$$choice0~0_30, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_35, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_77, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_125, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15, ~y$flush_delayed~0=v_~y$flush_delayed~0_44, ~y~0=v_~y~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_74, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_69, P1Thread1of1ForFork1_#t~nondet10=|v_P1Thread1of1ForFork1_#t~nondet10_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, P1Thread1of1ForFork1_#t~nondet9, ~weak$$choice2~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork1_#t~nondet10] because there is no mapped edge [2019-12-18 14:06:43,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1218] [1218] L762-2-->L762-4: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-532432644 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-532432644 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff0~0_In-532432644 |P1Thread1of1ForFork1_#t~ite11_Out-532432644|)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-532432644| ~y$w_buff1~0_In-532432644) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-532432644, ~y$w_buff1~0=~y$w_buff1~0_In-532432644, ~y$w_buff0~0=~y$w_buff0~0_In-532432644, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-532432644} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-532432644, ~y$w_buff1~0=~y$w_buff1~0_In-532432644, ~y$w_buff0~0=~y$w_buff0~0_In-532432644, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-532432644, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-532432644|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 14:06:43,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1145] [1145] L762-4-->L763: Formula: (= v_~y~0_45 |v_P1Thread1of1ForFork1_#t~ite11_10|) InVars {P1Thread1of1ForFork1_#t~ite11=|v_P1Thread1of1ForFork1_#t~ite11_10|} OutVars{P1Thread1of1ForFork1_#t~ite11=|v_P1Thread1of1ForFork1_#t~ite11_9|, P1Thread1of1ForFork1_#t~ite12=|v_P1Thread1of1ForFork1_#t~ite12_13|, ~y~0=v_~y~0_45} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12, ~y~0] because there is no mapped edge [2019-12-18 14:06:43,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1206] [1206] L767-->L768: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_173 256))) (= v_~y$r_buff0_thd2~0_264 v_~y$r_buff0_thd2~0_263)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_264, ~weak$$choice2~0=v_~weak$$choice2~0_173} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_263, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_173, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_17|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 14:06:43,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1227] [1227] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In263071464 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite31_Out263071464| ~y$mem_tmp~0_In263071464) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite31_Out263071464| ~y~0_In263071464) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In263071464, ~y$flush_delayed~0=~y$flush_delayed~0_In263071464, ~y~0=~y~0_In263071464} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In263071464, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out263071464|, ~y$flush_delayed~0=~y$flush_delayed~0_In263071464, ~y~0=~y~0_In263071464} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 14:06:43,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1246] [1246] L730-2-->L730-5: Formula: (let ((.cse1 (= |P0Thread1of1ForFork0_#t~ite4_Out189265914| |P0Thread1of1ForFork0_#t~ite3_Out189265914|)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In189265914 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In189265914 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= ~y$w_buff1~0_In189265914 |P0Thread1of1ForFork0_#t~ite3_Out189265914|)) (and .cse1 (= ~y~0_In189265914 |P0Thread1of1ForFork0_#t~ite3_Out189265914|) (or .cse2 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In189265914, ~y$w_buff1~0=~y$w_buff1~0_In189265914, ~y~0=~y~0_In189265914, ~y$w_buff1_used~0=~y$w_buff1_used~0_In189265914} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In189265914, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out189265914|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out189265914|, ~y$w_buff1~0=~y$w_buff1~0_In189265914, ~y~0=~y~0_In189265914, ~y$w_buff1_used~0=~y$w_buff1_used~0_In189265914} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 14:06:43,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1248] [1248] L778-2-->L778-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In88802803 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In88802803 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out88802803| ~y$w_buff0~0_In88802803) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out88802803| ~y$w_buff1~0_In88802803) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In88802803, ~y$w_buff1~0=~y$w_buff1~0_In88802803, ~y$w_buff0~0=~y$w_buff0~0_In88802803, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In88802803} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In88802803, ~y$w_buff1~0=~y$w_buff1~0_In88802803, ~y$w_buff0~0=~y$w_buff0~0_In88802803, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In88802803, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out88802803|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 14:06:43,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1163] [1163] L778-4-->L779: Formula: (= v_~y~0_81 |v_P1Thread1of1ForFork1_#t~ite34_8|) InVars {P1Thread1of1ForFork1_#t~ite34=|v_P1Thread1of1ForFork1_#t~ite34_8|} OutVars{P1Thread1of1ForFork1_#t~ite34=|v_P1Thread1of1ForFork1_#t~ite34_7|, P1Thread1of1ForFork1_#t~ite35=|v_P1Thread1of1ForFork1_#t~ite35_7|, ~y~0=v_~y~0_81} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34, P1Thread1of1ForFork1_#t~ite35, ~y~0] because there is no mapped edge [2019-12-18 14:06:43,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1197] [1197] L783-->L784: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_143 256))) (= v_~y$r_buff0_thd2~0_220 v_~y$r_buff0_thd2~0_219)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_220, ~weak$$choice2~0=v_~weak$$choice2~0_143} OutVars{P1Thread1of1ForFork1_#t~ite50=|v_P1Thread1of1ForFork1_#t~ite50_11|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_219, ~weak$$choice2~0=v_~weak$$choice2~0_143, P1Thread1of1ForFork1_#t~ite49=|v_P1Thread1of1ForFork1_#t~ite49_11|, P1Thread1of1ForFork1_#t~ite48=|v_P1Thread1of1ForFork1_#t~ite48_8|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite50, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite49, P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-18 14:06:43,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1232] [1232] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In73151253 256) 0))) (or (and (= ~y$mem_tmp~0_In73151253 |P1Thread1of1ForFork1_#t~ite54_Out73151253|) (not .cse0)) (and .cse0 (= ~y~0_In73151253 |P1Thread1of1ForFork1_#t~ite54_Out73151253|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In73151253, ~y$flush_delayed~0=~y$flush_delayed~0_In73151253, ~y~0=~y~0_In73151253} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In73151253, ~y$flush_delayed~0=~y$flush_delayed~0_In73151253, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out73151253|, ~y~0=~y~0_In73151253} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-18 14:06:43,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1219] [1219] L731-->L731-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In239741717 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In239741717 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out239741717| 0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out239741717| ~y$w_buff0_used~0_In239741717) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In239741717, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In239741717} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out239741717|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In239741717, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In239741717} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 14:06:43,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1214] [1214] L732-->L732-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-646006669 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-646006669 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-646006669 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-646006669 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-646006669 |P0Thread1of1ForFork0_#t~ite6_Out-646006669|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite6_Out-646006669| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-646006669, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-646006669, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-646006669, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-646006669} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-646006669|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-646006669, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-646006669, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-646006669, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-646006669} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 14:06:43,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1224] [1224] L733-->L733-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In1920689379 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1920689379 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In1920689379 |P0Thread1of1ForFork0_#t~ite7_Out1920689379|)) (and (= |P0Thread1of1ForFork0_#t~ite7_Out1920689379| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1920689379, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1920689379} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1920689379, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1920689379|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1920689379} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 14:06:43,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1250] [1250] L734-->L734-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In251512157 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In251512157 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In251512157 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In251512157 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out251512157|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In251512157 |P0Thread1of1ForFork0_#t~ite8_Out251512157|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In251512157, ~y$w_buff0_used~0=~y$w_buff0_used~0_In251512157, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In251512157, ~y$w_buff1_used~0=~y$w_buff1_used~0_In251512157} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In251512157, ~y$w_buff0_used~0=~y$w_buff0_used~0_In251512157, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out251512157|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In251512157, ~y$w_buff1_used~0=~y$w_buff1_used~0_In251512157} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 14:06:43,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1267] [1267] L734-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~y$r_buff1_thd1~0_56 |v_P0Thread1of1ForFork0_#t~ite8_32|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_56, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37} 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-18 14:06:43,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1247] [1247] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1727332568 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1727332568 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite57_Out1727332568|) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite57_Out1727332568| ~y$w_buff0_used~0_In1727332568)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1727332568, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1727332568} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1727332568, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1727332568, P1Thread1of1ForFork1_#t~ite57=|P1Thread1of1ForFork1_#t~ite57_Out1727332568|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite57] because there is no mapped edge [2019-12-18 14:06:43,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1251] [1251] L792-->L792-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-944902756 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-944902756 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-944902756 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-944902756 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite58_Out-944902756|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite58_Out-944902756| ~y$w_buff1_used~0_In-944902756)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-944902756, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-944902756, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-944902756, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-944902756} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-944902756, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-944902756, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-944902756, P1Thread1of1ForFork1_#t~ite58=|P1Thread1of1ForFork1_#t~ite58_Out-944902756|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-944902756} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite58] because there is no mapped edge [2019-12-18 14:06:43,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1244] [1244] L793-->L794: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1999305846 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1999305846 256)))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd2~0_Out-1999305846 0)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_Out-1999305846 ~y$r_buff0_thd2~0_In-1999305846)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1999305846, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1999305846} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1999305846, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1999305846, P1Thread1of1ForFork1_#t~ite59=|P1Thread1of1ForFork1_#t~ite59_Out-1999305846|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite59] because there is no mapped edge [2019-12-18 14:06:43,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1242] [1242] L794-->L794-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1198313804 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1198313804 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1198313804 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1198313804 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite60_Out-1198313804| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~y$r_buff1_thd2~0_In-1198313804 |P1Thread1of1ForFork1_#t~ite60_Out-1198313804|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1198313804, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1198313804, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1198313804, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1198313804} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1198313804, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1198313804, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out-1198313804|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1198313804, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1198313804} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-18 14:06:43,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1280] [1280] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= v_~y$r_buff1_thd2~0_339 |v_P1Thread1of1ForFork1_#t~ite60_32|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_339, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, 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-18 14:06:43,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1168] [1168] L819-->L821-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (or (= (mod v_~y$w_buff0_used~0_258 256) 0) (= (mod v_~y$r_buff0_thd0~0_91 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_258, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_91, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_258, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_91, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 14:06:43,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1241] [1241] L821-2-->L821-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In377467617 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In377467617 256)))) (or (and (= ~y~0_In377467617 |ULTIMATE.start_main_#t~ite63_Out377467617|) (or .cse0 .cse1)) (and (not .cse1) (= ~y$w_buff1~0_In377467617 |ULTIMATE.start_main_#t~ite63_Out377467617|) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In377467617, ~y~0=~y~0_In377467617, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In377467617, ~y$w_buff1_used~0=~y$w_buff1_used~0_In377467617} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out377467617|, ~y$w_buff1~0=~y$w_buff1~0_In377467617, ~y~0=~y~0_In377467617, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In377467617, ~y$w_buff1_used~0=~y$w_buff1_used~0_In377467617} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-18 14:06:43,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1184] [1184] L821-4-->L822: Formula: (= v_~y~0_114 |v_ULTIMATE.start_main_#t~ite63_12|) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_12|} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|, ~y~0=v_~y~0_114, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ~y~0, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-18 14:06:43,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1240] [1240] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-682969639 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-682969639 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite65_Out-682969639| 0)) (and (= |ULTIMATE.start_main_#t~ite65_Out-682969639| ~y$w_buff0_used~0_In-682969639) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-682969639, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-682969639} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-682969639, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-682969639, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out-682969639|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-18 14:06:43,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1215] [1215] L823-->L823-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-363904464 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-363904464 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-363904464 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-363904464 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite66_Out-363904464| ~y$w_buff1_used~0_In-363904464) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite66_Out-363904464| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-363904464, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-363904464, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-363904464, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-363904464} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-363904464, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-363904464, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-363904464|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-363904464, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-363904464} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-18 14:06:43,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1229] [1229] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1785913675 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1785913675 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite67_Out-1785913675|)) (and (= |ULTIMATE.start_main_#t~ite67_Out-1785913675| ~y$r_buff0_thd0~0_In-1785913675) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1785913675, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1785913675} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1785913675, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1785913675, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out-1785913675|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-18 14:06:43,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1221] [1221] L825-->L825-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In886484675 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In886484675 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In886484675 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In886484675 256)))) (or (and (= |ULTIMATE.start_main_#t~ite68_Out886484675| ~y$r_buff1_thd0~0_In886484675) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite68_Out886484675| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In886484675, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In886484675, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In886484675, ~y$w_buff1_used~0=~y$w_buff1_used~0_In886484675} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In886484675, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In886484675, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out886484675|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In886484675, ~y$w_buff1_used~0=~y$w_buff1_used~0_In886484675} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-18 14:06:43,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1222] [1222] L840-->L840-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1725005867 256)))) (or (and (= |ULTIMATE.start_main_#t~ite91_Out-1725005867| ~y~0_In-1725005867) .cse0) (and (= |ULTIMATE.start_main_#t~ite91_Out-1725005867| ~y$mem_tmp~0_In-1725005867) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1725005867, ~y$flush_delayed~0=~y$flush_delayed~0_In-1725005867, ~y~0=~y~0_In-1725005867} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1725005867, ULTIMATE.start_main_#t~ite91=|ULTIMATE.start_main_#t~ite91_Out-1725005867|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1725005867, ~y~0=~y~0_In-1725005867} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite91] because there is no mapped edge [2019-12-18 14:06:43,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1290] [1290] L840-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$flush_delayed~0_287 0) (= v_~y~0_301 |v_ULTIMATE.start_main_#t~ite91_55|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_26 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_22|) (= (mod v_~main$tmp_guard1~0_31 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_22|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_26 0)) InVars {ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_55|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_26, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_54|, ~y$flush_delayed~0=v_~y$flush_delayed~0_287, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ~y~0=v_~y~0_301, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_22|} 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-18 14:06:43,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:06:43 BasicIcfg [2019-12-18 14:06:43,379 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:06:43,381 INFO L168 Benchmark]: Toolchain (without parser) took 53029.84 ms. Allocated memory was 143.1 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 98.7 MB in the beginning and 748.1 MB in the end (delta: -649.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 14:06:43,382 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 143.1 MB. Free memory was 119.5 MB in the beginning and 119.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 14:06:43,382 INFO L168 Benchmark]: CACSL2BoogieTranslator took 792.70 ms. Allocated memory was 143.1 MB in the beginning and 200.3 MB in the end (delta: 57.1 MB). Free memory was 98.3 MB in the beginning and 151.7 MB in the end (delta: -53.4 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-18 14:06:43,383 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.98 ms. Allocated memory is still 200.3 MB. Free memory was 151.7 MB in the beginning and 147.6 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2019-12-18 14:06:43,384 INFO L168 Benchmark]: Boogie Preprocessor took 45.87 ms. Allocated memory is still 200.3 MB. Free memory was 147.6 MB in the beginning and 144.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-18 14:06:43,384 INFO L168 Benchmark]: RCFGBuilder took 1249.00 ms. Allocated memory was 200.3 MB in the beginning and 229.1 MB in the end (delta: 28.8 MB). Free memory was 144.1 MB in the beginning and 192.6 MB in the end (delta: -48.5 MB). Peak memory consumption was 69.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:06:43,385 INFO L168 Benchmark]: TraceAbstraction took 50852.07 ms. Allocated memory was 229.1 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 191.2 MB in the beginning and 748.1 MB in the end (delta: -556.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 14:06:43,388 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.22 ms. Allocated memory is still 143.1 MB. Free memory was 119.5 MB in the beginning and 119.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 792.70 ms. Allocated memory was 143.1 MB in the beginning and 200.3 MB in the end (delta: 57.1 MB). Free memory was 98.3 MB in the beginning and 151.7 MB in the end (delta: -53.4 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 83.98 ms. Allocated memory is still 200.3 MB. Free memory was 151.7 MB in the beginning and 147.6 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.87 ms. Allocated memory is still 200.3 MB. Free memory was 147.6 MB in the beginning and 144.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1249.00 ms. Allocated memory was 200.3 MB in the beginning and 229.1 MB in the end (delta: 28.8 MB). Free memory was 144.1 MB in the beginning and 192.6 MB in the end (delta: -48.5 MB). Peak memory consumption was 69.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 50852.07 ms. Allocated memory was 229.1 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 191.2 MB in the beginning and 748.1 MB in the end (delta: -556.8 MB). 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: 6.9s, 231 ProgramPointsBefore, 147 ProgramPointsAfterwards, 307 TransitionsBefore, 184 TransitionsAfterwards, 40114 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 76 ConcurrentYvCompositions, 42 ChoiceCompositions, 15276 VarBasedMoverChecksPositive, 410 VarBasedMoverChecksNegative, 97 SemBasedMoverChecksPositive, 446 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.4s, 0 MoverChecksTotal, 232725 CheckedPairsTotal, 139 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(&t1597, ((void *)0), P0, ((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] [L815] FCALL, FORK 0 pthread_create(&t1598, ((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] [L724] 1 y = 2 [L727] 1 x = 1 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=0, weak$$choice2=0, x=1, y=2, 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] [L730] 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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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] [L744] 2 x = 2 [L747] 2 y$w_buff1 = y$w_buff0 [L748] 2 y$w_buff0 = 1 [L749] 2 y$w_buff1_used = y$w_buff0_used [L750] 2 y$w_buff0_used = (_Bool)1 [L762] 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [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, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [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, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [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, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [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, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [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)) [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, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [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=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [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, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [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, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [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, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [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, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [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)) [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, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [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=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [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=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [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=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=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [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) [L730] 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) [L731] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L732] 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 [L733] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [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 [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=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$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=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 225 locations, 2 error locations. Result: UNSAFE, OverallTime: 50.4s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 23.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6035 SDtfs, 8159 SDslu, 22701 SDs, 0 SdLazy, 12988 SolverSat, 545 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 327 GetRequests, 56 SyntacticMatches, 31 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1129 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88377occurred 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: 11.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 27868 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1514 NumberOfCodeBlocks, 1514 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1406 ConstructedInterpolants, 0 QuantifiedInterpolants, 509856 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...