/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/mix056_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:53:08,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:53:08,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:53:08,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:53:08,385 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:53:08,386 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:53:08,388 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:53:08,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:53:08,391 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:53:08,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:53:08,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:53:08,394 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:53:08,394 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:53:08,395 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:53:08,396 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:53:08,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:53:08,398 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:53:08,399 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:53:08,400 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:53:08,402 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:53:08,404 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:53:08,405 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:53:08,406 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:53:08,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:53:08,409 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:53:08,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:53:08,410 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:53:08,410 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:53:08,411 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:53:08,412 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:53:08,412 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:53:08,413 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:53:08,413 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:53:08,414 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:53:08,415 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:53:08,415 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:53:08,416 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:53:08,416 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:53:08,416 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:53:08,417 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:53:08,418 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:53:08,419 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-18 21:53:08,433 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:53:08,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:53:08,434 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:53:08,434 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:53:08,435 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:53:08,435 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:53:08,435 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:53:08,435 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:53:08,435 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:53:08,436 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:53:08,436 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:53:08,436 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:53:08,436 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:53:08,436 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:53:08,436 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:53:08,437 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:53:08,437 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:53:08,437 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:53:08,437 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:53:08,437 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:53:08,438 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:53:08,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:53:08,438 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:53:08,438 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:53:08,438 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:53:08,439 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:53:08,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:53:08,439 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:53:08,439 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:53:08,439 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:53:08,717 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:53:08,734 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:53:08,739 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:53:08,742 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:53:08,742 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:53:08,743 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_rmo.opt.i [2019-12-18 21:53:08,819 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d88f397f7/58c026aba9ae44eaa2134dfd9538a37d/FLAG1cf34665a [2019-12-18 21:53:09,396 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:53:09,397 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_rmo.opt.i [2019-12-18 21:53:09,422 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d88f397f7/58c026aba9ae44eaa2134dfd9538a37d/FLAG1cf34665a [2019-12-18 21:53:09,717 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d88f397f7/58c026aba9ae44eaa2134dfd9538a37d [2019-12-18 21:53:09,725 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:53:09,727 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:53:09,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:53:09,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:53:09,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:53:09,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:53:09" (1/1) ... [2019-12-18 21:53:09,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6171d743 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:53:09, skipping insertion in model container [2019-12-18 21:53:09,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:53:09" (1/1) ... [2019-12-18 21:53:09,744 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:53:09,809 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:53:10,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:53:10,385 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:53:10,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:53:10,572 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:53:10,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:53:10 WrapperNode [2019-12-18 21:53:10,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:53:10,574 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:53:10,574 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:53:10,574 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:53:10,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:53:10" (1/1) ... [2019-12-18 21:53:10,618 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:53:10" (1/1) ... [2019-12-18 21:53:10,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:53:10,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:53:10,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:53:10,662 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:53:10,672 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:53:10" (1/1) ... [2019-12-18 21:53:10,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:53:10" (1/1) ... [2019-12-18 21:53:10,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:53:10" (1/1) ... [2019-12-18 21:53:10,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:53:10" (1/1) ... [2019-12-18 21:53:10,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:53:10" (1/1) ... [2019-12-18 21:53:10,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:53:10" (1/1) ... [2019-12-18 21:53:10,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:53:10" (1/1) ... [2019-12-18 21:53:10,701 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:53:10,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:53:10,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:53:10,702 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:53:10,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:53:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:53:10,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:53:10,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:53:10,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:53:10,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:53:10,786 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:53:10,787 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:53:10,787 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:53:10,788 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:53:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:53:10,789 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:53:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:53:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:53:10,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:53:10,792 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:53:11,569 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:53:11,569 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:53:11,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:53:11 BoogieIcfgContainer [2019-12-18 21:53:11,571 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:53:11,572 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:53:11,572 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:53:11,576 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:53:11,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:53:09" (1/3) ... [2019-12-18 21:53:11,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76995ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:53:11, skipping insertion in model container [2019-12-18 21:53:11,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:53:10" (2/3) ... [2019-12-18 21:53:11,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76995ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:53:11, skipping insertion in model container [2019-12-18 21:53:11,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:53:11" (3/3) ... [2019-12-18 21:53:11,580 INFO L109 eAbstractionObserver]: Analyzing ICFG mix056_rmo.opt.i [2019-12-18 21:53:11,590 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:53:11,590 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:53:11,598 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:53:11,599 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:53:11,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,636 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,636 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,638 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,638 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,646 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,646 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,647 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,647 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,647 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,658 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,660 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,660 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,664 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,664 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,667 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,668 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:53:11,685 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 21:53:11,705 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:53:11,705 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:53:11,705 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:53:11,705 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:53:11,705 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:53:11,705 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:53:11,706 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:53:11,706 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:53:11,724 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-18 21:53:11,726 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 21:53:11,827 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 21:53:11,828 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:53:11,844 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 21:53:11,865 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 21:53:11,924 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 21:53:11,924 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:53:11,933 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 21:53:11,949 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 21:53:11,950 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:53:15,222 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 21:53:15,335 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 21:53:15,358 INFO L206 etLargeBlockEncoding]: Checked pairs total: 51676 [2019-12-18 21:53:15,359 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-18 21:53:15,362 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 86 places, 97 transitions [2019-12-18 21:53:16,461 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18542 states. [2019-12-18 21:53:16,463 INFO L276 IsEmpty]: Start isEmpty. Operand 18542 states. [2019-12-18 21:53:16,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 21:53:16,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:16,475 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:53:16,475 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:16,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:16,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1984617832, now seen corresponding path program 1 times [2019-12-18 21:53:16,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:16,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275124021] [2019-12-18 21:53:16,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:16,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:16,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275124021] [2019-12-18 21:53:16,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:16,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:53:16,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275007274] [2019-12-18 21:53:16,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:53:16,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:16,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:53:16,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:53:16,824 INFO L87 Difference]: Start difference. First operand 18542 states. Second operand 3 states. [2019-12-18 21:53:17,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:17,859 INFO L93 Difference]: Finished difference Result 18414 states and 69758 transitions. [2019-12-18 21:53:17,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:53:17,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 21:53:17,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:18,121 INFO L225 Difference]: With dead ends: 18414 [2019-12-18 21:53:18,122 INFO L226 Difference]: Without dead ends: 18050 [2019-12-18 21:53:18,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:53:18,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18050 states. [2019-12-18 21:53:18,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18050 to 18050. [2019-12-18 21:53:18,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18050 states. [2019-12-18 21:53:19,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18050 states to 18050 states and 68456 transitions. [2019-12-18 21:53:19,065 INFO L78 Accepts]: Start accepts. Automaton has 18050 states and 68456 transitions. Word has length 7 [2019-12-18 21:53:19,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:19,066 INFO L462 AbstractCegarLoop]: Abstraction has 18050 states and 68456 transitions. [2019-12-18 21:53:19,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:53:19,066 INFO L276 IsEmpty]: Start isEmpty. Operand 18050 states and 68456 transitions. [2019-12-18 21:53:19,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:53:19,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:19,079 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:53:19,079 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:19,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:19,080 INFO L82 PathProgramCache]: Analyzing trace with hash -975860123, now seen corresponding path program 1 times [2019-12-18 21:53:19,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:19,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214088332] [2019-12-18 21:53:19,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:19,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:19,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214088332] [2019-12-18 21:53:19,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:19,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:53:19,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955408858] [2019-12-18 21:53:19,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:53:19,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:19,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:53:19,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:53:19,205 INFO L87 Difference]: Start difference. First operand 18050 states and 68456 transitions. Second operand 4 states. [2019-12-18 21:53:19,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:19,871 INFO L93 Difference]: Finished difference Result 28066 states and 102408 transitions. [2019-12-18 21:53:19,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:53:19,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 21:53:19,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:20,979 INFO L225 Difference]: With dead ends: 28066 [2019-12-18 21:53:20,980 INFO L226 Difference]: Without dead ends: 28052 [2019-12-18 21:53:20,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:53:21,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28052 states. [2019-12-18 21:53:21,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28052 to 25418. [2019-12-18 21:53:21,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25418 states. [2019-12-18 21:53:21,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25418 states to 25418 states and 94124 transitions. [2019-12-18 21:53:21,984 INFO L78 Accepts]: Start accepts. Automaton has 25418 states and 94124 transitions. Word has length 13 [2019-12-18 21:53:21,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:21,984 INFO L462 AbstractCegarLoop]: Abstraction has 25418 states and 94124 transitions. [2019-12-18 21:53:21,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:53:21,984 INFO L276 IsEmpty]: Start isEmpty. Operand 25418 states and 94124 transitions. [2019-12-18 21:53:21,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:53:21,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:21,987 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:53:21,988 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:21,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:21,988 INFO L82 PathProgramCache]: Analyzing trace with hash -595379205, now seen corresponding path program 1 times [2019-12-18 21:53:21,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:21,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891255112] [2019-12-18 21:53:21,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:22,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:22,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891255112] [2019-12-18 21:53:22,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:22,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:53:22,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784230933] [2019-12-18 21:53:22,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:53:22,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:22,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:53:22,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:53:22,058 INFO L87 Difference]: Start difference. First operand 25418 states and 94124 transitions. Second operand 3 states. [2019-12-18 21:53:22,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:22,134 INFO L93 Difference]: Finished difference Result 14452 states and 46370 transitions. [2019-12-18 21:53:22,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:53:22,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 21:53:22,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:22,192 INFO L225 Difference]: With dead ends: 14452 [2019-12-18 21:53:22,192 INFO L226 Difference]: Without dead ends: 14452 [2019-12-18 21:53:22,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:53:22,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14452 states. [2019-12-18 21:53:22,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14452 to 14452. [2019-12-18 21:53:22,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14452 states. [2019-12-18 21:53:22,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14452 states to 14452 states and 46370 transitions. [2019-12-18 21:53:22,841 INFO L78 Accepts]: Start accepts. Automaton has 14452 states and 46370 transitions. Word has length 13 [2019-12-18 21:53:22,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:22,842 INFO L462 AbstractCegarLoop]: Abstraction has 14452 states and 46370 transitions. [2019-12-18 21:53:22,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:53:22,842 INFO L276 IsEmpty]: Start isEmpty. Operand 14452 states and 46370 transitions. [2019-12-18 21:53:22,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:53:22,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:22,844 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:53:22,844 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:22,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:22,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1512112924, now seen corresponding path program 1 times [2019-12-18 21:53:22,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:22,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947544515] [2019-12-18 21:53:22,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:22,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:22,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947544515] [2019-12-18 21:53:22,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:22,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:53:22,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786216503] [2019-12-18 21:53:22,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:53:22,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:22,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:53:22,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:53:22,892 INFO L87 Difference]: Start difference. First operand 14452 states and 46370 transitions. Second operand 4 states. [2019-12-18 21:53:22,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:22,915 INFO L93 Difference]: Finished difference Result 2114 states and 4969 transitions. [2019-12-18 21:53:22,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:53:22,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 21:53:22,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:22,925 INFO L225 Difference]: With dead ends: 2114 [2019-12-18 21:53:22,925 INFO L226 Difference]: Without dead ends: 2114 [2019-12-18 21:53:22,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:53:22,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2019-12-18 21:53:22,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 2114. [2019-12-18 21:53:22,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2019-12-18 21:53:22,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 4969 transitions. [2019-12-18 21:53:22,963 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 4969 transitions. Word has length 14 [2019-12-18 21:53:22,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:22,964 INFO L462 AbstractCegarLoop]: Abstraction has 2114 states and 4969 transitions. [2019-12-18 21:53:22,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:53:22,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 4969 transitions. [2019-12-18 21:53:22,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 21:53:22,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:22,967 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] [2019-12-18 21:53:22,967 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:22,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:22,967 INFO L82 PathProgramCache]: Analyzing trace with hash 107168072, now seen corresponding path program 1 times [2019-12-18 21:53:22,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:22,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021745519] [2019-12-18 21:53:22,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:23,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:23,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021745519] [2019-12-18 21:53:23,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:23,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:53:23,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779325241] [2019-12-18 21:53:23,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:53:23,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:23,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:53:23,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:53:23,061 INFO L87 Difference]: Start difference. First operand 2114 states and 4969 transitions. Second operand 5 states. [2019-12-18 21:53:23,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:23,092 INFO L93 Difference]: Finished difference Result 699 states and 1627 transitions. [2019-12-18 21:53:23,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:53:23,093 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 21:53:23,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:23,095 INFO L225 Difference]: With dead ends: 699 [2019-12-18 21:53:23,095 INFO L226 Difference]: Without dead ends: 655 [2019-12-18 21:53:23,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:53:23,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-12-18 21:53:23,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 599. [2019-12-18 21:53:23,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-12-18 21:53:23,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1405 transitions. [2019-12-18 21:53:23,109 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1405 transitions. Word has length 26 [2019-12-18 21:53:23,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:23,110 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 1405 transitions. [2019-12-18 21:53:23,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:53:23,110 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1405 transitions. [2019-12-18 21:53:23,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:53:23,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:23,115 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] [2019-12-18 21:53:23,115 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:23,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:23,116 INFO L82 PathProgramCache]: Analyzing trace with hash 523730057, now seen corresponding path program 1 times [2019-12-18 21:53:23,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:23,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623372328] [2019-12-18 21:53:23,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:23,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:23,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623372328] [2019-12-18 21:53:23,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:23,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:53:23,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789990844] [2019-12-18 21:53:23,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:53:23,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:23,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:53:23,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:53:23,257 INFO L87 Difference]: Start difference. First operand 599 states and 1405 transitions. Second operand 3 states. [2019-12-18 21:53:23,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:23,305 INFO L93 Difference]: Finished difference Result 609 states and 1420 transitions. [2019-12-18 21:53:23,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:53:23,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 21:53:23,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:23,308 INFO L225 Difference]: With dead ends: 609 [2019-12-18 21:53:23,308 INFO L226 Difference]: Without dead ends: 609 [2019-12-18 21:53:23,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:53:23,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-12-18 21:53:23,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 605. [2019-12-18 21:53:23,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-18 21:53:23,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1416 transitions. [2019-12-18 21:53:23,320 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1416 transitions. Word has length 55 [2019-12-18 21:53:23,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:23,322 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1416 transitions. [2019-12-18 21:53:23,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:53:23,323 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1416 transitions. [2019-12-18 21:53:23,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:53:23,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:23,326 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] [2019-12-18 21:53:23,326 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:23,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:23,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1466894421, now seen corresponding path program 1 times [2019-12-18 21:53:23,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:23,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458100493] [2019-12-18 21:53:23,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:23,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:23,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458100493] [2019-12-18 21:53:23,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:23,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:53:23,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462949577] [2019-12-18 21:53:23,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:53:23,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:23,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:53:23,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:53:23,497 INFO L87 Difference]: Start difference. First operand 605 states and 1416 transitions. Second operand 5 states. [2019-12-18 21:53:23,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:23,727 INFO L93 Difference]: Finished difference Result 894 states and 2088 transitions. [2019-12-18 21:53:23,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:53:23,727 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-18 21:53:23,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:23,731 INFO L225 Difference]: With dead ends: 894 [2019-12-18 21:53:23,731 INFO L226 Difference]: Without dead ends: 894 [2019-12-18 21:53:23,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:53:23,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-12-18 21:53:23,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 719. [2019-12-18 21:53:23,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-12-18 21:53:23,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1697 transitions. [2019-12-18 21:53:23,758 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1697 transitions. Word has length 55 [2019-12-18 21:53:23,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:23,759 INFO L462 AbstractCegarLoop]: Abstraction has 719 states and 1697 transitions. [2019-12-18 21:53:23,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:53:23,759 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1697 transitions. [2019-12-18 21:53:23,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:53:23,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:23,764 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] [2019-12-18 21:53:23,765 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:23,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:23,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1931223363, now seen corresponding path program 2 times [2019-12-18 21:53:23,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:23,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652592332] [2019-12-18 21:53:23,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:23,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:23,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652592332] [2019-12-18 21:53:23,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:23,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:53:23,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156895619] [2019-12-18 21:53:23,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:53:23,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:23,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:53:23,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:53:23,942 INFO L87 Difference]: Start difference. First operand 719 states and 1697 transitions. Second operand 6 states. [2019-12-18 21:53:24,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:24,358 INFO L93 Difference]: Finished difference Result 1193 states and 2783 transitions. [2019-12-18 21:53:24,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:53:24,358 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-18 21:53:24,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:24,360 INFO L225 Difference]: With dead ends: 1193 [2019-12-18 21:53:24,360 INFO L226 Difference]: Without dead ends: 1193 [2019-12-18 21:53:24,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:53:24,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2019-12-18 21:53:24,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 761. [2019-12-18 21:53:24,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-12-18 21:53:24,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1800 transitions. [2019-12-18 21:53:24,383 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1800 transitions. Word has length 55 [2019-12-18 21:53:24,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:24,383 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 1800 transitions. [2019-12-18 21:53:24,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:53:24,384 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1800 transitions. [2019-12-18 21:53:24,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:53:24,386 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:24,386 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] [2019-12-18 21:53:24,386 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:24,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:24,387 INFO L82 PathProgramCache]: Analyzing trace with hash 891728533, now seen corresponding path program 3 times [2019-12-18 21:53:24,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:24,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110124404] [2019-12-18 21:53:24,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:24,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:24,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110124404] [2019-12-18 21:53:24,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:24,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:53:24,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050188307] [2019-12-18 21:53:24,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:53:24,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:24,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:53:24,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:53:24,582 INFO L87 Difference]: Start difference. First operand 761 states and 1800 transitions. Second operand 3 states. [2019-12-18 21:53:24,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:24,638 INFO L93 Difference]: Finished difference Result 760 states and 1798 transitions. [2019-12-18 21:53:24,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:53:24,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 21:53:24,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:24,640 INFO L225 Difference]: With dead ends: 760 [2019-12-18 21:53:24,640 INFO L226 Difference]: Without dead ends: 760 [2019-12-18 21:53:24,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:53:24,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2019-12-18 21:53:24,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 539. [2019-12-18 21:53:24,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2019-12-18 21:53:24,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 1284 transitions. [2019-12-18 21:53:24,652 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 1284 transitions. Word has length 55 [2019-12-18 21:53:24,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:24,652 INFO L462 AbstractCegarLoop]: Abstraction has 539 states and 1284 transitions. [2019-12-18 21:53:24,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:53:24,653 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 1284 transitions. [2019-12-18 21:53:24,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 21:53:24,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:24,655 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] [2019-12-18 21:53:24,655 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:24,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:24,656 INFO L82 PathProgramCache]: Analyzing trace with hash -660404610, now seen corresponding path program 1 times [2019-12-18 21:53:24,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:24,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787373876] [2019-12-18 21:53:24,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:24,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:24,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787373876] [2019-12-18 21:53:24,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:24,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:53:24,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476268899] [2019-12-18 21:53:24,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:53:24,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:24,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:53:24,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:53:24,783 INFO L87 Difference]: Start difference. First operand 539 states and 1284 transitions. Second operand 6 states. [2019-12-18 21:53:24,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:24,869 INFO L93 Difference]: Finished difference Result 910 states and 2076 transitions. [2019-12-18 21:53:24,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:53:24,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-18 21:53:24,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:24,871 INFO L225 Difference]: With dead ends: 910 [2019-12-18 21:53:24,871 INFO L226 Difference]: Without dead ends: 373 [2019-12-18 21:53:24,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:53:24,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-12-18 21:53:24,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 320. [2019-12-18 21:53:24,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-18 21:53:24,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 604 transitions. [2019-12-18 21:53:24,880 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 604 transitions. Word has length 56 [2019-12-18 21:53:24,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:24,880 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 604 transitions. [2019-12-18 21:53:24,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:53:24,880 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 604 transitions. [2019-12-18 21:53:24,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 21:53:24,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:24,882 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] [2019-12-18 21:53:24,882 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:24,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:24,883 INFO L82 PathProgramCache]: Analyzing trace with hash 172958554, now seen corresponding path program 2 times [2019-12-18 21:53:24,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:24,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428570384] [2019-12-18 21:53:24,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:24,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:24,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428570384] [2019-12-18 21:53:24,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:24,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:53:24,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816887105] [2019-12-18 21:53:24,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:53:24,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:24,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:53:24,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:53:24,947 INFO L87 Difference]: Start difference. First operand 320 states and 604 transitions. Second operand 3 states. [2019-12-18 21:53:24,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:24,962 INFO L93 Difference]: Finished difference Result 306 states and 560 transitions. [2019-12-18 21:53:24,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:53:24,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 21:53:24,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:24,964 INFO L225 Difference]: With dead ends: 306 [2019-12-18 21:53:24,964 INFO L226 Difference]: Without dead ends: 306 [2019-12-18 21:53:24,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:53:24,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-12-18 21:53:24,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 279. [2019-12-18 21:53:24,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-12-18 21:53:24,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 509 transitions. [2019-12-18 21:53:24,970 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 509 transitions. Word has length 56 [2019-12-18 21:53:24,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:24,971 INFO L462 AbstractCegarLoop]: Abstraction has 279 states and 509 transitions. [2019-12-18 21:53:24,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:53:24,971 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 509 transitions. [2019-12-18 21:53:24,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:53:24,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:24,973 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] [2019-12-18 21:53:24,973 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:24,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:24,974 INFO L82 PathProgramCache]: Analyzing trace with hash 543693155, now seen corresponding path program 1 times [2019-12-18 21:53:24,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:24,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772437537] [2019-12-18 21:53:24,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:25,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:25,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772437537] [2019-12-18 21:53:25,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:25,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 21:53:25,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77509111] [2019-12-18 21:53:25,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 21:53:25,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:25,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 21:53:25,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:53:25,506 INFO L87 Difference]: Start difference. First operand 279 states and 509 transitions. Second operand 19 states. [2019-12-18 21:53:26,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:26,926 INFO L93 Difference]: Finished difference Result 627 states and 1116 transitions. [2019-12-18 21:53:26,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 21:53:26,926 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2019-12-18 21:53:26,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:26,927 INFO L225 Difference]: With dead ends: 627 [2019-12-18 21:53:26,927 INFO L226 Difference]: Without dead ends: 595 [2019-12-18 21:53:26,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=207, Invalid=1053, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 21:53:26,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-12-18 21:53:26,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 339. [2019-12-18 21:53:26,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2019-12-18 21:53:26,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 608 transitions. [2019-12-18 21:53:26,935 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 608 transitions. Word has length 57 [2019-12-18 21:53:26,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:26,936 INFO L462 AbstractCegarLoop]: Abstraction has 339 states and 608 transitions. [2019-12-18 21:53:26,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 21:53:26,936 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 608 transitions. [2019-12-18 21:53:26,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:53:26,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:26,937 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] [2019-12-18 21:53:26,938 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:26,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:26,938 INFO L82 PathProgramCache]: Analyzing trace with hash -280237799, now seen corresponding path program 2 times [2019-12-18 21:53:26,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:26,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507793803] [2019-12-18 21:53:26,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:27,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:27,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507793803] [2019-12-18 21:53:27,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:27,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:53:27,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625198825] [2019-12-18 21:53:27,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 21:53:27,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:27,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 21:53:27,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:53:27,161 INFO L87 Difference]: Start difference. First operand 339 states and 608 transitions. Second operand 13 states. [2019-12-18 21:53:27,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:27,754 INFO L93 Difference]: Finished difference Result 592 states and 1055 transitions. [2019-12-18 21:53:27,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 21:53:27,755 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-18 21:53:27,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:27,756 INFO L225 Difference]: With dead ends: 592 [2019-12-18 21:53:27,756 INFO L226 Difference]: Without dead ends: 560 [2019-12-18 21:53:27,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2019-12-18 21:53:27,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-12-18 21:53:27,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 371. [2019-12-18 21:53:27,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-12-18 21:53:27,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 671 transitions. [2019-12-18 21:53:27,763 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 671 transitions. Word has length 57 [2019-12-18 21:53:27,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:27,764 INFO L462 AbstractCegarLoop]: Abstraction has 371 states and 671 transitions. [2019-12-18 21:53:27,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 21:53:27,764 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 671 transitions. [2019-12-18 21:53:27,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:53:27,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:27,765 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] [2019-12-18 21:53:27,766 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:27,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:27,766 INFO L82 PathProgramCache]: Analyzing trace with hash -381647339, now seen corresponding path program 3 times [2019-12-18 21:53:27,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:27,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183248542] [2019-12-18 21:53:27,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:28,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:28,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183248542] [2019-12-18 21:53:28,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:28,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 21:53:28,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285550349] [2019-12-18 21:53:28,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 21:53:28,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:28,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 21:53:28,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-12-18 21:53:28,223 INFO L87 Difference]: Start difference. First operand 371 states and 671 transitions. Second operand 20 states. [2019-12-18 21:53:29,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:29,371 INFO L93 Difference]: Finished difference Result 723 states and 1264 transitions. [2019-12-18 21:53:29,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 21:53:29,371 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 57 [2019-12-18 21:53:29,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:29,373 INFO L225 Difference]: With dead ends: 723 [2019-12-18 21:53:29,373 INFO L226 Difference]: Without dead ends: 691 [2019-12-18 21:53:29,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=953, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 21:53:29,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-12-18 21:53:29,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 383. [2019-12-18 21:53:29,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-12-18 21:53:29,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 692 transitions. [2019-12-18 21:53:29,380 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 692 transitions. Word has length 57 [2019-12-18 21:53:29,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:29,380 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 692 transitions. [2019-12-18 21:53:29,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 21:53:29,380 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 692 transitions. [2019-12-18 21:53:29,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:53:29,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:29,382 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] [2019-12-18 21:53:29,382 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:29,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:29,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1246719203, now seen corresponding path program 4 times [2019-12-18 21:53:29,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:29,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449696653] [2019-12-18 21:53:29,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:30,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:30,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449696653] [2019-12-18 21:53:30,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:30,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-18 21:53:30,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573742064] [2019-12-18 21:53:30,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 21:53:30,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:30,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 21:53:30,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-12-18 21:53:30,288 INFO L87 Difference]: Start difference. First operand 383 states and 692 transitions. Second operand 23 states. [2019-12-18 21:53:33,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:33,217 INFO L93 Difference]: Finished difference Result 871 states and 1568 transitions. [2019-12-18 21:53:33,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-18 21:53:33,217 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 57 [2019-12-18 21:53:33,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:33,219 INFO L225 Difference]: With dead ends: 871 [2019-12-18 21:53:33,219 INFO L226 Difference]: Without dead ends: 839 [2019-12-18 21:53:33,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=499, Invalid=2807, Unknown=0, NotChecked=0, Total=3306 [2019-12-18 21:53:33,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2019-12-18 21:53:33,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 421. [2019-12-18 21:53:33,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-12-18 21:53:33,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 763 transitions. [2019-12-18 21:53:33,241 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 763 transitions. Word has length 57 [2019-12-18 21:53:33,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:33,242 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 763 transitions. [2019-12-18 21:53:33,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 21:53:33,242 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 763 transitions. [2019-12-18 21:53:33,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:53:33,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:33,244 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] [2019-12-18 21:53:33,245 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:33,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:33,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1610761625, now seen corresponding path program 5 times [2019-12-18 21:53:33,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:33,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486298179] [2019-12-18 21:53:33,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:53:33,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:53:33,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486298179] [2019-12-18 21:53:33,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:53:33,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:53:33,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968810887] [2019-12-18 21:53:33,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 21:53:33,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:53:33,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 21:53:33,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:53:33,731 INFO L87 Difference]: Start difference. First operand 421 states and 763 transitions. Second operand 13 states. [2019-12-18 21:53:34,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:53:34,242 INFO L93 Difference]: Finished difference Result 663 states and 1163 transitions. [2019-12-18 21:53:34,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 21:53:34,242 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-18 21:53:34,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:53:34,243 INFO L225 Difference]: With dead ends: 663 [2019-12-18 21:53:34,244 INFO L226 Difference]: Without dead ends: 631 [2019-12-18 21:53:34,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2019-12-18 21:53:34,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-12-18 21:53:34,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 413. [2019-12-18 21:53:34,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-12-18 21:53:34,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 744 transitions. [2019-12-18 21:53:34,251 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 744 transitions. Word has length 57 [2019-12-18 21:53:34,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:53:34,252 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 744 transitions. [2019-12-18 21:53:34,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 21:53:34,252 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 744 transitions. [2019-12-18 21:53:34,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:53:34,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:53:34,253 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] [2019-12-18 21:53:34,254 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:53:34,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:53:34,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1879148695, now seen corresponding path program 6 times [2019-12-18 21:53:34,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:53:34,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101350094] [2019-12-18 21:53:34,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:53:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:53:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:53:34,376 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:53:34,376 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:53:34,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1504~0.base_27| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1504~0.base_27|) |v_ULTIMATE.start_main_~#t1504~0.offset_20| 0)) |v_#memory_int_25|) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~y$r_buff1_thd0~0_45) (= v_~y~0_25 0) (= v_~y$r_buff0_thd1~0_8 0) (= 0 v_~y$w_buff1~0_24) (= v_~main$tmp_guard0~0_9 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1504~0.base_27| 1) |v_#valid_64|) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~main$tmp_guard1~0_11 0) (= v_~y$r_buff0_thd2~0_19 0) (= v_~y$w_buff0_used~0_103 0) (= 0 v_~weak$$choice2~0_32) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1504~0.base_27|) (= v_~y$r_buff1_thd1~0_8 0) (= 0 v_~y$flush_delayed~0_13) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$r_buff0_thd3~0_25 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1504~0.base_27|) 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (= 0 |v_#NULL.base_6|) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$w_buff0~0_25) (= 0 v_~__unbuffered_cnt~0_22) (= 0 v_~y$r_buff1_thd3~0_18) (= v_~z~0_12 0) (= v_~y$mem_tmp~0_10 0) (= v_~x~0_12 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1504~0.base_27| 4)) (= v_~y$r_buff0_thd0~0_76 0) (= 0 v_~y$r_buff1_thd2~0_16) (= |v_ULTIMATE.start_main_~#t1504~0.offset_20| 0) (= v_~y$w_buff1_used~0_63 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_26|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t1504~0.base=|v_ULTIMATE.start_main_~#t1504~0.base_27|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_13|, ULTIMATE.start_main_~#t1504~0.offset=|v_ULTIMATE.start_main_~#t1504~0.offset_20|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_13|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_11|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_8, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ULTIMATE.start_main_~#t1506~0.offset=|v_ULTIMATE.start_main_~#t1506~0.offset_15|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_9|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_19, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_45, ~x~0=v_~x~0_12, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_15|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_15|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ULTIMATE.start_main_~#t1505~0.offset=|v_ULTIMATE.start_main_~#t1505~0.offset_20|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_15|, ULTIMATE.start_main_~#t1506~0.base=|v_ULTIMATE.start_main_~#t1506~0.base_22|, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y~0=v_~y~0_25, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_13|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_16|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_76, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_~#t1505~0.base=|v_ULTIMATE.start_main_~#t1505~0.base_27|, ~z~0=v_~z~0_12, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_63} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1504~0.base, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1504~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1506~0.offset, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1505~0.offset, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1506~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1505~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 21:53:34,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L800-1-->L802: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1505~0.base_13|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1505~0.base_13| 4) |v_#length_17|) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1505~0.base_13| 1) |v_#valid_40|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1505~0.base_13|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1505~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1505~0.base_13|) |v_ULTIMATE.start_main_~#t1505~0.offset_11| 1)) |v_#memory_int_17|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1505~0.base_13|) 0) (= |v_ULTIMATE.start_main_~#t1505~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1505~0.offset=|v_ULTIMATE.start_main_~#t1505~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, ULTIMATE.start_main_~#t1505~0.base=|v_ULTIMATE.start_main_~#t1505~0.base_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1505~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1505~0.base, #length] because there is no mapped edge [2019-12-18 21:53:34,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L802-1-->L804: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1506~0.base_12|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1506~0.base_12|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1506~0.base_12|) 0) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1506~0.base_12| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1506~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1506~0.base_12|) |v_ULTIMATE.start_main_~#t1506~0.offset_10| 2)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1506~0.offset_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1506~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1506~0.base=|v_ULTIMATE.start_main_~#t1506~0.base_12|, ULTIMATE.start_main_~#t1506~0.offset=|v_ULTIMATE.start_main_~#t1506~0.offset_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1506~0.base, ULTIMATE.start_main_~#t1506~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-18 21:53:34,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] P2ENTRY-->L4-3: Formula: (and (= 1 v_~y$w_buff0_used~0_79) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= (mod v_~y$w_buff1_used~0_51 256) 0) (= v_~y$w_buff1_used~0_51 v_~y$w_buff0_used~0_80) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_8) (= v_~y$w_buff0~0_16 v_~y$w_buff1~0_16) (= 2 v_~y$w_buff0~0_15) (= v_P2Thread1of1ForFork0_~arg.offset_4 |v_P2Thread1of1ForFork0_#in~arg.offset_4|) (= v_P2Thread1of1ForFork0_~arg.base_4 |v_P2Thread1of1ForFork0_#in~arg.base_4|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_80, ~y$w_buff0~0=v_~y$w_buff0~0_16, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_4|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_4, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_4|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_79, ~y$w_buff1~0=v_~y$w_buff1~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_15, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_4, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_4|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_51} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 21:53:34,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 1 v_~x~0_9) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 1 v_~z~0_7) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~z~0=v_~z~0_7, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_9, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 21:53:34,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-2146887071 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-2146887071 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite11_Out-2146887071|)) (and (= ~y$w_buff0_used~0_In-2146887071 |P2Thread1of1ForFork0_#t~ite11_Out-2146887071|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2146887071, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2146887071} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2146887071, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-2146887071|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2146887071} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 21:53:34,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L748-2-->L748-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-183165397 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-183165397 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite3_Out-183165397| ~y~0_In-183165397) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite3_Out-183165397| ~y$w_buff1~0_In-183165397) (not .cse0) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-183165397, ~y$w_buff1~0=~y$w_buff1~0_In-183165397, ~y~0=~y~0_In-183165397, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-183165397} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-183165397, ~y$w_buff1~0=~y$w_buff1~0_In-183165397, ~y~0=~y~0_In-183165397, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-183165397|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-183165397} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 21:53:34,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L748-4-->L749: Formula: (= v_~y~0_16 |v_P1Thread1of1ForFork2_#t~ite3_8|) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_8|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_7|, ~y~0=v_~y~0_16, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 21:53:34,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L749-->L749-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-463721658 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-463721658 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite5_Out-463721658| 0)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-463721658 |P1Thread1of1ForFork2_#t~ite5_Out-463721658|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-463721658, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-463721658} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-463721658, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-463721658, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out-463721658|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 21:53:34,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L750-->L750-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1536406543 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1536406543 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1536406543 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1536406543 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite6_Out-1536406543| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite6_Out-1536406543| ~y$w_buff1_used~0_In-1536406543) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1536406543, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1536406543, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1536406543, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1536406543} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1536406543, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1536406543, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1536406543, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-1536406543|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1536406543} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 21:53:34,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L751-->L751-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-168516647 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-168516647 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite7_Out-168516647| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite7_Out-168516647| ~y$r_buff0_thd2~0_In-168516647)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-168516647, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-168516647} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-168516647, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-168516647, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out-168516647|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 21:53:34,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L779-->L779-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-777157991 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In-777157991 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-777157991 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-777157991 256) 0))) (or (and (= ~y$w_buff1_used~0_In-777157991 |P2Thread1of1ForFork0_#t~ite12_Out-777157991|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork0_#t~ite12_Out-777157991|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-777157991, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-777157991, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-777157991, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-777157991} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-777157991, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-777157991, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-777157991|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-777157991, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-777157991} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 21:53:34,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L752-->L752-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In742250605 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In742250605 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In742250605 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In742250605 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite8_Out742250605|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In742250605 |P1Thread1of1ForFork2_#t~ite8_Out742250605|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In742250605, ~y$w_buff0_used~0=~y$w_buff0_used~0_In742250605, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In742250605, ~y$w_buff1_used~0=~y$w_buff1_used~0_In742250605} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In742250605, ~y$w_buff0_used~0=~y$w_buff0_used~0_In742250605, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out742250605|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In742250605, ~y$w_buff1_used~0=~y$w_buff1_used~0_In742250605} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:53:34,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L752-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite8_8| v_~y$r_buff1_thd2~0_12) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_12, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 21:53:34,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L780-->L781: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In5136008 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In5136008 256)))) (or (and (= ~y$r_buff0_thd3~0_Out5136008 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In5136008 ~y$r_buff0_thd3~0_Out5136008)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In5136008, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In5136008} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In5136008, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out5136008, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out5136008|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 21:53:34,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1017352031 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1017352031 256))) (.cse3 (= (mod ~y$r_buff0_thd3~0_In1017352031 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1017352031 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite14_Out1017352031|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite14_Out1017352031| ~y$r_buff1_thd3~0_In1017352031)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1017352031, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1017352031, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1017352031, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1017352031} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out1017352031|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1017352031, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1017352031, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1017352031, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1017352031} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 21:53:34,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~y$r_buff1_thd3~0_14 |v_P2Thread1of1ForFork0_#t~ite14_8|) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_14, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 21:53:34,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L804-1-->L810: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_3|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 21:53:34,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L810-2-->L810-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1647966289 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1647966289 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In1647966289 |ULTIMATE.start_main_#t~ite18_Out1647966289|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite18_Out1647966289| ~y~0_In1647966289)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1647966289, ~y~0=~y~0_In1647966289, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1647966289, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1647966289} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1647966289, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1647966289|, ~y~0=~y~0_In1647966289, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1647966289, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1647966289} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-18 21:53:34,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L810-4-->L811: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite18_7|) InVars {ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_7|} OutVars{ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_6|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_6|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y~0] because there is no mapped edge [2019-12-18 21:53:34,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In657971540 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In657971540 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite20_Out657971540|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In657971540 |ULTIMATE.start_main_#t~ite20_Out657971540|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In657971540, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In657971540} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In657971540, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In657971540, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out657971540|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:53:34,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In1259278662 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1259278662 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1259278662 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1259278662 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite21_Out1259278662|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In1259278662 |ULTIMATE.start_main_#t~ite21_Out1259278662|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1259278662, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1259278662, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1259278662, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1259278662} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1259278662, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1259278662, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1259278662|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1259278662, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1259278662} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:53:34,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1443083739 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1443083739 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out1443083739| ~y$r_buff0_thd0~0_In1443083739) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out1443083739|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1443083739, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1443083739} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1443083739, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1443083739, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1443083739|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:53:34,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1644890458 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1644890458 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1644890458 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1644890458 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite23_Out1644890458| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$r_buff1_thd0~0_In1644890458 |ULTIMATE.start_main_#t~ite23_Out1644890458|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1644890458, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1644890458, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1644890458, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1644890458} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1644890458, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1644890458, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1644890458, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1644890458|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1644890458} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 21:53:34,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L822-->L822-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2140544932 256) 0))) (or (and (= ~y$w_buff0~0_In-2140544932 |ULTIMATE.start_main_#t~ite29_Out-2140544932|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-2140544932 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-2140544932 256)) .cse1) (and (= 0 (mod ~y$r_buff1_thd0~0_In-2140544932 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-2140544932 256)))) (= |ULTIMATE.start_main_#t~ite30_Out-2140544932| |ULTIMATE.start_main_#t~ite29_Out-2140544932|)) (and (= |ULTIMATE.start_main_#t~ite30_Out-2140544932| ~y$w_buff0~0_In-2140544932) (= |ULTIMATE.start_main_#t~ite29_In-2140544932| |ULTIMATE.start_main_#t~ite29_Out-2140544932|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2140544932, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In-2140544932|, ~y$w_buff0~0=~y$w_buff0~0_In-2140544932, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2140544932, ~weak$$choice2~0=~weak$$choice2~0_In-2140544932, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2140544932, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2140544932} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-2140544932|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2140544932, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-2140544932|, ~y$w_buff0~0=~y$w_buff0~0_In-2140544932, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2140544932, ~weak$$choice2~0=~weak$$choice2~0_In-2140544932, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2140544932, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2140544932} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 21:53:34,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L826-->L827: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~y$r_buff0_thd0~0_54 v_~y$r_buff0_thd0~0_53)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_54, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_21, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:53:34,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L829-->L832-1: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_8 256)) (= v_~y~0_23 v_~y$mem_tmp~0_7) (not (= 0 (mod v_~y$flush_delayed~0_11 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:53:34,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} 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_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 21:53:34,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:53:34 BasicIcfg [2019-12-18 21:53:34,547 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:53:34,550 INFO L168 Benchmark]: Toolchain (without parser) took 24823.13 ms. Allocated memory was 136.3 MB in the beginning and 876.1 MB in the end (delta: 739.8 MB). Free memory was 99.2 MB in the beginning and 373.0 MB in the end (delta: -273.9 MB). Peak memory consumption was 465.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:53:34,550 INFO L168 Benchmark]: CDTParser took 1.04 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 21:53:34,551 INFO L168 Benchmark]: CACSL2BoogieTranslator took 845.05 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 98.7 MB in the beginning and 154.6 MB in the end (delta: -55.9 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:53:34,554 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.91 ms. Allocated memory is still 200.3 MB. Free memory was 154.6 MB in the beginning and 151.1 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:53:34,555 INFO L168 Benchmark]: Boogie Preprocessor took 39.22 ms. Allocated memory is still 200.3 MB. Free memory was 151.1 MB in the beginning and 149.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:53:34,555 INFO L168 Benchmark]: RCFGBuilder took 869.76 ms. Allocated memory is still 200.3 MB. Free memory was 149.0 MB in the beginning and 102.6 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. [2019-12-18 21:53:34,557 INFO L168 Benchmark]: TraceAbstraction took 22975.39 ms. Allocated memory was 200.3 MB in the beginning and 876.1 MB in the end (delta: 675.8 MB). Free memory was 102.0 MB in the beginning and 373.0 MB in the end (delta: -271.1 MB). Peak memory consumption was 404.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:53:34,566 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.04 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 845.05 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 98.7 MB in the beginning and 154.6 MB in the end (delta: -55.9 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 87.91 ms. Allocated memory is still 200.3 MB. Free memory was 154.6 MB in the beginning and 151.1 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.22 ms. Allocated memory is still 200.3 MB. Free memory was 151.1 MB in the beginning and 149.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 869.76 ms. Allocated memory is still 200.3 MB. Free memory was 149.0 MB in the beginning and 102.6 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22975.39 ms. Allocated memory was 200.3 MB in the beginning and 876.1 MB in the end (delta: 675.8 MB). Free memory was 102.0 MB in the beginning and 373.0 MB in the end (delta: -271.1 MB). Peak memory consumption was 404.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 162 ProgramPointsBefore, 86 ProgramPointsAfterwards, 193 TransitionsBefore, 97 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 24 ChoiceCompositions, 3760 VarBasedMoverChecksPositive, 156 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 51676 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t1504, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t1505, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1506, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L768] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L769] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L770] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L771] 3 y$r_buff0_thd3 = (_Bool)1 [L774] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L742] 2 x = 2 [L745] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L748] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L810] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L823] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L825] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L827] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 22.6s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1680 SDtfs, 2154 SDslu, 5987 SDs, 0 SdLazy, 5617 SolverSat, 295 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 233 GetRequests, 26 SyntacticMatches, 11 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25418occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 4991 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 747 NumberOfCodeBlocks, 747 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 674 ConstructedInterpolants, 0 QuantifiedInterpolants, 187033 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...