/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix043_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:31:06,503 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:31:06,506 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:31:06,524 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:31:06,524 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:31:06,525 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:31:06,526 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:31:06,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:31:06,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:31:06,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:31:06,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:31:06,533 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:31:06,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:31:06,535 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:31:06,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:31:06,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:31:06,538 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:31:06,539 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:31:06,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:31:06,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:31:06,544 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:31:06,545 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:31:06,546 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:31:06,547 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:31:06,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:31:06,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:31:06,550 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:31:06,551 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:31:06,551 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:31:06,552 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:31:06,553 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:31:06,555 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:31:06,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:31:06,558 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:31:06,559 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:31:06,559 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:31:06,560 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:31:06,560 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:31:06,560 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:31:06,561 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:31:06,562 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:31:06,563 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.epf [2019-12-27 06:31:06,583 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:31:06,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:31:06,584 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:31:06,585 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:31:06,585 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:31:06,586 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:31:06,586 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:31:06,586 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:31:06,586 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:31:06,586 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:31:06,587 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:31:06,587 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:31:06,587 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:31:06,587 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:31:06,587 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:31:06,588 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:31:06,589 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:31:06,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:31:06,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:31:06,590 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:31:06,590 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:31:06,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:31:06,590 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:31:06,591 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:31:06,591 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:31:06,591 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:31:06,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:31:06,592 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:31:06,592 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:31:06,592 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:31:06,897 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:31:06,914 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:31:06,917 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:31:06,919 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:31:06,919 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:31:06,920 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043_rmo.opt.i [2019-12-27 06:31:06,992 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ba3533af/8bdd37c974894f0f8c8e42260e24fbd0/FLAG223cd61a8 [2019-12-27 06:31:07,523 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:31:07,525 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043_rmo.opt.i [2019-12-27 06:31:07,543 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ba3533af/8bdd37c974894f0f8c8e42260e24fbd0/FLAG223cd61a8 [2019-12-27 06:31:07,825 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ba3533af/8bdd37c974894f0f8c8e42260e24fbd0 [2019-12-27 06:31:07,834 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:31:07,835 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:31:07,837 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:31:07,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:31:07,840 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:31:07,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:31:07" (1/1) ... [2019-12-27 06:31:07,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a6e624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:07, skipping insertion in model container [2019-12-27 06:31:07,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:31:07" (1/1) ... [2019-12-27 06:31:07,850 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:31:07,904 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:31:08,405 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:31:08,422 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:31:08,492 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:31:08,578 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:31:08,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:08 WrapperNode [2019-12-27 06:31:08,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:31:08,580 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:31:08,580 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:31:08,580 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:31:08,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:08" (1/1) ... [2019-12-27 06:31:08,610 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:08" (1/1) ... [2019-12-27 06:31:08,650 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:31:08,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:31:08,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:31:08,651 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:31:08,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:08" (1/1) ... [2019-12-27 06:31:08,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:08" (1/1) ... [2019-12-27 06:31:08,664 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:08" (1/1) ... [2019-12-27 06:31:08,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:08" (1/1) ... [2019-12-27 06:31:08,675 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:08" (1/1) ... [2019-12-27 06:31:08,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:08" (1/1) ... [2019-12-27 06:31:08,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:08" (1/1) ... [2019-12-27 06:31:08,689 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:31:08,690 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:31:08,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:31:08,690 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:31:08,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:08" (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 06:31:08,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:31:08,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:31:08,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:31:08,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:31:08,758 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:31:08,759 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:31:08,762 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:31:08,763 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:31:08,763 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:31:08,764 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:31:08,764 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 06:31:08,764 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 06:31:08,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:31:08,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:31:08,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:31:08,767 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 06:31:09,528 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:31:09,528 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:31:09,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:31:09 BoogieIcfgContainer [2019-12-27 06:31:09,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:31:09,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:31:09,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:31:09,535 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:31:09,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:31:07" (1/3) ... [2019-12-27 06:31:09,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f83546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:31:09, skipping insertion in model container [2019-12-27 06:31:09,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:08" (2/3) ... [2019-12-27 06:31:09,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f83546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:31:09, skipping insertion in model container [2019-12-27 06:31:09,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:31:09" (3/3) ... [2019-12-27 06:31:09,539 INFO L109 eAbstractionObserver]: Analyzing ICFG mix043_rmo.opt.i [2019-12-27 06:31:09,548 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:31:09,548 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:31:09,556 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:31:09,556 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:31:09,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,598 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,598 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,600 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,600 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,602 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,602 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,610 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,610 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,611 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,611 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,611 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,627 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,628 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,628 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,630 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,630 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,630 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,630 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,630 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,634 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,634 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,634 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,638 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,638 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,641 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,642 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,644 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,644 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,650 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,650 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,652 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:31:09,668 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 06:31:09,687 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:31:09,687 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:31:09,687 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:31:09,687 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:31:09,687 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:31:09,688 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:31:09,688 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:31:09,688 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:31:09,709 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 210 transitions [2019-12-27 06:31:09,711 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-27 06:31:09,831 INFO L132 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-27 06:31:09,831 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:31:09,847 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 06:31:09,867 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-27 06:31:09,956 INFO L132 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-27 06:31:09,957 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:31:09,967 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 06:31:09,986 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-27 06:31:09,987 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:31:13,560 WARN L192 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-27 06:31:13,756 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-27 06:31:13,780 INFO L206 etLargeBlockEncoding]: Checked pairs total: 57720 [2019-12-27 06:31:13,780 INFO L214 etLargeBlockEncoding]: Total number of compositions: 124 [2019-12-27 06:31:13,784 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 98 transitions [2019-12-27 06:31:15,935 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34622 states. [2019-12-27 06:31:15,937 INFO L276 IsEmpty]: Start isEmpty. Operand 34622 states. [2019-12-27 06:31:15,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 06:31:15,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:15,945 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:31:15,945 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:31:15,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:15,950 INFO L82 PathProgramCache]: Analyzing trace with hash 86209296, now seen corresponding path program 1 times [2019-12-27 06:31:15,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:15,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719044373] [2019-12-27 06:31:15,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:16,254 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 06:31:16,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719044373] [2019-12-27 06:31:16,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:16,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:31:16,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061911252] [2019-12-27 06:31:16,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:31:16,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:16,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:31:16,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:31:16,278 INFO L87 Difference]: Start difference. First operand 34622 states. Second operand 3 states. [2019-12-27 06:31:18,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:18,194 INFO L93 Difference]: Finished difference Result 34422 states and 146848 transitions. [2019-12-27 06:31:18,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:31:18,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 06:31:18,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:18,617 INFO L225 Difference]: With dead ends: 34422 [2019-12-27 06:31:18,625 INFO L226 Difference]: Without dead ends: 33750 [2019-12-27 06:31:18,627 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 06:31:19,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33750 states. [2019-12-27 06:31:20,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33750 to 33750. [2019-12-27 06:31:20,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33750 states. [2019-12-27 06:31:21,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33750 states to 33750 states and 144104 transitions. [2019-12-27 06:31:21,765 INFO L78 Accepts]: Start accepts. Automaton has 33750 states and 144104 transitions. Word has length 9 [2019-12-27 06:31:21,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:21,766 INFO L462 AbstractCegarLoop]: Abstraction has 33750 states and 144104 transitions. [2019-12-27 06:31:21,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:31:21,767 INFO L276 IsEmpty]: Start isEmpty. Operand 33750 states and 144104 transitions. [2019-12-27 06:31:21,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 06:31:21,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:21,786 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:31:21,787 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:31:21,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:21,787 INFO L82 PathProgramCache]: Analyzing trace with hash 2020718279, now seen corresponding path program 1 times [2019-12-27 06:31:21,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:21,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942342013] [2019-12-27 06:31:21,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:21,925 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 06:31:21,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942342013] [2019-12-27 06:31:21,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:21,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:31:21,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353715334] [2019-12-27 06:31:21,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:31:21,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:21,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:31:21,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:31:21,929 INFO L87 Difference]: Start difference. First operand 33750 states and 144104 transitions. Second operand 4 states. [2019-12-27 06:31:22,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:22,834 INFO L93 Difference]: Finished difference Result 52526 states and 216740 transitions. [2019-12-27 06:31:22,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:31:22,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 06:31:22,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:23,473 INFO L225 Difference]: With dead ends: 52526 [2019-12-27 06:31:23,473 INFO L226 Difference]: Without dead ends: 52498 [2019-12-27 06:31:23,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:31:23,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52498 states. [2019-12-27 06:31:25,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52498 to 47958. [2019-12-27 06:31:25,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47958 states. [2019-12-27 06:31:25,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47958 states to 47958 states and 199860 transitions. [2019-12-27 06:31:25,738 INFO L78 Accepts]: Start accepts. Automaton has 47958 states and 199860 transitions. Word has length 15 [2019-12-27 06:31:25,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:25,738 INFO L462 AbstractCegarLoop]: Abstraction has 47958 states and 199860 transitions. [2019-12-27 06:31:25,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:31:25,739 INFO L276 IsEmpty]: Start isEmpty. Operand 47958 states and 199860 transitions. [2019-12-27 06:31:25,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 06:31:25,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:25,742 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:31:25,743 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:31:25,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:25,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1977980563, now seen corresponding path program 1 times [2019-12-27 06:31:25,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:25,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449453673] [2019-12-27 06:31:25,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:25,880 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 06:31:25,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449453673] [2019-12-27 06:31:25,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:25,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:31:25,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230317745] [2019-12-27 06:31:25,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:31:25,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:25,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:31:25,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:31:25,883 INFO L87 Difference]: Start difference. First operand 47958 states and 199860 transitions. Second operand 4 states. [2019-12-27 06:31:28,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:28,202 INFO L93 Difference]: Finished difference Result 59070 states and 244072 transitions. [2019-12-27 06:31:28,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:31:28,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 06:31:28,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:28,640 INFO L225 Difference]: With dead ends: 59070 [2019-12-27 06:31:28,641 INFO L226 Difference]: Without dead ends: 59070 [2019-12-27 06:31:28,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:31:29,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59070 states. [2019-12-27 06:31:30,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59070 to 53006. [2019-12-27 06:31:30,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53006 states. [2019-12-27 06:31:30,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53006 states to 53006 states and 220392 transitions. [2019-12-27 06:31:30,625 INFO L78 Accepts]: Start accepts. Automaton has 53006 states and 220392 transitions. Word has length 15 [2019-12-27 06:31:30,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:30,625 INFO L462 AbstractCegarLoop]: Abstraction has 53006 states and 220392 transitions. [2019-12-27 06:31:30,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:31:30,625 INFO L276 IsEmpty]: Start isEmpty. Operand 53006 states and 220392 transitions. [2019-12-27 06:31:30,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 06:31:30,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:30,640 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] [2019-12-27 06:31:30,640 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:31:30,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:30,640 INFO L82 PathProgramCache]: Analyzing trace with hash -587282460, now seen corresponding path program 1 times [2019-12-27 06:31:30,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:30,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229088510] [2019-12-27 06:31:30,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:30,738 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 06:31:30,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229088510] [2019-12-27 06:31:30,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:30,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:31:30,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711020345] [2019-12-27 06:31:30,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:31:30,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:30,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:31:30,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:31:30,742 INFO L87 Difference]: Start difference. First operand 53006 states and 220392 transitions. Second operand 5 states. [2019-12-27 06:31:31,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:31,509 INFO L93 Difference]: Finished difference Result 70534 states and 288484 transitions. [2019-12-27 06:31:31,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:31:31,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 06:31:31,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:31,719 INFO L225 Difference]: With dead ends: 70534 [2019-12-27 06:31:31,719 INFO L226 Difference]: Without dead ends: 70506 [2019-12-27 06:31:31,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:31:34,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70506 states. [2019-12-27 06:31:35,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70506 to 52682. [2019-12-27 06:31:35,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52682 states. [2019-12-27 06:31:35,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52682 states to 52682 states and 218712 transitions. [2019-12-27 06:31:35,612 INFO L78 Accepts]: Start accepts. Automaton has 52682 states and 218712 transitions. Word has length 21 [2019-12-27 06:31:35,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:35,612 INFO L462 AbstractCegarLoop]: Abstraction has 52682 states and 218712 transitions. [2019-12-27 06:31:35,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:31:35,613 INFO L276 IsEmpty]: Start isEmpty. Operand 52682 states and 218712 transitions. [2019-12-27 06:31:35,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 06:31:35,672 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:35,672 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] [2019-12-27 06:31:35,672 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:31:35,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:35,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1693897678, now seen corresponding path program 1 times [2019-12-27 06:31:35,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:35,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135876913] [2019-12-27 06:31:35,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:35,744 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 06:31:35,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135876913] [2019-12-27 06:31:35,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:35,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:31:35,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339532831] [2019-12-27 06:31:35,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:31:35,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:35,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:31:35,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:31:35,746 INFO L87 Difference]: Start difference. First operand 52682 states and 218712 transitions. Second operand 3 states. [2019-12-27 06:31:36,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:36,091 INFO L93 Difference]: Finished difference Result 65362 states and 268648 transitions. [2019-12-27 06:31:36,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:31:36,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-27 06:31:36,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:36,295 INFO L225 Difference]: With dead ends: 65362 [2019-12-27 06:31:36,295 INFO L226 Difference]: Without dead ends: 65362 [2019-12-27 06:31:36,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:31:37,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65362 states. [2019-12-27 06:31:40,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65362 to 57878. [2019-12-27 06:31:40,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57878 states. [2019-12-27 06:31:41,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57878 states to 57878 states and 239624 transitions. [2019-12-27 06:31:41,154 INFO L78 Accepts]: Start accepts. Automaton has 57878 states and 239624 transitions. Word has length 29 [2019-12-27 06:31:41,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:41,154 INFO L462 AbstractCegarLoop]: Abstraction has 57878 states and 239624 transitions. [2019-12-27 06:31:41,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:31:41,154 INFO L276 IsEmpty]: Start isEmpty. Operand 57878 states and 239624 transitions. [2019-12-27 06:31:41,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 06:31:41,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:41,190 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] [2019-12-27 06:31:41,190 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:31:41,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:41,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1910359084, now seen corresponding path program 1 times [2019-12-27 06:31:41,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:41,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371014237] [2019-12-27 06:31:41,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:41,292 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 06:31:41,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371014237] [2019-12-27 06:31:41,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:41,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:31:41,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531422891] [2019-12-27 06:31:41,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:31:41,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:41,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:31:41,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:31:41,294 INFO L87 Difference]: Start difference. First operand 57878 states and 239624 transitions. Second operand 6 states. [2019-12-27 06:31:42,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:42,034 INFO L93 Difference]: Finished difference Result 82714 states and 336740 transitions. [2019-12-27 06:31:42,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:31:42,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-27 06:31:42,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:42,246 INFO L225 Difference]: With dead ends: 82714 [2019-12-27 06:31:42,246 INFO L226 Difference]: Without dead ends: 82650 [2019-12-27 06:31:42,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:31:42,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82650 states. [2019-12-27 06:31:44,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82650 to 66690. [2019-12-27 06:31:44,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66690 states. [2019-12-27 06:31:48,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66690 states to 66690 states and 274804 transitions. [2019-12-27 06:31:48,111 INFO L78 Accepts]: Start accepts. Automaton has 66690 states and 274804 transitions. Word has length 29 [2019-12-27 06:31:48,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:48,112 INFO L462 AbstractCegarLoop]: Abstraction has 66690 states and 274804 transitions. [2019-12-27 06:31:48,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:31:48,112 INFO L276 IsEmpty]: Start isEmpty. Operand 66690 states and 274804 transitions. [2019-12-27 06:31:48,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 06:31:48,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:48,184 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:31:48,184 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:31:48,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:48,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1476951563, now seen corresponding path program 1 times [2019-12-27 06:31:48,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:48,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315136340] [2019-12-27 06:31:48,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:48,272 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 06:31:48,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315136340] [2019-12-27 06:31:48,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:48,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:31:48,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959218306] [2019-12-27 06:31:48,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:31:48,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:48,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:31:48,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:31:48,275 INFO L87 Difference]: Start difference. First operand 66690 states and 274804 transitions. Second operand 4 states. [2019-12-27 06:31:48,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:48,530 INFO L93 Difference]: Finished difference Result 53176 states and 201520 transitions. [2019-12-27 06:31:48,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:31:48,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-27 06:31:48,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:48,643 INFO L225 Difference]: With dead ends: 53176 [2019-12-27 06:31:48,643 INFO L226 Difference]: Without dead ends: 52068 [2019-12-27 06:31:48,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:31:48,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52068 states. [2019-12-27 06:31:49,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52068 to 52068. [2019-12-27 06:31:49,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52068 states. [2019-12-27 06:31:50,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52068 states to 52068 states and 198044 transitions. [2019-12-27 06:31:50,098 INFO L78 Accepts]: Start accepts. Automaton has 52068 states and 198044 transitions. Word has length 35 [2019-12-27 06:31:50,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:50,099 INFO L462 AbstractCegarLoop]: Abstraction has 52068 states and 198044 transitions. [2019-12-27 06:31:50,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:31:50,099 INFO L276 IsEmpty]: Start isEmpty. Operand 52068 states and 198044 transitions. [2019-12-27 06:31:50,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 06:31:50,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:50,145 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] [2019-12-27 06:31:50,145 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:31:50,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:50,146 INFO L82 PathProgramCache]: Analyzing trace with hash -309113421, now seen corresponding path program 1 times [2019-12-27 06:31:50,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:50,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556198320] [2019-12-27 06:31:50,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:50,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:31:50,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556198320] [2019-12-27 06:31:50,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:50,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:31:50,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979447610] [2019-12-27 06:31:50,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:31:50,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:50,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:31:50,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:31:50,273 INFO L87 Difference]: Start difference. First operand 52068 states and 198044 transitions. Second operand 7 states. [2019-12-27 06:31:51,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:51,492 INFO L93 Difference]: Finished difference Result 70805 states and 264299 transitions. [2019-12-27 06:31:51,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 06:31:51,492 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-12-27 06:31:51,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:51,646 INFO L225 Difference]: With dead ends: 70805 [2019-12-27 06:31:51,646 INFO L226 Difference]: Without dead ends: 70725 [2019-12-27 06:31:51,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-27 06:31:51,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70725 states. [2019-12-27 06:31:53,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70725 to 47077. [2019-12-27 06:31:53,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47077 states. [2019-12-27 06:31:53,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47077 states to 47077 states and 180047 transitions. [2019-12-27 06:31:53,303 INFO L78 Accepts]: Start accepts. Automaton has 47077 states and 180047 transitions. Word has length 36 [2019-12-27 06:31:53,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:53,303 INFO L462 AbstractCegarLoop]: Abstraction has 47077 states and 180047 transitions. [2019-12-27 06:31:53,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:31:53,303 INFO L276 IsEmpty]: Start isEmpty. Operand 47077 states and 180047 transitions. [2019-12-27 06:31:53,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 06:31:53,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:53,353 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] [2019-12-27 06:31:53,353 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:31:53,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:53,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1815705398, now seen corresponding path program 1 times [2019-12-27 06:31:53,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:53,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298224642] [2019-12-27 06:31:53,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:53,432 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 06:31:53,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298224642] [2019-12-27 06:31:53,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:53,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:31:53,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571617894] [2019-12-27 06:31:53,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:31:53,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:53,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:31:53,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:31:53,436 INFO L87 Difference]: Start difference. First operand 47077 states and 180047 transitions. Second operand 5 states. [2019-12-27 06:31:53,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:53,547 INFO L93 Difference]: Finished difference Result 20482 states and 64868 transitions. [2019-12-27 06:31:53,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:31:53,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-12-27 06:31:53,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:53,576 INFO L225 Difference]: With dead ends: 20482 [2019-12-27 06:31:53,576 INFO L226 Difference]: Without dead ends: 19606 [2019-12-27 06:31:53,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:31:53,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19606 states. [2019-12-27 06:31:53,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19606 to 19606. [2019-12-27 06:31:53,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19606 states. [2019-12-27 06:31:53,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19606 states to 19606 states and 62070 transitions. [2019-12-27 06:31:53,883 INFO L78 Accepts]: Start accepts. Automaton has 19606 states and 62070 transitions. Word has length 36 [2019-12-27 06:31:53,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:53,883 INFO L462 AbstractCegarLoop]: Abstraction has 19606 states and 62070 transitions. [2019-12-27 06:31:53,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:31:53,883 INFO L276 IsEmpty]: Start isEmpty. Operand 19606 states and 62070 transitions. [2019-12-27 06:31:53,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 06:31:53,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:53,896 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:31:53,896 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:31:53,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:53,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1312019084, now seen corresponding path program 1 times [2019-12-27 06:31:53,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:53,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873121893] [2019-12-27 06:31:53,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:53,980 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 06:31:53,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873121893] [2019-12-27 06:31:53,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:53,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:31:53,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855001617] [2019-12-27 06:31:53,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:31:53,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:53,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:31:53,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:31:53,982 INFO L87 Difference]: Start difference. First operand 19606 states and 62070 transitions. Second operand 6 states. [2019-12-27 06:31:54,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:54,079 INFO L93 Difference]: Finished difference Result 3555 states and 9020 transitions. [2019-12-27 06:31:54,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:31:54,081 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-27 06:31:54,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:54,085 INFO L225 Difference]: With dead ends: 3555 [2019-12-27 06:31:54,085 INFO L226 Difference]: Without dead ends: 3186 [2019-12-27 06:31:54,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:31:54,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3186 states. [2019-12-27 06:31:54,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3186 to 3186. [2019-12-27 06:31:54,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3186 states. [2019-12-27 06:31:54,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3186 states to 3186 states and 7982 transitions. [2019-12-27 06:31:54,117 INFO L78 Accepts]: Start accepts. Automaton has 3186 states and 7982 transitions. Word has length 37 [2019-12-27 06:31:54,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:54,118 INFO L462 AbstractCegarLoop]: Abstraction has 3186 states and 7982 transitions. [2019-12-27 06:31:54,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:31:54,118 INFO L276 IsEmpty]: Start isEmpty. Operand 3186 states and 7982 transitions. [2019-12-27 06:31:54,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 06:31:54,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:54,120 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 06:31:54,121 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:31:54,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:54,121 INFO L82 PathProgramCache]: Analyzing trace with hash 347176231, now seen corresponding path program 1 times [2019-12-27 06:31:54,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:54,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875856844] [2019-12-27 06:31:54,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:54,199 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 06:31:54,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875856844] [2019-12-27 06:31:54,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:54,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:31:54,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313039486] [2019-12-27 06:31:54,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:31:54,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:54,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:31:54,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:31:54,201 INFO L87 Difference]: Start difference. First operand 3186 states and 7982 transitions. Second operand 5 states. [2019-12-27 06:31:54,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:54,762 INFO L93 Difference]: Finished difference Result 4394 states and 10954 transitions. [2019-12-27 06:31:54,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:31:54,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-27 06:31:54,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:54,769 INFO L225 Difference]: With dead ends: 4394 [2019-12-27 06:31:54,770 INFO L226 Difference]: Without dead ends: 4394 [2019-12-27 06:31:54,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:31:54,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4394 states. [2019-12-27 06:31:54,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4394 to 4028. [2019-12-27 06:31:54,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4028 states. [2019-12-27 06:31:54,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4028 states to 4028 states and 10206 transitions. [2019-12-27 06:31:54,839 INFO L78 Accepts]: Start accepts. Automaton has 4028 states and 10206 transitions. Word has length 47 [2019-12-27 06:31:54,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:54,839 INFO L462 AbstractCegarLoop]: Abstraction has 4028 states and 10206 transitions. [2019-12-27 06:31:54,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:31:54,840 INFO L276 IsEmpty]: Start isEmpty. Operand 4028 states and 10206 transitions. [2019-12-27 06:31:54,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 06:31:54,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:54,845 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 06:31:54,845 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:31:54,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:54,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1074702612, now seen corresponding path program 1 times [2019-12-27 06:31:54,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:54,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016192910] [2019-12-27 06:31:54,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:54,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:54,957 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 06:31:54,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016192910] [2019-12-27 06:31:54,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:54,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:31:54,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644473236] [2019-12-27 06:31:54,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:31:54,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:54,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:31:54,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:31:54,959 INFO L87 Difference]: Start difference. First operand 4028 states and 10206 transitions. Second operand 3 states. [2019-12-27 06:31:54,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:54,987 INFO L93 Difference]: Finished difference Result 3894 states and 9735 transitions. [2019-12-27 06:31:54,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:31:54,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-12-27 06:31:54,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:54,993 INFO L225 Difference]: With dead ends: 3894 [2019-12-27 06:31:54,993 INFO L226 Difference]: Without dead ends: 3894 [2019-12-27 06:31:54,993 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 06:31:55,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3894 states. [2019-12-27 06:31:55,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3894 to 3886. [2019-12-27 06:31:55,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3886 states. [2019-12-27 06:31:55,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3886 states to 3886 states and 9719 transitions. [2019-12-27 06:31:55,062 INFO L78 Accepts]: Start accepts. Automaton has 3886 states and 9719 transitions. Word has length 48 [2019-12-27 06:31:55,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:55,062 INFO L462 AbstractCegarLoop]: Abstraction has 3886 states and 9719 transitions. [2019-12-27 06:31:55,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:31:55,063 INFO L276 IsEmpty]: Start isEmpty. Operand 3886 states and 9719 transitions. [2019-12-27 06:31:55,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 06:31:55,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:55,069 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 06:31:55,069 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:31:55,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:55,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1055047611, now seen corresponding path program 1 times [2019-12-27 06:31:55,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:55,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258710258] [2019-12-27 06:31:55,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:55,260 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 06:31:55,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258710258] [2019-12-27 06:31:55,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:55,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:31:55,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93941246] [2019-12-27 06:31:55,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:31:55,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:55,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:31:55,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:31:55,263 INFO L87 Difference]: Start difference. First operand 3886 states and 9719 transitions. Second operand 7 states. [2019-12-27 06:31:55,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:55,512 INFO L93 Difference]: Finished difference Result 7064 states and 17066 transitions. [2019-12-27 06:31:55,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:31:55,512 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-27 06:31:55,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:55,517 INFO L225 Difference]: With dead ends: 7064 [2019-12-27 06:31:55,518 INFO L226 Difference]: Without dead ends: 4353 [2019-12-27 06:31:55,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:31:55,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4353 states. [2019-12-27 06:31:55,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4353 to 3969. [2019-12-27 06:31:55,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3969 states. [2019-12-27 06:31:55,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3969 states to 3969 states and 9784 transitions. [2019-12-27 06:31:55,648 INFO L78 Accepts]: Start accepts. Automaton has 3969 states and 9784 transitions. Word has length 48 [2019-12-27 06:31:55,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:55,649 INFO L462 AbstractCegarLoop]: Abstraction has 3969 states and 9784 transitions. [2019-12-27 06:31:55,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:31:55,649 INFO L276 IsEmpty]: Start isEmpty. Operand 3969 states and 9784 transitions. [2019-12-27 06:31:55,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 06:31:55,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:55,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, 1] [2019-12-27 06:31:55,652 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:31:55,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:55,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1847372445, now seen corresponding path program 2 times [2019-12-27 06:31:55,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:55,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123446372] [2019-12-27 06:31:55,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:55,952 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 06:31:55,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123446372] [2019-12-27 06:31:55,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:55,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 06:31:55,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225527596] [2019-12-27 06:31:55,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 06:31:55,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:55,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 06:31:55,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:31:55,954 INFO L87 Difference]: Start difference. First operand 3969 states and 9784 transitions. Second operand 13 states. [2019-12-27 06:31:57,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:57,703 INFO L93 Difference]: Finished difference Result 10863 states and 25061 transitions. [2019-12-27 06:31:57,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 06:31:57,703 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2019-12-27 06:31:57,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:57,710 INFO L225 Difference]: With dead ends: 10863 [2019-12-27 06:31:57,710 INFO L226 Difference]: Without dead ends: 4643 [2019-12-27 06:31:57,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=362, Invalid=828, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 06:31:57,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4643 states. [2019-12-27 06:31:57,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4643 to 3892. [2019-12-27 06:31:57,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3892 states. [2019-12-27 06:31:57,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3892 states to 3892 states and 9146 transitions. [2019-12-27 06:31:57,754 INFO L78 Accepts]: Start accepts. Automaton has 3892 states and 9146 transitions. Word has length 48 [2019-12-27 06:31:57,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:57,754 INFO L462 AbstractCegarLoop]: Abstraction has 3892 states and 9146 transitions. [2019-12-27 06:31:57,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 06:31:57,754 INFO L276 IsEmpty]: Start isEmpty. Operand 3892 states and 9146 transitions. [2019-12-27 06:31:57,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 06:31:57,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:57,757 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 06:31:57,757 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:31:57,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:57,758 INFO L82 PathProgramCache]: Analyzing trace with hash 323536583, now seen corresponding path program 3 times [2019-12-27 06:31:57,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:57,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386972687] [2019-12-27 06:31:57,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:57,848 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 06:31:57,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386972687] [2019-12-27 06:31:57,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:57,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:31:57,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943723411] [2019-12-27 06:31:57,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:31:57,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:57,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:31:57,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:31:57,850 INFO L87 Difference]: Start difference. First operand 3892 states and 9146 transitions. Second operand 7 states. [2019-12-27 06:31:57,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:57,940 INFO L93 Difference]: Finished difference Result 1780 states and 4499 transitions. [2019-12-27 06:31:57,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:31:57,940 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-27 06:31:57,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:57,942 INFO L225 Difference]: With dead ends: 1780 [2019-12-27 06:31:57,942 INFO L226 Difference]: Without dead ends: 1232 [2019-12-27 06:31:57,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:31:57,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-27 06:31:57,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1001. [2019-12-27 06:31:57,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2019-12-27 06:31:57,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 2387 transitions. [2019-12-27 06:31:57,958 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 2387 transitions. Word has length 48 [2019-12-27 06:31:57,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:57,959 INFO L462 AbstractCegarLoop]: Abstraction has 1001 states and 2387 transitions. [2019-12-27 06:31:57,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:31:57,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 2387 transitions. [2019-12-27 06:31:57,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:31:57,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:57,961 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:31:57,961 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:31:57,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:57,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1305376162, now seen corresponding path program 1 times [2019-12-27 06:31:57,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:57,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671515315] [2019-12-27 06:31:57,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:58,108 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 06:31:58,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671515315] [2019-12-27 06:31:58,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:58,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:31:58,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320634656] [2019-12-27 06:31:58,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:31:58,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:58,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:31:58,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:31:58,112 INFO L87 Difference]: Start difference. First operand 1001 states and 2387 transitions. Second operand 7 states. [2019-12-27 06:31:58,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:58,226 INFO L93 Difference]: Finished difference Result 1374 states and 3152 transitions. [2019-12-27 06:31:58,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 06:31:58,226 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-27 06:31:58,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:58,227 INFO L225 Difference]: With dead ends: 1374 [2019-12-27 06:31:58,227 INFO L226 Difference]: Without dead ends: 342 [2019-12-27 06:31:58,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:31:58,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-12-27 06:31:58,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 312. [2019-12-27 06:31:58,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-12-27 06:31:58,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 551 transitions. [2019-12-27 06:31:58,232 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 551 transitions. Word has length 59 [2019-12-27 06:31:58,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:58,233 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 551 transitions. [2019-12-27 06:31:58,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:31:58,233 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 551 transitions. [2019-12-27 06:31:58,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:31:58,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:58,234 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:31:58,234 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:31:58,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:58,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1892051570, now seen corresponding path program 2 times [2019-12-27 06:31:58,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:58,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042811718] [2019-12-27 06:31:58,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:58,314 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 06:31:58,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042811718] [2019-12-27 06:31:58,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:58,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:31:58,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94366253] [2019-12-27 06:31:58,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:31:58,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:58,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:31:58,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:31:58,318 INFO L87 Difference]: Start difference. First operand 312 states and 551 transitions. Second operand 3 states. [2019-12-27 06:31:58,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:58,367 INFO L93 Difference]: Finished difference Result 312 states and 550 transitions. [2019-12-27 06:31:58,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:31:58,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 06:31:58,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:58,368 INFO L225 Difference]: With dead ends: 312 [2019-12-27 06:31:58,369 INFO L226 Difference]: Without dead ends: 312 [2019-12-27 06:31:58,369 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 06:31:58,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-12-27 06:31:58,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 224. [2019-12-27 06:31:58,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-12-27 06:31:58,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 390 transitions. [2019-12-27 06:31:58,374 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 390 transitions. Word has length 59 [2019-12-27 06:31:58,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:58,375 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 390 transitions. [2019-12-27 06:31:58,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:31:58,375 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 390 transitions. [2019-12-27 06:31:58,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 06:31:58,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:58,376 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:31:58,376 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:31:58,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:58,376 INFO L82 PathProgramCache]: Analyzing trace with hash -450753008, now seen corresponding path program 1 times [2019-12-27 06:31:58,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:58,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84607937] [2019-12-27 06:31:58,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:58,698 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 06:31:58,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84607937] [2019-12-27 06:31:58,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:58,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 06:31:58,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69605407] [2019-12-27 06:31:58,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 06:31:58,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:58,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 06:31:58,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:31:58,701 INFO L87 Difference]: Start difference. First operand 224 states and 390 transitions. Second operand 14 states. [2019-12-27 06:31:59,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:59,296 INFO L93 Difference]: Finished difference Result 385 states and 652 transitions. [2019-12-27 06:31:59,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 06:31:59,296 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-27 06:31:59,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:59,297 INFO L225 Difference]: With dead ends: 385 [2019-12-27 06:31:59,297 INFO L226 Difference]: Without dead ends: 350 [2019-12-27 06:31:59,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2019-12-27 06:31:59,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-12-27 06:31:59,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 320. [2019-12-27 06:31:59,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-27 06:31:59,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 554 transitions. [2019-12-27 06:31:59,302 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 554 transitions. Word has length 60 [2019-12-27 06:31:59,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:59,302 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 554 transitions. [2019-12-27 06:31:59,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 06:31:59,302 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 554 transitions. [2019-12-27 06:31:59,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 06:31:59,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:59,303 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:31:59,303 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:31:59,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:59,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1199767330, now seen corresponding path program 2 times [2019-12-27 06:31:59,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:59,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019329882] [2019-12-27 06:31:59,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:59,578 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 06:31:59,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019329882] [2019-12-27 06:31:59,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:59,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 06:31:59,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185037860] [2019-12-27 06:31:59,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 06:31:59,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:59,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 06:31:59,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:31:59,580 INFO L87 Difference]: Start difference. First operand 320 states and 554 transitions. Second operand 14 states. [2019-12-27 06:32:00,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:32:00,090 INFO L93 Difference]: Finished difference Result 441 states and 738 transitions. [2019-12-27 06:32:00,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 06:32:00,091 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-27 06:32:00,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:32:00,092 INFO L225 Difference]: With dead ends: 441 [2019-12-27 06:32:00,092 INFO L226 Difference]: Without dead ends: 406 [2019-12-27 06:32:00,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2019-12-27 06:32:00,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-12-27 06:32:00,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 324. [2019-12-27 06:32:00,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-12-27 06:32:00,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 561 transitions. [2019-12-27 06:32:00,097 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 561 transitions. Word has length 60 [2019-12-27 06:32:00,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:32:00,097 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 561 transitions. [2019-12-27 06:32:00,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 06:32:00,098 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 561 transitions. [2019-12-27 06:32:00,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 06:32:00,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:32:00,098 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:32:00,098 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:32:00,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:32:00,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1921577050, now seen corresponding path program 3 times [2019-12-27 06:32:00,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:32:00,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290569449] [2019-12-27 06:32:00,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:32:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:32:00,397 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 06:32:00,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290569449] [2019-12-27 06:32:00,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:32:00,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 06:32:00,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507222538] [2019-12-27 06:32:00,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 06:32:00,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:32:00,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 06:32:00,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:32:00,399 INFO L87 Difference]: Start difference. First operand 324 states and 561 transitions. Second operand 13 states. [2019-12-27 06:32:00,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:32:00,882 INFO L93 Difference]: Finished difference Result 429 states and 717 transitions. [2019-12-27 06:32:00,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 06:32:00,883 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-27 06:32:00,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:32:00,884 INFO L225 Difference]: With dead ends: 429 [2019-12-27 06:32:00,884 INFO L226 Difference]: Without dead ends: 394 [2019-12-27 06:32:00,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2019-12-27 06:32:00,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-12-27 06:32:00,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 332. [2019-12-27 06:32:00,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-12-27 06:32:00,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 575 transitions. [2019-12-27 06:32:00,889 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 575 transitions. Word has length 60 [2019-12-27 06:32:00,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:32:00,890 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 575 transitions. [2019-12-27 06:32:00,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 06:32:00,890 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 575 transitions. [2019-12-27 06:32:00,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 06:32:00,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:32:00,891 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:32:00,891 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:32:00,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:32:00,891 INFO L82 PathProgramCache]: Analyzing trace with hash 790518800, now seen corresponding path program 4 times [2019-12-27 06:32:00,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:32:00,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421522775] [2019-12-27 06:32:00,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:32:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:32:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:32:01,013 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:32:01,014 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:32:01,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= 0 v_~z$w_buff1~0_23) (= v_~x~0_11 0) (= |v_#memory_int_27| (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1149~0.base_21| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1149~0.base_21|) |v_ULTIMATE.start_main_~#t1149~0.offset_16| 0))) (= 0 v_~z$r_buff1_thd1~0_10) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= 0 v_~__unbuffered_p1_EAX~0_11) (= v_~z$w_buff0_used~0_104 0) (= 0 v_~__unbuffered_p0_EAX~0_10) (= v_~z$r_buff0_thd4~0_29 0) (= v_~z$r_buff0_thd0~0_83 0) (= 0 v_~__unbuffered_p3_EAX~0_12) (= 0 v_~weak$$choice2~0_32) (= v_~z$read_delayed~0_5 0) (= 0 v_~z$r_buff1_thd0~0_50) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1149~0.base_21|) (= 0 v_~z$flush_delayed~0_17) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t1149~0.base_21| 1)) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~z$r_buff1_thd2~0_10) (= 0 v_~z$w_buff1_used~0_64) (= v_~a~0_10 0) (= 0 v_~weak$$choice0~0_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1149~0.base_21|)) (= 0 v_~__unbuffered_cnt~0_24) (< 0 |v_#StackHeapBarrier_20|) (= v_~z$r_buff0_thd1~0_11 0) (= 0 |v_#NULL.base_7|) (= v_~z~0_27 0) (= 0 v_~__unbuffered_p3_EBX~0_12) (= v_~z$r_buff0_thd2~0_9 0) (= (store |v_#length_28| |v_ULTIMATE.start_main_~#t1149~0.base_21| 4) |v_#length_27|) (= v_~z$mem_tmp~0_12 0) (= v_~y~0_10 0) (= 0 v_~z$w_buff0~0_25) (= v_~main$tmp_guard0~0_11 0) (= v_~b~0_12 0) (= v_~main$tmp_guard1~0_13 0) (= 0 |v_ULTIMATE.start_main_~#t1149~0.offset_16|) (= v_~z$r_buff0_thd3~0_22 0) (= 0 v_~z$r_buff1_thd3~0_17) (= 0 v_~z$r_buff1_thd4~0_19))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_28|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_10, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_8|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_11|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_12|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_8|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ~a~0=v_~a~0_10, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_83, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_29, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_12, #length=|v_#length_27|, ~z$mem_tmp~0=v_~z$mem_tmp~0_12, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_11|, ULTIMATE.start_main_~#t1151~0.base=|v_ULTIMATE.start_main_~#t1151~0.base_21|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_64, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_17, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_10|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_14|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_22, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~x~0=v_~x~0_11, ULTIMATE.start_main_~#t1152~0.base=|v_ULTIMATE.start_main_~#t1152~0.base_22|, ULTIMATE.start_main_~#t1150~0.offset=|v_ULTIMATE.start_main_~#t1150~0.offset_16|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_19, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ~z$w_buff1~0=v_~z$w_buff1~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_10|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_8|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_14|, ULTIMATE.start_main_~#t1150~0.base=|v_ULTIMATE.start_main_~#t1150~0.base_22|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_8|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_13|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_50, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_6|, ~y~0=v_~y~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_10|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_6|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ULTIMATE.start_main_~#t1149~0.offset=|v_ULTIMATE.start_main_~#t1149~0.offset_16|, ULTIMATE.start_main_~#t1152~0.offset=|v_ULTIMATE.start_main_~#t1152~0.offset_16|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_11|, ULTIMATE.start_main_~#t1149~0.base=|v_ULTIMATE.start_main_~#t1149~0.base_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_12|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ULTIMATE.start_main_~#t1151~0.offset=|v_ULTIMATE.start_main_~#t1151~0.offset_16|, ~b~0=v_~b~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_5|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t1151~0.base, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1152~0.base, ULTIMATE.start_main_~#t1150~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t1150~0.base, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t1149~0.offset, ULTIMATE.start_main_~#t1152~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t1149~0.base, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1151~0.offset, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:32:01,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L835-1-->L837: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1150~0.base_12| 0)) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1150~0.base_12|)) (= |v_ULTIMATE.start_main_~#t1150~0.offset_10| 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1150~0.base_12|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1150~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1150~0.base_12|) |v_ULTIMATE.start_main_~#t1150~0.offset_10| 1)) |v_#memory_int_21|) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1150~0.base_12| 1)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1150~0.base_12| 4) |v_#length_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1150~0.offset=|v_ULTIMATE.start_main_~#t1150~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1150~0.base=|v_ULTIMATE.start_main_~#t1150~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1150~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1150~0.base] because there is no mapped edge [2019-12-27 06:32:01,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L837-1-->L839: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1151~0.offset_8|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1151~0.base_8| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1151~0.base_8|) |v_ULTIMATE.start_main_~#t1151~0.offset_8| 2)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t1151~0.base_8|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1151~0.base_8|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1151~0.base_8| 4)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1151~0.base_8|) 0) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1151~0.base_8| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1151~0.offset=|v_ULTIMATE.start_main_~#t1151~0.offset_8|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1151~0.base=|v_ULTIMATE.start_main_~#t1151~0.base_8|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_3|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1151~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1151~0.base, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-27 06:32:01,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L839-1-->L841: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1152~0.base_12|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1152~0.base_12| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1152~0.base_12|) |v_ULTIMATE.start_main_~#t1152~0.offset_10| 3)) |v_#memory_int_23|) (= |v_ULTIMATE.start_main_~#t1152~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1152~0.base_12|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1152~0.base_12| 4)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1152~0.base_12| 1)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1152~0.base_12|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1152~0.offset=|v_ULTIMATE.start_main_~#t1152~0.offset_10|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_23|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|, ULTIMATE.start_main_~#t1152~0.base=|v_ULTIMATE.start_main_~#t1152~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1152~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1152~0.base] because there is no mapped edge [2019-12-27 06:32:01,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L4-->L812: Formula: (and (= ~a~0_Out-198070023 ~__unbuffered_p3_EAX~0_Out-198070023) (= ~b~0_In-198070023 ~__unbuffered_p3_EBX~0_Out-198070023) (= ~z$r_buff0_thd0~0_In-198070023 ~z$r_buff1_thd0~0_Out-198070023) (= ~z$r_buff1_thd4~0_Out-198070023 ~z$r_buff0_thd4~0_In-198070023) (= 1 ~z$r_buff0_thd4~0_Out-198070023) (= ~a~0_Out-198070023 1) (= ~z$r_buff1_thd3~0_Out-198070023 ~z$r_buff0_thd3~0_In-198070023) (not (= 0 P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-198070023)) (= ~z$r_buff0_thd1~0_In-198070023 ~z$r_buff1_thd1~0_Out-198070023) (= ~z$r_buff0_thd2~0_In-198070023 ~z$r_buff1_thd2~0_Out-198070023)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-198070023, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-198070023, ~b~0=~b~0_In-198070023, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-198070023, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-198070023, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-198070023, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-198070023} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-198070023, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-198070023, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-198070023, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-198070023, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out-198070023, ~a~0=~a~0_Out-198070023, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-198070023, ~b~0=~b~0_In-198070023, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-198070023, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-198070023, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-198070023, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-198070023, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-198070023, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-198070023, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-198070023} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 06:32:01,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] P0ENTRY-->P0EXIT: Formula: (and (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_7) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 1 v_~b~0_8) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_7} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_8, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, ~x~0=v_~x~0_7, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 06:32:01,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~__unbuffered_p1_EAX~0_6 v_~y~0_5) (= 1 v_~x~0_5) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~y~0=v_~y~0_5} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~y~0=v_~y~0_5, ~x~0=v_~x~0_5, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 06:32:01,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In329719444 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In329719444 256) 0))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out329719444|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In329719444 |P3Thread1of1ForFork3_#t~ite11_Out329719444|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In329719444, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In329719444} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In329719444, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In329719444, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out329719444|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-27 06:32:01,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L776-2-->L776-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1033122732 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1033122732 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite3_Out-1033122732| ~z$w_buff1~0_In-1033122732)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite3_Out-1033122732| ~z~0_In-1033122732)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1033122732, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1033122732, ~z$w_buff1~0=~z$w_buff1~0_In-1033122732, ~z~0=~z~0_In-1033122732} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-1033122732|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1033122732, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1033122732, ~z$w_buff1~0=~z$w_buff1~0_In-1033122732, ~z~0=~z~0_In-1033122732} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 06:32:01,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L776-4-->L777: Formula: (= v_~z~0_15 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_7|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-27 06:32:01,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1704484546 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1704484546 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite5_Out1704484546| ~z$w_buff0_used~0_In1704484546) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite5_Out1704484546| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1704484546, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1704484546} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out1704484546|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1704484546, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1704484546} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 06:32:01,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1264625873 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In1264625873 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1264625873 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In1264625873 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite6_Out1264625873|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1264625873 |P2Thread1of1ForFork2_#t~ite6_Out1264625873|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1264625873, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1264625873, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1264625873, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1264625873} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out1264625873|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1264625873, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1264625873, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1264625873, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1264625873} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 06:32:01,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In258137713 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In258137713 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite7_Out258137713| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite7_Out258137713| ~z$r_buff0_thd3~0_In258137713) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In258137713, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In258137713} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In258137713, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In258137713, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out258137713|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 06:32:01,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1476162460 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1476162460 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1476162460 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1476162460 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite8_Out-1476162460| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$r_buff1_thd3~0_In-1476162460 |P2Thread1of1ForFork2_#t~ite8_Out-1476162460|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1476162460, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1476162460, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1476162460, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1476162460} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1476162460, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1476162460, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1476162460, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1476162460, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-1476162460|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 06:32:01,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L780-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= v_~z$r_buff1_thd3~0_14 |v_P2Thread1of1ForFork2_#t~ite8_8|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_8|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_14, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_7|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 06:32:01,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L814-->L814-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1113759030 256))) (.cse3 (= (mod ~z$r_buff0_thd4~0_In-1113759030 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In-1113759030 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1113759030 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork3_#t~ite12_Out-1113759030| 0)) (and (= ~z$w_buff1_used~0_In-1113759030 |P3Thread1of1ForFork3_#t~ite12_Out-1113759030|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1113759030, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1113759030, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1113759030, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1113759030} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1113759030, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1113759030, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1113759030, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1113759030, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-1113759030|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-27 06:32:01,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L815-->L816: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In875252722 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In875252722 256) 0))) (or (and (= ~z$r_buff0_thd4~0_Out875252722 ~z$r_buff0_thd4~0_In875252722) (or .cse0 .cse1)) (and (= ~z$r_buff0_thd4~0_Out875252722 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In875252722, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In875252722} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In875252722, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out875252722, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out875252722|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-27 06:32:01,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-5894029 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-5894029 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd4~0_In-5894029 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-5894029 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork3_#t~ite14_Out-5894029| 0)) (and (= |P3Thread1of1ForFork3_#t~ite14_Out-5894029| ~z$r_buff1_thd4~0_In-5894029) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-5894029, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-5894029, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-5894029, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-5894029} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-5894029, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-5894029, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-5894029|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-5894029, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-5894029} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-27 06:32:01,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L816-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite14_8| v_~z$r_buff1_thd4~0_16) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_16, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_7|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 06:32:01,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L845-->L847-2: Formula: (and (or (= (mod v_~z$r_buff0_thd0~0_47 256) 0) (= (mod v_~z$w_buff0_used~0_70 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_70, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_70, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 06:32:01,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L847-2-->L847-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1114737037 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1114737037 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite19_Out-1114737037| |ULTIMATE.start_main_#t~ite20_Out-1114737037|))) (or (and (or .cse0 .cse1) (= ~z~0_In-1114737037 |ULTIMATE.start_main_#t~ite19_Out-1114737037|) .cse2) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite19_Out-1114737037| ~z$w_buff1~0_In-1114737037) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1114737037, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1114737037, ~z$w_buff1~0=~z$w_buff1~0_In-1114737037, ~z~0=~z~0_In-1114737037} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1114737037|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1114737037, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1114737037, ~z$w_buff1~0=~z$w_buff1~0_In-1114737037, ~z~0=~z~0_In-1114737037, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1114737037|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 06:32:01,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L848-->L848-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1012453852 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1012453852 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-1012453852| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite21_Out-1012453852| ~z$w_buff0_used~0_In-1012453852)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1012453852, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1012453852} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1012453852, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1012453852, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1012453852|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 06:32:01,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L849-->L849-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-1763061355 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1763061355 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1763061355 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1763061355 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-1763061355|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-1763061355 |ULTIMATE.start_main_#t~ite22_Out-1763061355|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1763061355, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1763061355, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1763061355, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1763061355} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1763061355, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1763061355, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1763061355, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1763061355, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1763061355|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 06:32:01,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L850-->L850-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In26663727 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In26663727 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite23_Out26663727| ~z$r_buff0_thd0~0_In26663727)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite23_Out26663727|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In26663727, ~z$w_buff0_used~0=~z$w_buff0_used~0_In26663727} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In26663727, ~z$w_buff0_used~0=~z$w_buff0_used~0_In26663727, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out26663727|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 06:32:01,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L851-->L851-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1761689513 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1761689513 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1761689513 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1761689513 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In1761689513 |ULTIMATE.start_main_#t~ite24_Out1761689513|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite24_Out1761689513| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1761689513, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1761689513, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1761689513, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1761689513} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1761689513, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1761689513, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1761689513, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1761689513|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1761689513} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 06:32:01,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L861-->L861-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1761619350 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite36_In1761619350| |ULTIMATE.start_main_#t~ite36_Out1761619350|) (= |ULTIMATE.start_main_#t~ite37_Out1761619350| ~z$w_buff0_used~0_In1761619350) (not .cse0)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1761619350 256) 0))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In1761619350 256) 0)) (and .cse1 (= (mod ~z$r_buff1_thd0~0_In1761619350 256) 0)) (= (mod ~z$w_buff0_used~0_In1761619350 256) 0))) (= |ULTIMATE.start_main_#t~ite36_Out1761619350| |ULTIMATE.start_main_#t~ite37_Out1761619350|) .cse0 (= |ULTIMATE.start_main_#t~ite36_Out1761619350| ~z$w_buff0_used~0_In1761619350)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1761619350, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1761619350, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1761619350, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1761619350, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_In1761619350|, ~weak$$choice2~0=~weak$$choice2~0_In1761619350} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1761619350, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1761619350, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1761619350, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1761619350, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1761619350|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1761619350|, ~weak$$choice2~0=~weak$$choice2~0_In1761619350} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 06:32:01,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L862-->L862-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1284481375 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1284481375 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In1284481375 256)) .cse0) (and (= (mod ~z$r_buff1_thd0~0_In1284481375 256) 0) .cse0) (= (mod ~z$w_buff0_used~0_In1284481375 256) 0))) .cse1 (= ~z$w_buff1_used~0_In1284481375 |ULTIMATE.start_main_#t~ite39_Out1284481375|) (= |ULTIMATE.start_main_#t~ite40_Out1284481375| |ULTIMATE.start_main_#t~ite39_Out1284481375|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite39_In1284481375| |ULTIMATE.start_main_#t~ite39_Out1284481375|) (= ~z$w_buff1_used~0_In1284481375 |ULTIMATE.start_main_#t~ite40_Out1284481375|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1284481375, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1284481375, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In1284481375|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1284481375, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1284481375, ~weak$$choice2~0=~weak$$choice2~0_In1284481375} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1284481375, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1284481375|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1284481375|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1284481375, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1284481375, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1284481375, ~weak$$choice2~0=~weak$$choice2~0_In1284481375} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 06:32:01,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L863-->L864: Formula: (and (= v_~z$r_buff0_thd0~0_58 v_~z$r_buff0_thd0~0_57) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_57, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_20, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 06:32:01,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L866-->L4: Formula: (and (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_~z~0_21 v_~z$mem_tmp~0_7) (= 0 v_~z$flush_delayed~0_10) (not (= (mod v_~z$flush_delayed~0_11 256) 0))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_21, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:32:01,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 06:32:01,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:32:01 BasicIcfg [2019-12-27 06:32:01,133 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:32:01,135 INFO L168 Benchmark]: Toolchain (without parser) took 53299.72 ms. Allocated memory was 139.5 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 102.4 MB in the beginning and 1.1 GB in the end (delta: -950.6 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 06:32:01,135 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 06:32:01,136 INFO L168 Benchmark]: CACSL2BoogieTranslator took 742.64 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 102.0 MB in the beginning and 157.1 MB in the end (delta: -55.1 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-12-27 06:32:01,136 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.47 ms. Allocated memory is still 203.9 MB. Free memory was 157.1 MB in the beginning and 154.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:32:01,137 INFO L168 Benchmark]: Boogie Preprocessor took 38.92 ms. Allocated memory is still 203.9 MB. Free memory was 154.5 MB in the beginning and 152.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:32:01,138 INFO L168 Benchmark]: RCFGBuilder took 840.41 ms. Allocated memory is still 203.9 MB. Free memory was 152.0 MB in the beginning and 102.3 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:32:01,141 INFO L168 Benchmark]: TraceAbstraction took 51601.83 ms. Allocated memory was 203.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 101.6 MB in the beginning and 1.1 GB in the end (delta: -951.4 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 06:32:01,145 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.51 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 742.64 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 102.0 MB in the beginning and 157.1 MB in the end (delta: -55.1 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.47 ms. Allocated memory is still 203.9 MB. Free memory was 157.1 MB in the beginning and 154.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.92 ms. Allocated memory is still 203.9 MB. Free memory was 154.5 MB in the beginning and 152.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 840.41 ms. Allocated memory is still 203.9 MB. Free memory was 152.0 MB in the beginning and 102.3 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 51601.83 ms. Allocated memory was 203.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 101.6 MB in the beginning and 1.1 GB in the end (delta: -951.4 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 182 ProgramPointsBefore, 91 ProgramPointsAfterwards, 210 TransitionsBefore, 98 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 26 ChoiceCompositions, 4581 VarBasedMoverChecksPositive, 178 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 57720 CheckedPairsTotal, 124 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t1149, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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(&t1150, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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] [L839] FCALL, FORK 0 pthread_create(&t1151, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L841] FCALL, FORK 0 pthread_create(&t1152, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L790] 4 z$w_buff1 = z$w_buff0 [L791] 4 z$w_buff0 = 2 [L792] 4 z$w_buff1_used = z$w_buff0_used [L793] 4 z$w_buff0_used = (_Bool)1 [L812] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 1 [L773] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 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) [L776] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L778] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L779] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 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 [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 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) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 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 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 51.3s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 15.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2990 SDtfs, 4447 SDslu, 8154 SDs, 0 SdLazy, 4490 SolverSat, 301 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 224 GetRequests, 26 SyntacticMatches, 12 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66690occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 25.7s AutomataMinimizationTime, 20 MinimizatonAttempts, 77552 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 859 NumberOfCodeBlocks, 859 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 779 ConstructedInterpolants, 0 QuantifiedInterpolants, 200247 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...