/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi008_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:09:09,235 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:09:09,238 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:09:09,256 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:09:09,256 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:09:09,258 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:09:09,260 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:09:09,273 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:09:09,275 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:09:09,276 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:09:09,280 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:09:09,281 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:09:09,281 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:09:09,283 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:09:09,287 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:09:09,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:09:09,291 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:09:09,294 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:09:09,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:09:09,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:09:09,306 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:09:09,310 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:09:09,312 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:09:09,313 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:09:09,318 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:09:09,318 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:09:09,319 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:09:09,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:09:09,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:09:09,324 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:09:09,324 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:09:09,325 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:09:09,326 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:09:09,328 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:09:09,329 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:09:09,329 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:09:09,330 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:09:09,330 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:09:09,330 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:09:09,331 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:09:09,333 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:09:09,334 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 22:09:09,354 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:09:09,354 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:09:09,359 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:09:09,359 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:09:09,359 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:09:09,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:09:09,360 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:09:09,360 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:09:09,360 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:09:09,360 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:09:09,361 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:09:09,362 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:09:09,362 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:09:09,363 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:09:09,363 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:09:09,363 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:09:09,363 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:09:09,363 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:09:09,364 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:09:09,364 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:09:09,364 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:09:09,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:09:09,364 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:09:09,365 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:09:09,365 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:09:09,365 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:09:09,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:09:09,365 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:09:09,365 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:09:09,366 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:09:09,669 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:09:09,683 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:09:09,686 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:09:09,688 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:09:09,688 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:09:09,689 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi008_rmo.opt.i [2019-12-18 22:09:09,762 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59bd17041/8b2ec301f77e4962a7d56d56198a20a1/FLAG182d4bfd1 [2019-12-18 22:09:10,419 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:09:10,420 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008_rmo.opt.i [2019-12-18 22:09:10,434 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59bd17041/8b2ec301f77e4962a7d56d56198a20a1/FLAG182d4bfd1 [2019-12-18 22:09:10,680 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59bd17041/8b2ec301f77e4962a7d56d56198a20a1 [2019-12-18 22:09:10,690 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:09:10,692 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:09:10,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:09:10,693 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:09:10,696 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:09:10,697 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:09:10" (1/1) ... [2019-12-18 22:09:10,700 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f522b85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:09:10, skipping insertion in model container [2019-12-18 22:09:10,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:09:10" (1/1) ... [2019-12-18 22:09:10,708 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:09:10,762 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:09:11,308 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:09:11,323 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:09:11,397 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:09:11,469 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:09:11,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:09:11 WrapperNode [2019-12-18 22:09:11,470 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:09:11,471 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:09:11,471 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:09:11,471 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:09:11,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:09:11" (1/1) ... [2019-12-18 22:09:11,515 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:09:11" (1/1) ... [2019-12-18 22:09:11,554 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:09:11,555 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:09:11,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:09:11,555 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:09:11,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:09:11" (1/1) ... [2019-12-18 22:09:11,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:09:11" (1/1) ... [2019-12-18 22:09:11,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:09:11" (1/1) ... [2019-12-18 22:09:11,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:09:11" (1/1) ... [2019-12-18 22:09:11,583 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:09:11" (1/1) ... [2019-12-18 22:09:11,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:09:11" (1/1) ... [2019-12-18 22:09:11,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:09:11" (1/1) ... [2019-12-18 22:09:11,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:09:11,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:09:11,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:09:11,598 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:09:11,598 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:09:11" (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 22:09:11,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:09:11,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:09:11,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:09:11,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:09:11,657 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:09:11,658 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:09:11,658 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:09:11,658 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:09:11,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:09:11,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:09:11,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:09:11,661 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 22:09:12,470 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:09:12,471 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:09:12,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:09:12 BoogieIcfgContainer [2019-12-18 22:09:12,472 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:09:12,473 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:09:12,473 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:09:12,476 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:09:12,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:09:10" (1/3) ... [2019-12-18 22:09:12,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac5900a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:09:12, skipping insertion in model container [2019-12-18 22:09:12,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:09:11" (2/3) ... [2019-12-18 22:09:12,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac5900a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:09:12, skipping insertion in model container [2019-12-18 22:09:12,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:09:12" (3/3) ... [2019-12-18 22:09:12,480 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi008_rmo.opt.i [2019-12-18 22:09:12,491 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:09:12,491 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:09:12,499 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:09:12,500 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:09:12,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,557 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,558 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,591 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,591 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,592 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,592 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,592 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,640 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,641 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,657 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,659 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,661 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:09:12,679 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 22:09:12,700 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:09:12,701 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:09:12,701 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:09:12,701 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:09:12,701 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:09:12,701 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:09:12,701 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:09:12,701 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:09:12,716 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 228 transitions [2019-12-18 22:09:12,717 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-18 22:09:12,809 INFO L126 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-18 22:09:12,810 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:09:12,830 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 551 event pairs. 6/174 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-18 22:09:12,862 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-18 22:09:12,952 INFO L126 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-18 22:09:12,952 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:09:12,965 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 551 event pairs. 6/174 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-18 22:09:12,988 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-18 22:09:12,989 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:09:16,010 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 22:09:16,401 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 22:09:16,517 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 22:09:16,548 INFO L206 etLargeBlockEncoding]: Checked pairs total: 149863 [2019-12-18 22:09:16,549 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-18 22:09:16,552 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 108 places, 133 transitions [2019-12-18 22:09:18,148 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27271 states. [2019-12-18 22:09:18,150 INFO L276 IsEmpty]: Start isEmpty. Operand 27271 states. [2019-12-18 22:09:18,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 22:09:18,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:18,156 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 22:09:18,157 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:18,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:18,162 INFO L82 PathProgramCache]: Analyzing trace with hash 955890454, now seen corresponding path program 1 times [2019-12-18 22:09:18,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:18,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969361439] [2019-12-18 22:09:18,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:09:18,514 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 22:09:18,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969361439] [2019-12-18 22:09:18,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:09:18,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:09:18,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071456090] [2019-12-18 22:09:18,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:09:18,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:09:18,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:09:18,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:09:18,537 INFO L87 Difference]: Start difference. First operand 27271 states. Second operand 3 states. [2019-12-18 22:09:19,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:09:19,208 INFO L93 Difference]: Finished difference Result 26946 states and 96635 transitions. [2019-12-18 22:09:19,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:09:19,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 22:09:19,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:09:19,435 INFO L225 Difference]: With dead ends: 26946 [2019-12-18 22:09:19,436 INFO L226 Difference]: Without dead ends: 25207 [2019-12-18 22:09:19,437 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 22:09:20,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25207 states. [2019-12-18 22:09:21,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25207 to 25207. [2019-12-18 22:09:21,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25207 states. [2019-12-18 22:09:21,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25207 states to 25207 states and 90336 transitions. [2019-12-18 22:09:21,728 INFO L78 Accepts]: Start accepts. Automaton has 25207 states and 90336 transitions. Word has length 5 [2019-12-18 22:09:21,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:09:21,729 INFO L462 AbstractCegarLoop]: Abstraction has 25207 states and 90336 transitions. [2019-12-18 22:09:21,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:09:21,729 INFO L276 IsEmpty]: Start isEmpty. Operand 25207 states and 90336 transitions. [2019-12-18 22:09:21,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:09:21,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:21,733 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:09:21,733 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:21,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:21,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1479335670, now seen corresponding path program 1 times [2019-12-18 22:09:21,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:21,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013537519] [2019-12-18 22:09:21,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:09:21,846 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 22:09:21,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013537519] [2019-12-18 22:09:21,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:09:21,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:09:21,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966431624] [2019-12-18 22:09:21,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:09:21,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:09:21,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:09:21,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:09:21,849 INFO L87 Difference]: Start difference. First operand 25207 states and 90336 transitions. Second operand 4 states. [2019-12-18 22:09:22,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:09:22,636 INFO L93 Difference]: Finished difference Result 38966 states and 133479 transitions. [2019-12-18 22:09:22,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:09:22,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:09:22,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:09:23,972 INFO L225 Difference]: With dead ends: 38966 [2019-12-18 22:09:23,973 INFO L226 Difference]: Without dead ends: 38948 [2019-12-18 22:09:23,975 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 22:09:24,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38948 states. [2019-12-18 22:09:25,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38948 to 37967. [2019-12-18 22:09:25,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37967 states. [2019-12-18 22:09:25,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37967 states to 37967 states and 130916 transitions. [2019-12-18 22:09:25,545 INFO L78 Accepts]: Start accepts. Automaton has 37967 states and 130916 transitions. Word has length 11 [2019-12-18 22:09:25,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:09:25,545 INFO L462 AbstractCegarLoop]: Abstraction has 37967 states and 130916 transitions. [2019-12-18 22:09:25,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:09:25,546 INFO L276 IsEmpty]: Start isEmpty. Operand 37967 states and 130916 transitions. [2019-12-18 22:09:25,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:09:25,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:25,554 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:09:25,555 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:25,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:25,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1793441041, now seen corresponding path program 1 times [2019-12-18 22:09:25,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:25,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644587482] [2019-12-18 22:09:25,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:09:25,657 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 22:09:25,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644587482] [2019-12-18 22:09:25,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:09:25,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:09:25,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646661205] [2019-12-18 22:09:25,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:09:25,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:09:25,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:09:25,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:09:25,660 INFO L87 Difference]: Start difference. First operand 37967 states and 130916 transitions. Second operand 4 states. [2019-12-18 22:09:26,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:09:26,415 INFO L93 Difference]: Finished difference Result 48754 states and 165257 transitions. [2019-12-18 22:09:26,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:09:26,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 22:09:26,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:09:26,717 INFO L225 Difference]: With dead ends: 48754 [2019-12-18 22:09:26,718 INFO L226 Difference]: Without dead ends: 48739 [2019-12-18 22:09:26,718 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 22:09:27,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48739 states. [2019-12-18 22:09:28,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48739 to 43861. [2019-12-18 22:09:28,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43861 states. [2019-12-18 22:09:30,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43861 states to 43861 states and 150189 transitions. [2019-12-18 22:09:30,838 INFO L78 Accepts]: Start accepts. Automaton has 43861 states and 150189 transitions. Word has length 14 [2019-12-18 22:09:30,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:09:30,839 INFO L462 AbstractCegarLoop]: Abstraction has 43861 states and 150189 transitions. [2019-12-18 22:09:30,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:09:30,839 INFO L276 IsEmpty]: Start isEmpty. Operand 43861 states and 150189 transitions. [2019-12-18 22:09:30,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 22:09:30,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:30,848 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:09:30,849 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:30,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:30,849 INFO L82 PathProgramCache]: Analyzing trace with hash 237931436, now seen corresponding path program 1 times [2019-12-18 22:09:30,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:30,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599792044] [2019-12-18 22:09:30,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:09:30,895 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 22:09:30,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599792044] [2019-12-18 22:09:30,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:09:30,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:09:30,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876500132] [2019-12-18 22:09:30,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:09:30,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:09:30,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:09:30,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:09:30,901 INFO L87 Difference]: Start difference. First operand 43861 states and 150189 transitions. Second operand 3 states. [2019-12-18 22:09:31,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:09:31,226 INFO L93 Difference]: Finished difference Result 71282 states and 233582 transitions. [2019-12-18 22:09:31,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:09:31,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 22:09:31,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:09:31,419 INFO L225 Difference]: With dead ends: 71282 [2019-12-18 22:09:31,420 INFO L226 Difference]: Without dead ends: 71282 [2019-12-18 22:09:31,420 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 22:09:32,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71282 states. [2019-12-18 22:09:33,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71282 to 63620. [2019-12-18 22:09:33,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63620 states. [2019-12-18 22:09:33,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63620 states to 63620 states and 211773 transitions. [2019-12-18 22:09:33,557 INFO L78 Accepts]: Start accepts. Automaton has 63620 states and 211773 transitions. Word has length 15 [2019-12-18 22:09:33,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:09:33,557 INFO L462 AbstractCegarLoop]: Abstraction has 63620 states and 211773 transitions. [2019-12-18 22:09:33,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:09:33,557 INFO L276 IsEmpty]: Start isEmpty. Operand 63620 states and 211773 transitions. [2019-12-18 22:09:33,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 22:09:33,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:33,563 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:09:33,563 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:33,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:33,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1616735725, now seen corresponding path program 1 times [2019-12-18 22:09:33,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:33,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114860157] [2019-12-18 22:09:33,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:09:33,607 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 22:09:33,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114860157] [2019-12-18 22:09:33,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:09:33,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:09:33,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814829809] [2019-12-18 22:09:33,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:09:33,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:09:33,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:09:33,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:09:33,609 INFO L87 Difference]: Start difference. First operand 63620 states and 211773 transitions. Second operand 3 states. [2019-12-18 22:09:33,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:09:33,823 INFO L93 Difference]: Finished difference Result 63517 states and 211446 transitions. [2019-12-18 22:09:33,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:09:33,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 22:09:33,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:09:33,943 INFO L225 Difference]: With dead ends: 63517 [2019-12-18 22:09:33,944 INFO L226 Difference]: Without dead ends: 63517 [2019-12-18 22:09:33,944 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 22:09:36,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63517 states. [2019-12-18 22:09:37,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63517 to 63517. [2019-12-18 22:09:37,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63517 states. [2019-12-18 22:09:37,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63517 states to 63517 states and 211446 transitions. [2019-12-18 22:09:37,753 INFO L78 Accepts]: Start accepts. Automaton has 63517 states and 211446 transitions. Word has length 16 [2019-12-18 22:09:37,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:09:37,753 INFO L462 AbstractCegarLoop]: Abstraction has 63517 states and 211446 transitions. [2019-12-18 22:09:37,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:09:37,754 INFO L276 IsEmpty]: Start isEmpty. Operand 63517 states and 211446 transitions. [2019-12-18 22:09:37,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 22:09:37,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:37,764 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 22:09:37,765 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:37,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:37,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1032158122, now seen corresponding path program 1 times [2019-12-18 22:09:37,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:37,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665965860] [2019-12-18 22:09:37,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:37,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:09:37,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:09:37,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665965860] [2019-12-18 22:09:37,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:09:37,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:09:37,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376020558] [2019-12-18 22:09:37,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:09:37,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:09:37,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:09:37,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:09:37,833 INFO L87 Difference]: Start difference. First operand 63517 states and 211446 transitions. Second operand 4 states. [2019-12-18 22:09:38,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:09:38,432 INFO L93 Difference]: Finished difference Result 77880 states and 255480 transitions. [2019-12-18 22:09:38,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:09:38,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 22:09:38,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:09:38,594 INFO L225 Difference]: With dead ends: 77880 [2019-12-18 22:09:38,594 INFO L226 Difference]: Without dead ends: 77863 [2019-12-18 22:09:38,594 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 22:09:39,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77863 states. [2019-12-18 22:09:40,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77863 to 64071. [2019-12-18 22:09:40,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64071 states. [2019-12-18 22:09:43,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64071 states to 64071 states and 213322 transitions. [2019-12-18 22:09:43,631 INFO L78 Accepts]: Start accepts. Automaton has 64071 states and 213322 transitions. Word has length 17 [2019-12-18 22:09:43,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:09:43,632 INFO L462 AbstractCegarLoop]: Abstraction has 64071 states and 213322 transitions. [2019-12-18 22:09:43,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:09:43,632 INFO L276 IsEmpty]: Start isEmpty. Operand 64071 states and 213322 transitions. [2019-12-18 22:09:43,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 22:09:43,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:43,640 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 22:09:43,640 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:43,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:43,640 INFO L82 PathProgramCache]: Analyzing trace with hash 274413131, now seen corresponding path program 1 times [2019-12-18 22:09:43,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:43,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259892647] [2019-12-18 22:09:43,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:09:43,675 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 22:09:43,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259892647] [2019-12-18 22:09:43,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:09:43,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:09:43,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035043082] [2019-12-18 22:09:43,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:09:43,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:09:43,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:09:43,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:09:43,677 INFO L87 Difference]: Start difference. First operand 64071 states and 213322 transitions. Second operand 3 states. [2019-12-18 22:09:43,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:09:43,917 INFO L93 Difference]: Finished difference Result 60500 states and 201181 transitions. [2019-12-18 22:09:43,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:09:43,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-18 22:09:43,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:09:44,032 INFO L225 Difference]: With dead ends: 60500 [2019-12-18 22:09:44,032 INFO L226 Difference]: Without dead ends: 60374 [2019-12-18 22:09:44,033 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 22:09:44,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60374 states. [2019-12-18 22:09:45,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60374 to 60374. [2019-12-18 22:09:45,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60374 states. [2019-12-18 22:09:45,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60374 states to 60374 states and 200794 transitions. [2019-12-18 22:09:45,618 INFO L78 Accepts]: Start accepts. Automaton has 60374 states and 200794 transitions. Word has length 17 [2019-12-18 22:09:45,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:09:45,618 INFO L462 AbstractCegarLoop]: Abstraction has 60374 states and 200794 transitions. [2019-12-18 22:09:45,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:09:45,619 INFO L276 IsEmpty]: Start isEmpty. Operand 60374 states and 200794 transitions. [2019-12-18 22:09:45,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 22:09:45,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:45,631 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:09:45,631 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:45,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:45,631 INFO L82 PathProgramCache]: Analyzing trace with hash 363158557, now seen corresponding path program 1 times [2019-12-18 22:09:45,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:45,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931619123] [2019-12-18 22:09:45,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:09:45,703 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 22:09:45,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931619123] [2019-12-18 22:09:45,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:09:45,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:09:45,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75912859] [2019-12-18 22:09:45,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:09:45,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:09:45,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:09:45,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:09:45,706 INFO L87 Difference]: Start difference. First operand 60374 states and 200794 transitions. Second operand 5 states. [2019-12-18 22:09:46,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:09:46,643 INFO L93 Difference]: Finished difference Result 84981 states and 275357 transitions. [2019-12-18 22:09:46,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:09:46,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-18 22:09:46,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:09:46,805 INFO L225 Difference]: With dead ends: 84981 [2019-12-18 22:09:46,806 INFO L226 Difference]: Without dead ends: 84967 [2019-12-18 22:09:46,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:09:48,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84967 states. [2019-12-18 22:09:48,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84967 to 65930. [2019-12-18 22:09:48,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65930 states. [2019-12-18 22:09:51,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65930 states to 65930 states and 218108 transitions. [2019-12-18 22:09:51,760 INFO L78 Accepts]: Start accepts. Automaton has 65930 states and 218108 transitions. Word has length 20 [2019-12-18 22:09:51,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:09:51,760 INFO L462 AbstractCegarLoop]: Abstraction has 65930 states and 218108 transitions. [2019-12-18 22:09:51,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:09:51,761 INFO L276 IsEmpty]: Start isEmpty. Operand 65930 states and 218108 transitions. [2019-12-18 22:09:51,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 22:09:51,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:51,782 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 22:09:51,782 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:51,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:51,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1131596126, now seen corresponding path program 1 times [2019-12-18 22:09:51,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:51,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225573480] [2019-12-18 22:09:51,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:09:51,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:09:51,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225573480] [2019-12-18 22:09:51,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:09:51,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:09:51,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449265577] [2019-12-18 22:09:51,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:09:51,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:09:51,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:09:51,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:09:51,852 INFO L87 Difference]: Start difference. First operand 65930 states and 218108 transitions. Second operand 5 states. [2019-12-18 22:09:52,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:09:52,760 INFO L93 Difference]: Finished difference Result 89060 states and 288103 transitions. [2019-12-18 22:09:52,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:09:52,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-18 22:09:52,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:09:52,932 INFO L225 Difference]: With dead ends: 89060 [2019-12-18 22:09:52,933 INFO L226 Difference]: Without dead ends: 89032 [2019-12-18 22:09:52,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:09:53,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89032 states. [2019-12-18 22:09:54,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89032 to 61456. [2019-12-18 22:09:54,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61456 states. [2019-12-18 22:09:54,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61456 states to 61456 states and 203832 transitions. [2019-12-18 22:09:54,920 INFO L78 Accepts]: Start accepts. Automaton has 61456 states and 203832 transitions. Word has length 23 [2019-12-18 22:09:54,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:09:54,921 INFO L462 AbstractCegarLoop]: Abstraction has 61456 states and 203832 transitions. [2019-12-18 22:09:54,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:09:54,921 INFO L276 IsEmpty]: Start isEmpty. Operand 61456 states and 203832 transitions. [2019-12-18 22:09:54,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 22:09:54,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:54,976 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:09:54,976 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:54,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:54,977 INFO L82 PathProgramCache]: Analyzing trace with hash -936804425, now seen corresponding path program 1 times [2019-12-18 22:09:54,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:54,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286652485] [2019-12-18 22:09:54,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:09:55,032 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 22:09:55,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286652485] [2019-12-18 22:09:55,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:09:55,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:09:55,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070314514] [2019-12-18 22:09:55,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:09:55,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:09:55,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:09:55,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:09:55,034 INFO L87 Difference]: Start difference. First operand 61456 states and 203832 transitions. Second operand 3 states. [2019-12-18 22:09:55,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:09:55,251 INFO L93 Difference]: Finished difference Result 57816 states and 188658 transitions. [2019-12-18 22:09:55,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:09:55,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-18 22:09:55,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:09:55,359 INFO L225 Difference]: With dead ends: 57816 [2019-12-18 22:09:55,359 INFO L226 Difference]: Without dead ends: 57816 [2019-12-18 22:09:55,360 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 22:09:55,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57816 states. [2019-12-18 22:09:56,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57816 to 57580. [2019-12-18 22:09:56,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57580 states. [2019-12-18 22:09:57,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57580 states to 57580 states and 187992 transitions. [2019-12-18 22:09:57,116 INFO L78 Accepts]: Start accepts. Automaton has 57580 states and 187992 transitions. Word has length 31 [2019-12-18 22:09:57,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:09:57,116 INFO L462 AbstractCegarLoop]: Abstraction has 57580 states and 187992 transitions. [2019-12-18 22:09:57,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:09:57,116 INFO L276 IsEmpty]: Start isEmpty. Operand 57580 states and 187992 transitions. [2019-12-18 22:09:57,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 22:09:57,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:57,161 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] [2019-12-18 22:09:57,161 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:57,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:57,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1732188204, now seen corresponding path program 1 times [2019-12-18 22:09:57,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:57,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845437314] [2019-12-18 22:09:57,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:09:57,283 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 22:09:57,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845437314] [2019-12-18 22:09:57,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:09:57,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:09:57,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609606449] [2019-12-18 22:09:57,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:09:57,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:09:57,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:09:57,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:09:57,285 INFO L87 Difference]: Start difference. First operand 57580 states and 187992 transitions. Second operand 10 states. [2019-12-18 22:10:00,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:10:00,017 INFO L93 Difference]: Finished difference Result 142970 states and 467161 transitions. [2019-12-18 22:10:00,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 22:10:00,017 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-12-18 22:10:00,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:10:00,258 INFO L225 Difference]: With dead ends: 142970 [2019-12-18 22:10:00,258 INFO L226 Difference]: Without dead ends: 117958 [2019-12-18 22:10:00,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2019-12-18 22:10:01,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117958 states. [2019-12-18 22:10:02,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117958 to 92250. [2019-12-18 22:10:02,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92250 states. [2019-12-18 22:10:02,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92250 states to 92250 states and 304217 transitions. [2019-12-18 22:10:02,962 INFO L78 Accepts]: Start accepts. Automaton has 92250 states and 304217 transitions. Word has length 32 [2019-12-18 22:10:02,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:10:02,962 INFO L462 AbstractCegarLoop]: Abstraction has 92250 states and 304217 transitions. [2019-12-18 22:10:02,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:10:02,962 INFO L276 IsEmpty]: Start isEmpty. Operand 92250 states and 304217 transitions. [2019-12-18 22:10:03,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 22:10:03,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:10:03,061 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] [2019-12-18 22:10:03,061 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:10:03,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:10:03,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1881248646, now seen corresponding path program 2 times [2019-12-18 22:10:03,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:10:03,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413466019] [2019-12-18 22:10:03,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:10:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:10:03,188 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 22:10:03,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413466019] [2019-12-18 22:10:03,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:10:03,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:10:03,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354202747] [2019-12-18 22:10:03,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:10:03,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:10:03,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:10:03,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:10:03,191 INFO L87 Difference]: Start difference. First operand 92250 states and 304217 transitions. Second operand 10 states. [2019-12-18 22:10:06,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:10:06,121 INFO L93 Difference]: Finished difference Result 152274 states and 500249 transitions. [2019-12-18 22:10:06,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 22:10:06,121 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-12-18 22:10:06,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:10:06,410 INFO L225 Difference]: With dead ends: 152274 [2019-12-18 22:10:06,410 INFO L226 Difference]: Without dead ends: 137496 [2019-12-18 22:10:06,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=482, Unknown=0, NotChecked=0, Total=650 [2019-12-18 22:10:07,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137496 states. [2019-12-18 22:10:09,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137496 to 93446. [2019-12-18 22:10:09,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93446 states. [2019-12-18 22:10:09,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93446 states to 93446 states and 307728 transitions. [2019-12-18 22:10:09,525 INFO L78 Accepts]: Start accepts. Automaton has 93446 states and 307728 transitions. Word has length 32 [2019-12-18 22:10:09,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:10:09,525 INFO L462 AbstractCegarLoop]: Abstraction has 93446 states and 307728 transitions. [2019-12-18 22:10:09,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:10:09,525 INFO L276 IsEmpty]: Start isEmpty. Operand 93446 states and 307728 transitions. [2019-12-18 22:10:09,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 22:10:09,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:10:09,610 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] [2019-12-18 22:10:09,610 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:10:09,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:10:09,610 INFO L82 PathProgramCache]: Analyzing trace with hash 597590804, now seen corresponding path program 3 times [2019-12-18 22:10:09,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:10:09,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097760257] [2019-12-18 22:10:09,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:10:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:10:09,693 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 22:10:09,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097760257] [2019-12-18 22:10:09,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:10:09,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:10:09,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384249130] [2019-12-18 22:10:09,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:10:09,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:10:09,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:10:09,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:10:09,695 INFO L87 Difference]: Start difference. First operand 93446 states and 307728 transitions. Second operand 7 states. [2019-12-18 22:10:11,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:10:11,253 INFO L93 Difference]: Finished difference Result 166163 states and 550261 transitions. [2019-12-18 22:10:11,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 22:10:11,254 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-12-18 22:10:11,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:10:11,580 INFO L225 Difference]: With dead ends: 166163 [2019-12-18 22:10:11,580 INFO L226 Difference]: Without dead ends: 158223 [2019-12-18 22:10:11,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-12-18 22:10:13,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158223 states. [2019-12-18 22:10:15,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158223 to 93476. [2019-12-18 22:10:15,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93476 states. [2019-12-18 22:10:15,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93476 states to 93476 states and 307847 transitions. [2019-12-18 22:10:15,785 INFO L78 Accepts]: Start accepts. Automaton has 93476 states and 307847 transitions. Word has length 32 [2019-12-18 22:10:15,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:10:15,785 INFO L462 AbstractCegarLoop]: Abstraction has 93476 states and 307847 transitions. [2019-12-18 22:10:15,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:10:15,786 INFO L276 IsEmpty]: Start isEmpty. Operand 93476 states and 307847 transitions. [2019-12-18 22:10:15,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 22:10:15,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:10:15,868 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:10:15,868 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:10:15,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:10:15,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1306987540, now seen corresponding path program 4 times [2019-12-18 22:10:15,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:10:15,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969281879] [2019-12-18 22:10:15,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:10:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:10:16,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:10:16,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969281879] [2019-12-18 22:10:16,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:10:16,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:10:16,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501214413] [2019-12-18 22:10:16,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:10:16,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:10:16,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:10:16,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:10:16,053 INFO L87 Difference]: Start difference. First operand 93476 states and 307847 transitions. Second operand 10 states. [2019-12-18 22:10:17,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:10:17,663 INFO L93 Difference]: Finished difference Result 147466 states and 485559 transitions. [2019-12-18 22:10:17,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 22:10:17,663 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-12-18 22:10:17,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:10:17,968 INFO L225 Difference]: With dead ends: 147466 [2019-12-18 22:10:17,969 INFO L226 Difference]: Without dead ends: 140266 [2019-12-18 22:10:17,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2019-12-18 22:10:19,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140266 states. [2019-12-18 22:10:21,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140266 to 94193. [2019-12-18 22:10:21,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94193 states. [2019-12-18 22:10:21,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94193 states to 94193 states and 310106 transitions. [2019-12-18 22:10:21,253 INFO L78 Accepts]: Start accepts. Automaton has 94193 states and 310106 transitions. Word has length 32 [2019-12-18 22:10:21,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:10:21,253 INFO L462 AbstractCegarLoop]: Abstraction has 94193 states and 310106 transitions. [2019-12-18 22:10:21,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:10:21,253 INFO L276 IsEmpty]: Start isEmpty. Operand 94193 states and 310106 transitions. [2019-12-18 22:10:24,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 22:10:24,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:10:24,853 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] [2019-12-18 22:10:24,853 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:10:24,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:10:24,854 INFO L82 PathProgramCache]: Analyzing trace with hash -790939130, now seen corresponding path program 5 times [2019-12-18 22:10:24,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:10:24,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708081271] [2019-12-18 22:10:24,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:10:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:10:24,962 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 22:10:24,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708081271] [2019-12-18 22:10:24,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:10:24,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:10:24,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904275563] [2019-12-18 22:10:24,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:10:24,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:10:24,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:10:24,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:10:24,964 INFO L87 Difference]: Start difference. First operand 94193 states and 310106 transitions. Second operand 7 states. [2019-12-18 22:10:26,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:10:26,451 INFO L93 Difference]: Finished difference Result 151275 states and 500126 transitions. [2019-12-18 22:10:26,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 22:10:26,451 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-12-18 22:10:26,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:10:26,746 INFO L225 Difference]: With dead ends: 151275 [2019-12-18 22:10:26,746 INFO L226 Difference]: Without dead ends: 144255 [2019-12-18 22:10:26,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-12-18 22:10:27,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144255 states. [2019-12-18 22:10:29,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144255 to 93887. [2019-12-18 22:10:29,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93887 states. [2019-12-18 22:10:29,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93887 states to 93887 states and 309033 transitions. [2019-12-18 22:10:29,616 INFO L78 Accepts]: Start accepts. Automaton has 93887 states and 309033 transitions. Word has length 32 [2019-12-18 22:10:29,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:10:29,616 INFO L462 AbstractCegarLoop]: Abstraction has 93887 states and 309033 transitions. [2019-12-18 22:10:29,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:10:29,616 INFO L276 IsEmpty]: Start isEmpty. Operand 93887 states and 309033 transitions. [2019-12-18 22:10:29,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 22:10:29,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:10:29,705 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:10:29,705 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:10:29,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:10:29,705 INFO L82 PathProgramCache]: Analyzing trace with hash 4490691, now seen corresponding path program 1 times [2019-12-18 22:10:29,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:10:29,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011441620] [2019-12-18 22:10:29,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:10:29,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:10:29,766 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 22:10:29,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011441620] [2019-12-18 22:10:29,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:10:29,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:10:29,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443043341] [2019-12-18 22:10:29,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:10:29,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:10:29,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:10:29,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:10:29,768 INFO L87 Difference]: Start difference. First operand 93887 states and 309033 transitions. Second operand 4 states. [2019-12-18 22:10:29,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:10:29,844 INFO L93 Difference]: Finished difference Result 13178 states and 36455 transitions. [2019-12-18 22:10:29,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:10:29,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-18 22:10:29,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:10:29,857 INFO L225 Difference]: With dead ends: 13178 [2019-12-18 22:10:29,857 INFO L226 Difference]: Without dead ends: 7848 [2019-12-18 22:10:29,857 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 22:10:29,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7848 states. [2019-12-18 22:10:29,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7848 to 7609. [2019-12-18 22:10:29,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7609 states. [2019-12-18 22:10:29,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7609 states to 7609 states and 18012 transitions. [2019-12-18 22:10:29,939 INFO L78 Accepts]: Start accepts. Automaton has 7609 states and 18012 transitions. Word has length 33 [2019-12-18 22:10:29,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:10:29,939 INFO L462 AbstractCegarLoop]: Abstraction has 7609 states and 18012 transitions. [2019-12-18 22:10:29,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:10:29,939 INFO L276 IsEmpty]: Start isEmpty. Operand 7609 states and 18012 transitions. [2019-12-18 22:10:29,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 22:10:29,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:10:29,945 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] [2019-12-18 22:10:29,945 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:10:29,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:10:29,946 INFO L82 PathProgramCache]: Analyzing trace with hash 2021850497, now seen corresponding path program 1 times [2019-12-18 22:10:29,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:10:29,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109393683] [2019-12-18 22:10:29,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:10:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:10:29,997 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 22:10:29,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109393683] [2019-12-18 22:10:29,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:10:29,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:10:29,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890820164] [2019-12-18 22:10:29,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:10:29,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:10:29,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:10:29,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:10:29,999 INFO L87 Difference]: Start difference. First operand 7609 states and 18012 transitions. Second operand 4 states. [2019-12-18 22:10:30,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:10:30,037 INFO L93 Difference]: Finished difference Result 8621 states and 20290 transitions. [2019-12-18 22:10:30,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:10:30,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-18 22:10:30,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:10:30,047 INFO L225 Difference]: With dead ends: 8621 [2019-12-18 22:10:30,047 INFO L226 Difference]: Without dead ends: 6818 [2019-12-18 22:10:30,047 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 22:10:30,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6818 states. [2019-12-18 22:10:30,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6818 to 6798. [2019-12-18 22:10:30,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6798 states. [2019-12-18 22:10:30,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6798 states to 6798 states and 16073 transitions. [2019-12-18 22:10:30,213 INFO L78 Accepts]: Start accepts. Automaton has 6798 states and 16073 transitions. Word has length 44 [2019-12-18 22:10:30,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:10:30,213 INFO L462 AbstractCegarLoop]: Abstraction has 6798 states and 16073 transitions. [2019-12-18 22:10:30,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:10:30,213 INFO L276 IsEmpty]: Start isEmpty. Operand 6798 states and 16073 transitions. [2019-12-18 22:10:30,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 22:10:30,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:10:30,219 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] [2019-12-18 22:10:30,219 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:10:30,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:10:30,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1006962917, now seen corresponding path program 2 times [2019-12-18 22:10:30,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:10:30,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969474964] [2019-12-18 22:10:30,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:10:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:10:30,291 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 22:10:30,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969474964] [2019-12-18 22:10:30,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:10:30,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:10:30,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231142067] [2019-12-18 22:10:30,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:10:30,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:10:30,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:10:30,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:10:30,293 INFO L87 Difference]: Start difference. First operand 6798 states and 16073 transitions. Second operand 5 states. [2019-12-18 22:10:30,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:10:30,344 INFO L93 Difference]: Finished difference Result 4999 states and 12006 transitions. [2019-12-18 22:10:30,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:10:30,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-18 22:10:30,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:10:30,346 INFO L225 Difference]: With dead ends: 4999 [2019-12-18 22:10:30,346 INFO L226 Difference]: Without dead ends: 529 [2019-12-18 22:10:30,346 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 22:10:30,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-12-18 22:10:30,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2019-12-18 22:10:30,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-12-18 22:10:30,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1146 transitions. [2019-12-18 22:10:30,352 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1146 transitions. Word has length 44 [2019-12-18 22:10:30,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:10:30,352 INFO L462 AbstractCegarLoop]: Abstraction has 529 states and 1146 transitions. [2019-12-18 22:10:30,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:10:30,352 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1146 transitions. [2019-12-18 22:10:30,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 22:10:30,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:10:30,353 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] [2019-12-18 22:10:30,353 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:10:30,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:10:30,354 INFO L82 PathProgramCache]: Analyzing trace with hash -234128232, now seen corresponding path program 1 times [2019-12-18 22:10:30,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:10:30,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67703588] [2019-12-18 22:10:30,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:10:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:10:30,444 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 22:10:30,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67703588] [2019-12-18 22:10:30,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:10:30,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:10:30,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674106633] [2019-12-18 22:10:30,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 22:10:30,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:10:30,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 22:10:30,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:10:30,446 INFO L87 Difference]: Start difference. First operand 529 states and 1146 transitions. Second operand 8 states. [2019-12-18 22:10:30,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:10:30,695 INFO L93 Difference]: Finished difference Result 1082 states and 2315 transitions. [2019-12-18 22:10:30,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 22:10:30,696 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-12-18 22:10:30,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:10:30,697 INFO L225 Difference]: With dead ends: 1082 [2019-12-18 22:10:30,697 INFO L226 Difference]: Without dead ends: 759 [2019-12-18 22:10:30,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-18 22:10:30,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-12-18 22:10:30,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 605. [2019-12-18 22:10:30,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-18 22:10:30,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1277 transitions. [2019-12-18 22:10:30,711 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1277 transitions. Word has length 60 [2019-12-18 22:10:30,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:10:30,712 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1277 transitions. [2019-12-18 22:10:30,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 22:10:30,712 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1277 transitions. [2019-12-18 22:10:30,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 22:10:30,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:10:30,714 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] [2019-12-18 22:10:30,715 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:10:30,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:10:30,715 INFO L82 PathProgramCache]: Analyzing trace with hash 663982360, now seen corresponding path program 2 times [2019-12-18 22:10:30,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:10:30,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649563175] [2019-12-18 22:10:30,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:10:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:10:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:10:30,957 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:10:30,958 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:10:30,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_43| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= 0 v_~y$r_buff1_thd2~0_36) (= 0 v_~weak$$choice0~0_10) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1731~0.base_21|)) (= |v_#valid_41| (store .cse0 |v_ULTIMATE.start_main_~#t1731~0.base_21| 1)) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~__unbuffered_p1_EBX~0_17 0) (= 0 v_~__unbuffered_p1_EAX~0_18) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd1~0_53 0) (= v_~main$tmp_guard0~0_12 0) (= |v_#NULL.offset_3| 0) (= 0 v_~y$r_buff1_thd0~0_22) (= v_~y$mem_tmp~0_13 0) (= 0 v_~x~0_9) (= 0 v_~y$flush_delayed~0_18) (= v_~y$w_buff0_used~0_130 0) (= v_~y$r_buff0_thd2~0_75 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1731~0.base_21| 4)) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd0~0_23 0) (= v_~y~0_32 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1731~0.base_21|) (= 0 v_~weak$$choice2~0_35) (= 0 v_~y$w_buff1~0_32) (= 0 v_~__unbuffered_p0_EAX~0_16) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1731~0.base_21| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1731~0.base_21|) |v_ULTIMATE.start_main_~#t1731~0.offset_17| 0)) |v_#memory_int_15|) (= 0 |v_#NULL.base_3|) (= 0 |v_ULTIMATE.start_main_~#t1731~0.offset_17|) (= 0 v_~y$r_buff1_thd1~0_27) (= v_~y$w_buff1_used~0_64 0) (= v_~__unbuffered_p0_EBX~0_17 0) (= 0 v_~y$w_buff0~0_35) (= 0 v_~__unbuffered_cnt~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_130, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ULTIMATE.start_main_~#t1732~0.base=|v_ULTIMATE.start_main_~#t1732~0.base_18|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_7|, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_~#t1731~0.offset=|v_ULTIMATE.start_main_~#t1731~0.offset_17|, ULTIMATE.start_main_~#t1731~0.base=|v_ULTIMATE.start_main_~#t1731~0.base_21|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_27, ~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~y$flush_delayed~0=v_~y$flush_delayed~0_18, #length=|v_#length_17|, ~y~0=v_~y~0_32, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_17, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_13|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_12|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_24|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_36, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_10|, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_23, #valid=|v_#valid_41|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_75, #memory_int=|v_#memory_int_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ULTIMATE.start_main_~#t1732~0.offset=|v_ULTIMATE.start_main_~#t1732~0.offset_15|, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_22, ~x~0=v_~x~0_9, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_64} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t1732~0.base, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1731~0.offset, ULTIMATE.start_main_~#t1731~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1732~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 22:10:30,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L813-1-->L815: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1732~0.base_13| 4)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1732~0.base_13|) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1732~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t1732~0.base_13| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1732~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1732~0.base_13|) |v_ULTIMATE.start_main_~#t1732~0.offset_11| 1))) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1732~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t1732~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1732~0.base=|v_ULTIMATE.start_main_~#t1732~0.base_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1732~0.offset=|v_ULTIMATE.start_main_~#t1732~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1732~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1732~0.offset] because there is no mapped edge [2019-12-18 22:10:30,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [862] [862] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|) (= 1 v_~y$w_buff0_used~0_98) (= 1 v_~y$w_buff0~0_22) (= v_~y$w_buff1_used~0_53 v_~y$w_buff0_used~0_99) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| 1) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= v_~y$w_buff0~0_23 v_~y$w_buff1~0_24) (= (mod v_~y$w_buff1_used~0_53 256) 0)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff0~0=v_~y$w_buff0~0_23, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_24, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, ~y$w_buff0~0=v_~y$w_buff0~0_22, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_53} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 22:10:30,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L775-2-->L775-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1801877143 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1801877143 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff0~0_In1801877143 |P1Thread1of1ForFork1_#t~ite28_Out1801877143|)) (and (or .cse1 .cse0) (= ~y$w_buff1~0_In1801877143 |P1Thread1of1ForFork1_#t~ite28_Out1801877143|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1801877143, ~y$w_buff1~0=~y$w_buff1~0_In1801877143, ~y$w_buff0~0=~y$w_buff0~0_In1801877143, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1801877143} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1801877143, ~y$w_buff1~0=~y$w_buff1~0_In1801877143, ~y$w_buff0~0=~y$w_buff0~0_In1801877143, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1801877143, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1801877143|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 22:10:30,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L775-4-->L776: Formula: (= v_~y~0_22 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_7|, ~y~0=v_~y~0_22, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~y~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 22:10:30,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L780-->L781: Formula: (and (= v_~y$r_buff0_thd2~0_53 v_~y$r_buff0_thd2~0_52) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_52, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-18 22:10:30,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In583990 256) 0))) (or (and (= ~y$mem_tmp~0_In583990 |P1Thread1of1ForFork1_#t~ite48_Out583990|) (not .cse0)) (and (= ~y~0_In583990 |P1Thread1of1ForFork1_#t~ite48_Out583990|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In583990, ~y$flush_delayed~0=~y$flush_delayed~0_In583990, ~y~0=~y~0_In583990} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In583990, ~y$flush_delayed~0=~y$flush_delayed~0_In583990, ~y~0=~y~0_In583990, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out583990|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-18 22:10:30,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L791-->L791-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1507291772 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1507291772 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1507291772 |P1Thread1of1ForFork1_#t~ite51_Out-1507291772|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite51_Out-1507291772|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1507291772, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1507291772} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1507291772, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-1507291772|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1507291772} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-18 22:10:30,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L792-->L792-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-324624769 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-324624769 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-324624769 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-324624769 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite52_Out-324624769| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite52_Out-324624769| ~y$w_buff1_used~0_In-324624769) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-324624769, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-324624769, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-324624769, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-324624769} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-324624769, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-324624769, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out-324624769|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-324624769, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-324624769} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-18 22:10:30,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L793-->L794: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2074351168 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-2074351168 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_Out-2074351168 ~y$r_buff0_thd2~0_In-2074351168)) (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd2~0_Out-2074351168 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2074351168, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2074351168} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-2074351168|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2074351168, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-2074351168} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 22:10:30,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L794-->L794-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In761894182 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In761894182 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In761894182 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In761894182 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite54_Out761894182| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~y$r_buff1_thd2~0_In761894182 |P1Thread1of1ForFork1_#t~ite54_Out761894182|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In761894182, ~y$w_buff0_used~0=~y$w_buff0_used~0_In761894182, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In761894182, ~y$w_buff1_used~0=~y$w_buff1_used~0_In761894182} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In761894182, ~y$w_buff0_used~0=~y$w_buff0_used~0_In761894182, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In761894182, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out761894182|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In761894182} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-18 22:10:30,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~y$r_buff1_thd2~0_31 |v_P1Thread1of1ForFork1_#t~ite54_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_31, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 22:10:31,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L747-->L747-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In224892305 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite25_Out224892305| ~y~0_In224892305) .cse0) (and (= ~y$mem_tmp~0_In224892305 |P0Thread1of1ForFork0_#t~ite25_Out224892305|) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In224892305, ~y$flush_delayed~0=~y$flush_delayed~0_In224892305, ~y~0=~y~0_In224892305} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In224892305, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out224892305|, ~y$flush_delayed~0=~y$flush_delayed~0_In224892305, ~y~0=~y~0_In224892305} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-18 22:10:31,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L747-2-->P0EXIT: Formula: (and (= 0 v_~y$flush_delayed~0_12) (= v_~y~0_26 |v_P0Thread1of1ForFork0_#t~ite25_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_7|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~y~0=v_~y~0_26} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-18 22:10:31,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L819-->L821-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= 0 (mod v_~y$r_buff0_thd0~0_16 256)) (= (mod v_~y$w_buff0_used~0_106 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 22:10:31,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L821-2-->L821-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1095843752 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1095843752 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite57_Out-1095843752| ~y~0_In-1095843752) (or .cse0 .cse1)) (and (= ~y$w_buff1~0_In-1095843752 |ULTIMATE.start_main_#t~ite57_Out-1095843752|) (not .cse1) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1095843752, ~y~0=~y~0_In-1095843752, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1095843752, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1095843752} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1095843752, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-1095843752|, ~y~0=~y~0_In-1095843752, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1095843752, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1095843752} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-18 22:10:31,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-4-->L822: Formula: (= v_~y~0_19 |v_ULTIMATE.start_main_#t~ite57_7|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_7|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_6|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_6|, ~y~0=v_~y~0_19} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~y~0] because there is no mapped edge [2019-12-18 22:10:31,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In152847582 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In152847582 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite59_Out152847582|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In152847582 |ULTIMATE.start_main_#t~ite59_Out152847582|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In152847582, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In152847582} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In152847582, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In152847582, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out152847582|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-18 22:10:31,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [935] [935] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In65339664 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In65339664 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In65339664 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In65339664 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite60_Out65339664|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In65339664 |ULTIMATE.start_main_#t~ite60_Out65339664|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In65339664, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In65339664, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In65339664, ~y$w_buff1_used~0=~y$w_buff1_used~0_In65339664} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out65339664|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In65339664, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In65339664, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In65339664, ~y$w_buff1_used~0=~y$w_buff1_used~0_In65339664} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-18 22:10:31,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2006814066 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-2006814066 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out-2006814066| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-2006814066| ~y$r_buff0_thd0~0_In-2006814066)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2006814066, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2006814066} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-2006814066|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2006814066, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2006814066} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-18 22:10:31,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L825-->L825-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In735170569 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In735170569 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In735170569 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In735170569 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out735170569| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In735170569 |ULTIMATE.start_main_#t~ite62_Out735170569|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In735170569, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In735170569, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In735170569, ~y$w_buff1_used~0=~y$w_buff1_used~0_In735170569} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out735170569|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In735170569, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In735170569, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In735170569, ~y$w_buff1_used~0=~y$w_buff1_used~0_In735170569} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-18 22:10:31,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L825-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EBX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite62_13| v_~y$r_buff1_thd0~0_14) (= 1 v_~__unbuffered_p1_EAX~0_10) (= v_~__unbuffered_p0_EAX~0_8 1) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 0 v_~__unbuffered_p1_EBX~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_13|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_12|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_14, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:10:31,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:10:31 BasicIcfg [2019-12-18 22:10:31,162 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:10:31,166 INFO L168 Benchmark]: Toolchain (without parser) took 80473.14 ms. Allocated memory was 147.8 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 104.2 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 843.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:10:31,167 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 147.8 MB. Free memory was 124.2 MB in the beginning and 124.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 22:10:31,168 INFO L168 Benchmark]: CACSL2BoogieTranslator took 777.80 ms. Allocated memory was 147.8 MB in the beginning and 204.5 MB in the end (delta: 56.6 MB). Free memory was 103.7 MB in the beginning and 157.8 MB in the end (delta: -54.0 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:10:31,171 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.80 ms. Allocated memory is still 204.5 MB. Free memory was 157.8 MB in the beginning and 154.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2019-12-18 22:10:31,173 INFO L168 Benchmark]: Boogie Preprocessor took 41.90 ms. Allocated memory is still 204.5 MB. Free memory was 154.7 MB in the beginning and 152.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-18 22:10:31,174 INFO L168 Benchmark]: RCFGBuilder took 874.74 ms. Allocated memory is still 204.5 MB. Free memory was 152.2 MB in the beginning and 99.5 MB in the end (delta: 52.7 MB). Peak memory consumption was 52.7 MB. Max. memory is 7.1 GB. [2019-12-18 22:10:31,174 INFO L168 Benchmark]: TraceAbstraction took 78689.46 ms. Allocated memory was 204.5 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 98.9 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 781.7 MB. Max. memory is 7.1 GB. [2019-12-18 22:10:31,185 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.21 ms. Allocated memory is still 147.8 MB. Free memory was 124.2 MB in the beginning and 124.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 777.80 ms. Allocated memory was 147.8 MB in the beginning and 204.5 MB in the end (delta: 56.6 MB). Free memory was 103.7 MB in the beginning and 157.8 MB in the end (delta: -54.0 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 83.80 ms. Allocated memory is still 204.5 MB. Free memory was 157.8 MB in the beginning and 154.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.90 ms. Allocated memory is still 204.5 MB. Free memory was 154.7 MB in the beginning and 152.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 874.74 ms. Allocated memory is still 204.5 MB. Free memory was 152.2 MB in the beginning and 99.5 MB in the end (delta: 52.7 MB). Peak memory consumption was 52.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 78689.46 ms. Allocated memory was 204.5 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 98.9 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 781.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 179 ProgramPointsBefore, 108 ProgramPointsAfterwards, 228 TransitionsBefore, 133 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 49 ConcurrentYvCompositions, 27 ChoiceCompositions, 8765 VarBasedMoverChecksPositive, 227 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 149863 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t1731, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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(&t1732, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 y$flush_delayed = weak$$choice2 [L774] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y$w_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)) [L777] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] 2 y$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)) [L778] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y$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)) [L779] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L779] 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)) [L781] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 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)) [L782] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] 2 y = y$flush_delayed ? y$mem_tmp : y [L784] 2 y$flush_delayed = (_Bool)0 [L787] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 x = 1 [L732] 1 __unbuffered_p0_EAX = x [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 y$flush_delayed = weak$$choice2 [L738] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L739] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L740] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L741] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L742] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L745] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 173 locations, 2 error locations. Result: UNSAFE, OverallTime: 78.2s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 20.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5144 SDtfs, 6972 SDslu, 12537 SDs, 0 SdLazy, 6493 SolverSat, 228 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94193occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 45.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 305521 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 570 NumberOfCodeBlocks, 570 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 491 ConstructedInterpolants, 0 QuantifiedInterpolants, 52773 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...