/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 04:10:25,499 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 04:10:25,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 04:10:25,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 04:10:25,520 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 04:10:25,522 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 04:10:25,524 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 04:10:25,534 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 04:10:25,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 04:10:25,540 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 04:10:25,542 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 04:10:25,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 04:10:25,543 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 04:10:25,545 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 04:10:25,547 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 04:10:25,548 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 04:10:25,550 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 04:10:25,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 04:10:25,552 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 04:10:25,556 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 04:10:25,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 04:10:25,560 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 04:10:25,561 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 04:10:25,562 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 04:10:25,563 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 04:10:25,564 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 04:10:25,564 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 04:10:25,564 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 04:10:25,565 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 04:10:25,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 04:10:25,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 04:10:25,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 04:10:25,567 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 04:10:25,568 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 04:10:25,569 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 04:10:25,569 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 04:10:25,569 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 04:10:25,570 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 04:10:25,570 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 04:10:25,571 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 04:10:25,571 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 04:10:25,572 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 04:10:25,585 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 04:10:25,586 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 04:10:25,587 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 04:10:25,587 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 04:10:25,587 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 04:10:25,588 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 04:10:25,588 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 04:10:25,588 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 04:10:25,588 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 04:10:25,588 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 04:10:25,588 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 04:10:25,589 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 04:10:25,589 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 04:10:25,589 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 04:10:25,589 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 04:10:25,589 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 04:10:25,589 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 04:10:25,590 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 04:10:25,590 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 04:10:25,590 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 04:10:25,590 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 04:10:25,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 04:10:25,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 04:10:25,591 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 04:10:25,591 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 04:10:25,591 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 04:10:25,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 04:10:25,592 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 04:10:25,592 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 04:10:25,871 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 04:10:25,890 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 04:10:25,893 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 04:10:25,895 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 04:10:25,895 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 04:10:25,896 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_pso.opt.i [2019-12-27 04:10:25,970 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e44dc93da/9a3971b37d0e4e95b48fe936c03bb97c/FLAG31f46b325 [2019-12-27 04:10:26,527 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 04:10:26,527 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_pso.opt.i [2019-12-27 04:10:26,549 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e44dc93da/9a3971b37d0e4e95b48fe936c03bb97c/FLAG31f46b325 [2019-12-27 04:10:26,826 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e44dc93da/9a3971b37d0e4e95b48fe936c03bb97c [2019-12-27 04:10:26,834 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 04:10:26,835 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 04:10:26,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 04:10:26,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 04:10:26,840 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 04:10:26,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:10:26" (1/1) ... [2019-12-27 04:10:26,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691f4c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:10:26, skipping insertion in model container [2019-12-27 04:10:26,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:10:26" (1/1) ... [2019-12-27 04:10:26,850 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 04:10:26,899 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 04:10:27,441 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:10:27,459 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 04:10:27,540 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:10:27,611 INFO L208 MainTranslator]: Completed translation [2019-12-27 04:10:27,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:10:27 WrapperNode [2019-12-27 04:10:27,611 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 04:10:27,612 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 04:10:27,612 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 04:10:27,612 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 04:10:27,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:10:27" (1/1) ... [2019-12-27 04:10:27,641 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:10:27" (1/1) ... [2019-12-27 04:10:27,675 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 04:10:27,676 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 04:10:27,676 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 04:10:27,676 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 04:10:27,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:10:27" (1/1) ... [2019-12-27 04:10:27,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:10:27" (1/1) ... [2019-12-27 04:10:27,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:10:27" (1/1) ... [2019-12-27 04:10:27,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:10:27" (1/1) ... [2019-12-27 04:10:27,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:10:27" (1/1) ... [2019-12-27 04:10:27,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:10:27" (1/1) ... [2019-12-27 04:10:27,707 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:10:27" (1/1) ... [2019-12-27 04:10:27,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 04:10:27,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 04:10:27,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 04:10:27,713 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 04:10:27,714 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:10:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 04:10:27,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 04:10:27,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 04:10:27,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 04:10:27,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 04:10:27,778 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 04:10:27,778 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 04:10:27,778 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 04:10:27,779 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 04:10:27,779 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 04:10:27,779 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 04:10:27,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 04:10:27,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 04:10:27,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 04:10:27,781 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 04:10:28,495 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 04:10:28,495 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 04:10:28,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:10:28 BoogieIcfgContainer [2019-12-27 04:10:28,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 04:10:28,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 04:10:28,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 04:10:28,502 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 04:10:28,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:10:26" (1/3) ... [2019-12-27 04:10:28,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c7d4df5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:10:28, skipping insertion in model container [2019-12-27 04:10:28,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:10:27" (2/3) ... [2019-12-27 04:10:28,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c7d4df5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:10:28, skipping insertion in model container [2019-12-27 04:10:28,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:10:28" (3/3) ... [2019-12-27 04:10:28,506 INFO L109 eAbstractionObserver]: Analyzing ICFG safe031_pso.opt.i [2019-12-27 04:10:28,519 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 04:10:28,520 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 04:10:28,530 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 04:10:28,531 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 04:10:28,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,576 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,576 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,578 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,578 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,588 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,588 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,589 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,589 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,590 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,601 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,603 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,603 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,607 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,607 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,610 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,611 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:10:28,628 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 04:10:28,650 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:10:28,651 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:10:28,651 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:10:28,651 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:10:28,651 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:10:28,651 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:10:28,652 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:10:28,652 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:10:28,690 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-27 04:10:28,691 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 04:10:28,804 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 04:10:28,805 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:10:28,819 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 263 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 04:10:28,835 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 04:10:28,922 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 04:10:28,922 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:10:28,930 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 263 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 04:10:28,941 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 04:10:28,942 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 04:10:33,574 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 04:10:33,681 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 04:10:33,702 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48124 [2019-12-27 04:10:33,702 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 04:10:33,705 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 94 transitions [2019-12-27 04:10:34,632 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 15710 states. [2019-12-27 04:10:34,634 INFO L276 IsEmpty]: Start isEmpty. Operand 15710 states. [2019-12-27 04:10:34,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 04:10:34,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:34,642 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:10:34,642 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-27 04:10:34,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:34,647 INFO L82 PathProgramCache]: Analyzing trace with hash 2126234855, now seen corresponding path program 1 times [2019-12-27 04:10:34,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:34,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219206200] [2019-12-27 04:10:34,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:34,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:10:34,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219206200] [2019-12-27 04:10:34,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:34,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 04:10:34,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862133519] [2019-12-27 04:10:34,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:10:34,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:34,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:10:34,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:10:34,924 INFO L87 Difference]: Start difference. First operand 15710 states. Second operand 3 states. [2019-12-27 04:10:35,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:35,416 INFO L93 Difference]: Finished difference Result 15638 states and 59348 transitions. [2019-12-27 04:10:35,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:10:35,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 04:10:35,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:35,607 INFO L225 Difference]: With dead ends: 15638 [2019-12-27 04:10:35,607 INFO L226 Difference]: Without dead ends: 15326 [2019-12-27 04:10:35,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:10:35,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15326 states. [2019-12-27 04:10:36,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15326 to 15326. [2019-12-27 04:10:36,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15326 states. [2019-12-27 04:10:36,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15326 states to 15326 states and 58230 transitions. [2019-12-27 04:10:36,976 INFO L78 Accepts]: Start accepts. Automaton has 15326 states and 58230 transitions. Word has length 7 [2019-12-27 04:10:36,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:36,978 INFO L462 AbstractCegarLoop]: Abstraction has 15326 states and 58230 transitions. [2019-12-27 04:10:36,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:10:36,978 INFO L276 IsEmpty]: Start isEmpty. Operand 15326 states and 58230 transitions. [2019-12-27 04:10:36,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 04:10:36,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:36,990 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:10:36,990 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-27 04:10:36,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:36,991 INFO L82 PathProgramCache]: Analyzing trace with hash -380072381, now seen corresponding path program 1 times [2019-12-27 04:10:36,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:36,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650581529] [2019-12-27 04:10:36,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:37,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:10:37,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650581529] [2019-12-27 04:10:37,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:37,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:10:37,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250023258] [2019-12-27 04:10:37,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:10:37,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:37,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:10:37,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:10:37,184 INFO L87 Difference]: Start difference. First operand 15326 states and 58230 transitions. Second operand 4 states. [2019-12-27 04:10:37,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:37,959 INFO L93 Difference]: Finished difference Result 24490 states and 89350 transitions. [2019-12-27 04:10:37,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:10:37,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 04:10:37,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:38,071 INFO L225 Difference]: With dead ends: 24490 [2019-12-27 04:10:38,072 INFO L226 Difference]: Without dead ends: 24476 [2019-12-27 04:10:38,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:10:38,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24476 states. [2019-12-27 04:10:39,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24476 to 22206. [2019-12-27 04:10:39,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22206 states. [2019-12-27 04:10:40,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22206 states to 22206 states and 82052 transitions. [2019-12-27 04:10:40,403 INFO L78 Accepts]: Start accepts. Automaton has 22206 states and 82052 transitions. Word has length 13 [2019-12-27 04:10:40,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:40,403 INFO L462 AbstractCegarLoop]: Abstraction has 22206 states and 82052 transitions. [2019-12-27 04:10:40,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:10:40,404 INFO L276 IsEmpty]: Start isEmpty. Operand 22206 states and 82052 transitions. [2019-12-27 04:10:40,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 04:10:40,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:40,407 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:10:40,408 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-27 04:10:40,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:40,408 INFO L82 PathProgramCache]: Analyzing trace with hash 691839138, now seen corresponding path program 1 times [2019-12-27 04:10:40,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:40,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998178773] [2019-12-27 04:10:40,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:40,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:10:40,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998178773] [2019-12-27 04:10:40,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:40,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:10:40,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978368820] [2019-12-27 04:10:40,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:10:40,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:40,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:10:40,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:10:40,508 INFO L87 Difference]: Start difference. First operand 22206 states and 82052 transitions. Second operand 3 states. [2019-12-27 04:10:40,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:40,576 INFO L93 Difference]: Finished difference Result 12702 states and 40687 transitions. [2019-12-27 04:10:40,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:10:40,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 04:10:40,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:40,619 INFO L225 Difference]: With dead ends: 12702 [2019-12-27 04:10:40,620 INFO L226 Difference]: Without dead ends: 12702 [2019-12-27 04:10:40,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:10:40,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12702 states. [2019-12-27 04:10:40,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12702 to 12702. [2019-12-27 04:10:40,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12702 states. [2019-12-27 04:10:40,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12702 states to 12702 states and 40687 transitions. [2019-12-27 04:10:40,974 INFO L78 Accepts]: Start accepts. Automaton has 12702 states and 40687 transitions. Word has length 13 [2019-12-27 04:10:40,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:40,976 INFO L462 AbstractCegarLoop]: Abstraction has 12702 states and 40687 transitions. [2019-12-27 04:10:40,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:10:40,979 INFO L276 IsEmpty]: Start isEmpty. Operand 12702 states and 40687 transitions. [2019-12-27 04:10:40,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 04:10:40,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:40,985 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:10:40,985 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-27 04:10:40,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:40,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1718037058, now seen corresponding path program 1 times [2019-12-27 04:10:40,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:40,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525143320] [2019-12-27 04:10:40,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:41,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-27 04:10:41,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525143320] [2019-12-27 04:10:41,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:41,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:10:41,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119246244] [2019-12-27 04:10:41,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:10:41,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:41,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:10:41,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:10:41,061 INFO L87 Difference]: Start difference. First operand 12702 states and 40687 transitions. Second operand 4 states. [2019-12-27 04:10:41,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:41,083 INFO L93 Difference]: Finished difference Result 1935 states and 4569 transitions. [2019-12-27 04:10:41,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 04:10:41,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 04:10:41,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:41,089 INFO L225 Difference]: With dead ends: 1935 [2019-12-27 04:10:41,089 INFO L226 Difference]: Without dead ends: 1935 [2019-12-27 04:10:41,090 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-27 04:10:41,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-12-27 04:10:41,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1935. [2019-12-27 04:10:41,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-12-27 04:10:41,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 4569 transitions. [2019-12-27 04:10:41,126 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 4569 transitions. Word has length 14 [2019-12-27 04:10:41,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:41,126 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 4569 transitions. [2019-12-27 04:10:41,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:10:41,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 4569 transitions. [2019-12-27 04:10:41,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 04:10:41,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:41,129 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-27 04:10:41,129 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-27 04:10:41,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:41,129 INFO L82 PathProgramCache]: Analyzing trace with hash 968226525, now seen corresponding path program 1 times [2019-12-27 04:10:41,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:41,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872630569] [2019-12-27 04:10:41,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:41,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:41,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:10:41,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872630569] [2019-12-27 04:10:41,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:41,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 04:10:41,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62752812] [2019-12-27 04:10:41,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:10:41,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:41,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:10:41,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:10:41,236 INFO L87 Difference]: Start difference. First operand 1935 states and 4569 transitions. Second operand 5 states. [2019-12-27 04:10:41,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:41,262 INFO L93 Difference]: Finished difference Result 630 states and 1476 transitions. [2019-12-27 04:10:41,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:10:41,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 04:10:41,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:41,265 INFO L225 Difference]: With dead ends: 630 [2019-12-27 04:10:41,265 INFO L226 Difference]: Without dead ends: 630 [2019-12-27 04:10:41,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:10:41,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-12-27 04:10:41,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 574. [2019-12-27 04:10:41,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-12-27 04:10:41,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 1344 transitions. [2019-12-27 04:10:41,276 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 1344 transitions. Word has length 26 [2019-12-27 04:10:41,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:41,277 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 1344 transitions. [2019-12-27 04:10:41,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:10:41,277 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 1344 transitions. [2019-12-27 04:10:41,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 04:10:41,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:41,282 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-27 04:10:41,282 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-27 04:10:41,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:41,282 INFO L82 PathProgramCache]: Analyzing trace with hash 196092715, now seen corresponding path program 1 times [2019-12-27 04:10:41,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:41,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765530442] [2019-12-27 04:10:41,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:41,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:10:41,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765530442] [2019-12-27 04:10:41,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:41,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:10:41,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749041286] [2019-12-27 04:10:41,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:10:41,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:41,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:10:41,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:10:41,363 INFO L87 Difference]: Start difference. First operand 574 states and 1344 transitions. Second operand 3 states. [2019-12-27 04:10:41,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:41,466 INFO L93 Difference]: Finished difference Result 584 states and 1354 transitions. [2019-12-27 04:10:41,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:10:41,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 04:10:41,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:41,469 INFO L225 Difference]: With dead ends: 584 [2019-12-27 04:10:41,469 INFO L226 Difference]: Without dead ends: 584 [2019-12-27 04:10:41,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:10:41,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-12-27 04:10:41,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 580. [2019-12-27 04:10:41,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-12-27 04:10:41,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 1350 transitions. [2019-12-27 04:10:41,479 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 1350 transitions. Word has length 55 [2019-12-27 04:10:41,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:41,479 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 1350 transitions. [2019-12-27 04:10:41,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:10:41,480 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 1350 transitions. [2019-12-27 04:10:41,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 04:10:41,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:41,481 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-27 04:10:41,482 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-27 04:10:41,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:41,482 INFO L82 PathProgramCache]: Analyzing trace with hash -922835002, now seen corresponding path program 1 times [2019-12-27 04:10:41,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:41,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532079183] [2019-12-27 04:10:41,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:41,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:10:41,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532079183] [2019-12-27 04:10:41,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:41,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 04:10:41,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469973021] [2019-12-27 04:10:41,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 04:10:41,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:41,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 04:10:41,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 04:10:41,656 INFO L87 Difference]: Start difference. First operand 580 states and 1350 transitions. Second operand 6 states. [2019-12-27 04:10:41,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:41,979 INFO L93 Difference]: Finished difference Result 933 states and 2172 transitions. [2019-12-27 04:10:41,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 04:10:41,980 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 04:10:41,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:41,982 INFO L225 Difference]: With dead ends: 933 [2019-12-27 04:10:41,982 INFO L226 Difference]: Without dead ends: 933 [2019-12-27 04:10:41,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 04:10:41,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2019-12-27 04:10:41,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 738. [2019-12-27 04:10:41,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-12-27 04:10:41,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1733 transitions. [2019-12-27 04:10:41,997 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1733 transitions. Word has length 55 [2019-12-27 04:10:41,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:41,998 INFO L462 AbstractCegarLoop]: Abstraction has 738 states and 1733 transitions. [2019-12-27 04:10:41,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 04:10:41,998 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1733 transitions. [2019-12-27 04:10:42,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 04:10:42,000 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:42,000 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-27 04:10:42,000 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-27 04:10:42,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:42,001 INFO L82 PathProgramCache]: Analyzing trace with hash -256459022, now seen corresponding path program 2 times [2019-12-27 04:10:42,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:42,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745803156] [2019-12-27 04:10:42,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:42,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:10:42,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745803156] [2019-12-27 04:10:42,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:42,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 04:10:42,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890169467] [2019-12-27 04:10:42,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 04:10:42,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:42,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 04:10:42,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 04:10:42,102 INFO L87 Difference]: Start difference. First operand 738 states and 1733 transitions. Second operand 6 states. [2019-12-27 04:10:42,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:42,440 INFO L93 Difference]: Finished difference Result 1275 states and 2967 transitions. [2019-12-27 04:10:42,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 04:10:42,441 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 04:10:42,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:42,447 INFO L225 Difference]: With dead ends: 1275 [2019-12-27 04:10:42,447 INFO L226 Difference]: Without dead ends: 1275 [2019-12-27 04:10:42,447 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-27 04:10:42,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2019-12-27 04:10:42,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 816. [2019-12-27 04:10:42,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2019-12-27 04:10:42,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1930 transitions. [2019-12-27 04:10:42,464 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1930 transitions. Word has length 55 [2019-12-27 04:10:42,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:42,464 INFO L462 AbstractCegarLoop]: Abstraction has 816 states and 1930 transitions. [2019-12-27 04:10:42,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 04:10:42,464 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1930 transitions. [2019-12-27 04:10:42,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 04:10:42,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:42,467 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-27 04:10:42,467 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-27 04:10:42,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:42,467 INFO L82 PathProgramCache]: Analyzing trace with hash -198491454, now seen corresponding path program 3 times [2019-12-27 04:10:42,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:42,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701243829] [2019-12-27 04:10:42,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:42,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:10:42,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701243829] [2019-12-27 04:10:42,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:42,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:10:42,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045562792] [2019-12-27 04:10:42,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:10:42,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:42,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:10:42,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:10:42,526 INFO L87 Difference]: Start difference. First operand 816 states and 1930 transitions. Second operand 3 states. [2019-12-27 04:10:42,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:42,539 INFO L93 Difference]: Finished difference Result 738 states and 1703 transitions. [2019-12-27 04:10:42,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:10:42,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 04:10:42,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:42,542 INFO L225 Difference]: With dead ends: 738 [2019-12-27 04:10:42,542 INFO L226 Difference]: Without dead ends: 738 [2019-12-27 04:10:42,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:10:42,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-12-27 04:10:42,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2019-12-27 04:10:42,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-12-27 04:10:42,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1703 transitions. [2019-12-27 04:10:42,555 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1703 transitions. Word has length 55 [2019-12-27 04:10:42,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:42,555 INFO L462 AbstractCegarLoop]: Abstraction has 738 states and 1703 transitions. [2019-12-27 04:10:42,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:10:42,555 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1703 transitions. [2019-12-27 04:10:42,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 04:10:42,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:42,557 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-27 04:10:42,558 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-27 04:10:42,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:42,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1314270907, now seen corresponding path program 1 times [2019-12-27 04:10:42,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:42,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215506098] [2019-12-27 04:10:42,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:42,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:10:42,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215506098] [2019-12-27 04:10:42,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:42,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 04:10:42,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773819490] [2019-12-27 04:10:42,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:10:42,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:42,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:10:42,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:10:42,662 INFO L87 Difference]: Start difference. First operand 738 states and 1703 transitions. Second operand 5 states. [2019-12-27 04:10:42,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:42,709 INFO L93 Difference]: Finished difference Result 1067 states and 2295 transitions. [2019-12-27 04:10:42,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:10:42,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-27 04:10:42,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:42,712 INFO L225 Difference]: With dead ends: 1067 [2019-12-27 04:10:42,712 INFO L226 Difference]: Without dead ends: 676 [2019-12-27 04:10:42,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:10:42,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2019-12-27 04:10:42,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 676. [2019-12-27 04:10:42,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-12-27 04:10:42,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 1524 transitions. [2019-12-27 04:10:42,722 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 1524 transitions. Word has length 56 [2019-12-27 04:10:42,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:42,722 INFO L462 AbstractCegarLoop]: Abstraction has 676 states and 1524 transitions. [2019-12-27 04:10:42,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:10:42,723 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 1524 transitions. [2019-12-27 04:10:42,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 04:10:42,724 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:42,725 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-27 04:10:42,725 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-27 04:10:42,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:42,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1871132585, now seen corresponding path program 2 times [2019-12-27 04:10:42,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:42,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140171964] [2019-12-27 04:10:42,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:42,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:10:42,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140171964] [2019-12-27 04:10:42,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:42,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 04:10:42,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176568464] [2019-12-27 04:10:42,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 04:10:42,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:42,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 04:10:42,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 04:10:42,902 INFO L87 Difference]: Start difference. First operand 676 states and 1524 transitions. Second operand 8 states. [2019-12-27 04:10:43,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:43,442 INFO L93 Difference]: Finished difference Result 1049 states and 2337 transitions. [2019-12-27 04:10:43,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:10:43,443 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-12-27 04:10:43,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:43,445 INFO L225 Difference]: With dead ends: 1049 [2019-12-27 04:10:43,446 INFO L226 Difference]: Without dead ends: 1049 [2019-12-27 04:10:43,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-12-27 04:10:43,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2019-12-27 04:10:43,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 601. [2019-12-27 04:10:43,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-12-27 04:10:43,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 1338 transitions. [2019-12-27 04:10:43,458 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 1338 transitions. Word has length 56 [2019-12-27 04:10:43,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:43,458 INFO L462 AbstractCegarLoop]: Abstraction has 601 states and 1338 transitions. [2019-12-27 04:10:43,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 04:10:43,459 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 1338 transitions. [2019-12-27 04:10:43,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 04:10:43,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:43,460 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-27 04:10:43,461 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-27 04:10:43,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:43,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1040007325, now seen corresponding path program 3 times [2019-12-27 04:10:43,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:43,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823875182] [2019-12-27 04:10:43,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:43,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:10:43,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823875182] [2019-12-27 04:10:43,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:43,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:10:43,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111645870] [2019-12-27 04:10:43,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:10:43,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:43,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:10:43,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:10:43,522 INFO L87 Difference]: Start difference. First operand 601 states and 1338 transitions. Second operand 3 states. [2019-12-27 04:10:43,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:43,560 INFO L93 Difference]: Finished difference Result 601 states and 1337 transitions. [2019-12-27 04:10:43,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:10:43,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 04:10:43,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:43,561 INFO L225 Difference]: With dead ends: 601 [2019-12-27 04:10:43,561 INFO L226 Difference]: Without dead ends: 601 [2019-12-27 04:10:43,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:10:43,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-12-27 04:10:43,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 422. [2019-12-27 04:10:43,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-12-27 04:10:43,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 914 transitions. [2019-12-27 04:10:43,570 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 914 transitions. Word has length 56 [2019-12-27 04:10:43,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:43,570 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 914 transitions. [2019-12-27 04:10:43,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:10:43,570 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 914 transitions. [2019-12-27 04:10:43,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 04:10:43,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:43,572 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-27 04:10:43,572 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-27 04:10:43,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:43,572 INFO L82 PathProgramCache]: Analyzing trace with hash 574299964, now seen corresponding path program 1 times [2019-12-27 04:10:43,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:43,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178578308] [2019-12-27 04:10:43,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:43,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:10:43,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178578308] [2019-12-27 04:10:43,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:43,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 04:10:43,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821039744] [2019-12-27 04:10:43,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 04:10:43,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:43,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 04:10:43,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:10:43,885 INFO L87 Difference]: Start difference. First operand 422 states and 914 transitions. Second operand 13 states. [2019-12-27 04:10:44,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:44,691 INFO L93 Difference]: Finished difference Result 1058 states and 2193 transitions. [2019-12-27 04:10:44,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 04:10:44,692 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 04:10:44,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:44,693 INFO L225 Difference]: With dead ends: 1058 [2019-12-27 04:10:44,693 INFO L226 Difference]: Without dead ends: 226 [2019-12-27 04:10:44,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=502, Unknown=0, NotChecked=0, Total=702 [2019-12-27 04:10:44,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-12-27 04:10:44,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 202. [2019-12-27 04:10:44,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-12-27 04:10:44,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 344 transitions. [2019-12-27 04:10:44,704 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 344 transitions. Word has length 57 [2019-12-27 04:10:44,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:44,704 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 344 transitions. [2019-12-27 04:10:44,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 04:10:44,705 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 344 transitions. [2019-12-27 04:10:44,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 04:10:44,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:44,706 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-27 04:10:44,706 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-27 04:10:44,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:44,706 INFO L82 PathProgramCache]: Analyzing trace with hash -431408076, now seen corresponding path program 2 times [2019-12-27 04:10:44,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:44,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435712007] [2019-12-27 04:10:44,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:45,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:10:45,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435712007] [2019-12-27 04:10:45,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:45,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-27 04:10:45,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172255804] [2019-12-27 04:10:45,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 04:10:45,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:45,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 04:10:45,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-12-27 04:10:45,346 INFO L87 Difference]: Start difference. First operand 202 states and 344 transitions. Second operand 21 states. [2019-12-27 04:10:46,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:46,844 INFO L93 Difference]: Finished difference Result 521 states and 873 transitions. [2019-12-27 04:10:46,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 04:10:46,844 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2019-12-27 04:10:46,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:46,846 INFO L225 Difference]: With dead ends: 521 [2019-12-27 04:10:46,846 INFO L226 Difference]: Without dead ends: 488 [2019-12-27 04:10:46,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=235, Invalid=1171, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 04:10:46,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-12-27 04:10:46,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 259. [2019-12-27 04:10:46,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-12-27 04:10:46,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 437 transitions. [2019-12-27 04:10:46,853 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 437 transitions. Word has length 57 [2019-12-27 04:10:46,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:46,854 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 437 transitions. [2019-12-27 04:10:46,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 04:10:46,854 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 437 transitions. [2019-12-27 04:10:46,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 04:10:46,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:46,855 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-27 04:10:46,855 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-27 04:10:46,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:46,856 INFO L82 PathProgramCache]: Analyzing trace with hash -550616912, now seen corresponding path program 3 times [2019-12-27 04:10:46,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:46,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875168743] [2019-12-27 04:10:46,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:47,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:10:47,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875168743] [2019-12-27 04:10:47,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:47,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 04:10:47,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530182346] [2019-12-27 04:10:47,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 04:10:47,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:47,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 04:10:47,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:10:47,077 INFO L87 Difference]: Start difference. First operand 259 states and 437 transitions. Second operand 13 states. [2019-12-27 04:10:47,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:47,675 INFO L93 Difference]: Finished difference Result 426 states and 711 transitions. [2019-12-27 04:10:47,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 04:10:47,675 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 04:10:47,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:47,676 INFO L225 Difference]: With dead ends: 426 [2019-12-27 04:10:47,676 INFO L226 Difference]: Without dead ends: 391 [2019-12-27 04:10:47,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2019-12-27 04:10:47,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-12-27 04:10:47,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 302. [2019-12-27 04:10:47,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-12-27 04:10:47,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 515 transitions. [2019-12-27 04:10:47,684 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 515 transitions. Word has length 57 [2019-12-27 04:10:47,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:47,685 INFO L462 AbstractCegarLoop]: Abstraction has 302 states and 515 transitions. [2019-12-27 04:10:47,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 04:10:47,685 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 515 transitions. [2019-12-27 04:10:47,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 04:10:47,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:47,686 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-27 04:10:47,686 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-27 04:10:47,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:47,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1239613688, now seen corresponding path program 4 times [2019-12-27 04:10:47,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:47,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857283129] [2019-12-27 04:10:47,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:47,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:10:47,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857283129] [2019-12-27 04:10:47,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:47,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 04:10:47,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793830778] [2019-12-27 04:10:47,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 04:10:47,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:47,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 04:10:47,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 04:10:47,954 INFO L87 Difference]: Start difference. First operand 302 states and 515 transitions. Second operand 14 states. [2019-12-27 04:10:48,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:48,387 INFO L93 Difference]: Finished difference Result 405 states and 670 transitions. [2019-12-27 04:10:48,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 04:10:48,388 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2019-12-27 04:10:48,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:48,388 INFO L225 Difference]: With dead ends: 405 [2019-12-27 04:10:48,389 INFO L226 Difference]: Without dead ends: 372 [2019-12-27 04:10:48,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:10:48,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-12-27 04:10:48,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 310. [2019-12-27 04:10:48,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-12-27 04:10:48,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 529 transitions. [2019-12-27 04:10:48,395 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 529 transitions. Word has length 57 [2019-12-27 04:10:48,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:48,395 INFO L462 AbstractCegarLoop]: Abstraction has 310 states and 529 transitions. [2019-12-27 04:10:48,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 04:10:48,396 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 529 transitions. [2019-12-27 04:10:48,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 04:10:48,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:48,397 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-27 04:10:48,397 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-27 04:10:48,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:48,397 INFO L82 PathProgramCache]: Analyzing trace with hash -97225810, now seen corresponding path program 5 times [2019-12-27 04:10:48,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:48,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033937461] [2019-12-27 04:10:48,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:10:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:10:48,568 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 04:10:48,569 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 04:10:48,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= v_~y$w_buff1~0_198 0) (= v_~x~0_55 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~weak$$choice2~0_120 0) (= v_~main$tmp_guard1~0_31 0) (= v_~y$r_buff1_thd0~0_279 0) (= 0 v_~y$r_buff1_thd2~0_191) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$w_buff0~0_215) (= 0 |v_ULTIMATE.start_main_~#t2522~0.offset_17|) (= 0 v_~y$r_buff0_thd3~0_201) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff0_thd0~0_331 0) (= v_~y$r_buff0_thd1~0_37 0) (= v_~y$w_buff0_used~0_623 0) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t2522~0.base_22| 1)) (= 0 |v_#NULL.base_4|) (= v_~y~0_147 0) (= 0 v_~__unbuffered_p0_EAX~0_42) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$mem_tmp~0_20 0) (= 0 v_~weak$$choice0~0_16) (= 0 v_~y$flush_delayed~0_42) (= 0 v_~y$r_buff0_thd2~0_116) (= v_~y$w_buff1_used~0_397 0) (= |v_#NULL.offset_4| 0) (= v_~main$tmp_guard0~0_26 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t2522~0.base_22| 4) |v_#length_21|) (= 0 v_~y$r_buff1_thd3~0_162) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2522~0.base_22|)) (= v_~z~0_148 0) (= 0 v_~__unbuffered_cnt~0_97) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2522~0.base_22|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2522~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2522~0.base_22|) |v_ULTIMATE.start_main_~#t2522~0.offset_17| 0)) |v_#memory_int_19|) (= v_~y$r_buff1_thd1~0_116 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_40|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_23|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_23|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_46|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_25|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_162, ULTIMATE.start_main_~#t2522~0.base=|v_ULTIMATE.start_main_~#t2522~0.base_22|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_37, ~y$flush_delayed~0=v_~y$flush_delayed~0_42, ULTIMATE.start_main_~#t2522~0.offset=|v_ULTIMATE.start_main_~#t2522~0.offset_17|, #length=|v_#length_21|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_27|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_23|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_28|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_35|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_60|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_65|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_27|, ~y$w_buff1~0=v_~y$w_buff1~0_198, ~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_116, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_7|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ULTIMATE.start_main_~#t2524~0.offset=|v_ULTIMATE.start_main_~#t2524~0.offset_15|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_279, ~x~0=v_~x~0_55, ~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_623, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_44|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_31|, ULTIMATE.start_main_~#t2523~0.offset=|v_ULTIMATE.start_main_~#t2523~0.offset_15|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_129|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_28|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_37|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_50|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_116, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_25|, ~y$w_buff0~0=v_~y$w_buff0~0_215, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_201, ULTIMATE.start_main_~#t2524~0.base=|v_ULTIMATE.start_main_~#t2524~0.base_18|, ~y~0=v_~y~0_147, ULTIMATE.start_main_~#t2523~0.base=|v_ULTIMATE.start_main_~#t2523~0.base_19|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_31|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_19|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_34|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_64|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_24|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_191, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_33|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_331, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_148, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_397} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #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, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ULTIMATE.start_main_~#t2522~0.base, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t2522~0.offset, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, 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, ULTIMATE.start_main_~#t2524~0.offset, ~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_~#t2523~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t2524~0.base, ~y~0, ULTIMATE.start_main_~#t2523~0.base, 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, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 04:10:48,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L802-1-->L804: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2523~0.base_11|) (= (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2523~0.base_11| 1) |v_#valid_33|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2523~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2523~0.base_11|) |v_ULTIMATE.start_main_~#t2523~0.offset_10| 1)) |v_#memory_int_15|) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2523~0.base_11|) 0) (= 0 |v_ULTIMATE.start_main_~#t2523~0.offset_10|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2523~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2523~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2523~0.base=|v_ULTIMATE.start_main_~#t2523~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2523~0.offset=|v_ULTIMATE.start_main_~#t2523~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2523~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t2523~0.offset] because there is no mapped edge [2019-12-27 04:10:48,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L804-1-->L806: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2524~0.offset_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2524~0.base_10| 4)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2524~0.base_10| 1) |v_#valid_29|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2524~0.base_10|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2524~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t2524~0.base_10| 0)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2524~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2524~0.base_10|) |v_ULTIMATE.start_main_~#t2524~0.offset_10| 2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2524~0.base=|v_ULTIMATE.start_main_~#t2524~0.base_10|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2524~0.offset=|v_ULTIMATE.start_main_~#t2524~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2524~0.base, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t2524~0.offset] because there is no mapped edge [2019-12-27 04:10:48,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [616] [616] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0~0_29 v_~y$w_buff1~0_24) (= 2 v_~y$w_buff0~0_28) (= |v_P2Thread1of1ForFork0_#in~arg.base_11| v_P2Thread1of1ForFork0_~arg.base_11) (= v_~y$w_buff0_used~0_103 1) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_11| v_P2Thread1of1ForFork0_~arg.offset_11) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_13 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|) (= v_~y$w_buff1_used~0_54 v_~y$w_buff0_used~0_104) (= 0 (mod v_~y$w_buff1_used~0_54 256))) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_11|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff0~0=v_~y$w_buff0~0_29, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_11|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_11, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_11|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_28, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_11, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_11|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_13, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_54} 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-27 04:10:48,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_15| 0) (= 0 |v_P0Thread1of1ForFork1_#res.offset_15|) (= v_~x~0_47 v_~__unbuffered_p0_EAX~0_32) (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80) (= v_~z~0_109 2)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x~0=v_~x~0_47} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_15|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_15|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, ~z~0=v_~z~0_109, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x~0=v_~x~0_47, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 04:10:48,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In388547554 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In388547554 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite11_Out388547554|)) (and (= |P2Thread1of1ForFork0_#t~ite11_Out388547554| ~y$w_buff0_used~0_In388547554) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In388547554, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In388547554} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In388547554, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out388547554|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In388547554} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 04:10:48,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L750-2-->L750-5: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In312225141 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In312225141 256) 0)) (.cse0 (= |P1Thread1of1ForFork2_#t~ite4_Out312225141| |P1Thread1of1ForFork2_#t~ite3_Out312225141|))) (or (and (= ~y~0_In312225141 |P1Thread1of1ForFork2_#t~ite3_Out312225141|) .cse0 (or .cse1 .cse2)) (and (not .cse2) (not .cse1) .cse0 (= ~y$w_buff1~0_In312225141 |P1Thread1of1ForFork2_#t~ite3_Out312225141|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In312225141, ~y$w_buff1~0=~y$w_buff1~0_In312225141, ~y~0=~y~0_In312225141, ~y$w_buff1_used~0=~y$w_buff1_used~0_In312225141} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In312225141, ~y$w_buff1~0=~y$w_buff1~0_In312225141, P1Thread1of1ForFork2_#t~ite4=|P1Thread1of1ForFork2_#t~ite4_Out312225141|, ~y~0=~y~0_In312225141, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out312225141|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In312225141} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 04:10:48,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L751-->L751-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In2082719380 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In2082719380 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite5_Out2082719380| 0) (not .cse1)) (and (= ~y$w_buff0_used~0_In2082719380 |P1Thread1of1ForFork2_#t~ite5_Out2082719380|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2082719380, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2082719380} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2082719380, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2082719380, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out2082719380|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 04:10:48,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L781-->L781-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-1067530610 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1067530610 256))) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-1067530610 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1067530610 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite12_Out-1067530610| ~y$w_buff1_used~0_In-1067530610)) (and (= |P2Thread1of1ForFork0_#t~ite12_Out-1067530610| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1067530610, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1067530610, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1067530610, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1067530610} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1067530610, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1067530610, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-1067530610|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1067530610, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1067530610} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 04:10:48,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In3735267 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In3735267 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In3735267 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In3735267 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite6_Out3735267| 0)) (and (= |P1Thread1of1ForFork2_#t~ite6_Out3735267| ~y$w_buff1_used~0_In3735267) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In3735267, ~y$w_buff0_used~0=~y$w_buff0_used~0_In3735267, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In3735267, ~y$w_buff1_used~0=~y$w_buff1_used~0_In3735267} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In3735267, ~y$w_buff0_used~0=~y$w_buff0_used~0_In3735267, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In3735267, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out3735267|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In3735267} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 04:10:48,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L753-->L753-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In987512193 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In987512193 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In987512193 |P1Thread1of1ForFork2_#t~ite7_Out987512193|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite7_Out987512193|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In987512193, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In987512193} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In987512193, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In987512193, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out987512193|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 04:10:48,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L754-->L754-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1084338024 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1084338024 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-1084338024 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1084338024 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite8_Out-1084338024|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-1084338024 |P1Thread1of1ForFork2_#t~ite8_Out-1084338024|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1084338024, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1084338024, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1084338024, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1084338024} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1084338024, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1084338024, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-1084338024|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1084338024, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1084338024} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 04:10:48,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L754-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= |v_P1Thread1of1ForFork2_#t~ite8_26| v_~y$r_buff1_thd2~0_103) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_103, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, 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-27 04:10:48,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L782-->L783: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1190945479 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1190945479 256) 0))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd3~0_Out-1190945479) (not .cse1)) (and (= ~y$r_buff0_thd3~0_In-1190945479 ~y$r_buff0_thd3~0_Out-1190945479) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1190945479, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1190945479} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1190945479, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1190945479, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-1190945479|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 04:10:48,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1165406931 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1165406931 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In-1165406931 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1165406931 256)))) (or (and (= ~y$r_buff1_thd3~0_In-1165406931 |P2Thread1of1ForFork0_#t~ite14_Out-1165406931|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite14_Out-1165406931|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1165406931, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1165406931, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1165406931, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1165406931} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-1165406931|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1165406931, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1165406931, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1165406931, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1165406931} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 04:10:48,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L783-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_26| v_~y$r_buff1_thd3~0_99) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66)) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_25|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_99, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, 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-27 04:10:48,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [614] [614] L806-1-->L812: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 04:10:48,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L812-2-->L812-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite18_Out2132999972| |ULTIMATE.start_main_#t~ite19_Out2132999972|)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In2132999972 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In2132999972 256) 0))) (or (and .cse0 (not .cse1) (not .cse2) (= ~y$w_buff1~0_In2132999972 |ULTIMATE.start_main_#t~ite18_Out2132999972|)) (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite18_Out2132999972| ~y~0_In2132999972)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2132999972, ~y~0=~y~0_In2132999972, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2132999972, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2132999972} OutVars{~y$w_buff1~0=~y$w_buff1~0_In2132999972, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out2132999972|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out2132999972|, ~y~0=~y~0_In2132999972, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2132999972, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2132999972} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 04:10:48,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1008420178 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1008420178 256)))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out1008420178| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out1008420178| ~y$w_buff0_used~0_In1008420178)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1008420178, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1008420178} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1008420178, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1008420178, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1008420178|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 04:10:48,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L814-->L814-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In942399168 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In942399168 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In942399168 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In942399168 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite21_Out942399168| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out942399168| ~y$w_buff1_used~0_In942399168) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In942399168, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In942399168, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In942399168, ~y$w_buff1_used~0=~y$w_buff1_used~0_In942399168} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In942399168, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In942399168, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out942399168|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In942399168, ~y$w_buff1_used~0=~y$w_buff1_used~0_In942399168} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 04:10:48,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In398885132 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In398885132 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out398885132| ~y$r_buff0_thd0~0_In398885132) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out398885132|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In398885132, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In398885132} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In398885132, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In398885132, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out398885132|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 04:10:48,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1477559808 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1477559808 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1477559808 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-1477559808 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite23_Out-1477559808|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In-1477559808 |ULTIMATE.start_main_#t~ite23_Out-1477559808|) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1477559808, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1477559808, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1477559808, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1477559808} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1477559808, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1477559808, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1477559808, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1477559808|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1477559808} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 04:10:48,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L827-->L827-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-743713768 256)))) (or (and (not .cse0) (= ~y$w_buff1_used~0_In-743713768 |ULTIMATE.start_main_#t~ite39_Out-743713768|) (= |ULTIMATE.start_main_#t~ite38_In-743713768| |ULTIMATE.start_main_#t~ite38_Out-743713768|)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-743713768 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-743713768 256))) (= 0 (mod ~y$w_buff0_used~0_In-743713768 256)) (and (= (mod ~y$r_buff1_thd0~0_In-743713768 256) 0) .cse1))) (= ~y$w_buff1_used~0_In-743713768 |ULTIMATE.start_main_#t~ite38_Out-743713768|) .cse0 (= |ULTIMATE.start_main_#t~ite38_Out-743713768| |ULTIMATE.start_main_#t~ite39_Out-743713768|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-743713768, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-743713768, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-743713768|, ~weak$$choice2~0=~weak$$choice2~0_In-743713768, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-743713768, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-743713768} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-743713768, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-743713768|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-743713768, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-743713768|, ~weak$$choice2~0=~weak$$choice2~0_In-743713768, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-743713768, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-743713768} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 04:10:48,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L828-->L829: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~y$r_buff0_thd0~0_98 v_~y$r_buff0_thd0~0_97)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_98, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_97, ~weak$$choice2~0=v_~weak$$choice2~0_25, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} 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-27 04:10:48,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L831-->L4: Formula: (and (= v_~y~0_99 v_~y$mem_tmp~0_10) (not (= (mod v_~y$flush_delayed~0_27 256) 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4| (mod v_~main$tmp_guard1~0_12 256)) (= 0 v_~y$flush_delayed~0_26)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ~y$flush_delayed~0=v_~y$flush_delayed~0_26, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_99, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~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-27 04:10:48,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L4-->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-27 04:10:48,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:10:48 BasicIcfg [2019-12-27 04:10:48,769 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 04:10:48,772 INFO L168 Benchmark]: Toolchain (without parser) took 21936.31 ms. Allocated memory was 144.7 MB in the beginning and 853.0 MB in the end (delta: 708.3 MB). Free memory was 99.5 MB in the beginning and 246.0 MB in the end (delta: -146.4 MB). Peak memory consumption was 561.9 MB. Max. memory is 7.1 GB. [2019-12-27 04:10:48,778 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 04:10:48,779 INFO L168 Benchmark]: CACSL2BoogieTranslator took 775.53 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 99.1 MB in the beginning and 156.0 MB in the end (delta: -56.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 04:10:48,780 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.38 ms. Allocated memory is still 201.9 MB. Free memory was 155.3 MB in the beginning and 152.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 04:10:48,780 INFO L168 Benchmark]: Boogie Preprocessor took 36.63 ms. Allocated memory is still 201.9 MB. Free memory was 152.7 MB in the beginning and 150.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 04:10:48,783 INFO L168 Benchmark]: RCFGBuilder took 784.51 ms. Allocated memory is still 201.9 MB. Free memory was 150.0 MB in the beginning and 103.8 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. [2019-12-27 04:10:48,783 INFO L168 Benchmark]: TraceAbstraction took 20270.96 ms. Allocated memory was 201.9 MB in the beginning and 853.0 MB in the end (delta: 651.2 MB). Free memory was 103.2 MB in the beginning and 246.0 MB in the end (delta: -142.8 MB). Peak memory consumption was 508.4 MB. Max. memory is 7.1 GB. [2019-12-27 04:10:48,795 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 775.53 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 99.1 MB in the beginning and 156.0 MB in the end (delta: -56.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.38 ms. Allocated memory is still 201.9 MB. Free memory was 155.3 MB in the beginning and 152.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.63 ms. Allocated memory is still 201.9 MB. Free memory was 152.7 MB in the beginning and 150.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 784.51 ms. Allocated memory is still 201.9 MB. Free memory was 150.0 MB in the beginning and 103.8 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20270.96 ms. Allocated memory was 201.9 MB in the beginning and 853.0 MB in the end (delta: 651.2 MB). Free memory was 103.2 MB in the beginning and 246.0 MB in the end (delta: -142.8 MB). Peak memory consumption was 508.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 162 ProgramPointsBefore, 83 ProgramPointsAfterwards, 193 TransitionsBefore, 94 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 24 ChoiceCompositions, 4225 VarBasedMoverChecksPositive, 199 VarBasedMoverChecksNegative, 61 SemBasedMoverChecksPositive, 194 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 48124 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t2522, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L804] FCALL, FORK 0 pthread_create(&t2523, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L806] FCALL, FORK 0 pthread_create(&t2524, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L769] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L770] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L771] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L772] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L773] 3 y$r_buff0_thd3 = (_Bool)1 [L776] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=1] [L779] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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=2] [L744] 2 x = 1 [L747] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_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=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2] [L779] 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) [L750] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2] [L780] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L750] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L751] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L752] 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 [L753] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L781] 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 [L812] EXPR 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_p0_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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2] [L812] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L813] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L814] 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 [L815] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L816] 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 [L819] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L820] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L821] 0 y$flush_delayed = weak$$choice2 [L822] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2] [L823] 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_p0_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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2] [L823] 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) [L824] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2] [L824] 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)) [L825] 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_p0_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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2] [L825] 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)) [L826] 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_p0_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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2] [L826] 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)) [L827] 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)) [L829] 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_p0_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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2] [L829] 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)) [L830] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 19.9s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1630 SDtfs, 1909 SDslu, 4968 SDs, 0 SdLazy, 3556 SolverSat, 189 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 28 SyntacticMatches, 15 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22206occurred 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: 4.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 4015 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 746 NumberOfCodeBlocks, 746 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 673 ConstructedInterpolants, 0 QuantifiedInterpolants, 140740 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...