/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/mix011_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:29:42,364 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:29:42,367 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:29:42,383 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:29:42,383 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:29:42,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:29:42,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:29:42,387 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:29:42,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:29:42,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:29:42,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:29:42,398 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:29:42,398 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:29:42,400 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:29:42,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:29:42,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:29:42,402 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:29:42,403 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:29:42,405 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:29:42,407 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:29:42,408 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:29:42,409 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:29:42,410 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:29:42,411 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:29:42,413 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:29:42,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:29:42,416 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:29:42,417 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:29:42,418 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:29:42,419 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:29:42,420 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:29:42,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:29:42,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:29:42,425 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:29:42,426 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:29:42,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:29:42,429 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:29:42,430 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:29:42,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:29:42,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:29:42,432 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:29:42,435 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-26 21:29:42,450 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:29:42,450 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:29:42,451 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:29:42,452 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:29:42,452 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:29:42,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:29:42,452 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:29:42,452 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:29:42,453 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:29:42,453 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:29:42,453 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:29:42,453 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:29:42,453 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:29:42,454 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:29:42,454 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:29:42,454 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:29:42,454 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:29:42,454 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:29:42,455 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:29:42,455 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:29:42,455 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:29:42,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:29:42,455 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:29:42,456 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:29:42,456 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:29:42,456 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:29:42,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:29:42,457 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:29:42,457 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:29:42,457 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:29:42,714 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:29:42,734 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:29:42,739 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:29:42,740 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:29:42,740 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:29:42,742 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_power.opt.i [2019-12-26 21:29:42,820 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a38eaf65e/494d7a51de844f7a9bda099b8f8b661a/FLAGb62575456 [2019-12-26 21:29:43,393 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:29:43,393 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_power.opt.i [2019-12-26 21:29:43,411 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a38eaf65e/494d7a51de844f7a9bda099b8f8b661a/FLAGb62575456 [2019-12-26 21:29:43,653 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a38eaf65e/494d7a51de844f7a9bda099b8f8b661a [2019-12-26 21:29:43,662 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:29:43,664 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:29:43,665 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:29:43,665 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:29:43,669 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:29:43,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:29:43" (1/1) ... [2019-12-26 21:29:43,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50ef380c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:29:43, skipping insertion in model container [2019-12-26 21:29:43,674 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:29:43" (1/1) ... [2019-12-26 21:29:43,682 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:29:43,746 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:29:44,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:29:44,349 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:29:44,414 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:29:44,491 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:29:44,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:29:44 WrapperNode [2019-12-26 21:29:44,491 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:29:44,492 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:29:44,492 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:29:44,493 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:29:44,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:29:44" (1/1) ... [2019-12-26 21:29:44,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:29:44" (1/1) ... [2019-12-26 21:29:44,568 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:29:44,569 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:29:44,569 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:29:44,569 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:29:44,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:29:44" (1/1) ... [2019-12-26 21:29:44,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:29:44" (1/1) ... [2019-12-26 21:29:44,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:29:44" (1/1) ... [2019-12-26 21:29:44,584 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:29:44" (1/1) ... [2019-12-26 21:29:44,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:29:44" (1/1) ... [2019-12-26 21:29:44,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:29:44" (1/1) ... [2019-12-26 21:29:44,604 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:29:44" (1/1) ... [2019-12-26 21:29:44,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:29:44,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:29:44,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:29:44,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:29:44,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:29:44" (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-26 21:29:44,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:29:44,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:29:44,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:29:44,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:29:44,692 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:29:44,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:29:44,692 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:29:44,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:29:44,692 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 21:29:44,693 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 21:29:44,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:29:44,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:29:44,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:29:44,695 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 21:29:45,516 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:29:45,516 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:29:45,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:29:45 BoogieIcfgContainer [2019-12-26 21:29:45,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:29:45,519 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:29:45,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:29:45,523 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:29:45,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:29:43" (1/3) ... [2019-12-26 21:29:45,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d3275e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:29:45, skipping insertion in model container [2019-12-26 21:29:45,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:29:44" (2/3) ... [2019-12-26 21:29:45,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d3275e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:29:45, skipping insertion in model container [2019-12-26 21:29:45,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:29:45" (3/3) ... [2019-12-26 21:29:45,527 INFO L109 eAbstractionObserver]: Analyzing ICFG mix011_power.opt.i [2019-12-26 21:29:45,537 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:29:45,537 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:29:45,545 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:29:45,546 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:29:45,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,605 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,605 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,608 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,608 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,637 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,637 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,638 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,638 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,638 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,665 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,666 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,668 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,676 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,676 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,680 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,682 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:29:45,699 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 21:29:45,719 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:29:45,720 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:29:45,720 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:29:45,720 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:29:45,720 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:29:45,720 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:29:45,720 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:29:45,720 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:29:45,737 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 242 transitions [2019-12-26 21:29:45,739 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-12-26 21:29:45,856 INFO L132 PetriNetUnfolder]: 56/239 cut-off events. [2019-12-26 21:29:45,857 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:29:45,876 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 565 event pairs. 0/181 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-26 21:29:45,909 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-12-26 21:29:46,017 INFO L132 PetriNetUnfolder]: 56/239 cut-off events. [2019-12-26 21:29:46,017 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:29:46,033 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 565 event pairs. 0/181 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-26 21:29:46,064 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-26 21:29:46,065 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:29:52,157 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-26 21:29:52,300 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-26 21:29:52,555 INFO L206 etLargeBlockEncoding]: Checked pairs total: 115591 [2019-12-26 21:29:52,556 INFO L214 etLargeBlockEncoding]: Total number of compositions: 128 [2019-12-26 21:29:52,559 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 103 places, 122 transitions [2019-12-26 21:29:55,978 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 39870 states. [2019-12-26 21:29:55,980 INFO L276 IsEmpty]: Start isEmpty. Operand 39870 states. [2019-12-26 21:29:55,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-26 21:29:55,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:29:55,986 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:29:55,986 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-26 21:29:55,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:29:55,991 INFO L82 PathProgramCache]: Analyzing trace with hash 191430122, now seen corresponding path program 1 times [2019-12-26 21:29:55,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:29:55,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294440698] [2019-12-26 21:29:55,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:29:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:29:56,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:29:56,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294440698] [2019-12-26 21:29:56,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:29:56,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:29:56,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056549124] [2019-12-26 21:29:56,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:29:56,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:29:56,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:29:56,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:29:56,346 INFO L87 Difference]: Start difference. First operand 39870 states. Second operand 3 states. [2019-12-26 21:29:57,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:29:57,059 INFO L93 Difference]: Finished difference Result 39574 states and 160408 transitions. [2019-12-26 21:29:57,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:29:57,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-26 21:29:57,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:29:57,694 INFO L225 Difference]: With dead ends: 39574 [2019-12-26 21:29:57,695 INFO L226 Difference]: Without dead ends: 36868 [2019-12-26 21:29:57,696 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-26 21:29:58,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36868 states. [2019-12-26 21:29:59,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36868 to 36868. [2019-12-26 21:29:59,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36868 states. [2019-12-26 21:29:59,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36868 states to 36868 states and 149325 transitions. [2019-12-26 21:29:59,703 INFO L78 Accepts]: Start accepts. Automaton has 36868 states and 149325 transitions. Word has length 7 [2019-12-26 21:29:59,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:29:59,706 INFO L462 AbstractCegarLoop]: Abstraction has 36868 states and 149325 transitions. [2019-12-26 21:29:59,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:29:59,706 INFO L276 IsEmpty]: Start isEmpty. Operand 36868 states and 149325 transitions. [2019-12-26 21:29:59,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 21:29:59,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:29:59,717 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:29:59,717 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-26 21:29:59,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:29:59,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1210424527, now seen corresponding path program 1 times [2019-12-26 21:29:59,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:29:59,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917961579] [2019-12-26 21:29:59,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:29:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:29:59,870 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-26 21:29:59,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917961579] [2019-12-26 21:29:59,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:29:59,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:29:59,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476498752] [2019-12-26 21:29:59,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:29:59,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:29:59,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:29:59,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:29:59,877 INFO L87 Difference]: Start difference. First operand 36868 states and 149325 transitions. Second operand 4 states. [2019-12-26 21:30:02,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:30:02,141 INFO L93 Difference]: Finished difference Result 58688 states and 229341 transitions. [2019-12-26 21:30:02,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:30:02,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 21:30:02,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:30:02,459 INFO L225 Difference]: With dead ends: 58688 [2019-12-26 21:30:02,460 INFO L226 Difference]: Without dead ends: 58658 [2019-12-26 21:30:02,461 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-26 21:30:03,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58658 states. [2019-12-26 21:30:04,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58658 to 56314. [2019-12-26 21:30:04,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56314 states. [2019-12-26 21:30:05,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56314 states to 56314 states and 221696 transitions. [2019-12-26 21:30:05,225 INFO L78 Accepts]: Start accepts. Automaton has 56314 states and 221696 transitions. Word has length 13 [2019-12-26 21:30:05,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:30:05,226 INFO L462 AbstractCegarLoop]: Abstraction has 56314 states and 221696 transitions. [2019-12-26 21:30:05,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:30:05,226 INFO L276 IsEmpty]: Start isEmpty. Operand 56314 states and 221696 transitions. [2019-12-26 21:30:05,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:30:05,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:30:05,232 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:30:05,232 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-26 21:30:05,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:30:05,233 INFO L82 PathProgramCache]: Analyzing trace with hash -2049494264, now seen corresponding path program 1 times [2019-12-26 21:30:05,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:30:05,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002699657] [2019-12-26 21:30:05,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:30:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:30:05,325 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-26 21:30:05,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002699657] [2019-12-26 21:30:05,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:30:05,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:30:05,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938795348] [2019-12-26 21:30:05,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:30:05,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:30:05,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:30:05,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:30:05,328 INFO L87 Difference]: Start difference. First operand 56314 states and 221696 transitions. Second operand 4 states. [2019-12-26 21:30:05,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:30:05,922 INFO L93 Difference]: Finished difference Result 73686 states and 285874 transitions. [2019-12-26 21:30:05,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:30:05,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 21:30:05,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:30:08,766 INFO L225 Difference]: With dead ends: 73686 [2019-12-26 21:30:08,767 INFO L226 Difference]: Without dead ends: 73656 [2019-12-26 21:30:08,767 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-26 21:30:09,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73656 states. [2019-12-26 21:30:10,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73656 to 64544. [2019-12-26 21:30:10,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64544 states. [2019-12-26 21:30:11,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64544 states to 64544 states and 252987 transitions. [2019-12-26 21:30:11,246 INFO L78 Accepts]: Start accepts. Automaton has 64544 states and 252987 transitions. Word has length 16 [2019-12-26 21:30:11,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:30:11,246 INFO L462 AbstractCegarLoop]: Abstraction has 64544 states and 252987 transitions. [2019-12-26 21:30:11,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:30:11,247 INFO L276 IsEmpty]: Start isEmpty. Operand 64544 states and 252987 transitions. [2019-12-26 21:30:11,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-26 21:30:11,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:30:11,256 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-26 21:30:11,256 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-26 21:30:11,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:30:11,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1983670654, now seen corresponding path program 1 times [2019-12-26 21:30:11,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:30:11,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88449929] [2019-12-26 21:30:11,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:30:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:30:11,339 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-26 21:30:11,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88449929] [2019-12-26 21:30:11,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:30:11,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:30:11,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317541426] [2019-12-26 21:30:11,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:30:11,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:30:11,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:30:11,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:30:11,341 INFO L87 Difference]: Start difference. First operand 64544 states and 252987 transitions. Second operand 3 states. [2019-12-26 21:30:11,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:30:11,616 INFO L93 Difference]: Finished difference Result 64378 states and 252374 transitions. [2019-12-26 21:30:11,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:30:11,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-26 21:30:11,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:30:11,806 INFO L225 Difference]: With dead ends: 64378 [2019-12-26 21:30:11,807 INFO L226 Difference]: Without dead ends: 64378 [2019-12-26 21:30:11,807 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-26 21:30:12,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64378 states. [2019-12-26 21:30:15,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64378 to 64378. [2019-12-26 21:30:15,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64378 states. [2019-12-26 21:30:16,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64378 states to 64378 states and 252374 transitions. [2019-12-26 21:30:16,204 INFO L78 Accepts]: Start accepts. Automaton has 64378 states and 252374 transitions. Word has length 18 [2019-12-26 21:30:16,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:30:16,205 INFO L462 AbstractCegarLoop]: Abstraction has 64378 states and 252374 transitions. [2019-12-26 21:30:16,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:30:16,205 INFO L276 IsEmpty]: Start isEmpty. Operand 64378 states and 252374 transitions. [2019-12-26 21:30:16,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 21:30:16,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:30:16,218 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:30:16,218 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-26 21:30:16,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:30:16,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1589508715, now seen corresponding path program 1 times [2019-12-26 21:30:16,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:30:16,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338540191] [2019-12-26 21:30:16,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:30:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:30:16,268 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-26 21:30:16,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338540191] [2019-12-26 21:30:16,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:30:16,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:30:16,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705551499] [2019-12-26 21:30:16,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:30:16,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:30:16,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:30:16,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:30:16,270 INFO L87 Difference]: Start difference. First operand 64378 states and 252374 transitions. Second operand 3 states. [2019-12-26 21:30:16,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:30:16,546 INFO L93 Difference]: Finished difference Result 60640 states and 237307 transitions. [2019-12-26 21:30:16,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:30:16,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-26 21:30:16,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:30:16,679 INFO L225 Difference]: With dead ends: 60640 [2019-12-26 21:30:16,680 INFO L226 Difference]: Without dead ends: 60640 [2019-12-26 21:30:16,680 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-26 21:30:17,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60640 states. [2019-12-26 21:30:20,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60640 to 60640. [2019-12-26 21:30:20,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60640 states. [2019-12-26 21:30:20,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60640 states to 60640 states and 237307 transitions. [2019-12-26 21:30:20,554 INFO L78 Accepts]: Start accepts. Automaton has 60640 states and 237307 transitions. Word has length 19 [2019-12-26 21:30:20,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:30:20,555 INFO L462 AbstractCegarLoop]: Abstraction has 60640 states and 237307 transitions. [2019-12-26 21:30:20,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:30:20,555 INFO L276 IsEmpty]: Start isEmpty. Operand 60640 states and 237307 transitions. [2019-12-26 21:30:20,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 21:30:20,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:30:20,575 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-26 21:30:20,576 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-26 21:30:20,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:30:20,576 INFO L82 PathProgramCache]: Analyzing trace with hash 84396495, now seen corresponding path program 1 times [2019-12-26 21:30:20,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:30:20,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818444971] [2019-12-26 21:30:20,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:30:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:30:20,655 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-26 21:30:20,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818444971] [2019-12-26 21:30:20,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:30:20,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:30:20,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608223323] [2019-12-26 21:30:20,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:30:20,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:30:20,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:30:20,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:30:20,657 INFO L87 Difference]: Start difference. First operand 60640 states and 237307 transitions. Second operand 5 states. [2019-12-26 21:30:22,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:30:22,169 INFO L93 Difference]: Finished difference Result 73008 states and 281971 transitions. [2019-12-26 21:30:22,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 21:30:22,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 21:30:22,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:30:22,347 INFO L225 Difference]: With dead ends: 73008 [2019-12-26 21:30:22,347 INFO L226 Difference]: Without dead ends: 72954 [2019-12-26 21:30:22,348 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-26 21:30:22,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72954 states. [2019-12-26 21:30:26,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72954 to 60474. [2019-12-26 21:30:26,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60474 states. [2019-12-26 21:30:26,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60474 states to 60474 states and 236710 transitions. [2019-12-26 21:30:26,566 INFO L78 Accepts]: Start accepts. Automaton has 60474 states and 236710 transitions. Word has length 22 [2019-12-26 21:30:26,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:30:26,567 INFO L462 AbstractCegarLoop]: Abstraction has 60474 states and 236710 transitions. [2019-12-26 21:30:26,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:30:26,567 INFO L276 IsEmpty]: Start isEmpty. Operand 60474 states and 236710 transitions. [2019-12-26 21:30:26,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 21:30:26,638 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:30:26,638 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-26 21:30:26,639 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-26 21:30:26,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:30:26,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1678286889, now seen corresponding path program 1 times [2019-12-26 21:30:26,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:30:26,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602845360] [2019-12-26 21:30:26,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:30:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:30:26,718 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-26 21:30:26,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602845360] [2019-12-26 21:30:26,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:30:26,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:30:26,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342034161] [2019-12-26 21:30:26,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:30:26,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:30:26,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:30:26,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:30:26,721 INFO L87 Difference]: Start difference. First operand 60474 states and 236710 transitions. Second operand 4 states. [2019-12-26 21:30:26,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:30:26,889 INFO L93 Difference]: Finished difference Result 37598 states and 128471 transitions. [2019-12-26 21:30:26,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:30:26,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-26 21:30:26,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:30:26,945 INFO L225 Difference]: With dead ends: 37598 [2019-12-26 21:30:26,945 INFO L226 Difference]: Without dead ends: 33608 [2019-12-26 21:30:26,946 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-26 21:30:27,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33608 states. [2019-12-26 21:30:28,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33608 to 33608. [2019-12-26 21:30:28,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33608 states. [2019-12-26 21:30:28,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33608 states to 33608 states and 114748 transitions. [2019-12-26 21:30:28,083 INFO L78 Accepts]: Start accepts. Automaton has 33608 states and 114748 transitions. Word has length 33 [2019-12-26 21:30:28,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:30:28,083 INFO L462 AbstractCegarLoop]: Abstraction has 33608 states and 114748 transitions. [2019-12-26 21:30:28,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:30:28,084 INFO L276 IsEmpty]: Start isEmpty. Operand 33608 states and 114748 transitions. [2019-12-26 21:30:28,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 21:30:28,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:30:28,132 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-26 21:30:28,132 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-26 21:30:28,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:30:28,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1346675898, now seen corresponding path program 1 times [2019-12-26 21:30:28,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:30:28,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611863644] [2019-12-26 21:30:28,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:30:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:30:28,205 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-26 21:30:28,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611863644] [2019-12-26 21:30:28,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:30:28,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:30:28,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110635090] [2019-12-26 21:30:28,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:30:28,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:30:28,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:30:28,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:30:28,208 INFO L87 Difference]: Start difference. First operand 33608 states and 114748 transitions. Second operand 5 states. [2019-12-26 21:30:28,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:30:28,292 INFO L93 Difference]: Finished difference Result 7560 states and 22484 transitions. [2019-12-26 21:30:28,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:30:28,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-26 21:30:28,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:30:28,300 INFO L225 Difference]: With dead ends: 7560 [2019-12-26 21:30:28,300 INFO L226 Difference]: Without dead ends: 5436 [2019-12-26 21:30:28,300 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-26 21:30:28,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5436 states. [2019-12-26 21:30:28,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5436 to 5436. [2019-12-26 21:30:28,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5436 states. [2019-12-26 21:30:28,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5436 states to 5436 states and 15272 transitions. [2019-12-26 21:30:28,365 INFO L78 Accepts]: Start accepts. Automaton has 5436 states and 15272 transitions. Word has length 34 [2019-12-26 21:30:28,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:30:28,365 INFO L462 AbstractCegarLoop]: Abstraction has 5436 states and 15272 transitions. [2019-12-26 21:30:28,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:30:28,365 INFO L276 IsEmpty]: Start isEmpty. Operand 5436 states and 15272 transitions. [2019-12-26 21:30:28,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-26 21:30:28,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:30:28,372 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] [2019-12-26 21:30:28,372 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-26 21:30:28,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:30:28,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1224861265, now seen corresponding path program 1 times [2019-12-26 21:30:28,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:30:28,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280150943] [2019-12-26 21:30:28,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:30:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:30:28,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:30:28,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280150943] [2019-12-26 21:30:28,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:30:28,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:30:28,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618321861] [2019-12-26 21:30:28,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:30:28,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:30:28,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:30:28,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:30:28,449 INFO L87 Difference]: Start difference. First operand 5436 states and 15272 transitions. Second operand 4 states. [2019-12-26 21:30:28,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:30:28,490 INFO L93 Difference]: Finished difference Result 6560 states and 17832 transitions. [2019-12-26 21:30:28,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:30:28,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-26 21:30:28,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:30:28,500 INFO L225 Difference]: With dead ends: 6560 [2019-12-26 21:30:28,501 INFO L226 Difference]: Without dead ends: 5447 [2019-12-26 21:30:28,501 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-26 21:30:28,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5447 states. [2019-12-26 21:30:28,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5447 to 5428. [2019-12-26 21:30:28,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5428 states. [2019-12-26 21:30:28,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5428 states to 5428 states and 15184 transitions. [2019-12-26 21:30:28,589 INFO L78 Accepts]: Start accepts. Automaton has 5428 states and 15184 transitions. Word has length 45 [2019-12-26 21:30:28,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:30:28,590 INFO L462 AbstractCegarLoop]: Abstraction has 5428 states and 15184 transitions. [2019-12-26 21:30:28,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:30:28,590 INFO L276 IsEmpty]: Start isEmpty. Operand 5428 states and 15184 transitions. [2019-12-26 21:30:28,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-26 21:30:28,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:30:28,596 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] [2019-12-26 21:30:28,596 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-26 21:30:28,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:30:28,596 INFO L82 PathProgramCache]: Analyzing trace with hash -543745161, now seen corresponding path program 2 times [2019-12-26 21:30:28,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:30:28,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158929504] [2019-12-26 21:30:28,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:30:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:30:28,663 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-26 21:30:28,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158929504] [2019-12-26 21:30:28,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:30:28,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:30:28,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009839951] [2019-12-26 21:30:28,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:30:28,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:30:28,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:30:28,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:30:28,665 INFO L87 Difference]: Start difference. First operand 5428 states and 15184 transitions. Second operand 3 states. [2019-12-26 21:30:28,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:30:28,700 INFO L93 Difference]: Finished difference Result 8397 states and 22373 transitions. [2019-12-26 21:30:28,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:30:28,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-12-26 21:30:28,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:30:28,709 INFO L225 Difference]: With dead ends: 8397 [2019-12-26 21:30:28,709 INFO L226 Difference]: Without dead ends: 5146 [2019-12-26 21:30:28,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-26 21:30:28,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5146 states. [2019-12-26 21:30:28,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5146 to 5089. [2019-12-26 21:30:28,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5089 states. [2019-12-26 21:30:28,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5089 states to 5089 states and 12436 transitions. [2019-12-26 21:30:28,790 INFO L78 Accepts]: Start accepts. Automaton has 5089 states and 12436 transitions. Word has length 45 [2019-12-26 21:30:28,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:30:28,790 INFO L462 AbstractCegarLoop]: Abstraction has 5089 states and 12436 transitions. [2019-12-26 21:30:28,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:30:28,791 INFO L276 IsEmpty]: Start isEmpty. Operand 5089 states and 12436 transitions. [2019-12-26 21:30:28,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-26 21:30:28,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:30:28,798 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] [2019-12-26 21:30:28,798 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-26 21:30:28,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:30:28,799 INFO L82 PathProgramCache]: Analyzing trace with hash 386811681, now seen corresponding path program 3 times [2019-12-26 21:30:28,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:30:28,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261376929] [2019-12-26 21:30:28,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:30:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:30:28,871 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-26 21:30:28,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261376929] [2019-12-26 21:30:28,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:30:28,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:30:28,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793080803] [2019-12-26 21:30:28,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:30:28,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:30:28,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:30:28,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:30:28,873 INFO L87 Difference]: Start difference. First operand 5089 states and 12436 transitions. Second operand 5 states. [2019-12-26 21:30:28,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:30:28,989 INFO L93 Difference]: Finished difference Result 8512 states and 20986 transitions. [2019-12-26 21:30:28,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:30:28,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-26 21:30:28,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:30:29,000 INFO L225 Difference]: With dead ends: 8512 [2019-12-26 21:30:29,000 INFO L226 Difference]: Without dead ends: 6789 [2019-12-26 21:30:29,000 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-26 21:30:29,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6789 states. [2019-12-26 21:30:29,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6789 to 6789. [2019-12-26 21:30:29,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6789 states. [2019-12-26 21:30:29,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6789 states to 6789 states and 16978 transitions. [2019-12-26 21:30:29,085 INFO L78 Accepts]: Start accepts. Automaton has 6789 states and 16978 transitions. Word has length 45 [2019-12-26 21:30:29,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:30:29,085 INFO L462 AbstractCegarLoop]: Abstraction has 6789 states and 16978 transitions. [2019-12-26 21:30:29,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:30:29,085 INFO L276 IsEmpty]: Start isEmpty. Operand 6789 states and 16978 transitions. [2019-12-26 21:30:29,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-26 21:30:29,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:30:29,091 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:30:29,091 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-26 21:30:29,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:30:29,092 INFO L82 PathProgramCache]: Analyzing trace with hash -78055340, now seen corresponding path program 1 times [2019-12-26 21:30:29,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:30:29,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49194766] [2019-12-26 21:30:29,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:30:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:30:29,170 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-26 21:30:29,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49194766] [2019-12-26 21:30:29,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:30:29,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:30:29,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396071427] [2019-12-26 21:30:29,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:30:29,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:30:29,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:30:29,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:30:29,172 INFO L87 Difference]: Start difference. First operand 6789 states and 16978 transitions. Second operand 5 states. [2019-12-26 21:30:29,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:30:29,576 INFO L93 Difference]: Finished difference Result 7713 states and 18946 transitions. [2019-12-26 21:30:29,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:30:29,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-26 21:30:29,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:30:29,587 INFO L225 Difference]: With dead ends: 7713 [2019-12-26 21:30:29,588 INFO L226 Difference]: Without dead ends: 7713 [2019-12-26 21:30:29,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:30:29,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7713 states. [2019-12-26 21:30:29,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7713 to 7425. [2019-12-26 21:30:29,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7425 states. [2019-12-26 21:30:29,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7425 states to 7425 states and 18388 transitions. [2019-12-26 21:30:29,677 INFO L78 Accepts]: Start accepts. Automaton has 7425 states and 18388 transitions. Word has length 46 [2019-12-26 21:30:29,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:30:29,677 INFO L462 AbstractCegarLoop]: Abstraction has 7425 states and 18388 transitions. [2019-12-26 21:30:29,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:30:29,678 INFO L276 IsEmpty]: Start isEmpty. Operand 7425 states and 18388 transitions. [2019-12-26 21:30:29,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-26 21:30:29,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:30:29,686 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:30:29,686 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-26 21:30:29,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:30:29,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1124747, now seen corresponding path program 1 times [2019-12-26 21:30:29,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:30:29,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778324053] [2019-12-26 21:30:29,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:30:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:30:29,808 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-26 21:30:29,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778324053] [2019-12-26 21:30:29,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:30:29,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:30:29,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919051281] [2019-12-26 21:30:29,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:30:29,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:30:29,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:30:29,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:30:29,812 INFO L87 Difference]: Start difference. First operand 7425 states and 18388 transitions. Second operand 6 states. [2019-12-26 21:30:29,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:30:29,921 INFO L93 Difference]: Finished difference Result 6200 states and 15448 transitions. [2019-12-26 21:30:29,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:30:29,922 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-26 21:30:29,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:30:29,924 INFO L225 Difference]: With dead ends: 6200 [2019-12-26 21:30:29,924 INFO L226 Difference]: Without dead ends: 730 [2019-12-26 21:30:29,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:30:29,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-12-26 21:30:29,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 718. [2019-12-26 21:30:29,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2019-12-26 21:30:29,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1536 transitions. [2019-12-26 21:30:29,941 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1536 transitions. Word has length 47 [2019-12-26 21:30:29,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:30:29,942 INFO L462 AbstractCegarLoop]: Abstraction has 718 states and 1536 transitions. [2019-12-26 21:30:29,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:30:29,942 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1536 transitions. [2019-12-26 21:30:29,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-26 21:30:29,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:30:29,944 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] [2019-12-26 21:30:29,944 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-26 21:30:29,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:30:29,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1276870801, now seen corresponding path program 1 times [2019-12-26 21:30:29,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:30:29,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762992803] [2019-12-26 21:30:29,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:30:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:30:30,097 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-26 21:30:30,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762992803] [2019-12-26 21:30:30,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:30:30,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:30:30,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107427006] [2019-12-26 21:30:30,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:30:30,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:30:30,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:30:30,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:30:30,099 INFO L87 Difference]: Start difference. First operand 718 states and 1536 transitions. Second operand 8 states. [2019-12-26 21:30:30,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:30:30,357 INFO L93 Difference]: Finished difference Result 1829 states and 3867 transitions. [2019-12-26 21:30:30,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 21:30:30,358 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-12-26 21:30:30,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:30:30,360 INFO L225 Difference]: With dead ends: 1829 [2019-12-26 21:30:30,360 INFO L226 Difference]: Without dead ends: 1473 [2019-12-26 21:30:30,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-26 21:30:30,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2019-12-26 21:30:30,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 813. [2019-12-26 21:30:30,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-12-26 21:30:30,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1733 transitions. [2019-12-26 21:30:30,377 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1733 transitions. Word has length 62 [2019-12-26 21:30:30,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:30:30,377 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1733 transitions. [2019-12-26 21:30:30,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:30:30,377 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1733 transitions. [2019-12-26 21:30:30,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-26 21:30:30,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:30:30,379 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] [2019-12-26 21:30:30,379 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-26 21:30:30,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:30:30,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1241781053, now seen corresponding path program 2 times [2019-12-26 21:30:30,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:30:30,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031166590] [2019-12-26 21:30:30,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:30:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:30:30,559 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-26 21:30:30,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031166590] [2019-12-26 21:30:30,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:30:30,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:30:30,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698530694] [2019-12-26 21:30:30,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:30:30,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:30:30,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:30:30,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:30:30,562 INFO L87 Difference]: Start difference. First operand 813 states and 1733 transitions. Second operand 9 states. [2019-12-26 21:30:31,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:30:31,426 INFO L93 Difference]: Finished difference Result 1834 states and 3897 transitions. [2019-12-26 21:30:31,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:30:31,426 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2019-12-26 21:30:31,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:30:31,428 INFO L225 Difference]: With dead ends: 1834 [2019-12-26 21:30:31,428 INFO L226 Difference]: Without dead ends: 1834 [2019-12-26 21:30:31,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-26 21:30:31,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2019-12-26 21:30:31,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1006. [2019-12-26 21:30:31,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2019-12-26 21:30:31,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 2166 transitions. [2019-12-26 21:30:31,440 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 2166 transitions. Word has length 62 [2019-12-26 21:30:31,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:30:31,440 INFO L462 AbstractCegarLoop]: Abstraction has 1006 states and 2166 transitions. [2019-12-26 21:30:31,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:30:31,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 2166 transitions. [2019-12-26 21:30:31,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-26 21:30:31,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:30:31,442 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:30:31,442 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-26 21:30:31,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:30:31,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1690536267, now seen corresponding path program 3 times [2019-12-26 21:30:31,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:30:31,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944940505] [2019-12-26 21:30:31,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:30:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:30:31,526 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-26 21:30:31,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944940505] [2019-12-26 21:30:31,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:30:31,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:30:31,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539323793] [2019-12-26 21:30:31,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:30:31,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:30:31,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:30:31,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:30:31,530 INFO L87 Difference]: Start difference. First operand 1006 states and 2166 transitions. Second operand 3 states. [2019-12-26 21:30:31,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:30:31,542 INFO L93 Difference]: Finished difference Result 1006 states and 2165 transitions. [2019-12-26 21:30:31,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:30:31,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-26 21:30:31,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:30:31,544 INFO L225 Difference]: With dead ends: 1006 [2019-12-26 21:30:31,545 INFO L226 Difference]: Without dead ends: 1006 [2019-12-26 21:30:31,545 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-26 21:30:31,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-12-26 21:30:31,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 888. [2019-12-26 21:30:31,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2019-12-26 21:30:31,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1934 transitions. [2019-12-26 21:30:31,560 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1934 transitions. Word has length 62 [2019-12-26 21:30:31,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:30:31,561 INFO L462 AbstractCegarLoop]: Abstraction has 888 states and 1934 transitions. [2019-12-26 21:30:31,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:30:31,561 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1934 transitions. [2019-12-26 21:30:31,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 21:30:31,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:30:31,562 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-26 21:30:31,562 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:30:31,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:30:31,563 INFO L82 PathProgramCache]: Analyzing trace with hash 222753420, now seen corresponding path program 1 times [2019-12-26 21:30:31,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:30:31,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447408961] [2019-12-26 21:30:31,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:30:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:30:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:30:31,704 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:30:31,704 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:30:31,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1029] [1029] ULTIMATE.startENTRY-->L838: Formula: (let ((.cse0 (store |v_#valid_69| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_40) (= 0 v_~z$flush_delayed~0_312) (= v_~z$r_buff0_thd1~0_133 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$r_buff1_thd3~0_369) (= v_~__unbuffered_p2_EBX~0_30 0) (= v_~x~0_59 0) (= v_~z$read_delayed~0_6 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t284~0.base_31| 4) |v_#length_23|) (= v_~main$tmp_guard1~0_30 0) (= v_~z$w_buff0~0_407 0) (= v_~z$r_buff1_thd0~0_262 0) (= v_~z$r_buff1_thd1~0_201 0) (= 0 v_~__unbuffered_p1_EAX~0_53) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$mem_tmp~0_246) (= v_~z$r_buff1_thd2~0_361 0) (= |v_ULTIMATE.start_main_~#t284~0.offset_23| 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$w_buff0_used~0_953 0) (= v_~z$r_buff0_thd0~0_190 0) (= v_~a~0_20 0) (= v_~weak$$choice2~0_312 0) (= 0 |v_#NULL.base_6|) (= v_~__unbuffered_p1_EBX~0_29 0) (= 0 v_~z$r_buff0_thd3~0_586) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$w_buff1~0_282 0) (= v_~z$w_buff1_used~0_540 0) (= v_~z$r_buff0_thd2~0_401 0) (= 0 v_~weak$$choice0~0_233) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t284~0.base_31| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t284~0.base_31|) |v_ULTIMATE.start_main_~#t284~0.offset_23| 0)) |v_#memory_int_23|) (= v_~main$tmp_guard0~0_32 0) (= v_~__unbuffered_cnt~0_150 0) (= |v_#valid_67| (store .cse0 |v_ULTIMATE.start_main_~#t284~0.base_31| 1)) (= (select .cse0 |v_ULTIMATE.start_main_~#t284~0.base_31|) 0) (= v_~y~0_37 0) (= v_~z~0_322 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t284~0.base_31|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t285~0.base=|v_ULTIMATE.start_main_~#t285~0.base_22|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_21|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_361, #NULL.offset=|v_#NULL.offset_6|, ~a~0=v_~a~0_20, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_190, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_40, ~z$mem_tmp~0=v_~z$mem_tmp~0_246, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_58|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_540, ~z$flush_delayed~0=v_~z$flush_delayed~0_312, ULTIMATE.start_main_~#t286~0.offset=|v_ULTIMATE.start_main_~#t286~0.offset_18|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_52|, ULTIMATE.start_main_~#t285~0.offset=|v_ULTIMATE.start_main_~#t285~0.offset_18|, ~weak$$choice0~0=v_~weak$$choice0~0_233, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_40|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_201, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_586, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_150, ULTIMATE.start_main_~#t284~0.base=|v_ULTIMATE.start_main_~#t284~0.base_31|, ~x~0=v_~x~0_59, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_282, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t284~0.offset=|v_ULTIMATE.start_main_~#t284~0.offset_23|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_262, ~y~0=v_~y~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_401, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_953, ~z$w_buff0~0=v_~z$w_buff0~0_407, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_369, ULTIMATE.start_main_~#t286~0.base=|v_ULTIMATE.start_main_~#t286~0.base_22|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_73|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_446|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_322, ~weak$$choice2~0=v_~weak$$choice2~0_312, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_133} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t285~0.base, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t286~0.offset, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_~#t285~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t284~0.base, ~x~0, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t284~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t286~0.base, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:30:31,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [974] [974] L838-1-->L840: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t285~0.base_10| 4)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t285~0.base_10| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t285~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t285~0.base_10|) |v_ULTIMATE.start_main_~#t285~0.offset_9| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t285~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t285~0.offset_9|) (not (= |v_ULTIMATE.start_main_~#t285~0.base_10| 0)) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t285~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t285~0.offset=|v_ULTIMATE.start_main_~#t285~0.offset_9|, ULTIMATE.start_main_~#t285~0.base=|v_ULTIMATE.start_main_~#t285~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t285~0.offset, ULTIMATE.start_main_~#t285~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 21:30:31,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L840-1-->L842: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t286~0.base_11|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t286~0.base_11| 4) |v_#length_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t286~0.base_11|) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t286~0.base_11| 1)) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t286~0.base_11|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t286~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t286~0.base_11|) |v_ULTIMATE.start_main_~#t286~0.offset_10| 2)) |v_#memory_int_17|) (= |v_ULTIMATE.start_main_~#t286~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t286~0.base=|v_ULTIMATE.start_main_~#t286~0.base_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t286~0.offset=|v_ULTIMATE.start_main_~#t286~0.offset_10|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t286~0.base, #length, ULTIMATE.start_main_~#t286~0.offset] because there is no mapped edge [2019-12-26 21:30:31,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] P2ENTRY-->L4-3: Formula: (and (= (mod v_~z$w_buff1_used~0_82 256) 0) (= v_~z$w_buff0~0_55 v_~z$w_buff1~0_45) (= v_~z$w_buff0_used~0_158 v_~z$w_buff1_used~0_82) (= 1 v_~z$w_buff0~0_54) (= v_~z$w_buff0_used~0_157 1) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_19|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_19| v_P2Thread1of1ForFork0_~arg.offset_19) (= |v_P2Thread1of1ForFork0_#in~arg.base_19| v_P2Thread1of1ForFork0_~arg.base_19) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_21 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_19|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_158, ~z$w_buff0~0=v_~z$w_buff0~0_55, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_19|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_19, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_19|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_157, ~z$w_buff0~0=v_~z$w_buff0~0_54, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$w_buff1~0=v_~z$w_buff1~0_45, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_19|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_21} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 21:30:31,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [954] [954] L800-2-->L800-5: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In642552568 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In642552568 256))) (.cse2 (= |P2Thread1of1ForFork0_#t~ite29_Out642552568| |P2Thread1of1ForFork0_#t~ite28_Out642552568|))) (or (and (not .cse0) (= ~z$w_buff0~0_In642552568 |P2Thread1of1ForFork0_#t~ite28_Out642552568|) (not .cse1) .cse2) (and (= ~z$w_buff1~0_In642552568 |P2Thread1of1ForFork0_#t~ite28_Out642552568|) (or .cse0 .cse1) .cse2))) InVars {~z$w_buff0~0=~z$w_buff0~0_In642552568, ~z$w_buff0_used~0=~z$w_buff0_used~0_In642552568, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In642552568, ~z$w_buff1~0=~z$w_buff1~0_In642552568} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out642552568|, ~z$w_buff0~0=~z$w_buff0~0_In642552568, ~z$w_buff0_used~0=~z$w_buff0_used~0_In642552568, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In642552568, ~z$w_buff1~0=~z$w_buff1~0_In642552568, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out642552568|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 21:30:31,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L805-->L806: Formula: (and (= v_~z$r_buff0_thd3~0_95 v_~z$r_buff0_thd3~0_94) (not (= (mod v_~weak$$choice2~0_47 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_47} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_11|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_94, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_8|, ~weak$$choice2~0=v_~weak$$choice2~0_47} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-26 21:30:31,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In1363775995 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out1363775995| ~z$mem_tmp~0_In1363775995)) (and (= ~z~0_In1363775995 |P2Thread1of1ForFork0_#t~ite48_Out1363775995|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1363775995, ~z$flush_delayed~0=~z$flush_delayed~0_In1363775995, ~z~0=~z~0_In1363775995} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out1363775995|, ~z$mem_tmp~0=~z$mem_tmp~0_In1363775995, ~z$flush_delayed~0=~z$flush_delayed~0_In1363775995, ~z~0=~z~0_In1363775995} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-26 21:30:31,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_36 1) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_P0Thread1of1ForFork1_~arg.base_9 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89) (= v_~a~0_13 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|) (= v_P0Thread1of1ForFork1_~arg.offset_9 |v_P0Thread1of1ForFork1_#in~arg.offset_9|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|} OutVars{~a~0=v_~a~0_13, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~x~0=v_~x~0_36, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_9} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-26 21:30:31,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In2091585055 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In2091585055 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite51_Out2091585055| ~z$w_buff0_used~0_In2091585055) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite51_Out2091585055| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2091585055, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2091585055} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2091585055, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2091585055, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out2091585055|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-26 21:30:31,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L817-->L817-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-1096785384 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1096785384 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1096785384 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1096785384 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite52_Out-1096785384| ~z$w_buff1_used~0_In-1096785384) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite52_Out-1096785384| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1096785384, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1096785384, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1096785384, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1096785384} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1096785384, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1096785384, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1096785384, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-1096785384|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1096785384} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-26 21:30:31,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L818-->L819: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-316351916 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-316351916 256) 0))) (or (and (= 0 ~z$r_buff0_thd3~0_Out-316351916) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd3~0_In-316351916 ~z$r_buff0_thd3~0_Out-316351916) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-316351916, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-316351916} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-316351916, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-316351916, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-316351916|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-26 21:30:31,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In757557388 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In757557388 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In757557388 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In757557388 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite54_Out757557388| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$r_buff1_thd3~0_In757557388 |P2Thread1of1ForFork0_#t~ite54_Out757557388|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In757557388, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In757557388, ~z$w_buff1_used~0=~z$w_buff1_used~0_In757557388, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In757557388} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In757557388, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out757557388|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In757557388, ~z$w_buff1_used~0=~z$w_buff1_used~0_In757557388, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In757557388} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-26 21:30:31,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L819-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~__unbuffered_cnt~0_121 (+ v_~__unbuffered_cnt~0_122 1)) (= v_~z$r_buff1_thd3~0_301 |v_P2Thread1of1ForFork0_#t~ite54_32|)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_122} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_31|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_301, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_121, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-26 21:30:31,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In1330274368 256) 0))) (or (and .cse0 (= ~z~0_In1330274368 |P1Thread1of1ForFork2_#t~ite25_Out1330274368|)) (and (= |P1Thread1of1ForFork2_#t~ite25_Out1330274368| ~z$mem_tmp~0_In1330274368) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1330274368, ~z$flush_delayed~0=~z$flush_delayed~0_In1330274368, ~z~0=~z~0_In1330274368} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1330274368, ~z$flush_delayed~0=~z$flush_delayed~0_In1330274368, ~z~0=~z~0_In1330274368, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out1330274368|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-26 21:30:31,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L771-2-->P1EXIT: Formula: (and (= v_~z~0_145 |v_P1Thread1of1ForFork2_#t~ite25_58|) (= 0 v_~z$flush_delayed~0_126) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_58|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~z$flush_delayed~0=v_~z$flush_delayed~0_126, ~z~0=v_~z~0_145, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_57|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-26 21:30:31,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] L846-->L848-2: Formula: (and (or (= 0 (mod v_~z$r_buff0_thd0~0_18 256)) (= 0 (mod v_~z$w_buff0_used~0_136 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_136, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_136, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 21:30:31,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L848-2-->L848-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite58_Out-485859912| |ULTIMATE.start_main_#t~ite59_Out-485859912|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-485859912 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-485859912 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In-485859912 |ULTIMATE.start_main_#t~ite58_Out-485859912|) .cse2) (and (= |ULTIMATE.start_main_#t~ite58_Out-485859912| ~z$w_buff1~0_In-485859912) .cse2 (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-485859912, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-485859912, ~z$w_buff1~0=~z$w_buff1~0_In-485859912, ~z~0=~z~0_In-485859912} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-485859912, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-485859912|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-485859912, ~z$w_buff1~0=~z$w_buff1~0_In-485859912, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-485859912|, ~z~0=~z~0_In-485859912} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-26 21:30:31,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L849-->L849-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In756281104 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In756281104 256)))) (or (and (= ~z$w_buff0_used~0_In756281104 |ULTIMATE.start_main_#t~ite60_Out756281104|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite60_Out756281104|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In756281104, ~z$w_buff0_used~0=~z$w_buff0_used~0_In756281104} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out756281104|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In756281104, ~z$w_buff0_used~0=~z$w_buff0_used~0_In756281104} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-26 21:30:31,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L850-->L850-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In-1468770640 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1468770640 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1468770640 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1468770640 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite61_Out-1468770640| ~z$w_buff1_used~0_In-1468770640)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite61_Out-1468770640| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1468770640, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1468770640, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1468770640, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1468770640} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1468770640, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1468770640|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1468770640, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1468770640, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1468770640} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-26 21:30:31,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L851-->L851-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2081311473 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In2081311473 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out2081311473| ~z$r_buff0_thd0~0_In2081311473)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite62_Out2081311473| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2081311473, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2081311473} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out2081311473|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2081311473, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2081311473} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-26 21:30:31,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L852-->L852-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In367054571 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In367054571 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In367054571 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In367054571 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite63_Out367054571|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd0~0_In367054571 |ULTIMATE.start_main_#t~ite63_Out367054571|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In367054571, ~z$w_buff0_used~0=~z$w_buff0_used~0_In367054571, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In367054571, ~z$w_buff1_used~0=~z$w_buff1_used~0_In367054571} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out367054571|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In367054571, ~z$w_buff0_used~0=~z$w_buff0_used~0_In367054571, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In367054571, ~z$w_buff1_used~0=~z$w_buff1_used~0_In367054571} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-26 21:30:31,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1022] [1022] L852-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_31) (= v_~x~0_50 2) (= v_~__unbuffered_p1_EBX~0_20 0) (= v_~main$tmp_guard1~0_21 0) (= v_~__unbuffered_p2_EBX~0_21 0) (= v_~z$r_buff1_thd0~0_249 |v_ULTIMATE.start_main_#t~ite63_36|) (= (mod v_~main$tmp_guard1~0_21 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= 1 v_~__unbuffered_p1_EAX~0_44) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_36|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~x~0=v_~x~0_50} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_35|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_249, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~x~0=v_~x~0_50, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 21:30:31,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:30:31 BasicIcfg [2019-12-26 21:30:31,895 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:30:31,898 INFO L168 Benchmark]: Toolchain (without parser) took 48234.15 ms. Allocated memory was 138.9 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 102.5 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 866.8 MB. Max. memory is 7.1 GB. [2019-12-26 21:30:31,901 INFO L168 Benchmark]: CDTParser took 0.84 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-26 21:30:31,904 INFO L168 Benchmark]: CACSL2BoogieTranslator took 826.63 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 102.1 MB in the beginning and 155.9 MB in the end (delta: -53.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-12-26 21:30:31,906 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.44 ms. Allocated memory is still 202.9 MB. Free memory was 155.9 MB in the beginning and 152.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-26 21:30:31,906 INFO L168 Benchmark]: Boogie Preprocessor took 41.19 ms. Allocated memory is still 202.9 MB. Free memory was 152.7 MB in the beginning and 150.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 21:30:31,907 INFO L168 Benchmark]: RCFGBuilder took 907.70 ms. Allocated memory is still 202.9 MB. Free memory was 150.0 MB in the beginning and 94.4 MB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 7.1 GB. [2019-12-26 21:30:31,907 INFO L168 Benchmark]: TraceAbstraction took 46376.14 ms. Allocated memory was 202.9 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 94.4 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 794.8 MB. Max. memory is 7.1 GB. [2019-12-26 21:30:31,915 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.84 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 826.63 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 102.1 MB in the beginning and 155.9 MB in the end (delta: -53.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.44 ms. Allocated memory is still 202.9 MB. Free memory was 155.9 MB in the beginning and 152.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.19 ms. Allocated memory is still 202.9 MB. Free memory was 152.7 MB in the beginning and 150.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 907.70 ms. Allocated memory is still 202.9 MB. Free memory was 150.0 MB in the beginning and 94.4 MB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 46376.14 ms. Allocated memory was 202.9 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 94.4 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 794.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.8s, 196 ProgramPointsBefore, 103 ProgramPointsAfterwards, 242 TransitionsBefore, 122 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 31 ChoiceCompositions, 9041 VarBasedMoverChecksPositive, 312 VarBasedMoverChecksNegative, 82 SemBasedMoverChecksPositive, 320 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.3s, 0 MoverChecksTotal, 115591 CheckedPairsTotal, 128 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L838] FCALL, FORK 0 pthread_create(&t284, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] FCALL, FORK 0 pthread_create(&t285, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] FCALL, FORK 0 pthread_create(&t286, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L790] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L791] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L792] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L793] 3 z$r_buff0_thd3 = (_Bool)1 [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 z$flush_delayed = weak$$choice2 [L799] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L801] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L802] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L803] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L804] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L806] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 z = z$flush_delayed ? z$mem_tmp : z [L809] 3 z$flush_delayed = (_Bool)0 [L812] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 y = 1 [L756] 2 __unbuffered_p1_EAX = y [L759] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 2 z$flush_delayed = weak$$choice2 [L762] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L763] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L763] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L764] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L765] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L766] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L767] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L769] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 187 locations, 2 error locations. Result: UNSAFE, OverallTime: 45.9s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2905 SDtfs, 3742 SDslu, 4900 SDs, 0 SdLazy, 1961 SolverSat, 124 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64544occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 21.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 25918 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 639 NumberOfCodeBlocks, 639 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 560 ConstructedInterpolants, 0 QuantifiedInterpolants, 68133 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...