/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix012_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:23:24,244 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:23:24,247 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:23:24,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:23:24,266 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:23:24,268 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:23:24,270 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:23:24,280 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:23:24,283 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:23:24,286 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:23:24,288 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:23:24,290 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:23:24,290 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:23:24,292 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:23:24,294 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:23:24,296 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:23:24,297 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:23:24,298 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:23:24,299 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:23:24,304 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:23:24,308 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:23:24,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:23:24,314 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:23:24,314 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:23:24,317 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:23:24,317 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:23:24,317 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:23:24,319 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:23:24,320 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:23:24,321 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:23:24,321 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:23:24,322 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:23:24,322 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:23:24,324 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:23:24,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:23:24,325 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:23:24,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:23:24,326 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:23:24,326 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:23:24,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:23:24,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:23:24,329 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 16:23:24,361 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:23:24,361 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:23:24,366 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:23:24,366 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:23:24,366 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:23:24,366 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:23:24,367 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:23:24,367 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:23:24,367 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:23:24,367 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:23:24,367 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:23:24,367 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:23:24,368 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:23:24,373 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:23:24,373 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:23:24,373 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:23:24,373 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:23:24,374 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:23:24,374 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:23:24,374 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:23:24,374 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:23:24,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:23:24,375 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:23:24,375 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:23:24,375 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:23:24,375 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:23:24,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:23:24,376 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:23:24,376 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:23:24,665 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:23:24,684 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:23:24,687 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:23:24,689 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:23:24,689 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:23:24,690 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_tso.opt.i [2019-12-18 16:23:24,764 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bcc4646d/396b569735054dad9bdb8a01bc74f133/FLAGfc20f4452 [2019-12-18 16:23:25,347 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:23:25,348 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_tso.opt.i [2019-12-18 16:23:25,374 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bcc4646d/396b569735054dad9bdb8a01bc74f133/FLAGfc20f4452 [2019-12-18 16:23:25,611 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bcc4646d/396b569735054dad9bdb8a01bc74f133 [2019-12-18 16:23:25,622 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:23:25,625 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:23:25,627 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:23:25,627 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:23:25,632 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:23:25,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:23:25" (1/1) ... [2019-12-18 16:23:25,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@115225be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:25, skipping insertion in model container [2019-12-18 16:23:25,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:23:25" (1/1) ... [2019-12-18 16:23:25,647 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:23:25,717 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:23:26,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:23:26,301 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:23:26,424 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:23:26,504 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:23:26,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:26 WrapperNode [2019-12-18 16:23:26,506 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:23:26,506 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:23:26,507 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:23:26,507 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:23:26,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:26" (1/1) ... [2019-12-18 16:23:26,540 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:26" (1/1) ... [2019-12-18 16:23:26,580 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:23:26,581 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:23:26,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:23:26,584 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:23:26,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:26" (1/1) ... [2019-12-18 16:23:26,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:26" (1/1) ... [2019-12-18 16:23:26,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:26" (1/1) ... [2019-12-18 16:23:26,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:26" (1/1) ... [2019-12-18 16:23:26,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:26" (1/1) ... [2019-12-18 16:23:26,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:26" (1/1) ... [2019-12-18 16:23:26,631 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:26" (1/1) ... [2019-12-18 16:23:26,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:23:26,643 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:23:26,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:23:26,644 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:23:26,645 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:23:26,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:23:26,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:23:26,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:23:26,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:23:26,706 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:23:26,707 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:23:26,707 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:23:26,707 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:23:26,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:23:26,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:23:26,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:23:26,710 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 16:23:27,527 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:23:27,527 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:23:27,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:23:27 BoogieIcfgContainer [2019-12-18 16:23:27,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:23:27,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:23:27,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:23:27,533 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:23:27,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:23:25" (1/3) ... [2019-12-18 16:23:27,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399834f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:23:27, skipping insertion in model container [2019-12-18 16:23:27,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:26" (2/3) ... [2019-12-18 16:23:27,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399834f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:23:27, skipping insertion in model container [2019-12-18 16:23:27,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:23:27" (3/3) ... [2019-12-18 16:23:27,537 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_tso.opt.i [2019-12-18 16:23:27,548 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:23:27,549 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:23:27,562 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:23:27,563 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:23:27,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,630 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,630 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,651 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,651 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,651 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,651 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,652 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,679 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,680 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,687 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,688 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,691 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:27,709 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 16:23:27,733 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:23:27,733 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:23:27,733 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:23:27,733 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:23:27,734 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:23:27,734 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:23:27,734 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:23:27,734 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:23:27,753 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 227 transitions [2019-12-18 16:23:27,755 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 227 transitions [2019-12-18 16:23:27,869 INFO L126 PetriNetUnfolder]: 56/225 cut-off events. [2019-12-18 16:23:27,869 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:23:27,896 INFO L76 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 225 events. 56/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 561 event pairs. 6/173 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-18 16:23:27,930 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 227 transitions [2019-12-18 16:23:28,015 INFO L126 PetriNetUnfolder]: 56/225 cut-off events. [2019-12-18 16:23:28,016 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:23:28,027 INFO L76 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 225 events. 56/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 561 event pairs. 6/173 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-18 16:23:28,055 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-18 16:23:28,056 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:23:28,469 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2019-12-18 16:23:33,261 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 16:23:33,372 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 16:23:33,470 INFO L206 etLargeBlockEncoding]: Checked pairs total: 122314 [2019-12-18 16:23:33,471 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 16:23:33,474 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 103 places, 126 transitions [2019-12-18 16:23:35,051 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 24222 states. [2019-12-18 16:23:35,053 INFO L276 IsEmpty]: Start isEmpty. Operand 24222 states. [2019-12-18 16:23:35,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 16:23:35,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:35,058 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 16:23:35,058 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:35,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:35,063 INFO L82 PathProgramCache]: Analyzing trace with hash 958600405, now seen corresponding path program 1 times [2019-12-18 16:23:35,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:35,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652263765] [2019-12-18 16:23:35,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:35,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:23:35,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652263765] [2019-12-18 16:23:35,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:35,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:23:35,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745983719] [2019-12-18 16:23:35,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:23:35,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:35,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:23:35,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:23:35,304 INFO L87 Difference]: Start difference. First operand 24222 states. Second operand 3 states. [2019-12-18 16:23:36,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:36,002 INFO L93 Difference]: Finished difference Result 24022 states and 85786 transitions. [2019-12-18 16:23:36,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:23:36,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 16:23:36,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:36,227 INFO L225 Difference]: With dead ends: 24022 [2019-12-18 16:23:36,227 INFO L226 Difference]: Without dead ends: 22482 [2019-12-18 16:23:36,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:23:36,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22482 states. [2019-12-18 16:23:38,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22482 to 22482. [2019-12-18 16:23:38,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22482 states. [2019-12-18 16:23:38,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22482 states to 22482 states and 80227 transitions. [2019-12-18 16:23:38,190 INFO L78 Accepts]: Start accepts. Automaton has 22482 states and 80227 transitions. Word has length 5 [2019-12-18 16:23:38,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:38,191 INFO L462 AbstractCegarLoop]: Abstraction has 22482 states and 80227 transitions. [2019-12-18 16:23:38,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:23:38,191 INFO L276 IsEmpty]: Start isEmpty. Operand 22482 states and 80227 transitions. [2019-12-18 16:23:38,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 16:23:38,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:38,198 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:38,199 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:38,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:38,200 INFO L82 PathProgramCache]: Analyzing trace with hash -131274802, now seen corresponding path program 1 times [2019-12-18 16:23:38,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:38,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079187358] [2019-12-18 16:23:38,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:38,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:23:38,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079187358] [2019-12-18 16:23:38,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:38,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:23:38,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885734203] [2019-12-18 16:23:38,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:23:38,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:38,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:23:38,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:23:38,403 INFO L87 Difference]: Start difference. First operand 22482 states and 80227 transitions. Second operand 4 states. [2019-12-18 16:23:39,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:39,345 INFO L93 Difference]: Finished difference Result 34872 states and 119343 transitions. [2019-12-18 16:23:39,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:23:39,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 16:23:39,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:39,504 INFO L225 Difference]: With dead ends: 34872 [2019-12-18 16:23:39,505 INFO L226 Difference]: Without dead ends: 34857 [2019-12-18 16:23:39,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:23:40,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34857 states. [2019-12-18 16:23:40,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34857 to 33973. [2019-12-18 16:23:40,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33973 states. [2019-12-18 16:23:40,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33973 states to 33973 states and 117000 transitions. [2019-12-18 16:23:40,998 INFO L78 Accepts]: Start accepts. Automaton has 33973 states and 117000 transitions. Word has length 11 [2019-12-18 16:23:40,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:40,998 INFO L462 AbstractCegarLoop]: Abstraction has 33973 states and 117000 transitions. [2019-12-18 16:23:40,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:23:40,999 INFO L276 IsEmpty]: Start isEmpty. Operand 33973 states and 117000 transitions. [2019-12-18 16:23:41,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 16:23:41,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:41,008 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:41,008 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:41,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:41,008 INFO L82 PathProgramCache]: Analyzing trace with hash -570349916, now seen corresponding path program 1 times [2019-12-18 16:23:41,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:41,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368630834] [2019-12-18 16:23:41,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:41,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:23:41,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368630834] [2019-12-18 16:23:41,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:41,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:23:41,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709318212] [2019-12-18 16:23:41,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:23:41,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:41,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:23:41,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:23:41,092 INFO L87 Difference]: Start difference. First operand 33973 states and 117000 transitions. Second operand 4 states. [2019-12-18 16:23:42,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:42,632 INFO L93 Difference]: Finished difference Result 43608 states and 147815 transitions. [2019-12-18 16:23:42,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:23:42,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 16:23:42,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:42,755 INFO L225 Difference]: With dead ends: 43608 [2019-12-18 16:23:42,755 INFO L226 Difference]: Without dead ends: 43594 [2019-12-18 16:23:42,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:23:43,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43594 states. [2019-12-18 16:23:44,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43594 to 39207. [2019-12-18 16:23:44,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39207 states. [2019-12-18 16:23:44,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39207 states to 39207 states and 134217 transitions. [2019-12-18 16:23:44,289 INFO L78 Accepts]: Start accepts. Automaton has 39207 states and 134217 transitions. Word has length 14 [2019-12-18 16:23:44,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:44,290 INFO L462 AbstractCegarLoop]: Abstraction has 39207 states and 134217 transitions. [2019-12-18 16:23:44,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:23:44,290 INFO L276 IsEmpty]: Start isEmpty. Operand 39207 states and 134217 transitions. [2019-12-18 16:23:44,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 16:23:44,296 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:44,296 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:44,297 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:44,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:44,297 INFO L82 PathProgramCache]: Analyzing trace with hash -500949887, now seen corresponding path program 1 times [2019-12-18 16:23:44,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:44,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658933783] [2019-12-18 16:23:44,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:44,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:23:44,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658933783] [2019-12-18 16:23:44,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:44,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:23:44,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184219250] [2019-12-18 16:23:44,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:23:44,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:44,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:23:44,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:23:44,341 INFO L87 Difference]: Start difference. First operand 39207 states and 134217 transitions. Second operand 3 states. [2019-12-18 16:23:45,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:45,015 INFO L93 Difference]: Finished difference Result 65918 states and 215197 transitions. [2019-12-18 16:23:45,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:23:45,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 16:23:45,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:45,142 INFO L225 Difference]: With dead ends: 65918 [2019-12-18 16:23:45,142 INFO L226 Difference]: Without dead ends: 65918 [2019-12-18 16:23:45,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:23:45,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65918 states. [2019-12-18 16:23:46,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65918 to 58476. [2019-12-18 16:23:46,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58476 states. [2019-12-18 16:23:46,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58476 states to 58476 states and 193967 transitions. [2019-12-18 16:23:46,809 INFO L78 Accepts]: Start accepts. Automaton has 58476 states and 193967 transitions. Word has length 15 [2019-12-18 16:23:46,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:46,809 INFO L462 AbstractCegarLoop]: Abstraction has 58476 states and 193967 transitions. [2019-12-18 16:23:46,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:23:46,809 INFO L276 IsEmpty]: Start isEmpty. Operand 58476 states and 193967 transitions. [2019-12-18 16:23:46,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:23:46,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:46,815 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:46,815 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:46,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:46,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1418364262, now seen corresponding path program 1 times [2019-12-18 16:23:46,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:46,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948632630] [2019-12-18 16:23:46,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:46,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:23:46,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948632630] [2019-12-18 16:23:46,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:46,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:23:46,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849993975] [2019-12-18 16:23:46,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:23:46,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:46,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:23:46,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:23:46,862 INFO L87 Difference]: Start difference. First operand 58476 states and 193967 transitions. Second operand 3 states. [2019-12-18 16:23:47,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:47,117 INFO L93 Difference]: Finished difference Result 55330 states and 183290 transitions. [2019-12-18 16:23:47,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:23:47,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 16:23:47,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:48,986 INFO L225 Difference]: With dead ends: 55330 [2019-12-18 16:23:48,986 INFO L226 Difference]: Without dead ends: 55330 [2019-12-18 16:23:48,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:23:49,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55330 states. [2019-12-18 16:23:50,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55330 to 55330. [2019-12-18 16:23:50,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55330 states. [2019-12-18 16:23:50,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55330 states to 55330 states and 183290 transitions. [2019-12-18 16:23:50,328 INFO L78 Accepts]: Start accepts. Automaton has 55330 states and 183290 transitions. Word has length 16 [2019-12-18 16:23:50,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:50,328 INFO L462 AbstractCegarLoop]: Abstraction has 55330 states and 183290 transitions. [2019-12-18 16:23:50,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:23:50,328 INFO L276 IsEmpty]: Start isEmpty. Operand 55330 states and 183290 transitions. [2019-12-18 16:23:50,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 16:23:50,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:50,337 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:50,338 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:50,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:50,338 INFO L82 PathProgramCache]: Analyzing trace with hash 285364695, now seen corresponding path program 1 times [2019-12-18 16:23:50,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:50,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540548025] [2019-12-18 16:23:50,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:50,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:23:50,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540548025] [2019-12-18 16:23:50,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:50,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:23:50,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502675840] [2019-12-18 16:23:50,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:23:50,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:50,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:23:50,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:23:50,397 INFO L87 Difference]: Start difference. First operand 55330 states and 183290 transitions. Second operand 4 states. [2019-12-18 16:23:50,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:50,913 INFO L93 Difference]: Finished difference Result 68586 states and 223928 transitions. [2019-12-18 16:23:50,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:23:50,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 16:23:50,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:51,042 INFO L225 Difference]: With dead ends: 68586 [2019-12-18 16:23:51,043 INFO L226 Difference]: Without dead ends: 68569 [2019-12-18 16:23:51,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:23:51,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68569 states. [2019-12-18 16:23:52,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68569 to 56099. [2019-12-18 16:23:52,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56099 states. [2019-12-18 16:23:52,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56099 states to 56099 states and 185794 transitions. [2019-12-18 16:23:52,843 INFO L78 Accepts]: Start accepts. Automaton has 56099 states and 185794 transitions. Word has length 17 [2019-12-18 16:23:52,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:52,843 INFO L462 AbstractCegarLoop]: Abstraction has 56099 states and 185794 transitions. [2019-12-18 16:23:52,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:23:52,843 INFO L276 IsEmpty]: Start isEmpty. Operand 56099 states and 185794 transitions. [2019-12-18 16:23:52,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 16:23:52,856 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:52,856 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:52,856 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:52,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:52,857 INFO L82 PathProgramCache]: Analyzing trace with hash -762555601, now seen corresponding path program 1 times [2019-12-18 16:23:52,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:52,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961528457] [2019-12-18 16:23:52,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:52,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:52,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:23:52,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961528457] [2019-12-18 16:23:52,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:52,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:23:52,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642285376] [2019-12-18 16:23:52,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:23:52,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:52,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:23:52,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:23:52,933 INFO L87 Difference]: Start difference. First operand 56099 states and 185794 transitions. Second operand 4 states. [2019-12-18 16:23:52,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:52,998 INFO L93 Difference]: Finished difference Result 9220 states and 24944 transitions. [2019-12-18 16:23:52,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:23:52,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-18 16:23:52,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:53,005 INFO L225 Difference]: With dead ends: 9220 [2019-12-18 16:23:53,005 INFO L226 Difference]: Without dead ends: 5668 [2019-12-18 16:23:53,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:23:53,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5668 states. [2019-12-18 16:23:53,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5668 to 5668. [2019-12-18 16:23:53,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5668 states. [2019-12-18 16:23:53,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5668 states to 5668 states and 13278 transitions. [2019-12-18 16:23:53,074 INFO L78 Accepts]: Start accepts. Automaton has 5668 states and 13278 transitions. Word has length 20 [2019-12-18 16:23:53,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:53,074 INFO L462 AbstractCegarLoop]: Abstraction has 5668 states and 13278 transitions. [2019-12-18 16:23:53,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:23:53,075 INFO L276 IsEmpty]: Start isEmpty. Operand 5668 states and 13278 transitions. [2019-12-18 16:23:53,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 16:23:53,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:53,078 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] [2019-12-18 16:23:53,078 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:53,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:53,078 INFO L82 PathProgramCache]: Analyzing trace with hash -32759108, now seen corresponding path program 1 times [2019-12-18 16:23:53,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:53,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766586172] [2019-12-18 16:23:53,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:53,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:53,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:23:53,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766586172] [2019-12-18 16:23:53,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:53,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:23:53,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328620947] [2019-12-18 16:23:53,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:23:53,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:53,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:23:53,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:23:53,176 INFO L87 Difference]: Start difference. First operand 5668 states and 13278 transitions. Second operand 5 states. [2019-12-18 16:23:53,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:53,619 INFO L93 Difference]: Finished difference Result 7654 states and 17475 transitions. [2019-12-18 16:23:53,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:23:53,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 16:23:53,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:53,629 INFO L225 Difference]: With dead ends: 7654 [2019-12-18 16:23:53,629 INFO L226 Difference]: Without dead ends: 7653 [2019-12-18 16:23:53,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:23:53,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7653 states. [2019-12-18 16:23:53,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7653 to 7010. [2019-12-18 16:23:53,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7010 states. [2019-12-18 16:23:53,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7010 states to 7010 states and 16196 transitions. [2019-12-18 16:23:53,707 INFO L78 Accepts]: Start accepts. Automaton has 7010 states and 16196 transitions. Word has length 28 [2019-12-18 16:23:53,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:53,707 INFO L462 AbstractCegarLoop]: Abstraction has 7010 states and 16196 transitions. [2019-12-18 16:23:53,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:23:53,707 INFO L276 IsEmpty]: Start isEmpty. Operand 7010 states and 16196 transitions. [2019-12-18 16:23:53,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 16:23:53,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:53,712 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:53,712 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:53,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:53,713 INFO L82 PathProgramCache]: Analyzing trace with hash 484194479, now seen corresponding path program 1 times [2019-12-18 16:23:53,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:53,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840128907] [2019-12-18 16:23:53,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:53,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:23:53,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840128907] [2019-12-18 16:23:53,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:53,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:23:53,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017058167] [2019-12-18 16:23:53,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:23:53,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:53,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:23:53,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:23:53,890 INFO L87 Difference]: Start difference. First operand 7010 states and 16196 transitions. Second operand 3 states. [2019-12-18 16:23:53,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:53,981 INFO L93 Difference]: Finished difference Result 7678 states and 16747 transitions. [2019-12-18 16:23:53,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:23:53,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-18 16:23:53,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:53,989 INFO L225 Difference]: With dead ends: 7678 [2019-12-18 16:23:53,989 INFO L226 Difference]: Without dead ends: 7678 [2019-12-18 16:23:53,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:23:54,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7678 states. [2019-12-18 16:23:54,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7678 to 7092. [2019-12-18 16:23:54,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7092 states. [2019-12-18 16:23:54,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7092 states to 7092 states and 15530 transitions. [2019-12-18 16:23:54,066 INFO L78 Accepts]: Start accepts. Automaton has 7092 states and 15530 transitions. Word has length 31 [2019-12-18 16:23:54,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:54,067 INFO L462 AbstractCegarLoop]: Abstraction has 7092 states and 15530 transitions. [2019-12-18 16:23:54,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:23:54,067 INFO L276 IsEmpty]: Start isEmpty. Operand 7092 states and 15530 transitions. [2019-12-18 16:23:54,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 16:23:54,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:54,073 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:54,073 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:54,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:54,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1443742418, now seen corresponding path program 1 times [2019-12-18 16:23:54,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:54,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573464122] [2019-12-18 16:23:54,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:54,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:23:54,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573464122] [2019-12-18 16:23:54,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:54,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:23:54,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169742108] [2019-12-18 16:23:54,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:23:54,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:54,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:23:54,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:23:54,189 INFO L87 Difference]: Start difference. First operand 7092 states and 15530 transitions. Second operand 5 states. [2019-12-18 16:23:54,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:54,247 INFO L93 Difference]: Finished difference Result 4680 states and 10142 transitions. [2019-12-18 16:23:54,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:23:54,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-18 16:23:54,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:54,253 INFO L225 Difference]: With dead ends: 4680 [2019-12-18 16:23:54,253 INFO L226 Difference]: Without dead ends: 4403 [2019-12-18 16:23:54,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:23:54,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4403 states. [2019-12-18 16:23:54,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4403 to 3689. [2019-12-18 16:23:54,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3689 states. [2019-12-18 16:23:54,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3689 states to 3689 states and 8190 transitions. [2019-12-18 16:23:54,295 INFO L78 Accepts]: Start accepts. Automaton has 3689 states and 8190 transitions. Word has length 34 [2019-12-18 16:23:54,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:54,295 INFO L462 AbstractCegarLoop]: Abstraction has 3689 states and 8190 transitions. [2019-12-18 16:23:54,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:23:54,295 INFO L276 IsEmpty]: Start isEmpty. Operand 3689 states and 8190 transitions. [2019-12-18 16:23:54,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 16:23:54,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:54,300 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] [2019-12-18 16:23:54,300 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:54,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:54,300 INFO L82 PathProgramCache]: Analyzing trace with hash 935213406, now seen corresponding path program 1 times [2019-12-18 16:23:54,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:54,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695051437] [2019-12-18 16:23:54,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:54,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:23:54,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695051437] [2019-12-18 16:23:54,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:54,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:23:54,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214184218] [2019-12-18 16:23:54,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:23:54,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:54,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:23:54,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:23:54,407 INFO L87 Difference]: Start difference. First operand 3689 states and 8190 transitions. Second operand 4 states. [2019-12-18 16:23:54,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:54,433 INFO L93 Difference]: Finished difference Result 4181 states and 9235 transitions. [2019-12-18 16:23:54,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:23:54,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-18 16:23:54,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:54,435 INFO L225 Difference]: With dead ends: 4181 [2019-12-18 16:23:54,435 INFO L226 Difference]: Without dead ends: 548 [2019-12-18 16:23:54,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:23:54,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-12-18 16:23:54,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2019-12-18 16:23:54,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-12-18 16:23:54,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1120 transitions. [2019-12-18 16:23:54,443 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 1120 transitions. Word has length 58 [2019-12-18 16:23:54,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:54,443 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 1120 transitions. [2019-12-18 16:23:54,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:23:54,443 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1120 transitions. [2019-12-18 16:23:54,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 16:23:54,446 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:54,446 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] [2019-12-18 16:23:54,446 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:54,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:54,447 INFO L82 PathProgramCache]: Analyzing trace with hash 2074119366, now seen corresponding path program 2 times [2019-12-18 16:23:54,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:54,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419347280] [2019-12-18 16:23:54,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:54,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:23:54,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419347280] [2019-12-18 16:23:54,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:54,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:23:54,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51350634] [2019-12-18 16:23:54,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:23:54,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:54,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:23:54,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:23:54,618 INFO L87 Difference]: Start difference. First operand 548 states and 1120 transitions. Second operand 5 states. [2019-12-18 16:23:54,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:54,695 INFO L93 Difference]: Finished difference Result 1085 states and 2228 transitions. [2019-12-18 16:23:54,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:23:54,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 16:23:54,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:54,697 INFO L225 Difference]: With dead ends: 1085 [2019-12-18 16:23:54,698 INFO L226 Difference]: Without dead ends: 547 [2019-12-18 16:23:54,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:23:54,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-12-18 16:23:54,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2019-12-18 16:23:54,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-12-18 16:23:54,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1118 transitions. [2019-12-18 16:23:54,709 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1118 transitions. Word has length 58 [2019-12-18 16:23:54,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:54,710 INFO L462 AbstractCegarLoop]: Abstraction has 547 states and 1118 transitions. [2019-12-18 16:23:54,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:23:54,710 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1118 transitions. [2019-12-18 16:23:54,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 16:23:54,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:54,712 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] [2019-12-18 16:23:54,712 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:54,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:54,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1745093714, now seen corresponding path program 1 times [2019-12-18 16:23:54,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:54,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541151591] [2019-12-18 16:23:54,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:54,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:23:54,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541151591] [2019-12-18 16:23:54,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:54,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:23:54,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656395412] [2019-12-18 16:23:54,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:23:54,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:54,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:23:54,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:23:54,833 INFO L87 Difference]: Start difference. First operand 547 states and 1118 transitions. Second operand 5 states. [2019-12-18 16:23:55,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:55,168 INFO L93 Difference]: Finished difference Result 918 states and 1829 transitions. [2019-12-18 16:23:55,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:23:55,168 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-12-18 16:23:55,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:55,170 INFO L225 Difference]: With dead ends: 918 [2019-12-18 16:23:55,171 INFO L226 Difference]: Without dead ends: 918 [2019-12-18 16:23:55,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:23:55,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-12-18 16:23:55,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 853. [2019-12-18 16:23:55,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2019-12-18 16:23:55,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1709 transitions. [2019-12-18 16:23:55,182 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1709 transitions. Word has length 59 [2019-12-18 16:23:55,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:55,182 INFO L462 AbstractCegarLoop]: Abstraction has 853 states and 1709 transitions. [2019-12-18 16:23:55,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:23:55,182 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1709 transitions. [2019-12-18 16:23:55,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 16:23:55,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:55,183 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] [2019-12-18 16:23:55,183 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:55,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:55,184 INFO L82 PathProgramCache]: Analyzing trace with hash 472534802, now seen corresponding path program 2 times [2019-12-18 16:23:55,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:55,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366436691] [2019-12-18 16:23:55,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:55,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:23:55,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366436691] [2019-12-18 16:23:55,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:55,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:23:55,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513540950] [2019-12-18 16:23:55,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:23:55,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:55,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:23:55,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:23:55,272 INFO L87 Difference]: Start difference. First operand 853 states and 1709 transitions. Second operand 8 states. [2019-12-18 16:23:55,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:55,591 INFO L93 Difference]: Finished difference Result 1920 states and 3719 transitions. [2019-12-18 16:23:55,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 16:23:55,591 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-12-18 16:23:55,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:55,593 INFO L225 Difference]: With dead ends: 1920 [2019-12-18 16:23:55,593 INFO L226 Difference]: Without dead ends: 1404 [2019-12-18 16:23:55,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-18 16:23:55,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2019-12-18 16:23:55,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 920. [2019-12-18 16:23:55,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2019-12-18 16:23:55,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1831 transitions. [2019-12-18 16:23:55,608 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1831 transitions. Word has length 59 [2019-12-18 16:23:55,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:55,608 INFO L462 AbstractCegarLoop]: Abstraction has 920 states and 1831 transitions. [2019-12-18 16:23:55,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:23:55,609 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1831 transitions. [2019-12-18 16:23:55,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 16:23:55,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:55,610 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:55,611 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:55,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:55,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1337355214, now seen corresponding path program 3 times [2019-12-18 16:23:55,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:55,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889590533] [2019-12-18 16:23:55,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:55,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:23:55,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889590533] [2019-12-18 16:23:55,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:55,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 16:23:55,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260828227] [2019-12-18 16:23:55,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 16:23:55,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:55,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 16:23:55,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-18 16:23:55,813 INFO L87 Difference]: Start difference. First operand 920 states and 1831 transitions. Second operand 10 states. [2019-12-18 16:23:56,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:56,436 INFO L93 Difference]: Finished difference Result 1439 states and 2757 transitions. [2019-12-18 16:23:56,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 16:23:56,437 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-18 16:23:56,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:56,439 INFO L225 Difference]: With dead ends: 1439 [2019-12-18 16:23:56,439 INFO L226 Difference]: Without dead ends: 1439 [2019-12-18 16:23:56,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-18 16:23:56,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2019-12-18 16:23:56,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 937. [2019-12-18 16:23:56,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2019-12-18 16:23:56,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1850 transitions. [2019-12-18 16:23:56,450 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1850 transitions. Word has length 59 [2019-12-18 16:23:56,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:56,451 INFO L462 AbstractCegarLoop]: Abstraction has 937 states and 1850 transitions. [2019-12-18 16:23:56,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 16:23:56,451 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1850 transitions. [2019-12-18 16:23:56,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 16:23:56,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:56,453 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] [2019-12-18 16:23:56,453 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:56,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:56,453 INFO L82 PathProgramCache]: Analyzing trace with hash -656253202, now seen corresponding path program 4 times [2019-12-18 16:23:56,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:56,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053912622] [2019-12-18 16:23:56,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:56,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:23:56,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053912622] [2019-12-18 16:23:56,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:56,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:23:56,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270607308] [2019-12-18 16:23:56,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:23:56,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:56,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:23:56,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:23:56,542 INFO L87 Difference]: Start difference. First operand 937 states and 1850 transitions. Second operand 6 states. [2019-12-18 16:23:56,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:56,952 INFO L93 Difference]: Finished difference Result 1145 states and 2216 transitions. [2019-12-18 16:23:56,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:23:56,952 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-18 16:23:56,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:56,954 INFO L225 Difference]: With dead ends: 1145 [2019-12-18 16:23:56,954 INFO L226 Difference]: Without dead ends: 1145 [2019-12-18 16:23:56,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:23:56,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2019-12-18 16:23:56,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 967. [2019-12-18 16:23:56,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 967 states. [2019-12-18 16:23:56,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1905 transitions. [2019-12-18 16:23:56,967 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1905 transitions. Word has length 59 [2019-12-18 16:23:56,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:56,967 INFO L462 AbstractCegarLoop]: Abstraction has 967 states and 1905 transitions. [2019-12-18 16:23:56,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:23:56,968 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1905 transitions. [2019-12-18 16:23:56,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 16:23:56,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:56,969 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] [2019-12-18 16:23:56,970 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:56,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:56,970 INFO L82 PathProgramCache]: Analyzing trace with hash -308873018, now seen corresponding path program 5 times [2019-12-18 16:23:56,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:56,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520408779] [2019-12-18 16:23:56,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:57,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:23:57,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520408779] [2019-12-18 16:23:57,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:57,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:23:57,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593697520] [2019-12-18 16:23:57,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:23:57,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:57,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:23:57,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:23:57,031 INFO L87 Difference]: Start difference. First operand 967 states and 1905 transitions. Second operand 3 states. [2019-12-18 16:23:57,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:57,043 INFO L93 Difference]: Finished difference Result 966 states and 1903 transitions. [2019-12-18 16:23:57,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:23:57,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 16:23:57,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:57,045 INFO L225 Difference]: With dead ends: 966 [2019-12-18 16:23:57,045 INFO L226 Difference]: Without dead ends: 966 [2019-12-18 16:23:57,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:23:57,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2019-12-18 16:23:57,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 823. [2019-12-18 16:23:57,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-12-18 16:23:57,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1640 transitions. [2019-12-18 16:23:57,060 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1640 transitions. Word has length 59 [2019-12-18 16:23:57,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:57,060 INFO L462 AbstractCegarLoop]: Abstraction has 823 states and 1640 transitions. [2019-12-18 16:23:57,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:23:57,060 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1640 transitions. [2019-12-18 16:23:57,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 16:23:57,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:57,062 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:57,063 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:57,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:57,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1424316398, now seen corresponding path program 1 times [2019-12-18 16:23:57,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:57,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915377125] [2019-12-18 16:23:57,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:23:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:23:57,260 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 16:23:57,260 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 16:23:57,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] ULTIMATE.startENTRY-->L808: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= 0 v_~x$w_buff0~0_184) (= (select .cse0 |v_ULTIMATE.start_main_~#t319~0.base_35|) 0) (= v_~x$r_buff0_thd0~0_104 0) (= v_~x$flush_delayed~0_211 0) (= 0 v_~x$w_buff1~0_179) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t319~0.base_35| 1)) (= 0 v_~__unbuffered_p0_EAX~0_49) (= |v_#NULL.offset_3| 0) (= 0 v_~x~0_237) (= 0 v_~x$mem_tmp~0_172) (= 0 v_~x$r_buff1_thd2~0_289) (= v_~y~0_71 0) (= v_~__unbuffered_p1_EBX~0_59 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t319~0.base_35|) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~main$tmp_guard1~0_39 0) (= 0 v_~__unbuffered_cnt~0_51) (= 0 v_~__unbuffered_p1_EAX~0_57) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff1_thd0~0_189 0) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_243 0) (= v_~main$tmp_guard0~0_35 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$w_buff1_used~0_431) (= v_~x$r_buff0_thd1~0_285 0) (= |v_ULTIMATE.start_main_~#t319~0.offset_25| 0) (= 0 v_~x$r_buff0_thd2~0_420) (= v_~x$r_buff1_thd1~0_241 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t319~0.base_35| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t319~0.base_35|) |v_ULTIMATE.start_main_~#t319~0.offset_25| 0)) |v_#memory_int_17|) (= 0 v_~weak$$choice0~0_159) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t319~0.base_35| 4)) (= 0 v_~x$w_buff0_used~0_795) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t319~0.base=|v_ULTIMATE.start_main_~#t319~0.base_35|, ~x$w_buff0~0=v_~x$w_buff0~0_184, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_285, ~x$flush_delayed~0=v_~x$flush_delayed~0_211, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_20|, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_241, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ~x$mem_tmp~0=v_~x$mem_tmp~0_172, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ULTIMATE.start_main_~#t319~0.offset=|v_ULTIMATE.start_main_~#t319~0.offset_25|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_57, #length=|v_#length_19|, ~y~0=v_~y~0_71, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_104, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_59, ~x$w_buff1~0=v_~x$w_buff1~0_179, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_34|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_35|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_431, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_289, ULTIMATE.start_main_~#t320~0.offset=|v_ULTIMATE.start_main_~#t320~0.offset_16|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_169|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_35, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_189, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_420, ULTIMATE.start_main_~#t320~0.base=|v_ULTIMATE.start_main_~#t320~0.base_24|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_795, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_79|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_229|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_27|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_243, ~x~0=v_~x~0_237, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t319~0.base, ~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t319~0.offset, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t320~0.offset, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t320~0.base, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite62, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 16:23:57,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [949] [949] L808-1-->L810: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t320~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t320~0.offset_11|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t320~0.base_11|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t320~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t320~0.base_11|) |v_ULTIMATE.start_main_~#t320~0.offset_11| 1)) |v_#memory_int_9|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t320~0.base_11| 1)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t320~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t320~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t320~0.offset=|v_ULTIMATE.start_main_~#t320~0.offset_11|, #length=|v_#length_11|, ULTIMATE.start_main_~#t320~0.base=|v_ULTIMATE.start_main_~#t320~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t320~0.offset, #length, ULTIMATE.start_main_~#t320~0.base] because there is no mapped edge [2019-12-18 16:23:57,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_6 |v_P1Thread1of1ForFork1_#in~arg.base_6|) (= 1 v_~x$w_buff0~0_24) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|) (= 1 v_~x$w_buff0_used~0_123) (= v_~x$w_buff0~0_25 v_~x$w_buff1~0_31) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6| 1) (= v_~x$w_buff1_used~0_76 v_~x$w_buff0_used~0_124) (= 0 (mod v_~x$w_buff1_used~0_76 256)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_6| v_P1Thread1of1ForFork1_~arg.offset_6)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_25, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_6|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_124} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~x$w_buff0~0=v_~x$w_buff0~0_24, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_6, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_6, ~x$w_buff1~0=v_~x$w_buff1~0_31, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_6|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_6|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 16:23:57,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L770-2-->L770-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1977069940 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1977069940 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out1977069940| ~x$w_buff1~0_In1977069940)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out1977069940| ~x$w_buff0~0_In1977069940)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1977069940, ~x$w_buff1~0=~x$w_buff1~0_In1977069940, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1977069940, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1977069940} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1977069940, ~x$w_buff1~0=~x$w_buff1~0_In1977069940, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1977069940, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1977069940|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1977069940} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 16:23:57,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L770-4-->L771: Formula: (= v_~x~0_35 |v_P1Thread1of1ForFork1_#t~ite28_14|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_14|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_13|, ~x~0=v_~x~0_35, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_13|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~x~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 16:23:57,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L775-->L776: Formula: (and (= v_~x$r_buff0_thd2~0_206 v_~x$r_buff0_thd2~0_205) (not (= 0 (mod v_~weak$$choice2~0_111 256)))) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_206, ~weak$$choice2~0=v_~weak$$choice2~0_111} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_13|, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_10|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_12|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_111} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 16:23:57,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [911] [911] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In-1944326849 256)))) (or (and (= ~x$mem_tmp~0_In-1944326849 |P1Thread1of1ForFork1_#t~ite48_Out-1944326849|) (not .cse0)) (and .cse0 (= ~x~0_In-1944326849 |P1Thread1of1ForFork1_#t~ite48_Out-1944326849|)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-1944326849, ~x$mem_tmp~0=~x$mem_tmp~0_In-1944326849, ~x~0=~x~0_In-1944326849} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In-1944326849, ~x$mem_tmp~0=~x$mem_tmp~0_In-1944326849, ~x~0=~x~0_In-1944326849, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out-1944326849|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-18 16:23:57,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In1607841261 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite25_Out1607841261| ~x$mem_tmp~0_In1607841261)) (and .cse0 (= ~x~0_In1607841261 |P0Thread1of1ForFork0_#t~ite25_Out1607841261|)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In1607841261, ~x$mem_tmp~0=~x$mem_tmp~0_In1607841261, ~x~0=~x~0_In1607841261} OutVars{P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out1607841261|, ~x$flush_delayed~0=~x$flush_delayed~0_In1607841261, ~x$mem_tmp~0=~x$mem_tmp~0_In1607841261, ~x~0=~x~0_In1607841261} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-18 16:23:57,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite25_20| v_~x~0_109) (= v_~x$flush_delayed~0_78 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_19|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~x$flush_delayed~0=v_~x$flush_delayed~0_78, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_109} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~x$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 16:23:57,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1252658146 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1252658146 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1252658146 |P1Thread1of1ForFork1_#t~ite51_Out-1252658146|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite51_Out-1252658146|) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1252658146, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1252658146} OutVars{P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-1252658146|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1252658146, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1252658146} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-18 16:23:57,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [918] [918] L787-->L787-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-2101331532 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-2101331532 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-2101331532 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-2101331532 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-2101331532 |P1Thread1of1ForFork1_#t~ite52_Out-2101331532|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite52_Out-2101331532|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2101331532, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2101331532, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2101331532, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2101331532} OutVars{P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out-2101331532|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2101331532, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2101331532, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2101331532, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2101331532} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-18 16:23:57,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L788-->L789: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In95152 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In95152 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In95152 ~x$r_buff0_thd2~0_Out95152)) (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out95152) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In95152, ~x$w_buff0_used~0=~x$w_buff0_used~0_In95152} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out95152|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out95152, ~x$w_buff0_used~0=~x$w_buff0_used~0_In95152} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 16:23:57,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L789-->L789-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In-958547385 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-958547385 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-958547385 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-958547385 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite54_Out-958547385| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite54_Out-958547385| ~x$r_buff1_thd2~0_In-958547385) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-958547385, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-958547385, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-958547385, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-958547385} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-958547385, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-958547385, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-958547385|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-958547385, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-958547385} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-18 16:23:57,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L789-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_26 (+ v_~__unbuffered_cnt~0_27 1)) (= v_~x$r_buff1_thd2~0_141 |v_P1Thread1of1ForFork1_#t~ite54_20|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_20|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_141, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_19|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 16:23:57,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L814-->L816-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~x$w_buff0_used~0_229 256)) (= (mod v_~x$r_buff0_thd0~0_27 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_229} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_229} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 16:23:57,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L816-2-->L816-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-352008022 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-352008022 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-352008022 |ULTIMATE.start_main_#t~ite57_Out-352008022|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite57_Out-352008022| ~x~0_In-352008022)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-352008022, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-352008022, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-352008022, ~x~0=~x~0_In-352008022} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-352008022, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-352008022|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-352008022, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-352008022, ~x~0=~x~0_In-352008022} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-18 16:23:57,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] L816-4-->L817: Formula: (= v_~x~0_76 |v_ULTIMATE.start_main_#t~ite57_12|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_12|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_8|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_11|, ~x~0=v_~x~0_76} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x~0] because there is no mapped edge [2019-12-18 16:23:57,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [906] [906] L817-->L817-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1490497153 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1490497153 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite59_Out-1490497153|)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite59_Out-1490497153| ~x$w_buff0_used~0_In-1490497153)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1490497153, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1490497153} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1490497153, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1490497153|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1490497153} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-18 16:23:57,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [910] [910] L818-->L818-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-2146607458 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-2146607458 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-2146607458 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-2146607458 256)))) (or (and (= |ULTIMATE.start_main_#t~ite60_Out-2146607458| ~x$w_buff1_used~0_In-2146607458) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite60_Out-2146607458| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2146607458, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2146607458, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2146607458, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2146607458} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2146607458, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-2146607458|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2146607458, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2146607458, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2146607458} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-18 16:23:57,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-176032320 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-176032320 256)))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out-176032320| ~x$r_buff0_thd0~0_In-176032320) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-176032320| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-176032320, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-176032320} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-176032320, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-176032320|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-176032320} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-18 16:23:57,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L820-->L820-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-314113739 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-314113739 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-314113739 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-314113739 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-314113739 |ULTIMATE.start_main_#t~ite62_Out-314113739|)) (and (= 0 |ULTIMATE.start_main_#t~ite62_Out-314113739|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-314113739, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-314113739, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-314113739, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-314113739} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-314113739|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-314113739, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-314113739, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-314113739, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-314113739} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-18 16:23:57,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L820-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_23 256)) (= v_~x$r_buff1_thd0~0_171 |v_ULTIMATE.start_main_#t~ite62_47|) (= v_~main$tmp_guard1~0_23 0) (= 0 v_~__unbuffered_p0_EAX~0_27) (= v_~__unbuffered_p1_EBX~0_35 0) (= 1 v_~__unbuffered_p1_EAX~0_36)) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_47|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_27, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_27, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_171, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 16:23:57,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 04:23:57 BasicIcfg [2019-12-18 16:23:57,458 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 16:23:57,466 INFO L168 Benchmark]: Toolchain (without parser) took 31836.43 ms. Allocated memory was 146.8 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 102.0 MB in the beginning and 612.2 MB in the end (delta: -510.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 16:23:57,467 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 146.8 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 16:23:57,468 INFO L168 Benchmark]: CACSL2BoogieTranslator took 878.85 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 156.9 MB in the end (delta: -55.3 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-18 16:23:57,470 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.85 ms. Allocated memory is still 204.5 MB. Free memory was 156.9 MB in the beginning and 153.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2019-12-18 16:23:57,471 INFO L168 Benchmark]: Boogie Preprocessor took 55.28 ms. Allocated memory is still 204.5 MB. Free memory was 153.8 MB in the beginning and 151.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-18 16:23:57,471 INFO L168 Benchmark]: RCFGBuilder took 885.70 ms. Allocated memory is still 204.5 MB. Free memory was 151.3 MB in the beginning and 98.5 MB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2019-12-18 16:23:57,472 INFO L168 Benchmark]: TraceAbstraction took 29928.57 ms. Allocated memory was 204.5 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 98.5 MB in the beginning and 612.2 MB in the end (delta: -513.7 MB). Peak memory consumption was 999.4 MB. Max. memory is 7.1 GB. [2019-12-18 16:23:57,482 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 146.8 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 878.85 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 156.9 MB in the end (delta: -55.3 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.85 ms. Allocated memory is still 204.5 MB. Free memory was 156.9 MB in the beginning and 153.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.28 ms. Allocated memory is still 204.5 MB. Free memory was 153.8 MB in the beginning and 151.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 885.70 ms. Allocated memory is still 204.5 MB. Free memory was 151.3 MB in the beginning and 98.5 MB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29928.57 ms. Allocated memory was 204.5 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 98.5 MB in the beginning and 612.2 MB in the end (delta: -513.7 MB). Peak memory consumption was 999.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 178 ProgramPointsBefore, 103 ProgramPointsAfterwards, 227 TransitionsBefore, 126 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 48 ConcurrentYvCompositions, 29 ChoiceCompositions, 8870 VarBasedMoverChecksPositive, 271 VarBasedMoverChecksNegative, 66 SemBasedMoverChecksPositive, 290 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 122314 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L808] FCALL, FORK 0 pthread_create(&t319, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L810] FCALL, FORK 0 pthread_create(&t320, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L760] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L761] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L762] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L763] 2 x$r_buff0_thd2 = (_Bool)1 [L766] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 2 x$flush_delayed = weak$$choice2 [L769] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L770] 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L771] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L771] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L772] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L772] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L773] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L774] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L774] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] 2 x = x$flush_delayed ? x$mem_tmp : x [L779] 2 x$flush_delayed = (_Bool)0 [L782] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L727] 1 y = 1 [L730] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L731] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L732] 1 x$flush_delayed = weak$$choice2 [L733] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L735] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L735] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L736] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L737] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L737] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L740] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L740] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L741] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L787] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L812] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L818] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L819] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 172 locations, 2 error locations. Result: UNSAFE, OverallTime: 29.5s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3045 SDtfs, 2886 SDslu, 5267 SDs, 0 SdLazy, 2427 SolverSat, 151 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58476occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 28498 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 662 NumberOfCodeBlocks, 662 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 585 ConstructedInterpolants, 0 QuantifiedInterpolants, 84633 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...