/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi007_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:14:43,323 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:14:43,325 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:14:43,337 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:14:43,338 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:14:43,339 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:14:43,340 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:14:43,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:14:43,344 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:14:43,344 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:14:43,345 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:14:43,346 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:14:43,347 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:14:43,348 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:14:43,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:14:43,350 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:14:43,351 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:14:43,351 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:14:43,353 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:14:43,355 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:14:43,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:14:43,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:14:43,364 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:14:43,365 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:14:43,370 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:14:43,370 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:14:43,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:14:43,372 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:14:43,374 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:14:43,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:14:43,375 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:14:43,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:14:43,376 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:14:43,377 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:14:43,378 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:14:43,379 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:14:43,379 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:14:43,380 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:14:43,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:14:43,385 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:14:43,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:14:43,388 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:14:43,402 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:14:43,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:14:43,403 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:14:43,404 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:14:43,404 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:14:43,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:14:43,404 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:14:43,404 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:14:43,405 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:14:43,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:14:43,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:14:43,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:14:43,405 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:14:43,405 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:14:43,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:14:43,406 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:14:43,406 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:14:43,406 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:14:43,406 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:14:43,407 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:14:43,407 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:14:43,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:14:43,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:14:43,407 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:14:43,408 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:14:43,408 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:14:43,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:14:43,408 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:14:43,408 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:14:43,409 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:14:43,709 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:14:43,727 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:14:43,730 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:14:43,732 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:14:43,732 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:14:43,733 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_tso.opt.i [2019-12-18 14:14:43,790 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a1304b36/93c762695b5f47f799633e3b47a9dd74/FLAG54bd33be7 [2019-12-18 14:14:44,320 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:14:44,321 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_tso.opt.i [2019-12-18 14:14:44,353 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a1304b36/93c762695b5f47f799633e3b47a9dd74/FLAG54bd33be7 [2019-12-18 14:14:44,640 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a1304b36/93c762695b5f47f799633e3b47a9dd74 [2019-12-18 14:14:44,650 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:14:44,652 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:14:44,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:14:44,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:14:44,656 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:14:44,658 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:14:44" (1/1) ... [2019-12-18 14:14:44,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@373e4cca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:14:44, skipping insertion in model container [2019-12-18 14:14:44,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:14:44" (1/1) ... [2019-12-18 14:14:44,669 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:14:44,721 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:14:45,260 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:14:45,272 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:14:45,360 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:14:45,440 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:14:45,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:14:45 WrapperNode [2019-12-18 14:14:45,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:14:45,441 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:14:45,441 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:14:45,441 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:14:45,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:14:45" (1/1) ... [2019-12-18 14:14:45,471 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:14:45" (1/1) ... [2019-12-18 14:14:45,512 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:14:45,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:14:45,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:14:45,513 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:14:45,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:14:45" (1/1) ... [2019-12-18 14:14:45,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:14:45" (1/1) ... [2019-12-18 14:14:45,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:14:45" (1/1) ... [2019-12-18 14:14:45,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:14:45" (1/1) ... [2019-12-18 14:14:45,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:14:45" (1/1) ... [2019-12-18 14:14:45,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:14:45" (1/1) ... [2019-12-18 14:14:45,551 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:14:45" (1/1) ... [2019-12-18 14:14:45,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:14:45,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:14:45,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:14:45,558 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:14:45,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:14:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:14:45,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:14:45,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:14:45,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:14:45,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:14:45,634 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:14:45,634 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:14:45,634 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:14:45,634 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:14:45,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:14:45,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:14:45,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:14:45,637 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 14:14:46,503 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:14:46,503 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:14:46,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:14:46 BoogieIcfgContainer [2019-12-18 14:14:46,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:14:46,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:14:46,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:14:46,513 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:14:46,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:14:44" (1/3) ... [2019-12-18 14:14:46,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c339995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:14:46, skipping insertion in model container [2019-12-18 14:14:46,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:14:45" (2/3) ... [2019-12-18 14:14:46,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c339995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:14:46, skipping insertion in model container [2019-12-18 14:14:46,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:14:46" (3/3) ... [2019-12-18 14:14:46,518 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_tso.opt.i [2019-12-18 14:14:46,530 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:14:46,531 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:14:46,544 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:14:46,545 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:14:46,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,603 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,604 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,635 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,635 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,636 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,636 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,636 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,666 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,666 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,671 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,673 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,676 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:14:46,694 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 14:14:46,715 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:14:46,715 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:14:46,715 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:14:46,715 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:14:46,716 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:14:46,716 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:14:46,716 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:14:46,716 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:14:46,734 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 244 transitions [2019-12-18 14:14:46,736 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 244 transitions [2019-12-18 14:14:46,838 INFO L126 PetriNetUnfolder]: 62/242 cut-off events. [2019-12-18 14:14:46,838 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:14:46,863 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 242 events. 62/242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 512 event pairs. 6/184 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-18 14:14:46,897 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 244 transitions [2019-12-18 14:14:46,953 INFO L126 PetriNetUnfolder]: 62/242 cut-off events. [2019-12-18 14:14:46,954 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:14:46,966 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 242 events. 62/242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 512 event pairs. 6/184 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-18 14:14:46,996 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 25246 [2019-12-18 14:14:46,997 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:14:52,283 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-12-18 14:14:52,557 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 14:14:52,674 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 14:14:52,705 INFO L206 etLargeBlockEncoding]: Checked pairs total: 142511 [2019-12-18 14:14:52,706 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-18 14:14:52,709 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 137 transitions [2019-12-18 14:14:54,219 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27484 states. [2019-12-18 14:14:54,221 INFO L276 IsEmpty]: Start isEmpty. Operand 27484 states. [2019-12-18 14:14:54,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 14:14:54,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:14:54,228 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 14:14:54,228 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:14:54,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:14:54,234 INFO L82 PathProgramCache]: Analyzing trace with hash 979333444, now seen corresponding path program 1 times [2019-12-18 14:14:54,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:14:54,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214946336] [2019-12-18 14:14:54,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:14:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:14:54,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:14:54,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214946336] [2019-12-18 14:14:54,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:14:54,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:14:54,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201255215] [2019-12-18 14:14:54,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:14:54,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:14:54,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:14:54,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:14:54,489 INFO L87 Difference]: Start difference. First operand 27484 states. Second operand 3 states. [2019-12-18 14:14:54,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:14:54,991 INFO L93 Difference]: Finished difference Result 27436 states and 97226 transitions. [2019-12-18 14:14:54,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:14:54,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 14:14:54,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:14:55,182 INFO L225 Difference]: With dead ends: 27436 [2019-12-18 14:14:55,182 INFO L226 Difference]: Without dead ends: 26890 [2019-12-18 14:14:55,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:14:56,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26890 states. [2019-12-18 14:14:57,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26890 to 26890. [2019-12-18 14:14:57,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26890 states. [2019-12-18 14:14:57,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26890 states to 26890 states and 95406 transitions. [2019-12-18 14:14:57,480 INFO L78 Accepts]: Start accepts. Automaton has 26890 states and 95406 transitions. Word has length 5 [2019-12-18 14:14:57,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:14:57,480 INFO L462 AbstractCegarLoop]: Abstraction has 26890 states and 95406 transitions. [2019-12-18 14:14:57,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:14:57,480 INFO L276 IsEmpty]: Start isEmpty. Operand 26890 states and 95406 transitions. [2019-12-18 14:14:57,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:14:57,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:14:57,486 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:14:57,487 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:14:57,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:14:57,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1135413059, now seen corresponding path program 1 times [2019-12-18 14:14:57,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:14:57,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650534992] [2019-12-18 14:14:57,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:14:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:14:57,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:14:57,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650534992] [2019-12-18 14:14:57,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:14:57,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:14:57,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061553600] [2019-12-18 14:14:57,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:14:57,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:14:57,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:14:57,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:14:57,628 INFO L87 Difference]: Start difference. First operand 26890 states and 95406 transitions. Second operand 4 states. [2019-12-18 14:14:58,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:14:58,220 INFO L93 Difference]: Finished difference Result 43282 states and 146547 transitions. [2019-12-18 14:14:58,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:14:58,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:14:58,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:14:58,417 INFO L225 Difference]: With dead ends: 43282 [2019-12-18 14:14:58,417 INFO L226 Difference]: Without dead ends: 43275 [2019-12-18 14:14:58,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:15:00,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43275 states. [2019-12-18 14:15:01,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43275 to 41962. [2019-12-18 14:15:01,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41962 states. [2019-12-18 14:15:01,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41962 states to 41962 states and 143055 transitions. [2019-12-18 14:15:01,382 INFO L78 Accepts]: Start accepts. Automaton has 41962 states and 143055 transitions. Word has length 11 [2019-12-18 14:15:01,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:15:01,382 INFO L462 AbstractCegarLoop]: Abstraction has 41962 states and 143055 transitions. [2019-12-18 14:15:01,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:15:01,383 INFO L276 IsEmpty]: Start isEmpty. Operand 41962 states and 143055 transitions. [2019-12-18 14:15:01,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:15:01,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:15:01,385 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:15:01,386 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:15:01,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:15:01,386 INFO L82 PathProgramCache]: Analyzing trace with hash -217981421, now seen corresponding path program 1 times [2019-12-18 14:15:01,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:15:01,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729902138] [2019-12-18 14:15:01,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:15:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:15:01,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:15:01,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729902138] [2019-12-18 14:15:01,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:15:01,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:15:01,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694029607] [2019-12-18 14:15:01,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:15:01,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:15:01,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:15:01,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:15:01,503 INFO L87 Difference]: Start difference. First operand 41962 states and 143055 transitions. Second operand 4 states. [2019-12-18 14:15:02,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:15:02,014 INFO L93 Difference]: Finished difference Result 53078 states and 178895 transitions. [2019-12-18 14:15:02,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:15:02,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:15:02,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:15:02,191 INFO L225 Difference]: With dead ends: 53078 [2019-12-18 14:15:02,191 INFO L226 Difference]: Without dead ends: 53078 [2019-12-18 14:15:02,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:15:04,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53078 states. [2019-12-18 14:15:05,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53078 to 47600. [2019-12-18 14:15:05,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47600 states. [2019-12-18 14:15:05,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47600 states to 47600 states and 161707 transitions. [2019-12-18 14:15:05,595 INFO L78 Accepts]: Start accepts. Automaton has 47600 states and 161707 transitions. Word has length 11 [2019-12-18 14:15:05,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:15:05,596 INFO L462 AbstractCegarLoop]: Abstraction has 47600 states and 161707 transitions. [2019-12-18 14:15:05,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:15:05,596 INFO L276 IsEmpty]: Start isEmpty. Operand 47600 states and 161707 transitions. [2019-12-18 14:15:05,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 14:15:05,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:15:05,602 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:15:05,602 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:15:05,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:15:05,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1239203888, now seen corresponding path program 1 times [2019-12-18 14:15:05,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:15:05,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249266988] [2019-12-18 14:15:05,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:15:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:15:05,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:15:05,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249266988] [2019-12-18 14:15:05,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:15:05,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:15:05,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036096994] [2019-12-18 14:15:05,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:15:05,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:15:05,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:15:05,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:15:05,686 INFO L87 Difference]: Start difference. First operand 47600 states and 161707 transitions. Second operand 5 states. [2019-12-18 14:15:06,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:15:06,556 INFO L93 Difference]: Finished difference Result 63010 states and 210076 transitions. [2019-12-18 14:15:06,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:15:06,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 14:15:06,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:15:06,722 INFO L225 Difference]: With dead ends: 63010 [2019-12-18 14:15:06,723 INFO L226 Difference]: Without dead ends: 63003 [2019-12-18 14:15:06,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:15:07,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63003 states. [2019-12-18 14:15:08,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63003 to 47611. [2019-12-18 14:15:08,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47611 states. [2019-12-18 14:15:11,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47611 states to 47611 states and 161609 transitions. [2019-12-18 14:15:11,069 INFO L78 Accepts]: Start accepts. Automaton has 47611 states and 161609 transitions. Word has length 17 [2019-12-18 14:15:11,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:15:11,069 INFO L462 AbstractCegarLoop]: Abstraction has 47611 states and 161609 transitions. [2019-12-18 14:15:11,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:15:11,069 INFO L276 IsEmpty]: Start isEmpty. Operand 47611 states and 161609 transitions. [2019-12-18 14:15:11,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:15:11,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:15:11,094 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] [2019-12-18 14:15:11,094 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:15:11,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:15:11,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1918132910, now seen corresponding path program 1 times [2019-12-18 14:15:11,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:15:11,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313020708] [2019-12-18 14:15:11,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:15:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:15:11,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:15:11,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313020708] [2019-12-18 14:15:11,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:15:11,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:15:11,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555924431] [2019-12-18 14:15:11,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:15:11,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:15:11,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:15:11,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:15:11,179 INFO L87 Difference]: Start difference. First operand 47611 states and 161609 transitions. Second operand 4 states. [2019-12-18 14:15:11,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:15:11,221 INFO L93 Difference]: Finished difference Result 5620 states and 14074 transitions. [2019-12-18 14:15:11,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:15:11,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 14:15:11,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:15:11,229 INFO L225 Difference]: With dead ends: 5620 [2019-12-18 14:15:11,230 INFO L226 Difference]: Without dead ends: 4725 [2019-12-18 14:15:11,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:15:11,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4725 states. [2019-12-18 14:15:11,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4725 to 4725. [2019-12-18 14:15:11,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2019-12-18 14:15:11,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 11319 transitions. [2019-12-18 14:15:11,293 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 11319 transitions. Word has length 25 [2019-12-18 14:15:11,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:15:11,294 INFO L462 AbstractCegarLoop]: Abstraction has 4725 states and 11319 transitions. [2019-12-18 14:15:11,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:15:11,294 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 11319 transitions. [2019-12-18 14:15:11,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 14:15:11,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:15:11,299 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] [2019-12-18 14:15:11,299 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:15:11,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:15:11,299 INFO L82 PathProgramCache]: Analyzing trace with hash 2102045766, now seen corresponding path program 1 times [2019-12-18 14:15:11,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:15:11,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506088464] [2019-12-18 14:15:11,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:15:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:15:11,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:15:11,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506088464] [2019-12-18 14:15:11,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:15:11,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:15:11,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514769693] [2019-12-18 14:15:11,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:15:11,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:15:11,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:15:11,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:15:11,397 INFO L87 Difference]: Start difference. First operand 4725 states and 11319 transitions. Second operand 5 states. [2019-12-18 14:15:11,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:15:11,448 INFO L93 Difference]: Finished difference Result 1095 states and 2326 transitions. [2019-12-18 14:15:11,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:15:11,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 14:15:11,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:15:11,451 INFO L225 Difference]: With dead ends: 1095 [2019-12-18 14:15:11,451 INFO L226 Difference]: Without dead ends: 991 [2019-12-18 14:15:11,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:15:11,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-12-18 14:15:11,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 949. [2019-12-18 14:15:11,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949 states. [2019-12-18 14:15:11,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 2023 transitions. [2019-12-18 14:15:11,465 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 2023 transitions. Word has length 37 [2019-12-18 14:15:11,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:15:11,466 INFO L462 AbstractCegarLoop]: Abstraction has 949 states and 2023 transitions. [2019-12-18 14:15:11,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:15:11,466 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 2023 transitions. [2019-12-18 14:15:11,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:15:11,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:15:11,472 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:15:11,472 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:15:11,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:15:11,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1081276424, now seen corresponding path program 1 times [2019-12-18 14:15:11,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:15:11,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386323842] [2019-12-18 14:15:11,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:15:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:15:11,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:15:11,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386323842] [2019-12-18 14:15:11,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:15:11,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:15:11,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789614707] [2019-12-18 14:15:11,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:15:11,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:15:11,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:15:11,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:15:11,636 INFO L87 Difference]: Start difference. First operand 949 states and 2023 transitions. Second operand 6 states. [2019-12-18 14:15:12,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:15:12,245 INFO L93 Difference]: Finished difference Result 1405 states and 2968 transitions. [2019-12-18 14:15:12,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 14:15:12,246 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-18 14:15:12,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:15:12,248 INFO L225 Difference]: With dead ends: 1405 [2019-12-18 14:15:12,248 INFO L226 Difference]: Without dead ends: 1405 [2019-12-18 14:15:12,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:15:12,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2019-12-18 14:15:12,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1132. [2019-12-18 14:15:12,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2019-12-18 14:15:12,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 2413 transitions. [2019-12-18 14:15:12,266 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 2413 transitions. Word has length 68 [2019-12-18 14:15:12,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:15:12,269 INFO L462 AbstractCegarLoop]: Abstraction has 1132 states and 2413 transitions. [2019-12-18 14:15:12,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:15:12,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 2413 transitions. [2019-12-18 14:15:12,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:15:12,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:15:12,272 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:15:12,272 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:15:12,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:15:12,273 INFO L82 PathProgramCache]: Analyzing trace with hash 188736084, now seen corresponding path program 2 times [2019-12-18 14:15:12,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:15:12,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54426689] [2019-12-18 14:15:12,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:15:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:15:12,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:15:12,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54426689] [2019-12-18 14:15:12,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:15:12,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:15:12,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461176502] [2019-12-18 14:15:12,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:15:12,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:15:12,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:15:12,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:15:12,399 INFO L87 Difference]: Start difference. First operand 1132 states and 2413 transitions. Second operand 3 states. [2019-12-18 14:15:12,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:15:12,415 INFO L93 Difference]: Finished difference Result 963 states and 2007 transitions. [2019-12-18 14:15:12,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:15:12,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-18 14:15:12,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:15:12,418 INFO L225 Difference]: With dead ends: 963 [2019-12-18 14:15:12,418 INFO L226 Difference]: Without dead ends: 963 [2019-12-18 14:15:12,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:15:12,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-12-18 14:15:12,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2019-12-18 14:15:12,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-12-18 14:15:12,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 2007 transitions. [2019-12-18 14:15:12,433 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 2007 transitions. Word has length 68 [2019-12-18 14:15:12,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:15:12,433 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 2007 transitions. [2019-12-18 14:15:12,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:15:12,434 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 2007 transitions. [2019-12-18 14:15:12,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-18 14:15:12,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:15:12,437 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:15:12,437 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:15:12,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:15:12,438 INFO L82 PathProgramCache]: Analyzing trace with hash 788994926, now seen corresponding path program 1 times [2019-12-18 14:15:12,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:15:12,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104610773] [2019-12-18 14:15:12,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:15:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:15:12,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:15:12,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104610773] [2019-12-18 14:15:12,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:15:12,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:15:12,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204893288] [2019-12-18 14:15:12,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:15:12,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:15:12,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:15:12,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:15:12,596 INFO L87 Difference]: Start difference. First operand 963 states and 2007 transitions. Second operand 5 states. [2019-12-18 14:15:12,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:15:12,821 INFO L93 Difference]: Finished difference Result 1101 states and 2255 transitions. [2019-12-18 14:15:12,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:15:12,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-18 14:15:12,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:15:12,823 INFO L225 Difference]: With dead ends: 1101 [2019-12-18 14:15:12,823 INFO L226 Difference]: Without dead ends: 1101 [2019-12-18 14:15:12,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:15:12,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2019-12-18 14:15:12,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1048. [2019-12-18 14:15:12,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-12-18 14:15:12,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 2161 transitions. [2019-12-18 14:15:12,834 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 2161 transitions. Word has length 69 [2019-12-18 14:15:12,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:15:12,834 INFO L462 AbstractCegarLoop]: Abstraction has 1048 states and 2161 transitions. [2019-12-18 14:15:12,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:15:12,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 2161 transitions. [2019-12-18 14:15:12,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-18 14:15:12,836 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:15:12,836 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:15:12,837 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:15:12,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:15:12,837 INFO L82 PathProgramCache]: Analyzing trace with hash -103545414, now seen corresponding path program 2 times [2019-12-18 14:15:12,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:15:12,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535513851] [2019-12-18 14:15:12,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:15:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:15:13,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:15:13,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535513851] [2019-12-18 14:15:13,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:15:13,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 14:15:13,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128058754] [2019-12-18 14:15:13,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:15:13,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:15:13,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:15:13,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:15:13,092 INFO L87 Difference]: Start difference. First operand 1048 states and 2161 transitions. Second operand 11 states. [2019-12-18 14:15:13,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:15:13,802 INFO L93 Difference]: Finished difference Result 1756 states and 3543 transitions. [2019-12-18 14:15:13,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 14:15:13,803 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2019-12-18 14:15:13,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:15:13,805 INFO L225 Difference]: With dead ends: 1756 [2019-12-18 14:15:13,805 INFO L226 Difference]: Without dead ends: 1756 [2019-12-18 14:15:13,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:15:13,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2019-12-18 14:15:13,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1356. [2019-12-18 14:15:13,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1356 states. [2019-12-18 14:15:13,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 2783 transitions. [2019-12-18 14:15:13,822 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 2783 transitions. Word has length 69 [2019-12-18 14:15:13,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:15:13,822 INFO L462 AbstractCegarLoop]: Abstraction has 1356 states and 2783 transitions. [2019-12-18 14:15:13,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:15:13,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 2783 transitions. [2019-12-18 14:15:13,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-18 14:15:13,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:15:13,824 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:15:13,824 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:15:13,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:15:13,824 INFO L82 PathProgramCache]: Analyzing trace with hash 112597072, now seen corresponding path program 1 times [2019-12-18 14:15:13,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:15:13,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868642766] [2019-12-18 14:15:13,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:15:13,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:15:13,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:15:13,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868642766] [2019-12-18 14:15:13,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:15:13,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:15:13,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858034737] [2019-12-18 14:15:13,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:15:13,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:15:13,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:15:13,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:15:13,931 INFO L87 Difference]: Start difference. First operand 1356 states and 2783 transitions. Second operand 5 states. [2019-12-18 14:15:13,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:15:13,975 INFO L93 Difference]: Finished difference Result 1612 states and 3236 transitions. [2019-12-18 14:15:13,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:15:13,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-12-18 14:15:13,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:15:13,977 INFO L225 Difference]: With dead ends: 1612 [2019-12-18 14:15:13,977 INFO L226 Difference]: Without dead ends: 307 [2019-12-18 14:15:13,977 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 14:15:13,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-12-18 14:15:13,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2019-12-18 14:15:13,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-12-18 14:15:13,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 527 transitions. [2019-12-18 14:15:13,982 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 527 transitions. Word has length 70 [2019-12-18 14:15:13,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:15:13,982 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 527 transitions. [2019-12-18 14:15:13,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:15:13,982 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 527 transitions. [2019-12-18 14:15:13,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-18 14:15:13,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:15:13,984 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:15:13,984 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:15:13,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:15:13,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1184201342, now seen corresponding path program 2 times [2019-12-18 14:15:13,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:15:13,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233461257] [2019-12-18 14:15:13,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:15:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:15:14,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:15:14,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233461257] [2019-12-18 14:15:14,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:15:14,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 14:15:14,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605227431] [2019-12-18 14:15:14,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:15:14,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:15:14,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:15:14,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:15:14,302 INFO L87 Difference]: Start difference. First operand 307 states and 527 transitions. Second operand 11 states. [2019-12-18 14:15:14,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:15:14,841 INFO L93 Difference]: Finished difference Result 647 states and 1122 transitions. [2019-12-18 14:15:14,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 14:15:14,842 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2019-12-18 14:15:14,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:15:14,845 INFO L225 Difference]: With dead ends: 647 [2019-12-18 14:15:14,845 INFO L226 Difference]: Without dead ends: 647 [2019-12-18 14:15:14,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2019-12-18 14:15:14,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-12-18 14:15:14,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 357. [2019-12-18 14:15:14,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-12-18 14:15:14,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 616 transitions. [2019-12-18 14:15:14,851 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 616 transitions. Word has length 70 [2019-12-18 14:15:14,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:15:14,852 INFO L462 AbstractCegarLoop]: Abstraction has 357 states and 616 transitions. [2019-12-18 14:15:14,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:15:14,852 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 616 transitions. [2019-12-18 14:15:14,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-18 14:15:14,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:15:14,853 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:15:14,853 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:15:14,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:15:14,854 INFO L82 PathProgramCache]: Analyzing trace with hash -59017392, now seen corresponding path program 3 times [2019-12-18 14:15:14,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:15:14,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736390907] [2019-12-18 14:15:14,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:15:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:15:14,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:15:14,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736390907] [2019-12-18 14:15:14,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:15:14,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:15:14,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037751623] [2019-12-18 14:15:14,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:15:14,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:15:14,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:15:14,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:15:14,950 INFO L87 Difference]: Start difference. First operand 357 states and 616 transitions. Second operand 3 states. [2019-12-18 14:15:14,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:15:14,986 INFO L93 Difference]: Finished difference Result 356 states and 614 transitions. [2019-12-18 14:15:14,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:15:14,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-18 14:15:14,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:15:14,988 INFO L225 Difference]: With dead ends: 356 [2019-12-18 14:15:14,988 INFO L226 Difference]: Without dead ends: 356 [2019-12-18 14:15:14,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:15:14,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-12-18 14:15:14,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 250. [2019-12-18 14:15:14,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-18 14:15:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 418 transitions. [2019-12-18 14:15:14,992 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 418 transitions. Word has length 70 [2019-12-18 14:15:14,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:15:14,993 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 418 transitions. [2019-12-18 14:15:14,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:15:14,993 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 418 transitions. [2019-12-18 14:15:14,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-18 14:15:14,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:15:14,994 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:15:14,995 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:15:14,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:15:14,995 INFO L82 PathProgramCache]: Analyzing trace with hash -642215500, now seen corresponding path program 1 times [2019-12-18 14:15:14,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:15:14,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336666800] [2019-12-18 14:15:14,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:15:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:15:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:15:15,151 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:15:15,151 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:15:15,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~weak$$choice0~0_155) (= v_~y~0_275 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1719~0.base_30| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1719~0.base_30|) |v_ULTIMATE.start_main_~#t1719~0.offset_22| 0)) |v_#memory_int_17|) (= v_~y$r_buff1_thd1~0_174 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_865 0) (= 0 v_~y$w_buff0~0_221) (= v_~y$w_buff1~0_203 0) (= v_~y$r_buff0_thd0~0_374 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1719~0.base_30|) (= v_~y$r_buff1_thd0~0_352 0) (= v_~__unbuffered_p1_EBX~0_37 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1719~0.base_30| 4)) (= v_~y$mem_tmp~0_168 0) (= v_~y$w_buff1_used~0_515 0) (= 0 v_~y$r_buff1_thd2~0_343) (= 0 v_~__unbuffered_p1_EAX~0_60) (= 0 v_~y$r_buff0_thd2~0_460) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_4|) (= v_~weak$$choice2~0_236 0) (= v_~main$tmp_guard0~0_33 0) (= |v_#NULL.offset_4| 0) (= v_~x~0_25 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1719~0.base_30|) 0) (= v_~y$r_buff0_thd1~0_98 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~__unbuffered_cnt~0_42) (= |v_ULTIMATE.start_main_~#t1719~0.offset_22| 0) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t1719~0.base_30| 1)) (= v_~main$tmp_guard1~0_40 0) (= v_~y$flush_delayed~0_204 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_125|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_59|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_113|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_55|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_33|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_52|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~y$mem_tmp~0=v_~y$mem_tmp~0_168, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_60, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_98, ~y$flush_delayed~0=v_~y$flush_delayed~0_204, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet47=|v_ULTIMATE.start_main_#t~nondet47_57|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_42|, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_65|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_36|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_33|, ~weak$$choice0~0=v_~weak$$choice0~0_155, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_49|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_83|, ~y$w_buff1~0=v_~y$w_buff1~0_203, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_460, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_352, ~x~0=v_~x~0_25, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_865, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_69|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_141|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_27|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_50|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_174, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_61|, ULTIMATE.start_main_~#t1720~0.offset=|v_ULTIMATE.start_main_~#t1720~0.offset_22|, ~y$w_buff0~0=v_~y$w_buff0~0_221, ~y~0=v_~y~0_275, ULTIMATE.start_main_~#t1720~0.base=|v_ULTIMATE.start_main_~#t1720~0.base_30|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_37, ULTIMATE.start_main_~#t1719~0.base=|v_ULTIMATE.start_main_~#t1719~0.base_30|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_57|, ULTIMATE.start_main_~#t1719~0.offset=|v_ULTIMATE.start_main_~#t1719~0.offset_22|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_40|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_105|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_33, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_62|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_95|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_32|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_343, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_162|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_374, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ~weak$$choice2~0=v_~weak$$choice2~0_236, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_515} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet47, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t1720~0.offset, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_~#t1720~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1719~0.base, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t1719~0.offset, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 14:15:15,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L797-1-->L799: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1720~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1720~0.base_13|) |v_ULTIMATE.start_main_~#t1720~0.offset_11| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t1720~0.base_13|)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1720~0.base_13| 4)) (= (select |v_#valid_27| |v_ULTIMATE.start_main_~#t1720~0.base_13|) 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1720~0.base_13|) (= (store |v_#valid_27| |v_ULTIMATE.start_main_~#t1720~0.base_13| 1) |v_#valid_26|) (= 0 |v_ULTIMATE.start_main_~#t1720~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1720~0.offset=|v_ULTIMATE.start_main_~#t1720~0.offset_11|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1720~0.base=|v_ULTIMATE.start_main_~#t1720~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1720~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1720~0.base] because there is no mapped edge [2019-12-18 14:15:15,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_7) (= v_P1Thread1of1ForFork1_~arg.base_7 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= 0 (mod v_~y$w_buff1_used~0_77 256)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|) (= v_~y$w_buff0_used~0_156 1) (= v_~y$w_buff0~0_36 v_~y$w_buff1~0_27) (= 2 v_~y$w_buff0~0_35) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7| 1) (= v_~y$w_buff1_used~0_77 v_~y$w_buff0_used~0_157)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_157, ~y$w_buff0~0=v_~y$w_buff0~0_36, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_156, ~y$w_buff1~0=v_~y$w_buff1~0_27, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_7, ~y$w_buff0~0=v_~y$w_buff0~0_35, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_77} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 14:15:15,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L759-2-->L759-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-585299451 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-585299451 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite12_Out-585299451| |P1Thread1of1ForFork1_#t~ite11_Out-585299451|))) (or (and (not .cse0) (= ~y$w_buff0~0_In-585299451 |P1Thread1of1ForFork1_#t~ite11_Out-585299451|) (not .cse1) .cse2) (and (or .cse1 .cse0) (= ~y$w_buff1~0_In-585299451 |P1Thread1of1ForFork1_#t~ite11_Out-585299451|) .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-585299451, ~y$w_buff1~0=~y$w_buff1~0_In-585299451, ~y$w_buff0~0=~y$w_buff0~0_In-585299451, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-585299451} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-585299451, ~y$w_buff1~0=~y$w_buff1~0_In-585299451, ~y$w_buff0~0=~y$w_buff0~0_In-585299451, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-585299451, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-585299451|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-585299451|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 14:15:15,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L764-->L765: Formula: (and (= v_~y$r_buff0_thd2~0_138 v_~y$r_buff0_thd2~0_137) (not (= 0 (mod v_~weak$$choice2~0_59 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_138, ~weak$$choice2~0=v_~weak$$choice2~0_59} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_137, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_59, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_17|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_11|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 14:15:15,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In53971150 256)))) (or (and .cse0 (= ~y~0_In53971150 |P1Thread1of1ForFork1_#t~ite31_Out53971150|)) (and (= |P1Thread1of1ForFork1_#t~ite31_Out53971150| ~y$mem_tmp~0_In53971150) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In53971150, ~y$flush_delayed~0=~y$flush_delayed~0_In53971150, ~y~0=~y~0_In53971150} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In53971150, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out53971150|, ~y$flush_delayed~0=~y$flush_delayed~0_In53971150, ~y~0=~y~0_In53971150} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 14:15:15,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L730-2-->L730-5: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd1~0_In-843908614 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-843908614 256) 0)) (.cse1 (= |P0Thread1of1ForFork0_#t~ite4_Out-843908614| |P0Thread1of1ForFork0_#t~ite3_Out-843908614|))) (or (and (= ~y$w_buff1~0_In-843908614 |P0Thread1of1ForFork0_#t~ite3_Out-843908614|) (not .cse0) .cse1 (not .cse2)) (and (= ~y~0_In-843908614 |P0Thread1of1ForFork0_#t~ite3_Out-843908614|) (or .cse2 .cse0) .cse1))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-843908614, ~y$w_buff1~0=~y$w_buff1~0_In-843908614, ~y~0=~y~0_In-843908614, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-843908614} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-843908614, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-843908614|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-843908614|, ~y$w_buff1~0=~y$w_buff1~0_In-843908614, ~y~0=~y~0_In-843908614, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-843908614} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 14:15:15,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L731-->L731-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In460482847 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In460482847 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out460482847|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In460482847 |P0Thread1of1ForFork0_#t~ite5_Out460482847|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In460482847, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In460482847} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out460482847|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In460482847, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In460482847} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 14:15:15,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [944] [944] L732-->L732-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-107619162 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-107619162 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-107619162 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-107619162 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-107619162| ~y$w_buff1_used~0_In-107619162) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-107619162| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-107619162, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-107619162, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-107619162, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-107619162} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-107619162|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-107619162, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-107619162, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-107619162, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-107619162} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 14:15:15,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L733-->L733-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1317088266 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1317088266 256)))) (or (and (= ~y$r_buff0_thd1~0_In-1317088266 |P0Thread1of1ForFork0_#t~ite7_Out-1317088266|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-1317088266|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1317088266, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1317088266} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1317088266, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1317088266|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1317088266} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 14:15:15,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L734-->L734-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd1~0_In-1047175553 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1047175553 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In-1047175553 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1047175553 256)))) (or (and (= ~y$r_buff1_thd1~0_In-1047175553 |P0Thread1of1ForFork0_#t~ite8_Out-1047175553|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1047175553|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1047175553, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1047175553, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1047175553, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1047175553} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1047175553, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1047175553, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1047175553|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1047175553, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1047175553} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 14:15:15,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L734-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_141 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_141, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 14:15:15,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In716816996 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In716816996 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out716816996| ~y$w_buff0_used~0_In716816996)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out716816996|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In716816996, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In716816996} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In716816996, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In716816996, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out716816996|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 14:15:15,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [939] [939] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1135730559 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1135730559 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-1135730559 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1135730559 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1135730559|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-1135730559 |P1Thread1of1ForFork1_#t~ite35_Out-1135730559|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1135730559, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1135730559, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1135730559, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1135730559} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1135730559, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1135730559, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1135730559, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1135730559|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1135730559} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 14:15:15,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L777-->L778: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1425670812 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1425670812 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-1425670812 ~y$r_buff0_thd2~0_Out-1425670812)) (and (= 0 ~y$r_buff0_thd2~0_Out-1425670812) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1425670812, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1425670812} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1425670812, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1425670812, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1425670812|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 14:15:15,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L778-->L778-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In128549936 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In128549936 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In128549936 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In128549936 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out128549936|)) (and (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In128549936 |P1Thread1of1ForFork1_#t~ite37_Out128549936|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In128549936, ~y$w_buff0_used~0=~y$w_buff0_used~0_In128549936, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In128549936, ~y$w_buff1_used~0=~y$w_buff1_used~0_In128549936} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In128549936, ~y$w_buff0_used~0=~y$w_buff0_used~0_In128549936, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In128549936, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out128549936|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In128549936} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 14:15:15,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L778-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_155 |v_P1Thread1of1ForFork1_#t~ite37_22|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_155, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 14:15:15,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L803-->L805-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_55 256)) (= (mod v_~y$w_buff0_used~0_124 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_55, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_55, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 14:15:15,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L805-2-->L805-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1357644194 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1357644194 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out1357644194| ~y$w_buff1~0_In1357644194) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out1357644194| ~y~0_In1357644194) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1357644194, ~y~0=~y~0_In1357644194, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1357644194, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1357644194} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1357644194|, ~y$w_buff1~0=~y$w_buff1~0_In1357644194, ~y~0=~y~0_In1357644194, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1357644194, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1357644194} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 14:15:15,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L805-4-->L806: Formula: (= v_~y~0_55 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y~0=v_~y~0_55} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-18 14:15:15,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1117043928 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1117043928 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out1117043928| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1117043928 |ULTIMATE.start_main_#t~ite42_Out1117043928|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1117043928, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1117043928} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1117043928, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1117043928, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1117043928|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 14:15:15,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L807-->L807-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-1163811202 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1163811202 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-1163811202 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1163811202 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1163811202 |ULTIMATE.start_main_#t~ite43_Out-1163811202|)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-1163811202|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1163811202, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1163811202, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1163811202, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1163811202} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1163811202, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1163811202, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1163811202|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1163811202, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1163811202} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 14:15:15,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In217398430 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In217398430 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out217398430| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out217398430| ~y$r_buff0_thd0~0_In217398430)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In217398430, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In217398430} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In217398430, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In217398430, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out217398430|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 14:15:15,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In992947047 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In992947047 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In992947047 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In992947047 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out992947047| 0)) (and (= ~y$r_buff1_thd0~0_In992947047 |ULTIMATE.start_main_#t~ite45_Out992947047|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In992947047, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In992947047, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In992947047, ~y$w_buff1_used~0=~y$w_buff1_used~0_In992947047} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In992947047, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In992947047, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In992947047, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out992947047|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In992947047} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 14:15:15,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1456087303 256) 0))) (or (and (= ~y~0_In-1456087303 |ULTIMATE.start_main_#t~ite68_Out-1456087303|) .cse0) (and (= ~y$mem_tmp~0_In-1456087303 |ULTIMATE.start_main_#t~ite68_Out-1456087303|) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1456087303, ~y$flush_delayed~0=~y$flush_delayed~0_In-1456087303, ~y~0=~y~0_In-1456087303} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1456087303, ~y$flush_delayed~0=~y$flush_delayed~0_In-1456087303, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-1456087303|, ~y~0=~y~0_In-1456087303} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-18 14:15:15,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_262 |v_ULTIMATE.start_main_#t~ite68_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$flush_delayed~0_189 0)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~y$flush_delayed~0=v_~y$flush_delayed~0_189, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_39|, ~y~0=v_~y~0_262, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite68, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:15:15,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:15:15 BasicIcfg [2019-12-18 14:15:15,284 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:15:15,285 INFO L168 Benchmark]: Toolchain (without parser) took 30634.12 ms. Allocated memory was 140.0 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 98.8 MB in the beginning and 989.1 MB in the end (delta: -890.3 MB). Peak memory consumption was 621.2 MB. Max. memory is 7.1 GB. [2019-12-18 14:15:15,286 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory was 119.6 MB in the beginning and 119.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 14:15:15,290 INFO L168 Benchmark]: CACSL2BoogieTranslator took 787.67 ms. Allocated memory was 140.0 MB in the beginning and 201.3 MB in the end (delta: 61.3 MB). Free memory was 98.6 MB in the beginning and 153.4 MB in the end (delta: -54.9 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:15:15,290 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.70 ms. Allocated memory is still 201.3 MB. Free memory was 153.4 MB in the beginning and 150.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-18 14:15:15,291 INFO L168 Benchmark]: Boogie Preprocessor took 44.21 ms. Allocated memory is still 201.3 MB. Free memory was 150.1 MB in the beginning and 147.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:15:15,291 INFO L168 Benchmark]: RCFGBuilder took 947.95 ms. Allocated memory is still 201.3 MB. Free memory was 147.3 MB in the beginning and 91.5 MB in the end (delta: 55.8 MB). Peak memory consumption was 55.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:15:15,292 INFO L168 Benchmark]: TraceAbstraction took 28775.41 ms. Allocated memory was 201.3 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 91.5 MB in the beginning and 989.1 MB in the end (delta: -897.6 MB). Peak memory consumption was 552.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:15:15,295 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory was 119.6 MB in the beginning and 119.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 787.67 ms. Allocated memory was 140.0 MB in the beginning and 201.3 MB in the end (delta: 61.3 MB). Free memory was 98.6 MB in the beginning and 153.4 MB in the end (delta: -54.9 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.70 ms. Allocated memory is still 201.3 MB. Free memory was 153.4 MB in the beginning and 150.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.21 ms. Allocated memory is still 201.3 MB. Free memory was 150.1 MB in the beginning and 147.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 947.95 ms. Allocated memory is still 201.3 MB. Free memory was 147.3 MB in the beginning and 91.5 MB in the end (delta: 55.8 MB). Peak memory consumption was 55.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28775.41 ms. Allocated memory was 201.3 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 91.5 MB in the beginning and 989.1 MB in the end (delta: -897.6 MB). Peak memory consumption was 552.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 189 ProgramPointsBefore, 112 ProgramPointsAfterwards, 244 TransitionsBefore, 137 TransitionsAfterwards, 25246 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 55 ConcurrentYvCompositions, 33 ChoiceCompositions, 10314 VarBasedMoverChecksPositive, 294 VarBasedMoverChecksNegative, 64 SemBasedMoverChecksPositive, 333 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 142511 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1719, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] FCALL, FORK 0 pthread_create(&t1720, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L749] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L750] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L751] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L752] 2 y$r_buff0_thd2 = (_Bool)1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L763] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y = y$flush_delayed ? y$mem_tmp : y [L768] 2 y$flush_delayed = (_Bool)0 [L771] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 x = 1 [L727] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L730] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L730] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L732] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L733] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L809] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L812] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 0 y$flush_delayed = weak$$choice2 [L815] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L816] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L816] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L817] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L818] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L818] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L819] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L819] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L820] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L820] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L822] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L823] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 183 locations, 2 error locations. Result: UNSAFE, OverallTime: 28.4s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2572 SDtfs, 2190 SDslu, 4868 SDs, 0 SdLazy, 2782 SolverSat, 131 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 20 SyntacticMatches, 14 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47611occurred 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: 13.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 23347 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 661 NumberOfCodeBlocks, 661 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 577 ConstructedInterpolants, 0 QuantifiedInterpolants, 97736 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...