/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix001_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:04:16,277 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:04:16,281 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:04:16,299 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:04:16,299 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:04:16,301 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:04:16,303 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:04:16,312 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:04:16,316 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:04:16,319 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:04:16,321 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:04:16,323 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:04:16,323 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:04:16,325 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:04:16,328 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:04:16,329 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:04:16,331 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:04:16,331 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:04:16,333 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:04:16,337 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:04:16,342 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:04:16,346 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:04:16,347 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:04:16,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:04:16,350 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:04:16,350 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:04:16,350 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:04:16,353 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:04:16,354 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:04:16,355 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:04:16,356 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:04:16,357 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:04:16,358 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:04:16,359 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:04:16,361 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:04:16,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:04:16,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:04:16,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:04:16,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:04:16,363 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:04:16,364 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:04:16,365 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:04:16,398 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:04:16,398 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:04:16,399 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:04:16,400 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:04:16,400 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:04:16,400 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:04:16,400 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:04:16,400 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:04:16,406 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:04:16,406 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:04:16,406 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:04:16,406 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:04:16,407 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:04:16,407 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:04:16,407 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:04:16,407 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:04:16,407 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:04:16,408 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:04:16,408 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:04:16,408 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:04:16,408 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:04:16,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:04:16,412 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:04:16,412 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:04:16,412 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:04:16,413 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:04:16,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:04:16,413 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:04:16,413 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:04:16,413 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:04:16,732 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:04:16,753 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:04:16,756 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:04:16,757 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:04:16,757 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:04:16,758 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix001_tso.opt.i [2019-12-18 12:04:16,829 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f731ff83/0bb8c483039744a8aff6de55aaa9c2d0/FLAG8719e3457 [2019-12-18 12:04:17,374 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:04:17,374 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix001_tso.opt.i [2019-12-18 12:04:17,391 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f731ff83/0bb8c483039744a8aff6de55aaa9c2d0/FLAG8719e3457 [2019-12-18 12:04:17,665 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f731ff83/0bb8c483039744a8aff6de55aaa9c2d0 [2019-12-18 12:04:17,674 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:04:17,676 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:04:17,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:04:17,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:04:17,681 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:04:17,682 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:04:17" (1/1) ... [2019-12-18 12:04:17,685 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745d7f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:04:17, skipping insertion in model container [2019-12-18 12:04:17,686 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:04:17" (1/1) ... [2019-12-18 12:04:17,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:04:17,751 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:04:18,233 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:04:18,257 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:04:18,368 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:04:18,440 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:04:18,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:04:18 WrapperNode [2019-12-18 12:04:18,441 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:04:18,442 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:04:18,442 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:04:18,442 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:04:18,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:04:18" (1/1) ... [2019-12-18 12:04:18,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:04:18" (1/1) ... [2019-12-18 12:04:18,528 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:04:18,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:04:18,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:04:18,528 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:04:18,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:04:18" (1/1) ... [2019-12-18 12:04:18,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:04:18" (1/1) ... [2019-12-18 12:04:18,542 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:04:18" (1/1) ... [2019-12-18 12:04:18,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:04:18" (1/1) ... [2019-12-18 12:04:18,554 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:04:18" (1/1) ... [2019-12-18 12:04:18,559 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:04:18" (1/1) ... [2019-12-18 12:04:18,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:04:18" (1/1) ... [2019-12-18 12:04:18,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:04:18,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:04:18,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:04:18,569 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:04:18,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:04:18" (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 12:04:18,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:04:18,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:04:18,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:04:18,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:04:18,651 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:04:18,651 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:04:18,651 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:04:18,652 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:04:18,652 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:04:18,653 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:04:18,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:04:18,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:04:18,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:04:18,656 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 12:04:19,530 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:04:19,531 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:04:19,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:04:19 BoogieIcfgContainer [2019-12-18 12:04:19,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:04:19,534 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:04:19,534 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:04:19,538 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:04:19,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:04:17" (1/3) ... [2019-12-18 12:04:19,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156d5b14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:04:19, skipping insertion in model container [2019-12-18 12:04:19,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:04:18" (2/3) ... [2019-12-18 12:04:19,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156d5b14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:04:19, skipping insertion in model container [2019-12-18 12:04:19,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:04:19" (3/3) ... [2019-12-18 12:04:19,542 INFO L109 eAbstractionObserver]: Analyzing ICFG mix001_tso.opt.i [2019-12-18 12:04:19,552 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:04:19,553 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:04:19,561 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:04:19,562 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:04:19,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,630 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,630 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,634 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,634 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,655 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,655 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,656 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,656 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,656 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,684 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,684 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,686 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,693 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,693 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,699 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,701 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:04:19,722 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:04:19,740 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:04:19,740 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:04:19,740 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:04:19,740 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:04:19,741 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:04:19,741 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:04:19,741 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:04:19,741 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:04:19,766 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 243 transitions [2019-12-18 12:04:19,768 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-18 12:04:19,888 INFO L126 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-18 12:04:19,888 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:04:19,914 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 561 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-18 12:04:19,954 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-18 12:04:20,044 INFO L126 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-18 12:04:20,044 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:04:20,058 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 561 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-18 12:04:20,088 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-18 12:04:20,089 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:04:26,723 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 12:04:26,860 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 12:04:26,934 INFO L206 etLargeBlockEncoding]: Checked pairs total: 124432 [2019-12-18 12:04:26,934 INFO L214 etLargeBlockEncoding]: Total number of compositions: 127 [2019-12-18 12:04:26,938 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 108 places, 130 transitions [2019-12-18 12:04:30,677 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44886 states. [2019-12-18 12:04:30,679 INFO L276 IsEmpty]: Start isEmpty. Operand 44886 states. [2019-12-18 12:04:30,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 12:04:30,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:04:30,685 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:04:30,686 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:04:30,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:04:30,692 INFO L82 PathProgramCache]: Analyzing trace with hash -614729650, now seen corresponding path program 1 times [2019-12-18 12:04:30,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:04:30,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349492720] [2019-12-18 12:04:30,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:04:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:04:31,000 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 12:04:31,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349492720] [2019-12-18 12:04:31,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:04:31,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:04:31,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179960919] [2019-12-18 12:04:31,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:04:31,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:04:31,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:04:31,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:04:31,029 INFO L87 Difference]: Start difference. First operand 44886 states. Second operand 3 states. [2019-12-18 12:04:31,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:04:31,923 INFO L93 Difference]: Finished difference Result 44562 states and 182514 transitions. [2019-12-18 12:04:31,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:04:31,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 12:04:31,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:04:32,234 INFO L225 Difference]: With dead ends: 44562 [2019-12-18 12:04:32,234 INFO L226 Difference]: Without dead ends: 41502 [2019-12-18 12:04:32,236 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 12:04:34,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41502 states. [2019-12-18 12:04:35,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41502 to 41502. [2019-12-18 12:04:35,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41502 states. [2019-12-18 12:04:35,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41502 states to 41502 states and 169862 transitions. [2019-12-18 12:04:35,664 INFO L78 Accepts]: Start accepts. Automaton has 41502 states and 169862 transitions. Word has length 7 [2019-12-18 12:04:35,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:04:35,665 INFO L462 AbstractCegarLoop]: Abstraction has 41502 states and 169862 transitions. [2019-12-18 12:04:35,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:04:35,665 INFO L276 IsEmpty]: Start isEmpty. Operand 41502 states and 169862 transitions. [2019-12-18 12:04:35,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:04:35,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:04:35,671 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:04:35,672 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:04:35,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:04:35,672 INFO L82 PathProgramCache]: Analyzing trace with hash 652997656, now seen corresponding path program 1 times [2019-12-18 12:04:35,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:04:35,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402176637] [2019-12-18 12:04:35,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:04:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:04:35,789 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 12:04:35,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402176637] [2019-12-18 12:04:35,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:04:35,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:04:35,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797280414] [2019-12-18 12:04:35,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:04:35,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:04:35,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:04:35,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:04:35,793 INFO L87 Difference]: Start difference. First operand 41502 states and 169862 transitions. Second operand 4 states. [2019-12-18 12:04:38,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:04:38,482 INFO L93 Difference]: Finished difference Result 66122 states and 260012 transitions. [2019-12-18 12:04:38,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:04:38,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 12:04:38,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:04:38,762 INFO L225 Difference]: With dead ends: 66122 [2019-12-18 12:04:38,762 INFO L226 Difference]: Without dead ends: 66092 [2019-12-18 12:04:38,763 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 12:04:39,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66092 states. [2019-12-18 12:04:41,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66092 to 64446. [2019-12-18 12:04:41,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64446 states. [2019-12-18 12:04:41,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64446 states to 64446 states and 254822 transitions. [2019-12-18 12:04:41,633 INFO L78 Accepts]: Start accepts. Automaton has 64446 states and 254822 transitions. Word has length 13 [2019-12-18 12:04:41,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:04:41,633 INFO L462 AbstractCegarLoop]: Abstraction has 64446 states and 254822 transitions. [2019-12-18 12:04:41,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:04:41,633 INFO L276 IsEmpty]: Start isEmpty. Operand 64446 states and 254822 transitions. [2019-12-18 12:04:41,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:04:41,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:04:41,642 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:04:41,642 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:04:41,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:04:41,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1079576864, now seen corresponding path program 1 times [2019-12-18 12:04:41,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:04:41,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227351671] [2019-12-18 12:04:41,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:04:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:04:41,765 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 12:04:41,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227351671] [2019-12-18 12:04:41,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:04:41,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:04:41,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115672131] [2019-12-18 12:04:41,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:04:41,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:04:41,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:04:41,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:04:41,768 INFO L87 Difference]: Start difference. First operand 64446 states and 254822 transitions. Second operand 4 states. [2019-12-18 12:04:42,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:04:42,916 INFO L93 Difference]: Finished difference Result 82254 states and 320688 transitions. [2019-12-18 12:04:42,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:04:42,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:04:42,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:04:43,181 INFO L225 Difference]: With dead ends: 82254 [2019-12-18 12:04:43,182 INFO L226 Difference]: Without dead ends: 82226 [2019-12-18 12:04:43,182 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 12:04:46,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82226 states. [2019-12-18 12:04:48,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82226 to 73414. [2019-12-18 12:04:48,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73414 states. [2019-12-18 12:04:48,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73414 states to 73414 states and 288912 transitions. [2019-12-18 12:04:48,764 INFO L78 Accepts]: Start accepts. Automaton has 73414 states and 288912 transitions. Word has length 16 [2019-12-18 12:04:48,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:04:48,764 INFO L462 AbstractCegarLoop]: Abstraction has 73414 states and 288912 transitions. [2019-12-18 12:04:48,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:04:48,764 INFO L276 IsEmpty]: Start isEmpty. Operand 73414 states and 288912 transitions. [2019-12-18 12:04:48,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 12:04:48,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:04:48,776 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:04:48,776 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:04:48,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:04:48,777 INFO L82 PathProgramCache]: Analyzing trace with hash -624278653, now seen corresponding path program 1 times [2019-12-18 12:04:48,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:04:48,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948123171] [2019-12-18 12:04:48,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:04:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:04:48,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:04:48,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948123171] [2019-12-18 12:04:48,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:04:48,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:04:48,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265992593] [2019-12-18 12:04:48,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:04:48,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:04:48,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:04:48,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:04:48,839 INFO L87 Difference]: Start difference. First operand 73414 states and 288912 transitions. Second operand 3 states. [2019-12-18 12:04:49,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:04:49,155 INFO L93 Difference]: Finished difference Result 68874 states and 270636 transitions. [2019-12-18 12:04:49,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:04:49,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 12:04:49,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:04:49,325 INFO L225 Difference]: With dead ends: 68874 [2019-12-18 12:04:49,325 INFO L226 Difference]: Without dead ends: 68874 [2019-12-18 12:04:49,325 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 12:04:50,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68874 states. [2019-12-18 12:04:52,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68874 to 68874. [2019-12-18 12:04:52,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68874 states. [2019-12-18 12:04:52,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68874 states to 68874 states and 270636 transitions. [2019-12-18 12:04:52,252 INFO L78 Accepts]: Start accepts. Automaton has 68874 states and 270636 transitions. Word has length 18 [2019-12-18 12:04:52,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:04:52,252 INFO L462 AbstractCegarLoop]: Abstraction has 68874 states and 270636 transitions. [2019-12-18 12:04:52,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:04:52,252 INFO L276 IsEmpty]: Start isEmpty. Operand 68874 states and 270636 transitions. [2019-12-18 12:04:52,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:04:52,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:04:52,278 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:04:52,278 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:04:52,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:04:52,278 INFO L82 PathProgramCache]: Analyzing trace with hash -482510294, now seen corresponding path program 1 times [2019-12-18 12:04:52,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:04:52,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920858393] [2019-12-18 12:04:52,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:04:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:04:52,354 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 12:04:52,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920858393] [2019-12-18 12:04:52,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:04:52,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:04:52,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385443251] [2019-12-18 12:04:52,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:04:52,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:04:52,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:04:52,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:04:52,358 INFO L87 Difference]: Start difference. First operand 68874 states and 270636 transitions. Second operand 5 states. [2019-12-18 12:04:55,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:04:55,624 INFO L93 Difference]: Finished difference Result 81922 states and 317702 transitions. [2019-12-18 12:04:55,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:04:55,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:04:55,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:04:55,832 INFO L225 Difference]: With dead ends: 81922 [2019-12-18 12:04:55,832 INFO L226 Difference]: Without dead ends: 81870 [2019-12-18 12:04:55,833 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 12:04:56,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81870 states. [2019-12-18 12:04:57,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81870 to 68462. [2019-12-18 12:04:57,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68462 states. [2019-12-18 12:04:58,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68462 states to 68462 states and 269172 transitions. [2019-12-18 12:04:58,196 INFO L78 Accepts]: Start accepts. Automaton has 68462 states and 269172 transitions. Word has length 22 [2019-12-18 12:04:58,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:04:58,197 INFO L462 AbstractCegarLoop]: Abstraction has 68462 states and 269172 transitions. [2019-12-18 12:04:58,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:04:58,197 INFO L276 IsEmpty]: Start isEmpty. Operand 68462 states and 269172 transitions. [2019-12-18 12:04:58,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 12:04:58,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:04:58,281 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 12:04:58,281 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:04:58,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:04:58,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1940822117, now seen corresponding path program 1 times [2019-12-18 12:04:58,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:04:58,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495794823] [2019-12-18 12:04:58,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:04:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:04:58,389 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 12:04:58,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495794823] [2019-12-18 12:04:58,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:04:58,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:04:58,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700381984] [2019-12-18 12:04:58,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:04:58,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:04:58,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:04:58,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:04:58,392 INFO L87 Difference]: Start difference. First operand 68462 states and 269172 transitions. Second operand 5 states. [2019-12-18 12:04:59,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:04:59,824 INFO L93 Difference]: Finished difference Result 103430 states and 412650 transitions. [2019-12-18 12:04:59,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:04:59,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-18 12:04:59,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:05:00,073 INFO L225 Difference]: With dead ends: 103430 [2019-12-18 12:05:00,073 INFO L226 Difference]: Without dead ends: 90822 [2019-12-18 12:05:00,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:05:00,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90822 states. [2019-12-18 12:05:05,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90822 to 90822. [2019-12-18 12:05:05,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90822 states. [2019-12-18 12:05:05,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90822 states to 90822 states and 363292 transitions. [2019-12-18 12:05:05,939 INFO L78 Accepts]: Start accepts. Automaton has 90822 states and 363292 transitions. Word has length 32 [2019-12-18 12:05:05,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:05:05,940 INFO L462 AbstractCegarLoop]: Abstraction has 90822 states and 363292 transitions. [2019-12-18 12:05:05,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:05:05,940 INFO L276 IsEmpty]: Start isEmpty. Operand 90822 states and 363292 transitions. [2019-12-18 12:05:06,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 12:05:06,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:05:06,050 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 12:05:06,050 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:05:06,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:05:06,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1864942543, now seen corresponding path program 2 times [2019-12-18 12:05:06,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:05:06,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541990446] [2019-12-18 12:05:06,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:05:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:05:06,105 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 12:05:06,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541990446] [2019-12-18 12:05:06,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:05:06,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:05:06,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837010627] [2019-12-18 12:05:06,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:05:06,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:05:06,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:05:06,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:05:06,107 INFO L87 Difference]: Start difference. First operand 90822 states and 363292 transitions. Second operand 3 states. [2019-12-18 12:05:06,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:05:06,548 INFO L93 Difference]: Finished difference Result 90770 states and 363112 transitions. [2019-12-18 12:05:06,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:05:06,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-18 12:05:06,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:05:06,770 INFO L225 Difference]: With dead ends: 90770 [2019-12-18 12:05:06,771 INFO L226 Difference]: Without dead ends: 90770 [2019-12-18 12:05:06,771 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 12:05:07,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90770 states. [2019-12-18 12:05:12,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90770 to 90770. [2019-12-18 12:05:12,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90770 states. [2019-12-18 12:05:12,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90770 states to 90770 states and 363112 transitions. [2019-12-18 12:05:12,804 INFO L78 Accepts]: Start accepts. Automaton has 90770 states and 363112 transitions. Word has length 32 [2019-12-18 12:05:12,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:05:12,804 INFO L462 AbstractCegarLoop]: Abstraction has 90770 states and 363112 transitions. [2019-12-18 12:05:12,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:05:12,805 INFO L276 IsEmpty]: Start isEmpty. Operand 90770 states and 363112 transitions. [2019-12-18 12:05:12,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:05:12,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:05:12,949 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:05:12,950 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:05:12,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:05:12,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1625131118, now seen corresponding path program 1 times [2019-12-18 12:05:12,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:05:12,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852131194] [2019-12-18 12:05:12,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:05:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:05:12,998 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 12:05:12,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852131194] [2019-12-18 12:05:12,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:05:12,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:05:12,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868105168] [2019-12-18 12:05:12,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:05:13,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:05:13,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:05:13,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:05:13,000 INFO L87 Difference]: Start difference. First operand 90770 states and 363112 transitions. Second operand 3 states. [2019-12-18 12:05:13,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:05:13,454 INFO L93 Difference]: Finished difference Result 89976 states and 359743 transitions. [2019-12-18 12:05:13,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:05:13,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-18 12:05:13,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:05:13,693 INFO L225 Difference]: With dead ends: 89976 [2019-12-18 12:05:13,694 INFO L226 Difference]: Without dead ends: 89976 [2019-12-18 12:05:13,694 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 12:05:14,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89976 states. [2019-12-18 12:05:19,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89976 to 89976. [2019-12-18 12:05:19,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89976 states. [2019-12-18 12:05:20,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89976 states to 89976 states and 359743 transitions. [2019-12-18 12:05:20,091 INFO L78 Accepts]: Start accepts. Automaton has 89976 states and 359743 transitions. Word has length 33 [2019-12-18 12:05:20,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:05:20,091 INFO L462 AbstractCegarLoop]: Abstraction has 89976 states and 359743 transitions. [2019-12-18 12:05:20,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:05:20,091 INFO L276 IsEmpty]: Start isEmpty. Operand 89976 states and 359743 transitions. [2019-12-18 12:05:20,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 12:05:20,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:05:20,207 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:05:20,208 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:05:20,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:05:20,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1074164756, now seen corresponding path program 1 times [2019-12-18 12:05:20,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:05:20,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021851131] [2019-12-18 12:05:20,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:05:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:05:20,276 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 12:05:20,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021851131] [2019-12-18 12:05:20,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:05:20,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:05:20,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775183684] [2019-12-18 12:05:20,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:05:20,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:05:20,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:05:20,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:05:20,278 INFO L87 Difference]: Start difference. First operand 89976 states and 359743 transitions. Second operand 3 states. [2019-12-18 12:05:20,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:05:20,950 INFO L93 Difference]: Finished difference Result 89976 states and 354699 transitions. [2019-12-18 12:05:20,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:05:20,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-18 12:05:20,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:05:21,286 INFO L225 Difference]: With dead ends: 89976 [2019-12-18 12:05:21,286 INFO L226 Difference]: Without dead ends: 89976 [2019-12-18 12:05:21,287 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 12:05:21,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89976 states. [2019-12-18 12:05:23,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89976 to 89816. [2019-12-18 12:05:23,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89816 states. [2019-12-18 12:05:24,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89816 states to 89816 states and 354195 transitions. [2019-12-18 12:05:24,229 INFO L78 Accepts]: Start accepts. Automaton has 89816 states and 354195 transitions. Word has length 34 [2019-12-18 12:05:24,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:05:24,229 INFO L462 AbstractCegarLoop]: Abstraction has 89816 states and 354195 transitions. [2019-12-18 12:05:24,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:05:24,229 INFO L276 IsEmpty]: Start isEmpty. Operand 89816 states and 354195 transitions. [2019-12-18 12:05:24,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 12:05:24,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:05:24,347 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:05:24,347 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:05:24,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:05:24,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1505027812, now seen corresponding path program 1 times [2019-12-18 12:05:24,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:05:24,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121436359] [2019-12-18 12:05:24,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:05:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:05:24,439 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 12:05:24,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121436359] [2019-12-18 12:05:24,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:05:24,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:05:24,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105324876] [2019-12-18 12:05:24,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:05:24,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:05:24,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:05:24,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:05:24,441 INFO L87 Difference]: Start difference. First operand 89816 states and 354195 transitions. Second operand 6 states. [2019-12-18 12:05:28,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:05:28,747 INFO L93 Difference]: Finished difference Result 145455 states and 568962 transitions. [2019-12-18 12:05:28,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 12:05:28,747 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-18 12:05:28,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:05:29,106 INFO L225 Difference]: With dead ends: 145455 [2019-12-18 12:05:29,106 INFO L226 Difference]: Without dead ends: 133499 [2019-12-18 12:05:29,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:05:29,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133499 states. [2019-12-18 12:05:31,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133499 to 101528. [2019-12-18 12:05:31,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101528 states. [2019-12-18 12:05:32,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101528 states to 101528 states and 400333 transitions. [2019-12-18 12:05:32,171 INFO L78 Accepts]: Start accepts. Automaton has 101528 states and 400333 transitions. Word has length 35 [2019-12-18 12:05:32,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:05:32,171 INFO L462 AbstractCegarLoop]: Abstraction has 101528 states and 400333 transitions. [2019-12-18 12:05:32,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:05:32,172 INFO L276 IsEmpty]: Start isEmpty. Operand 101528 states and 400333 transitions. [2019-12-18 12:05:32,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 12:05:32,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:05:32,298 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:05:32,298 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:05:32,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:05:32,299 INFO L82 PathProgramCache]: Analyzing trace with hash -22818902, now seen corresponding path program 2 times [2019-12-18 12:05:32,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:05:32,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217080077] [2019-12-18 12:05:32,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:05:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:05:32,412 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 12:05:32,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217080077] [2019-12-18 12:05:32,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:05:32,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:05:32,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086085388] [2019-12-18 12:05:32,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:05:32,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:05:32,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:05:32,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:05:32,416 INFO L87 Difference]: Start difference. First operand 101528 states and 400333 transitions. Second operand 5 states. [2019-12-18 12:05:32,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:05:32,541 INFO L93 Difference]: Finished difference Result 14022 states and 47881 transitions. [2019-12-18 12:05:32,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:05:32,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-12-18 12:05:32,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:05:32,560 INFO L225 Difference]: With dead ends: 14022 [2019-12-18 12:05:32,560 INFO L226 Difference]: Without dead ends: 7836 [2019-12-18 12:05:32,560 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 12:05:32,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7836 states. [2019-12-18 12:05:32,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7836 to 7836. [2019-12-18 12:05:32,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7836 states. [2019-12-18 12:05:32,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7836 states to 7836 states and 22841 transitions. [2019-12-18 12:05:32,679 INFO L78 Accepts]: Start accepts. Automaton has 7836 states and 22841 transitions. Word has length 35 [2019-12-18 12:05:32,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:05:32,680 INFO L462 AbstractCegarLoop]: Abstraction has 7836 states and 22841 transitions. [2019-12-18 12:05:32,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:05:32,680 INFO L276 IsEmpty]: Start isEmpty. Operand 7836 states and 22841 transitions. [2019-12-18 12:05:33,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 12:05:33,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:05:33,649 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:05:33,649 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:05:33,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:05:33,650 INFO L82 PathProgramCache]: Analyzing trace with hash -492468280, now seen corresponding path program 1 times [2019-12-18 12:05:33,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:05:33,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311153707] [2019-12-18 12:05:33,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:05:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:05:33,710 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 12:05:33,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311153707] [2019-12-18 12:05:33,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:05:33,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:05:33,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459116205] [2019-12-18 12:05:33,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:05:33,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:05:33,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:05:33,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:05:33,712 INFO L87 Difference]: Start difference. First operand 7836 states and 22841 transitions. Second operand 4 states. [2019-12-18 12:05:33,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:05:33,759 INFO L93 Difference]: Finished difference Result 8950 states and 25369 transitions. [2019-12-18 12:05:33,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:05:33,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-18 12:05:33,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:05:33,775 INFO L225 Difference]: With dead ends: 8950 [2019-12-18 12:05:33,776 INFO L226 Difference]: Without dead ends: 7847 [2019-12-18 12:05:33,776 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 12:05:33,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7847 states. [2019-12-18 12:05:33,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7847 to 7831. [2019-12-18 12:05:33,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7831 states. [2019-12-18 12:05:33,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7831 states to 7831 states and 22760 transitions. [2019-12-18 12:05:33,919 INFO L78 Accepts]: Start accepts. Automaton has 7831 states and 22760 transitions. Word has length 47 [2019-12-18 12:05:33,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:05:33,919 INFO L462 AbstractCegarLoop]: Abstraction has 7831 states and 22760 transitions. [2019-12-18 12:05:33,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:05:33,920 INFO L276 IsEmpty]: Start isEmpty. Operand 7831 states and 22760 transitions. [2019-12-18 12:05:33,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 12:05:33,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:05:33,931 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:05:33,931 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:05:33,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:05:33,932 INFO L82 PathProgramCache]: Analyzing trace with hash -109708298, now seen corresponding path program 2 times [2019-12-18 12:05:33,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:05:33,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826682057] [2019-12-18 12:05:33,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:05:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:05:34,008 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 12:05:34,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826682057] [2019-12-18 12:05:34,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:05:34,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:05:34,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516134794] [2019-12-18 12:05:34,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:05:34,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:05:34,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:05:34,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:05:34,010 INFO L87 Difference]: Start difference. First operand 7831 states and 22760 transitions. Second operand 4 states. [2019-12-18 12:05:34,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:05:34,067 INFO L93 Difference]: Finished difference Result 12102 states and 33378 transitions. [2019-12-18 12:05:34,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:05:34,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-18 12:05:34,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:05:34,075 INFO L225 Difference]: With dead ends: 12102 [2019-12-18 12:05:34,075 INFO L226 Difference]: Without dead ends: 4496 [2019-12-18 12:05:34,078 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 12:05:34,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4496 states. [2019-12-18 12:05:34,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4496 to 4496. [2019-12-18 12:05:34,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4496 states. [2019-12-18 12:05:34,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4496 states to 4496 states and 11124 transitions. [2019-12-18 12:05:34,135 INFO L78 Accepts]: Start accepts. Automaton has 4496 states and 11124 transitions. Word has length 47 [2019-12-18 12:05:34,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:05:34,136 INFO L462 AbstractCegarLoop]: Abstraction has 4496 states and 11124 transitions. [2019-12-18 12:05:34,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:05:34,136 INFO L276 IsEmpty]: Start isEmpty. Operand 4496 states and 11124 transitions. [2019-12-18 12:05:34,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 12:05:34,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:05:34,141 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:05:34,142 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:05:34,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:05:34,142 INFO L82 PathProgramCache]: Analyzing trace with hash 924019022, now seen corresponding path program 3 times [2019-12-18 12:05:34,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:05:34,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379566759] [2019-12-18 12:05:34,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:05:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:05:34,300 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 12:05:34,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379566759] [2019-12-18 12:05:34,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:05:34,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:05:34,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220816069] [2019-12-18 12:05:34,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:05:34,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:05:34,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:05:34,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:05:34,302 INFO L87 Difference]: Start difference. First operand 4496 states and 11124 transitions. Second operand 6 states. [2019-12-18 12:05:34,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:05:34,372 INFO L93 Difference]: Finished difference Result 3265 states and 8285 transitions. [2019-12-18 12:05:34,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:05:34,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-18 12:05:34,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:05:34,373 INFO L225 Difference]: With dead ends: 3265 [2019-12-18 12:05:34,373 INFO L226 Difference]: Without dead ends: 437 [2019-12-18 12:05:34,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:05:34,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-12-18 12:05:34,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2019-12-18 12:05:34,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-12-18 12:05:34,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 955 transitions. [2019-12-18 12:05:34,378 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 955 transitions. Word has length 47 [2019-12-18 12:05:34,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:05:34,378 INFO L462 AbstractCegarLoop]: Abstraction has 437 states and 955 transitions. [2019-12-18 12:05:34,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:05:34,379 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 955 transitions. [2019-12-18 12:05:34,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:05:34,380 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:05:34,380 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:05:34,380 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:05:34,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:05:34,380 INFO L82 PathProgramCache]: Analyzing trace with hash -496292372, now seen corresponding path program 1 times [2019-12-18 12:05:34,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:05:34,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827626511] [2019-12-18 12:05:34,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:05:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:05:34,474 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 12:05:34,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827626511] [2019-12-18 12:05:34,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:05:34,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:05:34,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958481970] [2019-12-18 12:05:34,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:05:34,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:05:34,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:05:34,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:05:34,476 INFO L87 Difference]: Start difference. First operand 437 states and 955 transitions. Second operand 8 states. [2019-12-18 12:05:34,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:05:34,739 INFO L93 Difference]: Finished difference Result 943 states and 2025 transitions. [2019-12-18 12:05:34,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:05:34,739 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-18 12:05:34,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:05:34,741 INFO L225 Difference]: With dead ends: 943 [2019-12-18 12:05:34,741 INFO L226 Difference]: Without dead ends: 692 [2019-12-18 12:05:34,742 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 12:05:34,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2019-12-18 12:05:34,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 528. [2019-12-18 12:05:34,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-12-18 12:05:34,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 1120 transitions. [2019-12-18 12:05:34,752 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 1120 transitions. Word has length 63 [2019-12-18 12:05:34,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:05:34,753 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 1120 transitions. [2019-12-18 12:05:34,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:05:34,753 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 1120 transitions. [2019-12-18 12:05:34,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:05:34,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:05:34,755 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:05:34,755 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:05:34,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:05:34,756 INFO L82 PathProgramCache]: Analyzing trace with hash -2092088660, now seen corresponding path program 2 times [2019-12-18 12:05:34,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:05:34,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688287657] [2019-12-18 12:05:34,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:05:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:05:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:05:34,938 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:05:34,941 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:05:34,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_146| 0 0))) (and (= v_~y$w_buff0_used~0_977 0) (= v_~main$tmp_guard0~0_31 0) (= v_~__unbuffered_cnt~0_147 0) (= v_~y~0_394 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~z~0_33 0) (= 0 v_~weak$$choice0~0_268) (= v_~y$w_buff1~0_277 0) (= 0 v_~y$r_buff1_thd3~0_407) (= v_~y$read_delayed~0_7 0) (= v_~x~0_53 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t35~0.base_112|)) (= v_~y$w_buff1_used~0_557 0) (= 0 v_~__unbuffered_p0_EAX~0_92) (= v_~y$r_buff1_thd0~0_349 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t35~0.base_112|) (= v_~__unbuffered_p0_EBX~0_92 0) (= v_~y$mem_tmp~0_281 0) (= v_~weak$$choice2~0_344 0) (= v_~y$r_buff0_thd0~0_222 0) (= 0 v_~y$r_buff1_thd2~0_454) (< 0 |v_#StackHeapBarrier_18|) (= v_~main$tmp_guard1~0_83 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t35~0.base_112| 4)) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 |v_ULTIMATE.start_main_~#t35~0.offset_63|) (= 0 v_~y$w_buff0~0_387) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t35~0.base_112| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t35~0.base_112|) |v_ULTIMATE.start_main_~#t35~0.offset_63| 0)) |v_#memory_int_21|) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff0_thd2~0_461) (= v_~y$r_buff0_thd1~0_167 0) (= 0 v_~__unbuffered_p1_EBX~0_100) (= 0 v_~y$r_buff0_thd3~0_651) (= v_~__unbuffered_p2_EBX~0_91 0) (= v_~__unbuffered_p1_EAX~0_110 0) (= v_~y$r_buff1_thd1~0_236 0) (= |v_#valid_144| (store .cse0 |v_ULTIMATE.start_main_~#t35~0.base_112| 1)) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_p2_EAX~0_98) (= v_~y$flush_delayed~0_345 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_146|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t37~0.base=|v_ULTIMATE.start_main_~#t37~0.base_59|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_18|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, #NULL.offset=|v_#NULL.offset_5|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_281, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_407, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_110, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_167, ~y$flush_delayed~0=v_~y$flush_delayed~0_345, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ULTIMATE.start_main_~#t35~0.offset=|v_ULTIMATE.start_main_~#t35~0.offset_63|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_91, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_~#t35~0.base=|v_ULTIMATE.start_main_~#t35~0.base_112|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_57|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_167|, ~weak$$choice0~0=v_~weak$$choice0~0_268, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_~#t36~0.base=|v_ULTIMATE.start_main_~#t36~0.base_84|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_33|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_461, ULTIMATE.start_main_~#t37~0.offset=|v_ULTIMATE.start_main_~#t37~0.offset_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_147, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_349, ~x~0=v_~x~0_53, ~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_977, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ULTIMATE.start_main_~#t36~0.offset=|v_ULTIMATE.start_main_~#t36~0.offset_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_83, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_236, ~y$w_buff0~0=v_~y$w_buff0~0_387, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_651, ~y~0=v_~y~0_394, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_100, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_84|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_29|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_454, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_375|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_67|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_222, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_33, ~weak$$choice2~0=v_~weak$$choice2~0_344, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_557} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t37~0.base, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t35~0.offset, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t35~0.base, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_~#t36~0.base, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_~#t37~0.offset, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ULTIMATE.start_main_~#t36~0.offset, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 12:05:34,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L840-1-->L842: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t36~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t36~0.base_11|)) (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t36~0.base_11|) 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t36~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t36~0.base_11|) |v_ULTIMATE.start_main_~#t36~0.offset_10| 1)) |v_#memory_int_11|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t36~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t36~0.offset_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t36~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t36~0.base=|v_ULTIMATE.start_main_~#t36~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t36~0.offset=|v_ULTIMATE.start_main_~#t36~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t36~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t36~0.offset, #length] because there is no mapped edge [2019-12-18 12:05:34,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L842-1-->L844: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t37~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t37~0.base_11|) |v_ULTIMATE.start_main_~#t37~0.offset_10| 2)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t37~0.offset_10|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t37~0.base_11| 1)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t37~0.base_11|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t37~0.base_11| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t37~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t37~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t37~0.base=|v_ULTIMATE.start_main_~#t37~0.base_11|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t37~0.offset=|v_ULTIMATE.start_main_~#t37~0.offset_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t37~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t37~0.offset, #length] because there is no mapped edge [2019-12-18 12:05:34,949 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [927] [927] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_346 v_~y$w_buff1_used~0_197) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_71 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_69|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_69| v_P2Thread1of1ForFork0_~arg.offset_69) (= |v_P2Thread1of1ForFork0_#in~arg.base_69| v_P2Thread1of1ForFork0_~arg.base_69) (= (mod v_~y$w_buff1_used~0_197 256) 0) (= v_~y$w_buff1~0_94 v_~y$w_buff0~0_159) (= v_~y$w_buff0_used~0_345 1) (= 1 v_~y$w_buff0~0_158) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_69|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_346, ~y$w_buff0~0=v_~y$w_buff0~0_159, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_69, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_69|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_345, ~y$w_buff1~0=v_~y$w_buff1~0_94, ~y$w_buff0~0=v_~y$w_buff0~0_158, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_69, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_71, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_197} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 12:05:34,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1084693197 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1084693197 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite28_Out1084693197| ~y$w_buff0~0_In1084693197) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out1084693197| ~y$w_buff1~0_In1084693197)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1084693197, ~y$w_buff1~0=~y$w_buff1~0_In1084693197, ~y$w_buff0~0=~y$w_buff0~0_In1084693197, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1084693197} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1084693197|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1084693197, ~y$w_buff1~0=~y$w_buff1~0_In1084693197, ~y$w_buff0~0=~y$w_buff0~0_In1084693197, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1084693197} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 12:05:34,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L802-4-->L803: Formula: (= v_~y~0_30 |v_P2Thread1of1ForFork0_#t~ite28_8|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_8|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_7|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_7|, ~y~0=v_~y~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-18 12:05:34,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L807-->L808: Formula: (and (= v_~y$r_buff0_thd3~0_64 v_~y$r_buff0_thd3~0_63) (not (= (mod v_~weak$$choice2~0_41 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_41} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_9|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_63, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_7|, ~weak$$choice2~0=v_~weak$$choice2~0_41} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 12:05:34,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-662152705 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite48_Out-662152705| ~y~0_In-662152705)) (and (= |P2Thread1of1ForFork0_#t~ite48_Out-662152705| ~y$mem_tmp~0_In-662152705) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-662152705, ~y$flush_delayed~0=~y$flush_delayed~0_In-662152705, ~y~0=~y~0_In-662152705} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-662152705|, ~y$mem_tmp~0=~y$mem_tmp~0_In-662152705, ~y$flush_delayed~0=~y$flush_delayed~0_In-662152705, ~y~0=~y~0_In-662152705} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-18 12:05:34,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_10| v_P0Thread1of1ForFork1_~arg.base_10) (= v_~z~0_13 v_~__unbuffered_p0_EAX~0_17) (= (+ v_~__unbuffered_cnt~0_80 1) v_~__unbuffered_cnt~0_79) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_p0_EBX~0_17 v_~x~0_35) (= v_~z~0_13 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_10 |v_P0Thread1of1ForFork1_#in~arg.offset_10|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_10|, ~x~0=v_~x~0_35} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_17, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_10|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_10, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~z~0=v_~z~0_13, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_10|, ~x~0=v_~x~0_35, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_10} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 12:05:34,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1289759244 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In1289759244 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite51_Out1289759244|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite51_Out1289759244| ~y$w_buff0_used~0_In1289759244)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1289759244, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1289759244} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1289759244, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1289759244, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out1289759244|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-18 12:05:34,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1479783361 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1479783361 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1479783361 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In1479783361 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite52_Out1479783361|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork0_#t~ite52_Out1479783361| ~y$w_buff1_used~0_In1479783361) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1479783361, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1479783361, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1479783361, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1479783361} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1479783361, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1479783361, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1479783361, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out1479783361|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1479783361} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-18 12:05:34,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L820-->L821: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1304873047 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1304873047 256) 0))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd3~0_Out1304873047) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In1304873047 ~y$r_buff0_thd3~0_Out1304873047)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1304873047, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1304873047} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1304873047, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1304873047, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out1304873047|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-18 12:05:34,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L821-->L821-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In2146420077 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In2146420077 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2146420077 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In2146420077 256) 0))) (or (and (= ~y$r_buff1_thd3~0_In2146420077 |P2Thread1of1ForFork0_#t~ite54_Out2146420077|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite54_Out2146420077|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2146420077, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2146420077, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2146420077, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2146420077} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2146420077, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2146420077, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out2146420077|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2146420077, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2146420077} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-18 12:05:34,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L821-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~y$r_buff1_thd3~0_196 |v_P2Thread1of1ForFork0_#t~ite54_38|) (= (+ v_~__unbuffered_cnt~0_98 1) v_~__unbuffered_cnt~0_97) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_196, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_37|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 12:05:34,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1250203294 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite25_Out1250203294| ~y$mem_tmp~0_In1250203294)) (and .cse0 (= |P1Thread1of1ForFork2_#t~ite25_Out1250203294| ~y~0_In1250203294)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1250203294, ~y$flush_delayed~0=~y$flush_delayed~0_In1250203294, ~y~0=~y~0_In1250203294} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1250203294, ~y$flush_delayed~0=~y$flush_delayed~0_In1250203294, ~y~0=~y~0_In1250203294, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out1250203294|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 12:05:34,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~y$flush_delayed~0_261 0) (= v_~y~0_233 |v_P1Thread1of1ForFork2_#t~ite25_94|) (= v_~__unbuffered_cnt~0_123 (+ v_~__unbuffered_cnt~0_124 1)) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_124, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_94|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_261, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123, ~y~0=v_~y~0_233, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_93|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 12:05:34,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] L848-->L850-2: Formula: (and (or (= (mod v_~y$r_buff0_thd0~0_26 256) 0) (= (mod v_~y$w_buff0_used~0_150 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_150, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_150, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 12:05:34,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L850-2-->L850-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite59_Out-1602741996| |ULTIMATE.start_main_#t~ite58_Out-1602741996|)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1602741996 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1602741996 256)))) (or (and .cse0 (not .cse1) (= ~y$w_buff1~0_In-1602741996 |ULTIMATE.start_main_#t~ite58_Out-1602741996|) (not .cse2)) (and .cse0 (= |ULTIMATE.start_main_#t~ite58_Out-1602741996| ~y~0_In-1602741996) (or .cse2 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1602741996, ~y~0=~y~0_In-1602741996, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1602741996, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1602741996} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1602741996, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-1602741996|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1602741996|, ~y~0=~y~0_In-1602741996, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1602741996, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1602741996} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-18 12:05:34,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L851-->L851-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1154104942 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1154104942 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1154104942 |ULTIMATE.start_main_#t~ite60_Out1154104942|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite60_Out1154104942| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1154104942, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1154104942} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1154104942|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1154104942, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1154104942} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-18 12:05:34,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L852-->L852-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In210728076 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In210728076 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In210728076 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In210728076 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out210728076|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In210728076 |ULTIMATE.start_main_#t~ite61_Out210728076|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In210728076, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In210728076, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In210728076, ~y$w_buff1_used~0=~y$w_buff1_used~0_In210728076} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out210728076|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In210728076, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In210728076, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In210728076, ~y$w_buff1_used~0=~y$w_buff1_used~0_In210728076} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-18 12:05:34,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L853-->L853-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In911353715 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In911353715 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In911353715 |ULTIMATE.start_main_#t~ite62_Out911353715|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite62_Out911353715|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In911353715, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In911353715} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out911353715|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In911353715, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In911353715} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-18 12:05:34,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L854-->L854-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1130706046 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1130706046 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1130706046 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1130706046 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite63_Out1130706046|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite63_Out1130706046| ~y$r_buff1_thd0~0_In1130706046) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1130706046, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1130706046, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1130706046, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1130706046} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1130706046|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1130706046, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1130706046, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1130706046, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1130706046} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-18 12:05:34,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p1_EBX~0_29 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~y$r_buff1_thd0~0_254 |v_ULTIMATE.start_main_#t~ite63_47|) (= 1 v_~__unbuffered_p0_EAX~0_29) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_22 256)) (= 1 v_~__unbuffered_p1_EAX~0_47) (= v_~__unbuffered_p2_EBX~0_26 0) (= v_~__unbuffered_p0_EBX~0_29 0) (= v_~main$tmp_guard1~0_22 0) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_47|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_29, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_29, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_254, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, 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 12:05:35,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:05:35 BasicIcfg [2019-12-18 12:05:35,123 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:05:35,125 INFO L168 Benchmark]: Toolchain (without parser) took 77449.04 ms. Allocated memory was 138.4 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 101.6 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 12:05:35,126 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 12:05:35,130 INFO L168 Benchmark]: CACSL2BoogieTranslator took 763.80 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 101.2 MB in the beginning and 153.3 MB in the end (delta: -52.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-12-18 12:05:35,132 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.15 ms. Allocated memory is still 201.3 MB. Free memory was 153.3 MB in the beginning and 150.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:05:35,133 INFO L168 Benchmark]: Boogie Preprocessor took 40.33 ms. Allocated memory is still 201.3 MB. Free memory was 150.7 MB in the beginning and 148.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:05:35,134 INFO L168 Benchmark]: RCFGBuilder took 963.99 ms. Allocated memory is still 201.3 MB. Free memory was 148.0 MB in the beginning and 91.6 MB in the end (delta: 56.4 MB). Peak memory consumption was 56.4 MB. Max. memory is 7.1 GB. [2019-12-18 12:05:35,135 INFO L168 Benchmark]: TraceAbstraction took 75588.83 ms. Allocated memory was 201.3 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 91.6 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 12:05:35,143 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 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 763.80 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 101.2 MB in the beginning and 153.3 MB in the end (delta: -52.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 86.15 ms. Allocated memory is still 201.3 MB. Free memory was 153.3 MB in the beginning and 150.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.33 ms. Allocated memory is still 201.3 MB. Free memory was 150.7 MB in the beginning and 148.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 963.99 ms. Allocated memory is still 201.3 MB. Free memory was 148.0 MB in the beginning and 91.6 MB in the end (delta: 56.4 MB). Peak memory consumption was 56.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 75588.83 ms. Allocated memory was 201.3 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 91.6 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.1s, 197 ProgramPointsBefore, 108 ProgramPointsAfterwards, 243 TransitionsBefore, 130 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 28 ChoiceCompositions, 9487 VarBasedMoverChecksPositive, 322 VarBasedMoverChecksNegative, 94 SemBasedMoverChecksPositive, 333 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.5s, 0 MoverChecksTotal, 124432 CheckedPairsTotal, 127 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L840] FCALL, FORK 0 pthread_create(&t35, ((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, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L842] FCALL, FORK 0 pthread_create(&t36, ((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, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L844] FCALL, FORK 0 pthread_create(&t37, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L791] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L792] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L793] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L794] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L795] 3 y$r_buff0_thd3 = (_Bool)1 [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 y$flush_delayed = weak$$choice2 [L801] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L802] 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? 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, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L803] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? 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, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L803] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L804] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? 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, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L804] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L805] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_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, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L805] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L806] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L808] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L810] 3 y = y$flush_delayed ? y$mem_tmp : y [L811] 3 y$flush_delayed = (_Bool)0 [L814] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L817] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L755] 2 x = 1 [L758] 2 __unbuffered_p1_EAX = x [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 y$flush_delayed = weak$$choice2 [L764] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L765] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L817] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L818] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L819] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L765] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L766] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L766] 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)) [L767] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L767] 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)) [L768] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L768] 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)) [L769] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L769] 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)) [L770] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L770] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L771] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L771] 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)) [L772] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L850] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L851] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L852] 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 [L853] 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 4 procedures, 188 locations, 2 error locations. Result: UNSAFE, OverallTime: 75.2s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 18.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3083 SDtfs, 3546 SDslu, 5164 SDs, 0 SdLazy, 1338 SolverSat, 91 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101528occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 41.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 56177 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 544 NumberOfCodeBlocks, 544 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 466 ConstructedInterpolants, 0 QuantifiedInterpolants, 49654 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...