/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix053_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:38:05,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:38:05,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:38:05,389 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:38:05,390 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:38:05,392 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:38:05,394 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:38:05,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:38:05,407 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:38:05,410 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:38:05,412 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:38:05,414 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:38:05,414 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:38:05,416 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:38:05,418 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:38:05,419 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:38:05,421 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:38:05,421 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:38:05,423 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:38:05,427 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:38:05,431 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:38:05,436 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:38:05,437 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:38:05,437 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:38:05,439 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:38:05,440 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:38:05,440 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:38:05,442 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:38:05,443 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:38:05,444 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:38:05,444 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:38:05,445 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:38:05,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:38:05,448 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:38:05,449 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:38:05,449 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:38:05,450 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:38:05,450 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:38:05,450 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:38:05,451 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:38:05,452 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:38:05,453 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:38:05,466 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:38:05,466 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:38:05,467 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:38:05,468 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:38:05,468 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:38:05,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:38:05,468 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:38:05,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:38:05,469 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:38:05,469 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:38:05,469 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:38:05,469 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:38:05,469 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:38:05,470 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:38:05,470 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:38:05,470 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:38:05,470 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:38:05,470 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:38:05,471 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:38:05,471 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:38:05,471 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:38:05,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:38:05,471 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:38:05,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:38:05,472 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:38:05,472 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:38:05,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:38:05,472 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:38:05,473 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:38:05,473 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:38:05,473 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:38:05,473 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:38:05,743 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:38:05,759 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:38:05,763 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:38:05,765 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:38:05,767 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:38:05,768 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053_pso.opt.i [2019-12-27 21:38:05,839 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/922f05696/e813bd0e1c6c4bda9176a2213dc711a1/FLAGf9a5d687a [2019-12-27 21:38:06,346 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:38:06,346 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_pso.opt.i [2019-12-27 21:38:06,365 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/922f05696/e813bd0e1c6c4bda9176a2213dc711a1/FLAGf9a5d687a [2019-12-27 21:38:06,702 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/922f05696/e813bd0e1c6c4bda9176a2213dc711a1 [2019-12-27 21:38:06,712 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:38:06,714 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:38:06,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:38:06,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:38:06,719 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:38:06,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:38:06" (1/1) ... [2019-12-27 21:38:06,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c762407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:38:06, skipping insertion in model container [2019-12-27 21:38:06,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:38:06" (1/1) ... [2019-12-27 21:38:06,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:38:06,799 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:38:07,344 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:38:07,362 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:38:07,455 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:38:07,526 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:38:07,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:38:07 WrapperNode [2019-12-27 21:38:07,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:38:07,528 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:38:07,528 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:38:07,528 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:38:07,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:38:07" (1/1) ... [2019-12-27 21:38:07,561 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:38:07" (1/1) ... [2019-12-27 21:38:07,598 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:38:07,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:38:07,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:38:07,598 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:38:07,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:38:07" (1/1) ... [2019-12-27 21:38:07,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:38:07" (1/1) ... [2019-12-27 21:38:07,621 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:38:07" (1/1) ... [2019-12-27 21:38:07,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:38:07" (1/1) ... [2019-12-27 21:38:07,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:38:07" (1/1) ... [2019-12-27 21:38:07,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:38:07" (1/1) ... [2019-12-27 21:38:07,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:38:07" (1/1) ... [2019-12-27 21:38:07,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:38:07,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:38:07,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:38:07,652 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:38:07,656 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:38:07" (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-27 21:38:07,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:38:07,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:38:07,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:38:07,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:38:07,726 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:38:07,726 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:38:07,726 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:38:07,726 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:38:07,726 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:38:07,727 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:38:07,727 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 21:38:07,727 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 21:38:07,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:38:07,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:38:07,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:38:07,729 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 21:38:08,480 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:38:08,481 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:38:08,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:38:08 BoogieIcfgContainer [2019-12-27 21:38:08,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:38:08,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:38:08,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:38:08,487 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:38:08,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:38:06" (1/3) ... [2019-12-27 21:38:08,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b30af42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:38:08, skipping insertion in model container [2019-12-27 21:38:08,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:38:07" (2/3) ... [2019-12-27 21:38:08,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b30af42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:38:08, skipping insertion in model container [2019-12-27 21:38:08,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:38:08" (3/3) ... [2019-12-27 21:38:08,491 INFO L109 eAbstractionObserver]: Analyzing ICFG mix053_pso.opt.i [2019-12-27 21:38:08,502 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:38:08,502 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:38:08,513 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:38:08,514 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:38:08,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,561 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,562 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,563 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,563 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,566 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,566 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,590 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,590 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,590 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,590 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,591 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,591 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,591 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,591 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,592 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,592 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,592 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,608 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,608 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,609 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,609 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,609 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,609 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,610 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,610 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,610 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,610 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,610 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,611 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,611 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,611 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,611 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,611 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,612 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,612 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,612 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,612 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,612 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,613 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,613 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,618 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,620 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,624 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,625 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,625 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,625 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,625 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,625 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,626 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,626 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,626 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,626 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,626 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,626 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,629 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,630 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,632 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,633 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:38:08,646 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 21:38:08,663 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:38:08,663 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:38:08,663 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:38:08,663 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:38:08,663 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:38:08,664 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:38:08,664 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:38:08,664 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:38:08,681 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 189 transitions [2019-12-27 21:38:08,683 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 167 places, 189 transitions [2019-12-27 21:38:08,776 INFO L132 PetriNetUnfolder]: 35/185 cut-off events. [2019-12-27 21:38:08,776 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:38:08,790 INFO L76 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 185 events. 35/185 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 348 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 21:38:08,811 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 167 places, 189 transitions [2019-12-27 21:38:08,860 INFO L132 PetriNetUnfolder]: 35/185 cut-off events. [2019-12-27 21:38:08,861 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:38:08,867 INFO L76 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 185 events. 35/185 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 348 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 21:38:08,883 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-27 21:38:08,884 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:38:09,608 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2019-12-27 21:38:12,282 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 21:38:12,400 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 21:38:12,738 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 21:38:12,889 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 21:38:12,910 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50569 [2019-12-27 21:38:12,910 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-27 21:38:12,913 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 87 transitions [2019-12-27 21:38:14,613 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27134 states. [2019-12-27 21:38:14,615 INFO L276 IsEmpty]: Start isEmpty. Operand 27134 states. [2019-12-27 21:38:14,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 21:38:14,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:14,623 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:38:14,624 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:38:14,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:14,630 INFO L82 PathProgramCache]: Analyzing trace with hash -2082077885, now seen corresponding path program 1 times [2019-12-27 21:38:14,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:14,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002774252] [2019-12-27 21:38:14,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:14,905 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-27 21:38:14,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002774252] [2019-12-27 21:38:14,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:14,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:38:14,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [881825389] [2019-12-27 21:38:14,910 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:14,916 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:14,931 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 21:38:14,932 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:14,936 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:38:14,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:38:14,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:14,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:38:14,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:38:14,953 INFO L87 Difference]: Start difference. First operand 27134 states. Second operand 3 states. [2019-12-27 21:38:16,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:16,088 INFO L93 Difference]: Finished difference Result 26286 states and 115156 transitions. [2019-12-27 21:38:16,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:38:16,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 21:38:16,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:16,346 INFO L225 Difference]: With dead ends: 26286 [2019-12-27 21:38:16,347 INFO L226 Difference]: Without dead ends: 24606 [2019-12-27 21:38:16,348 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-27 21:38:16,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24606 states. [2019-12-27 21:38:17,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24606 to 24606. [2019-12-27 21:38:17,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24606 states. [2019-12-27 21:38:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24606 states to 24606 states and 107644 transitions. [2019-12-27 21:38:18,815 INFO L78 Accepts]: Start accepts. Automaton has 24606 states and 107644 transitions. Word has length 9 [2019-12-27 21:38:18,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:18,816 INFO L462 AbstractCegarLoop]: Abstraction has 24606 states and 107644 transitions. [2019-12-27 21:38:18,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:38:18,817 INFO L276 IsEmpty]: Start isEmpty. Operand 24606 states and 107644 transitions. [2019-12-27 21:38:18,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 21:38:18,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:18,824 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:38:18,825 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:38:18,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:18,825 INFO L82 PathProgramCache]: Analyzing trace with hash 2101467982, now seen corresponding path program 1 times [2019-12-27 21:38:18,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:18,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563234873] [2019-12-27 21:38:18,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:18,892 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-27 21:38:18,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563234873] [2019-12-27 21:38:18,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:18,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:38:18,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [196714768] [2019-12-27 21:38:18,895 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:18,896 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:18,904 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 21:38:18,905 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:18,905 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:38:18,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:38:18,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:18,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:38:18,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:38:18,907 INFO L87 Difference]: Start difference. First operand 24606 states and 107644 transitions. Second operand 3 states. [2019-12-27 21:38:19,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:19,174 INFO L93 Difference]: Finished difference Result 19680 states and 80079 transitions. [2019-12-27 21:38:19,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:38:19,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 21:38:19,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:19,278 INFO L225 Difference]: With dead ends: 19680 [2019-12-27 21:38:19,278 INFO L226 Difference]: Without dead ends: 19680 [2019-12-27 21:38:19,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:38:19,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19680 states. [2019-12-27 21:38:20,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19680 to 19680. [2019-12-27 21:38:20,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19680 states. [2019-12-27 21:38:20,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19680 states to 19680 states and 80079 transitions. [2019-12-27 21:38:20,220 INFO L78 Accepts]: Start accepts. Automaton has 19680 states and 80079 transitions. Word has length 15 [2019-12-27 21:38:20,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:20,220 INFO L462 AbstractCegarLoop]: Abstraction has 19680 states and 80079 transitions. [2019-12-27 21:38:20,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:38:20,220 INFO L276 IsEmpty]: Start isEmpty. Operand 19680 states and 80079 transitions. [2019-12-27 21:38:20,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:38:20,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:20,224 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:38:20,224 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:38:20,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:20,225 INFO L82 PathProgramCache]: Analyzing trace with hash -740930963, now seen corresponding path program 1 times [2019-12-27 21:38:20,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:20,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308173581] [2019-12-27 21:38:20,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:20,306 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-27 21:38:20,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308173581] [2019-12-27 21:38:20,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:20,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:38:20,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [377376537] [2019-12-27 21:38:20,310 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:20,312 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:20,316 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 21:38:20,316 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:20,351 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:38:20,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:38:20,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:20,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:38:20,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:38:20,352 INFO L87 Difference]: Start difference. First operand 19680 states and 80079 transitions. Second operand 5 states. [2019-12-27 21:38:20,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:20,450 INFO L93 Difference]: Finished difference Result 9128 states and 31583 transitions. [2019-12-27 21:38:20,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:38:20,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 21:38:20,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:20,480 INFO L225 Difference]: With dead ends: 9128 [2019-12-27 21:38:20,481 INFO L226 Difference]: Without dead ends: 9128 [2019-12-27 21:38:20,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:38:20,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9128 states. [2019-12-27 21:38:20,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9128 to 9128. [2019-12-27 21:38:20,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9128 states. [2019-12-27 21:38:20,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9128 states to 9128 states and 31583 transitions. [2019-12-27 21:38:20,955 INFO L78 Accepts]: Start accepts. Automaton has 9128 states and 31583 transitions. Word has length 16 [2019-12-27 21:38:20,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:20,956 INFO L462 AbstractCegarLoop]: Abstraction has 9128 states and 31583 transitions. [2019-12-27 21:38:20,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:38:20,956 INFO L276 IsEmpty]: Start isEmpty. Operand 9128 states and 31583 transitions. [2019-12-27 21:38:20,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 21:38:20,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:20,959 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:38:20,959 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:38:20,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:20,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1638469218, now seen corresponding path program 1 times [2019-12-27 21:38:20,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:20,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371224301] [2019-12-27 21:38:20,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:21,061 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-27 21:38:21,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371224301] [2019-12-27 21:38:21,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:21,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:38:21,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [504787620] [2019-12-27 21:38:21,063 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:21,067 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:21,071 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 21:38:21,071 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:21,099 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:38:21,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:38:21,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:21,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:38:21,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:38:21,100 INFO L87 Difference]: Start difference. First operand 9128 states and 31583 transitions. Second operand 6 states. [2019-12-27 21:38:21,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:21,171 INFO L93 Difference]: Finished difference Result 2778 states and 8748 transitions. [2019-12-27 21:38:21,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:38:21,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-27 21:38:21,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:21,178 INFO L225 Difference]: With dead ends: 2778 [2019-12-27 21:38:21,178 INFO L226 Difference]: Without dead ends: 2778 [2019-12-27 21:38:21,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:38:21,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2778 states. [2019-12-27 21:38:21,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 2778. [2019-12-27 21:38:21,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2778 states. [2019-12-27 21:38:21,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2778 states to 2778 states and 8748 transitions. [2019-12-27 21:38:21,233 INFO L78 Accepts]: Start accepts. Automaton has 2778 states and 8748 transitions. Word has length 17 [2019-12-27 21:38:21,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:21,233 INFO L462 AbstractCegarLoop]: Abstraction has 2778 states and 8748 transitions. [2019-12-27 21:38:21,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:38:21,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2778 states and 8748 transitions. [2019-12-27 21:38:21,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 21:38:21,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:21,237 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:38:21,237 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:38:21,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:21,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1378718161, now seen corresponding path program 1 times [2019-12-27 21:38:21,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:21,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235249668] [2019-12-27 21:38:21,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:21,280 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-27 21:38:21,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235249668] [2019-12-27 21:38:21,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:21,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:38:21,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1550732492] [2019-12-27 21:38:21,281 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:21,284 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:21,288 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 54 transitions. [2019-12-27 21:38:21,289 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:21,316 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:38:21,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:38:21,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:21,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:38:21,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:38:21,317 INFO L87 Difference]: Start difference. First operand 2778 states and 8748 transitions. Second operand 5 states. [2019-12-27 21:38:21,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:21,431 INFO L93 Difference]: Finished difference Result 4006 states and 12172 transitions. [2019-12-27 21:38:21,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:38:21,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-27 21:38:21,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:21,441 INFO L225 Difference]: With dead ends: 4006 [2019-12-27 21:38:21,441 INFO L226 Difference]: Without dead ends: 4006 [2019-12-27 21:38:21,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:38:21,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4006 states. [2019-12-27 21:38:21,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4006 to 3258. [2019-12-27 21:38:21,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3258 states. [2019-12-27 21:38:21,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3258 states to 3258 states and 10122 transitions. [2019-12-27 21:38:21,536 INFO L78 Accepts]: Start accepts. Automaton has 3258 states and 10122 transitions. Word has length 18 [2019-12-27 21:38:21,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:21,537 INFO L462 AbstractCegarLoop]: Abstraction has 3258 states and 10122 transitions. [2019-12-27 21:38:21,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:38:21,537 INFO L276 IsEmpty]: Start isEmpty. Operand 3258 states and 10122 transitions. [2019-12-27 21:38:21,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 21:38:21,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:21,540 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:38:21,540 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:38:21,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:21,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1378596424, now seen corresponding path program 1 times [2019-12-27 21:38:21,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:21,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919494586] [2019-12-27 21:38:21,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:21,619 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-27 21:38:21,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919494586] [2019-12-27 21:38:21,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:21,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:38:21,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2042754800] [2019-12-27 21:38:21,620 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:21,625 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:21,632 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 54 transitions. [2019-12-27 21:38:21,632 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:21,653 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:38:21,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:38:21,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:21,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:38:21,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:38:21,654 INFO L87 Difference]: Start difference. First operand 3258 states and 10122 transitions. Second operand 5 states. [2019-12-27 21:38:21,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:21,848 INFO L93 Difference]: Finished difference Result 4136 states and 12556 transitions. [2019-12-27 21:38:21,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:38:21,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-27 21:38:21,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:21,856 INFO L225 Difference]: With dead ends: 4136 [2019-12-27 21:38:21,856 INFO L226 Difference]: Without dead ends: 4136 [2019-12-27 21:38:21,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:38:21,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4136 states. [2019-12-27 21:38:21,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4136 to 3930. [2019-12-27 21:38:21,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3930 states. [2019-12-27 21:38:21,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3930 states to 3930 states and 12106 transitions. [2019-12-27 21:38:21,940 INFO L78 Accepts]: Start accepts. Automaton has 3930 states and 12106 transitions. Word has length 18 [2019-12-27 21:38:21,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:21,941 INFO L462 AbstractCegarLoop]: Abstraction has 3930 states and 12106 transitions. [2019-12-27 21:38:21,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:38:21,941 INFO L276 IsEmpty]: Start isEmpty. Operand 3930 states and 12106 transitions. [2019-12-27 21:38:21,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 21:38:21,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:21,944 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:38:21,944 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:38:21,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:21,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1731664173, now seen corresponding path program 1 times [2019-12-27 21:38:21,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:21,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206834890] [2019-12-27 21:38:21,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:21,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:38:21,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206834890] [2019-12-27 21:38:21,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:21,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:38:21,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1569347769] [2019-12-27 21:38:21,998 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:22,000 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:22,007 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 54 transitions. [2019-12-27 21:38:22,008 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:22,026 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:38:22,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:38:22,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:22,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:38:22,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:38:22,027 INFO L87 Difference]: Start difference. First operand 3930 states and 12106 transitions. Second operand 5 states. [2019-12-27 21:38:22,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:22,265 INFO L93 Difference]: Finished difference Result 4838 states and 14661 transitions. [2019-12-27 21:38:22,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:38:22,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-27 21:38:22,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:22,390 INFO L225 Difference]: With dead ends: 4838 [2019-12-27 21:38:22,390 INFO L226 Difference]: Without dead ends: 4838 [2019-12-27 21:38:22,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:38:22,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4838 states. [2019-12-27 21:38:22,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4838 to 4069. [2019-12-27 21:38:22,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4069 states. [2019-12-27 21:38:22,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4069 states to 4069 states and 12539 transitions. [2019-12-27 21:38:22,471 INFO L78 Accepts]: Start accepts. Automaton has 4069 states and 12539 transitions. Word has length 18 [2019-12-27 21:38:22,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:22,472 INFO L462 AbstractCegarLoop]: Abstraction has 4069 states and 12539 transitions. [2019-12-27 21:38:22,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:38:22,472 INFO L276 IsEmpty]: Start isEmpty. Operand 4069 states and 12539 transitions. [2019-12-27 21:38:22,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 21:38:22,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:22,482 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:38:22,482 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:38:22,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:22,483 INFO L82 PathProgramCache]: Analyzing trace with hash -819903788, now seen corresponding path program 1 times [2019-12-27 21:38:22,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:22,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118596843] [2019-12-27 21:38:22,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:22,571 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-27 21:38:22,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118596843] [2019-12-27 21:38:22,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:22,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:38:22,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [484692652] [2019-12-27 21:38:22,573 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:22,585 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:22,651 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 336 transitions. [2019-12-27 21:38:22,651 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:22,706 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:38:22,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:38:22,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:22,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:38:22,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:38:22,708 INFO L87 Difference]: Start difference. First operand 4069 states and 12539 transitions. Second operand 8 states. [2019-12-27 21:38:22,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:22,796 INFO L93 Difference]: Finished difference Result 3144 states and 10159 transitions. [2019-12-27 21:38:22,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:38:22,796 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-12-27 21:38:22,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:22,803 INFO L225 Difference]: With dead ends: 3144 [2019-12-27 21:38:22,803 INFO L226 Difference]: Without dead ends: 3144 [2019-12-27 21:38:22,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:38:22,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3144 states. [2019-12-27 21:38:22,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3144 to 2944. [2019-12-27 21:38:22,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2944 states. [2019-12-27 21:38:22,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 9559 transitions. [2019-12-27 21:38:22,863 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 9559 transitions. Word has length 32 [2019-12-27 21:38:22,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:22,866 INFO L462 AbstractCegarLoop]: Abstraction has 2944 states and 9559 transitions. [2019-12-27 21:38:22,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:38:22,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 9559 transitions. [2019-12-27 21:38:22,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 21:38:22,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:22,877 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:38:22,877 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:38:22,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:22,878 INFO L82 PathProgramCache]: Analyzing trace with hash 579177876, now seen corresponding path program 1 times [2019-12-27 21:38:22,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:22,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837584838] [2019-12-27 21:38:22,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:22,981 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-27 21:38:22,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837584838] [2019-12-27 21:38:22,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:22,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:38:22,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [552301908] [2019-12-27 21:38:22,982 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:22,997 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:23,104 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 182 states and 292 transitions. [2019-12-27 21:38:23,105 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:23,120 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:38:23,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:38:23,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:23,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:38:23,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:38:23,121 INFO L87 Difference]: Start difference. First operand 2944 states and 9559 transitions. Second operand 5 states. [2019-12-27 21:38:23,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:23,262 INFO L93 Difference]: Finished difference Result 4140 states and 12859 transitions. [2019-12-27 21:38:23,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:38:23,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-27 21:38:23,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:23,269 INFO L225 Difference]: With dead ends: 4140 [2019-12-27 21:38:23,270 INFO L226 Difference]: Without dead ends: 2658 [2019-12-27 21:38:23,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:38:23,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2019-12-27 21:38:23,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2658. [2019-12-27 21:38:23,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2658 states. [2019-12-27 21:38:23,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 8505 transitions. [2019-12-27 21:38:23,327 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 8505 transitions. Word has length 47 [2019-12-27 21:38:23,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:23,327 INFO L462 AbstractCegarLoop]: Abstraction has 2658 states and 8505 transitions. [2019-12-27 21:38:23,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:38:23,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 8505 transitions. [2019-12-27 21:38:23,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 21:38:23,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:23,335 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:38:23,336 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:38:23,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:23,336 INFO L82 PathProgramCache]: Analyzing trace with hash -921349078, now seen corresponding path program 2 times [2019-12-27 21:38:23,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:23,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027574723] [2019-12-27 21:38:23,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:23,407 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-27 21:38:23,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027574723] [2019-12-27 21:38:23,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:23,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:38:23,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [815547790] [2019-12-27 21:38:23,408 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:23,419 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:23,562 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 213 states and 373 transitions. [2019-12-27 21:38:23,562 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:23,584 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:38:23,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:38:23,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:23,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:38:23,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:38:23,585 INFO L87 Difference]: Start difference. First operand 2658 states and 8505 transitions. Second operand 4 states. [2019-12-27 21:38:23,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:23,739 INFO L93 Difference]: Finished difference Result 4173 states and 12631 transitions. [2019-12-27 21:38:23,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:38:23,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-27 21:38:23,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:23,744 INFO L225 Difference]: With dead ends: 4173 [2019-12-27 21:38:23,745 INFO L226 Difference]: Without dead ends: 2504 [2019-12-27 21:38:23,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:38:23,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2019-12-27 21:38:23,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 1930. [2019-12-27 21:38:23,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1930 states. [2019-12-27 21:38:23,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 5542 transitions. [2019-12-27 21:38:23,784 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 5542 transitions. Word has length 47 [2019-12-27 21:38:23,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:23,785 INFO L462 AbstractCegarLoop]: Abstraction has 1930 states and 5542 transitions. [2019-12-27 21:38:23,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:38:23,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 5542 transitions. [2019-12-27 21:38:23,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 21:38:23,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:23,791 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:38:23,791 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:38:23,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:23,791 INFO L82 PathProgramCache]: Analyzing trace with hash -46543648, now seen corresponding path program 3 times [2019-12-27 21:38:23,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:23,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883369854] [2019-12-27 21:38:23,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:23,851 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-27 21:38:23,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883369854] [2019-12-27 21:38:23,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:23,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:38:23,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [356803995] [2019-12-27 21:38:23,853 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:23,864 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:24,026 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 196 states and 392 transitions. [2019-12-27 21:38:24,028 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:24,047 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:38:24,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:38:24,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:24,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:38:24,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:38:24,049 INFO L87 Difference]: Start difference. First operand 1930 states and 5542 transitions. Second operand 4 states. [2019-12-27 21:38:24,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:24,230 INFO L93 Difference]: Finished difference Result 3259 states and 9125 transitions. [2019-12-27 21:38:24,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:38:24,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-27 21:38:24,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:24,232 INFO L225 Difference]: With dead ends: 3259 [2019-12-27 21:38:24,232 INFO L226 Difference]: Without dead ends: 749 [2019-12-27 21:38:24,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:38:24,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2019-12-27 21:38:24,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 490. [2019-12-27 21:38:24,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-12-27 21:38:24,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1104 transitions. [2019-12-27 21:38:24,240 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1104 transitions. Word has length 47 [2019-12-27 21:38:24,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:24,241 INFO L462 AbstractCegarLoop]: Abstraction has 490 states and 1104 transitions. [2019-12-27 21:38:24,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:38:24,241 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1104 transitions. [2019-12-27 21:38:24,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 21:38:24,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:24,242 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:38:24,243 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:38:24,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:24,243 INFO L82 PathProgramCache]: Analyzing trace with hash 146962906, now seen corresponding path program 4 times [2019-12-27 21:38:24,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:24,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486510761] [2019-12-27 21:38:24,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:24,324 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-27 21:38:24,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486510761] [2019-12-27 21:38:24,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:24,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:38:24,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [22493979] [2019-12-27 21:38:24,325 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:24,337 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:24,427 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 296 transitions. [2019-12-27 21:38:24,428 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:24,467 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:38:24,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:38:24,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:24,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:38:24,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:38:24,469 INFO L87 Difference]: Start difference. First operand 490 states and 1104 transitions. Second operand 7 states. [2019-12-27 21:38:24,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:24,641 INFO L93 Difference]: Finished difference Result 890 states and 1958 transitions. [2019-12-27 21:38:24,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:38:24,642 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-27 21:38:24,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:24,643 INFO L225 Difference]: With dead ends: 890 [2019-12-27 21:38:24,643 INFO L226 Difference]: Without dead ends: 604 [2019-12-27 21:38:24,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:38:24,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-12-27 21:38:24,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 546. [2019-12-27 21:38:24,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-12-27 21:38:24,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1193 transitions. [2019-12-27 21:38:24,650 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1193 transitions. Word has length 47 [2019-12-27 21:38:24,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:24,651 INFO L462 AbstractCegarLoop]: Abstraction has 546 states and 1193 transitions. [2019-12-27 21:38:24,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:38:24,651 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1193 transitions. [2019-12-27 21:38:24,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 21:38:24,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:24,652 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:38:24,652 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:38:24,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:24,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1762247142, now seen corresponding path program 5 times [2019-12-27 21:38:24,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:24,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239014647] [2019-12-27 21:38:24,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:24,720 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-27 21:38:24,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239014647] [2019-12-27 21:38:24,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:24,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:38:24,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1163148275] [2019-12-27 21:38:24,721 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:24,732 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:24,950 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 201 states and 354 transitions. [2019-12-27 21:38:24,951 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:24,951 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:38:24,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:38:24,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:24,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:38:24,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:38:24,953 INFO L87 Difference]: Start difference. First operand 546 states and 1193 transitions. Second operand 3 states. [2019-12-27 21:38:24,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:24,969 INFO L93 Difference]: Finished difference Result 546 states and 1191 transitions. [2019-12-27 21:38:24,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:38:24,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-27 21:38:24,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:24,971 INFO L225 Difference]: With dead ends: 546 [2019-12-27 21:38:24,971 INFO L226 Difference]: Without dead ends: 546 [2019-12-27 21:38:24,971 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-27 21:38:24,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-12-27 21:38:24,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 546. [2019-12-27 21:38:24,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-12-27 21:38:24,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1191 transitions. [2019-12-27 21:38:24,980 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1191 transitions. Word has length 47 [2019-12-27 21:38:24,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:24,981 INFO L462 AbstractCegarLoop]: Abstraction has 546 states and 1191 transitions. [2019-12-27 21:38:24,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:38:24,981 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1191 transitions. [2019-12-27 21:38:24,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 21:38:24,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:24,983 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] [2019-12-27 21:38:24,984 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:38:24,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:24,984 INFO L82 PathProgramCache]: Analyzing trace with hash 317472309, now seen corresponding path program 1 times [2019-12-27 21:38:24,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:24,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501810321] [2019-12-27 21:38:24,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:38:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:38:25,115 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:38:25,116 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:38:25,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= 0 v_~z$r_buff1_thd3~0_40) (= 0 v_~z$w_buff1~0_25) (= v_~y~0_18 0) (= 0 v_~z$r_buff1_thd0~0_24) (= 0 v_~z$r_buff1_thd1~0_10) (= 0 v_~weak$$choice0~0_9) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1421~0.base_24|)) (= v_~z$r_buff0_thd0~0_20 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1421~0.base_24| 4)) (= v_~z~0_22 0) (= v_~z$r_buff0_thd4~0_25 0) (= v_~z$r_buff0_thd2~0_8 0) (= v_~main$tmp_guard0~0_8 0) (= v_~z$read_delayed~0_6 0) (= v_~z$read_delayed_var~0.base_8 0) (= 0 v_~weak$$choice2~0_34) (= 0 v_~z$r_buff1_thd4~0_18) (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t1421~0.base_24| 1)) (= 0 v_~__unbuffered_p3_EAX~0_16) (= v_~z$w_buff0_used~0_97 0) (= 0 v_~__unbuffered_cnt~0_26) (= 0 v_~z$flush_delayed~0_14) (= 0 v_~z$r_buff1_thd2~0_10) (= 0 |v_ULTIMATE.start_main_~#t1421~0.offset_19|) (= |v_#memory_int_25| (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1421~0.base_24| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1421~0.base_24|) |v_ULTIMATE.start_main_~#t1421~0.offset_19| 0))) (= 0 |v_#NULL.base_4|) (= v_~a~0_10 0) (= 0 v_~__unbuffered_p2_EAX~0_15) (= v_~z$r_buff0_thd1~0_9 0) (= v_~z$mem_tmp~0_10 0) (< 0 |v_#StackHeapBarrier_20|) (= v_~x~0_20 0) (= |v_#NULL.offset_4| 0) (= v_~z$r_buff0_thd3~0_67 0) (= 0 v_~z$w_buff0~0_29) (= 0 v_~z$w_buff1_used~0_57) (= v_~z$read_delayed_var~0.offset_8 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1421~0.base_24|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_10, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t1424~0.base=|v_ULTIMATE.start_main_~#t1424~0.base_19|, ULTIMATE.start_main_~#t1423~0.offset=|v_ULTIMATE.start_main_~#t1423~0.offset_16|, ~a~0=v_~a~0_10, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ULTIMATE.start_main_~#t1421~0.base=|v_ULTIMATE.start_main_~#t1421~0.base_24|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_25, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_57, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~x~0=v_~x~0_20, ULTIMATE.start_main_~#t1424~0.offset=|v_ULTIMATE.start_main_~#t1424~0.offset_15|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_18, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_8|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t1421~0.offset=|v_ULTIMATE.start_main_~#t1421~0.offset_19|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ULTIMATE.start_main_~#t1423~0.base=|v_ULTIMATE.start_main_~#t1423~0.base_22|, ~y~0=v_~y~0_18, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_97, ~z$w_buff0~0=v_~z$w_buff0~0_29, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_40, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_12|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_24|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_22, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_9, ULTIMATE.start_main_~#t1422~0.offset=|v_ULTIMATE.start_main_~#t1422~0.offset_19|, ULTIMATE.start_main_~#t1422~0.base=|v_ULTIMATE.start_main_~#t1422~0.base_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t1424~0.base, ULTIMATE.start_main_~#t1423~0.offset, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t1421~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1424~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1421~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1423~0.base, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t1422~0.offset, ULTIMATE.start_main_~#t1422~0.base] because there is no mapped edge [2019-12-27 21:38:25,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L831-1-->L833: Formula: (and (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1422~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t1422~0.offset_11|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1422~0.base_12| 4)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1422~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1422~0.base_12|) |v_ULTIMATE.start_main_~#t1422~0.offset_11| 1)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1422~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t1422~0.base_12| 0)) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1422~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1422~0.offset=|v_ULTIMATE.start_main_~#t1422~0.offset_11|, ULTIMATE.start_main_~#t1422~0.base=|v_ULTIMATE.start_main_~#t1422~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1422~0.offset, ULTIMATE.start_main_~#t1422~0.base] because there is no mapped edge [2019-12-27 21:38:25,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L833-1-->L835: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1423~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t1423~0.offset_10|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1423~0.base_11| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1423~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1423~0.base_11|) |v_ULTIMATE.start_main_~#t1423~0.offset_10| 2)) |v_#memory_int_15|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1423~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t1423~0.base_11|)) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1423~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t1423~0.offset=|v_ULTIMATE.start_main_~#t1423~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t1423~0.base=|v_ULTIMATE.start_main_~#t1423~0.base_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_15|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1423~0.offset, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1423~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 21:38:25,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L835-1-->L837: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1424~0.offset_10|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1424~0.base_12|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1424~0.base_12| 4)) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1424~0.base_12|) 0) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1424~0.base_12| 1) |v_#valid_48|) (not (= |v_ULTIMATE.start_main_~#t1424~0.base_12| 0)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1424~0.base_12| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1424~0.base_12|) |v_ULTIMATE.start_main_~#t1424~0.offset_10| 3)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1424~0.offset=|v_ULTIMATE.start_main_~#t1424~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1424~0.base=|v_ULTIMATE.start_main_~#t1424~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1424~0.offset, ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1424~0.base] because there is no mapped edge [2019-12-27 21:38:25,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] P3ENTRY-->L4-3: Formula: (and (= (mod v_~z$w_buff1_used~0_38 256) 0) (= v_P3Thread1of1ForFork1_~arg.base_5 |v_P3Thread1of1ForFork1_#in~arg.base_5|) (= 1 v_~z$w_buff0~0_17) (= v_~z$w_buff0_used~0_62 1) (= v_~z$w_buff0_used~0_63 v_~z$w_buff1_used~0_38) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_7) (= |v_P3Thread1of1ForFork1_#in~arg.offset_5| v_P3Thread1of1ForFork1_~arg.offset_5) (= v_~z$w_buff0~0_18 v_~z$w_buff1~0_15)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_63, ~z$w_buff0~0=v_~z$w_buff0~0_18, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_5|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_5|} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_62, ~z$w_buff0~0=v_~z$w_buff0~0_17, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_5|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_38, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, ~z$w_buff1~0=v_~z$w_buff1~0_15, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_5, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_5|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P3Thread1of1ForFork1___VERIFIER_assert_~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression, ~z$w_buff1~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 21:38:25,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork2_~arg.base_4 |v_P0Thread1of1ForFork2_#in~arg.base_4|) (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= v_~x~0_10 1) (= 1 v_~a~0_7) (= v_P0Thread1of1ForFork2_~arg.offset_4 |v_P0Thread1of1ForFork2_#in~arg.offset_4|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|} OutVars{~a~0=v_~a~0_7, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_4, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_10, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_4} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-27 21:38:25,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork3_#res.base_5|) (= 2 v_~x~0_8) (= 0 |v_P1Thread1of1ForFork3_#res.offset_5|) (= 1 v_~y~0_7) (= v_P1Thread1of1ForFork3_~arg.offset_5 |v_P1Thread1of1ForFork3_#in~arg.offset_5|) (= v_P1Thread1of1ForFork3_~arg.base_5 |v_P1Thread1of1ForFork3_#in~arg.base_5|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_5|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_5, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_5, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|, ~y~0=v_~y~0_7, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~y~0, ~x~0] because there is no mapped edge [2019-12-27 21:38:25,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In409921920 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In409921920 256)))) (or (and (= |P3Thread1of1ForFork1_#t~ite28_Out409921920| 0) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In409921920 |P3Thread1of1ForFork1_#t~ite28_Out409921920|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In409921920, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In409921920} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In409921920, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out409921920|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In409921920} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 21:38:25,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In202327589 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In202327589 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In202327589 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd4~0_In202327589 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork1_#t~ite29_Out202327589|)) (and (= ~z$w_buff1_used~0_In202327589 |P3Thread1of1ForFork1_#t~ite29_Out202327589|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In202327589, ~z$w_buff0_used~0=~z$w_buff0_used~0_In202327589, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In202327589, ~z$w_buff1_used~0=~z$w_buff1_used~0_In202327589} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In202327589, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out202327589|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In202327589, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In202327589, ~z$w_buff1_used~0=~z$w_buff1_used~0_In202327589} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 21:38:25,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L811-->L812: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In1903744207 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1903744207 256)))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out1903744207) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd4~0_Out1903744207 ~z$r_buff0_thd4~0_In1903744207)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1903744207, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1903744207} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1903744207, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1903744207, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out1903744207|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 21:38:25,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L812-->L812-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1534007867 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1534007867 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1534007867 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In1534007867 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork1_#t~ite31_Out1534007867| ~z$r_buff1_thd4~0_In1534007867)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P3Thread1of1ForFork1_#t~ite31_Out1534007867| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1534007867, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1534007867, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1534007867, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1534007867} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1534007867, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1534007867, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1534007867, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1534007867, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out1534007867|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 21:38:25,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L812-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd4~0_12 |v_P3Thread1of1ForFork1_#t~ite31_8|) (= |v_P3Thread1of1ForFork1_#res.base_5| 0) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_8|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_12, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_5|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_7|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 21:38:25,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L773-->L773-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2135363351 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite12_Out2135363351| ~z$w_buff1~0_In2135363351) (= |P2Thread1of1ForFork0_#t~ite11_In2135363351| |P2Thread1of1ForFork0_#t~ite11_Out2135363351|)) (and (= |P2Thread1of1ForFork0_#t~ite11_Out2135363351| |P2Thread1of1ForFork0_#t~ite12_Out2135363351|) (= |P2Thread1of1ForFork0_#t~ite11_Out2135363351| ~z$w_buff1~0_In2135363351) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In2135363351 256)))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In2135363351 256))) (= 0 (mod ~z$w_buff0_used~0_In2135363351 256)) (and (= 0 (mod ~z$r_buff1_thd3~0_In2135363351 256)) .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2135363351, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_In2135363351|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2135363351, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2135363351, ~z$w_buff1~0=~z$w_buff1~0_In2135363351, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2135363351, ~weak$$choice2~0=~weak$$choice2~0_In2135363351} OutVars{P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out2135363351|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2135363351, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out2135363351|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2135363351, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2135363351, ~z$w_buff1~0=~z$w_buff1~0_In2135363351, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2135363351, ~weak$$choice2~0=~weak$$choice2~0_In2135363351} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11, P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 21:38:25,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L776-->L777: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~z$r_buff0_thd3~0_56 v_~z$r_buff0_thd3~0_55)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_56, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_55, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_7|, ~weak$$choice2~0=v_~weak$$choice2~0_25, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-27 21:38:25,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L779-->L787: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_15 v_~z$mem_tmp~0_4)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 21:38:25,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L837-1-->L843: Formula: (and (= 4 v_~__unbuffered_cnt~0_11) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 21:38:25,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L843-2-->L843-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1733043920 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1733043920 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite37_Out-1733043920| |ULTIMATE.start_main_#t~ite36_Out-1733043920|))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-1733043920 |ULTIMATE.start_main_#t~ite36_Out-1733043920|) .cse2) (and (or .cse0 .cse1) (= ~z~0_In-1733043920 |ULTIMATE.start_main_#t~ite36_Out-1733043920|) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1733043920, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1733043920, ~z$w_buff1~0=~z$w_buff1~0_In-1733043920, ~z~0=~z~0_In-1733043920} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1733043920, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1733043920, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1733043920|, ~z$w_buff1~0=~z$w_buff1~0_In-1733043920, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1733043920|, ~z~0=~z~0_In-1733043920} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 21:38:25,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In727695262 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In727695262 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In727695262 |ULTIMATE.start_main_#t~ite38_Out727695262|)) (and (= 0 |ULTIMATE.start_main_#t~ite38_Out727695262|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In727695262, ~z$w_buff0_used~0=~z$w_buff0_used~0_In727695262} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In727695262, ~z$w_buff0_used~0=~z$w_buff0_used~0_In727695262, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out727695262|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 21:38:25,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L845-->L845-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In814078888 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In814078888 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In814078888 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In814078888 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out814078888| ~z$w_buff1_used~0_In814078888) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite39_Out814078888| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In814078888, ~z$w_buff0_used~0=~z$w_buff0_used~0_In814078888, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In814078888, ~z$w_buff1_used~0=~z$w_buff1_used~0_In814078888} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In814078888, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out814078888|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In814078888, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In814078888, ~z$w_buff1_used~0=~z$w_buff1_used~0_In814078888} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 21:38:25,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In450753228 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In450753228 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite40_Out450753228|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In450753228 |ULTIMATE.start_main_#t~ite40_Out450753228|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In450753228, ~z$w_buff0_used~0=~z$w_buff0_used~0_In450753228} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In450753228, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out450753228|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In450753228} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 21:38:25,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L847-->L847-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-1388102261 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-1388102261 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1388102261 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1388102261 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-1388102261 |ULTIMATE.start_main_#t~ite41_Out-1388102261|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite41_Out-1388102261|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1388102261, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1388102261, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1388102261, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1388102261} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1388102261|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1388102261, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1388102261, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1388102261, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1388102261} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 21:38:25,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L847-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 2 v_~y~0_9) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9| (mod v_~main$tmp_guard1~0_8 256)) (= v_~main$tmp_guard1~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0) (= v_~__unbuffered_p2_EAX~0_8 0) (= 0 v_~__unbuffered_p3_EAX~0_9) (= |v_ULTIMATE.start_main_#t~ite41_11| v_~z$r_buff1_thd0~0_16) (= v_~x~0_11 2)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_9, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_9, ~x~0=v_~x~0_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:38:25,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:38:25 BasicIcfg [2019-12-27 21:38:25,234 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:38:25,236 INFO L168 Benchmark]: Toolchain (without parser) took 18522.30 ms. Allocated memory was 145.2 MB in the beginning and 969.9 MB in the end (delta: 824.7 MB). Free memory was 99.9 MB in the beginning and 532.8 MB in the end (delta: -432.8 MB). Peak memory consumption was 391.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:38:25,237 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 21:38:25,237 INFO L168 Benchmark]: CACSL2BoogieTranslator took 811.93 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 99.7 MB in the beginning and 155.4 MB in the end (delta: -55.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:38:25,239 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.17 ms. Allocated memory is still 202.4 MB. Free memory was 155.4 MB in the beginning and 152.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:38:25,244 INFO L168 Benchmark]: Boogie Preprocessor took 47.21 ms. Allocated memory is still 202.4 MB. Free memory was 152.7 MB in the beginning and 150.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:38:25,245 INFO L168 Benchmark]: RCFGBuilder took 830.95 ms. Allocated memory is still 202.4 MB. Free memory was 150.1 MB in the beginning and 104.9 MB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 7.1 GB. [2019-12-27 21:38:25,247 INFO L168 Benchmark]: TraceAbstraction took 16750.42 ms. Allocated memory was 202.4 MB in the beginning and 969.9 MB in the end (delta: 767.6 MB). Free memory was 104.2 MB in the beginning and 532.8 MB in the end (delta: -428.5 MB). Peak memory consumption was 339.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:38:25,251 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 811.93 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 99.7 MB in the beginning and 155.4 MB in the end (delta: -55.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.17 ms. Allocated memory is still 202.4 MB. Free memory was 155.4 MB in the beginning and 152.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.21 ms. Allocated memory is still 202.4 MB. Free memory was 152.7 MB in the beginning and 150.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 830.95 ms. Allocated memory is still 202.4 MB. Free memory was 150.1 MB in the beginning and 104.9 MB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16750.42 ms. Allocated memory was 202.4 MB in the beginning and 969.9 MB in the end (delta: 767.6 MB). Free memory was 104.2 MB in the beginning and 532.8 MB in the end (delta: -428.5 MB). Peak memory consumption was 339.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 167 ProgramPointsBefore, 79 ProgramPointsAfterwards, 189 TransitionsBefore, 87 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 19 ChoiceCompositions, 5341 VarBasedMoverChecksPositive, 131 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 50569 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t1421, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L833] FCALL, FORK 0 pthread_create(&t1422, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1423, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1424, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L797] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L798] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L799] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L800] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L801] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L802] 4 z$r_buff0_thd4 = (_Bool)1 [L805] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 3 y = 2 [L767] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 3 z$flush_delayed = weak$$choice2 [L770] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L809] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L810] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L771] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L772] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L772] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L773] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L774] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L774] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L775] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L778] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L844] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L845] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L846] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.4s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1444 SDtfs, 2042 SDslu, 2285 SDs, 0 SdLazy, 724 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 24 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27134occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 2814 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 426 NumberOfCodeBlocks, 426 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 365 ConstructedInterpolants, 0 QuantifiedInterpolants, 33649 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...