/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi001_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:10:42,547 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:10:42,550 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:10:42,564 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:10:42,564 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:10:42,565 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:10:42,567 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:10:42,569 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:10:42,570 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:10:42,571 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:10:42,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:10:42,573 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:10:42,573 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:10:42,574 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:10:42,575 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:10:42,576 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:10:42,577 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:10:42,578 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:10:42,580 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:10:42,582 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:10:42,584 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:10:42,585 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:10:42,586 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:10:42,587 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:10:42,590 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:10:42,590 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:10:42,590 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:10:42,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:10:42,592 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:10:42,593 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:10:42,593 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:10:42,594 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:10:42,595 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:10:42,596 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:10:42,597 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:10:42,597 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:10:42,598 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:10:42,598 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:10:42,598 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:10:42,599 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:10:42,600 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:10:42,600 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:10:42,615 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:10:42,615 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:10:42,616 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:10:42,617 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:10:42,617 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:10:42,617 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:10:42,617 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:10:42,618 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:10:42,618 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:10:42,618 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:10:42,618 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:10:42,618 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:10:42,619 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:10:42,619 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:10:42,619 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:10:42,619 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:10:42,619 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:10:42,620 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:10:42,620 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:10:42,620 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:10:42,620 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:10:42,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:10:42,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:10:42,621 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:10:42,621 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:10:42,621 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:10:42,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:10:42,621 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:10:42,623 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:10:42,623 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:10:42,902 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:10:42,916 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:10:42,920 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:10:42,922 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:10:42,922 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:10:42,923 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_pso.opt.i [2019-12-26 23:10:42,987 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d50f6d6e6/4e911027d24a4d868c255d19fa5d4538/FLAGc3c46fe65 [2019-12-26 23:10:43,605 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:10:43,606 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_pso.opt.i [2019-12-26 23:10:43,626 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d50f6d6e6/4e911027d24a4d868c255d19fa5d4538/FLAGc3c46fe65 [2019-12-26 23:10:43,839 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d50f6d6e6/4e911027d24a4d868c255d19fa5d4538 [2019-12-26 23:10:43,848 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:10:43,850 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:10:43,851 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:10:43,851 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:10:43,855 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:10:43,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:10:43" (1/1) ... [2019-12-26 23:10:43,859 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36d4032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:43, skipping insertion in model container [2019-12-26 23:10:43,859 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:10:43" (1/1) ... [2019-12-26 23:10:43,867 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:10:43,933 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:10:44,426 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:10:44,439 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:10:44,510 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:10:44,589 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:10:44,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:44 WrapperNode [2019-12-26 23:10:44,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:10:44,590 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:10:44,590 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:10:44,590 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:10:44,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:44" (1/1) ... [2019-12-26 23:10:44,620 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:44" (1/1) ... [2019-12-26 23:10:44,659 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:10:44,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:10:44,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:10:44,660 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:10:44,672 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:44" (1/1) ... [2019-12-26 23:10:44,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:44" (1/1) ... [2019-12-26 23:10:44,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:44" (1/1) ... [2019-12-26 23:10:44,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:44" (1/1) ... [2019-12-26 23:10:44,698 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:44" (1/1) ... [2019-12-26 23:10:44,702 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:44" (1/1) ... [2019-12-26 23:10:44,707 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:44" (1/1) ... [2019-12-26 23:10:44,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:10:44,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:10:44,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:10:44,719 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:10:44,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:44" (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-26 23:10:44,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:10:44,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:10:44,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:10:44,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:10:44,782 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:10:44,783 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:10:44,784 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:10:44,785 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:10:44,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:10:44,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:10:44,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:10:44,789 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:10:45,508 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:10:45,508 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:10:45,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:10:45 BoogieIcfgContainer [2019-12-26 23:10:45,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:10:45,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:10:45,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:10:45,515 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:10:45,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:10:43" (1/3) ... [2019-12-26 23:10:45,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54bfe4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:10:45, skipping insertion in model container [2019-12-26 23:10:45,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:10:44" (2/3) ... [2019-12-26 23:10:45,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54bfe4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:10:45, skipping insertion in model container [2019-12-26 23:10:45,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:10:45" (3/3) ... [2019-12-26 23:10:45,519 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_pso.opt.i [2019-12-26 23:10:45,531 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:10:45,531 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:10:45,542 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:10:45,543 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:10:45,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,601 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,601 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,613 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,613 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,614 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,614 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,614 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,633 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,634 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,637 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,638 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,638 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:10:45,656 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 23:10:45,680 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:10:45,680 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:10:45,680 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:10:45,680 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:10:45,680 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:10:45,681 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:10:45,681 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:10:45,681 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:10:45,699 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-26 23:10:45,701 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-26 23:10:45,812 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-26 23:10:45,812 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:10:45,826 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 23:10:45,846 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-26 23:10:45,890 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-26 23:10:45,890 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:10:45,896 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 23:10:45,911 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-26 23:10:45,913 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:10:50,060 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-26 23:10:50,200 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-26 23:10:50,230 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46553 [2019-12-26 23:10:50,230 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-26 23:10:50,234 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-12-26 23:10:50,678 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8413 states. [2019-12-26 23:10:50,680 INFO L276 IsEmpty]: Start isEmpty. Operand 8413 states. [2019-12-26 23:10:50,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 23:10:50,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:50,688 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 23:10:50,689 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:50,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:50,695 INFO L82 PathProgramCache]: Analyzing trace with hash 698534967, now seen corresponding path program 1 times [2019-12-26 23:10:50,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:50,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041970568] [2019-12-26 23:10:50,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:50,988 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-26 23:10:50,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041970568] [2019-12-26 23:10:50,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:50,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:10:50,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696133838] [2019-12-26 23:10:50,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:10:50,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:51,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:10:51,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:10:51,015 INFO L87 Difference]: Start difference. First operand 8413 states. Second operand 3 states. [2019-12-26 23:10:51,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:51,266 INFO L93 Difference]: Finished difference Result 8365 states and 27377 transitions. [2019-12-26 23:10:51,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:10:51,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 23:10:51,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:51,409 INFO L225 Difference]: With dead ends: 8365 [2019-12-26 23:10:51,409 INFO L226 Difference]: Without dead ends: 8196 [2019-12-26 23:10:51,410 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-26 23:10:51,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8196 states. [2019-12-26 23:10:51,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8196 to 8196. [2019-12-26 23:10:51,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8196 states. [2019-12-26 23:10:51,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8196 states to 8196 states and 26857 transitions. [2019-12-26 23:10:51,893 INFO L78 Accepts]: Start accepts. Automaton has 8196 states and 26857 transitions. Word has length 5 [2019-12-26 23:10:51,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:51,893 INFO L462 AbstractCegarLoop]: Abstraction has 8196 states and 26857 transitions. [2019-12-26 23:10:51,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:10:51,894 INFO L276 IsEmpty]: Start isEmpty. Operand 8196 states and 26857 transitions. [2019-12-26 23:10:51,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:10:51,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:51,896 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:10:51,897 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:51,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:51,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1108629868, now seen corresponding path program 1 times [2019-12-26 23:10:51,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:51,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877150333] [2019-12-26 23:10:51,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:51,982 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-26 23:10:51,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877150333] [2019-12-26 23:10:51,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:51,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:10:51,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953058663] [2019-12-26 23:10:51,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:10:51,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:51,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:10:51,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:10:51,985 INFO L87 Difference]: Start difference. First operand 8196 states and 26857 transitions. Second operand 4 states. [2019-12-26 23:10:52,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:52,448 INFO L93 Difference]: Finished difference Result 13084 states and 41046 transitions. [2019-12-26 23:10:52,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:10:52,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:10:52,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:52,521 INFO L225 Difference]: With dead ends: 13084 [2019-12-26 23:10:52,521 INFO L226 Difference]: Without dead ends: 13077 [2019-12-26 23:10:52,522 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-26 23:10:52,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13077 states. [2019-12-26 23:10:53,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13077 to 11568. [2019-12-26 23:10:53,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11568 states. [2019-12-26 23:10:53,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11568 states to 11568 states and 36838 transitions. [2019-12-26 23:10:53,500 INFO L78 Accepts]: Start accepts. Automaton has 11568 states and 36838 transitions. Word has length 11 [2019-12-26 23:10:53,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:53,500 INFO L462 AbstractCegarLoop]: Abstraction has 11568 states and 36838 transitions. [2019-12-26 23:10:53,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:10:53,500 INFO L276 IsEmpty]: Start isEmpty. Operand 11568 states and 36838 transitions. [2019-12-26 23:10:53,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:10:53,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:53,503 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:10:53,503 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:53,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:53,504 INFO L82 PathProgramCache]: Analyzing trace with hash 531606898, now seen corresponding path program 1 times [2019-12-26 23:10:53,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:53,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665176797] [2019-12-26 23:10:53,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:53,585 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-26 23:10:53,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665176797] [2019-12-26 23:10:53,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:53,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:10:53,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378121056] [2019-12-26 23:10:53,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:10:53,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:53,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:10:53,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:10:53,587 INFO L87 Difference]: Start difference. First operand 11568 states and 36838 transitions. Second operand 4 states. [2019-12-26 23:10:53,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:53,621 INFO L93 Difference]: Finished difference Result 1922 states and 4461 transitions. [2019-12-26 23:10:53,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:10:53,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:10:53,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:53,626 INFO L225 Difference]: With dead ends: 1922 [2019-12-26 23:10:53,626 INFO L226 Difference]: Without dead ends: 1636 [2019-12-26 23:10:53,626 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-26 23:10:53,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2019-12-26 23:10:53,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1636. [2019-12-26 23:10:53,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1636 states. [2019-12-26 23:10:53,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 3670 transitions. [2019-12-26 23:10:53,661 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 3670 transitions. Word has length 11 [2019-12-26 23:10:53,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:53,661 INFO L462 AbstractCegarLoop]: Abstraction has 1636 states and 3670 transitions. [2019-12-26 23:10:53,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:10:53,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 3670 transitions. [2019-12-26 23:10:53,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-26 23:10:53,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:53,663 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] [2019-12-26 23:10:53,664 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:53,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:53,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1653802499, now seen corresponding path program 1 times [2019-12-26 23:10:53,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:53,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196654642] [2019-12-26 23:10:53,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:53,777 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-26 23:10:53,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196654642] [2019-12-26 23:10:53,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:53,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:10:53,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011280441] [2019-12-26 23:10:53,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:10:53,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:53,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:10:53,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:10:53,780 INFO L87 Difference]: Start difference. First operand 1636 states and 3670 transitions. Second operand 5 states. [2019-12-26 23:10:54,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:54,063 INFO L93 Difference]: Finished difference Result 2106 states and 4631 transitions. [2019-12-26 23:10:54,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:10:54,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-26 23:10:54,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:54,069 INFO L225 Difference]: With dead ends: 2106 [2019-12-26 23:10:54,069 INFO L226 Difference]: Without dead ends: 2106 [2019-12-26 23:10:54,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:10:54,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2019-12-26 23:10:54,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 1870. [2019-12-26 23:10:54,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1870 states. [2019-12-26 23:10:54,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 4159 transitions. [2019-12-26 23:10:54,112 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 4159 transitions. Word has length 23 [2019-12-26 23:10:54,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:54,112 INFO L462 AbstractCegarLoop]: Abstraction has 1870 states and 4159 transitions. [2019-12-26 23:10:54,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:10:54,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 4159 transitions. [2019-12-26 23:10:54,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-26 23:10:54,116 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:54,116 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:10:54,116 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:54,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:54,117 INFO L82 PathProgramCache]: Analyzing trace with hash -835970492, now seen corresponding path program 1 times [2019-12-26 23:10:54,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:54,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289520461] [2019-12-26 23:10:54,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:54,173 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-26 23:10:54,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289520461] [2019-12-26 23:10:54,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:54,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:10:54,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607172197] [2019-12-26 23:10:54,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:10:54,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:54,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:10:54,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:10:54,176 INFO L87 Difference]: Start difference. First operand 1870 states and 4159 transitions. Second operand 3 states. [2019-12-26 23:10:54,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:54,237 INFO L93 Difference]: Finished difference Result 2204 states and 4939 transitions. [2019-12-26 23:10:54,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:10:54,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-12-26 23:10:54,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:54,250 INFO L225 Difference]: With dead ends: 2204 [2019-12-26 23:10:54,250 INFO L226 Difference]: Without dead ends: 2204 [2019-12-26 23:10:54,251 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-26 23:10:54,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2204 states. [2019-12-26 23:10:54,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2204 to 2094. [2019-12-26 23:10:54,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2019-12-26 23:10:54,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 4716 transitions. [2019-12-26 23:10:54,295 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 4716 transitions. Word has length 37 [2019-12-26 23:10:54,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:54,296 INFO L462 AbstractCegarLoop]: Abstraction has 2094 states and 4716 transitions. [2019-12-26 23:10:54,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:10:54,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 4716 transitions. [2019-12-26 23:10:54,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-26 23:10:54,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:54,302 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:10:54,303 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:54,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:54,303 INFO L82 PathProgramCache]: Analyzing trace with hash -673430796, now seen corresponding path program 1 times [2019-12-26 23:10:54,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:54,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907209384] [2019-12-26 23:10:54,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:54,472 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-26 23:10:54,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907209384] [2019-12-26 23:10:54,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:54,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:10:54,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189904304] [2019-12-26 23:10:54,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:10:54,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:54,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:10:54,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:10:54,476 INFO L87 Difference]: Start difference. First operand 2094 states and 4716 transitions. Second operand 5 states. [2019-12-26 23:10:54,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:54,593 INFO L93 Difference]: Finished difference Result 429 states and 783 transitions. [2019-12-26 23:10:54,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:10:54,594 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-26 23:10:54,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:54,595 INFO L225 Difference]: With dead ends: 429 [2019-12-26 23:10:54,595 INFO L226 Difference]: Without dead ends: 383 [2019-12-26 23:10:54,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:10:54,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-12-26 23:10:54,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 348. [2019-12-26 23:10:54,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-12-26 23:10:54,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 628 transitions. [2019-12-26 23:10:54,604 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 628 transitions. Word has length 37 [2019-12-26 23:10:54,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:54,604 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 628 transitions. [2019-12-26 23:10:54,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:10:54,605 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 628 transitions. [2019-12-26 23:10:54,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:10:54,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:54,609 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] [2019-12-26 23:10:54,609 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:54,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:54,609 INFO L82 PathProgramCache]: Analyzing trace with hash 939573543, now seen corresponding path program 1 times [2019-12-26 23:10:54,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:54,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760860100] [2019-12-26 23:10:54,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:54,718 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-26 23:10:54,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760860100] [2019-12-26 23:10:54,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:54,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:10:54,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809678960] [2019-12-26 23:10:54,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:10:54,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:54,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:10:54,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:10:54,720 INFO L87 Difference]: Start difference. First operand 348 states and 628 transitions. Second operand 3 states. [2019-12-26 23:10:54,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:54,761 INFO L93 Difference]: Finished difference Result 352 states and 622 transitions. [2019-12-26 23:10:54,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:10:54,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-26 23:10:54,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:54,763 INFO L225 Difference]: With dead ends: 352 [2019-12-26 23:10:54,763 INFO L226 Difference]: Without dead ends: 352 [2019-12-26 23:10:54,764 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-26 23:10:54,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-12-26 23:10:54,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 344. [2019-12-26 23:10:54,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-26 23:10:54,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 614 transitions. [2019-12-26 23:10:54,771 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 614 transitions. Word has length 52 [2019-12-26 23:10:54,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:54,772 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 614 transitions. [2019-12-26 23:10:54,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:10:54,772 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 614 transitions. [2019-12-26 23:10:54,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:10:54,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:54,773 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] [2019-12-26 23:10:54,773 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:54,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:54,774 INFO L82 PathProgramCache]: Analyzing trace with hash 933754688, now seen corresponding path program 1 times [2019-12-26 23:10:54,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:54,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232585210] [2019-12-26 23:10:54,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:54,831 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-26 23:10:54,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232585210] [2019-12-26 23:10:54,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:54,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:10:54,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388354897] [2019-12-26 23:10:54,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:10:54,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:54,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:10:54,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:10:54,833 INFO L87 Difference]: Start difference. First operand 344 states and 614 transitions. Second operand 3 states. [2019-12-26 23:10:54,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:54,846 INFO L93 Difference]: Finished difference Result 344 states and 601 transitions. [2019-12-26 23:10:54,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:10:54,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-26 23:10:54,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:54,848 INFO L225 Difference]: With dead ends: 344 [2019-12-26 23:10:54,848 INFO L226 Difference]: Without dead ends: 344 [2019-12-26 23:10:54,848 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-26 23:10:54,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-12-26 23:10:54,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2019-12-26 23:10:54,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-26 23:10:54,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 601 transitions. [2019-12-26 23:10:54,855 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 601 transitions. Word has length 52 [2019-12-26 23:10:54,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:54,855 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 601 transitions. [2019-12-26 23:10:54,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:10:54,855 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 601 transitions. [2019-12-26 23:10:54,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 23:10:54,856 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:54,856 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] [2019-12-26 23:10:54,857 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:54,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:54,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1595558797, now seen corresponding path program 1 times [2019-12-26 23:10:54,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:54,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427819757] [2019-12-26 23:10:54,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:55,110 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-26 23:10:55,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427819757] [2019-12-26 23:10:55,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:55,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:10:55,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070290051] [2019-12-26 23:10:55,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:10:55,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:55,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:10:55,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:10:55,113 INFO L87 Difference]: Start difference. First operand 344 states and 601 transitions. Second operand 10 states. [2019-12-26 23:10:55,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:55,649 INFO L93 Difference]: Finished difference Result 486 states and 834 transitions. [2019-12-26 23:10:55,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-26 23:10:55,651 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-12-26 23:10:55,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:55,652 INFO L225 Difference]: With dead ends: 486 [2019-12-26 23:10:55,653 INFO L226 Difference]: Without dead ends: 486 [2019-12-26 23:10:55,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-12-26 23:10:55,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-12-26 23:10:55,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 408. [2019-12-26 23:10:55,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-12-26 23:10:55,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 705 transitions. [2019-12-26 23:10:55,662 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 705 transitions. Word has length 53 [2019-12-26 23:10:55,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:55,662 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 705 transitions. [2019-12-26 23:10:55,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:10:55,663 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 705 transitions. [2019-12-26 23:10:55,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 23:10:55,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:55,664 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] [2019-12-26 23:10:55,664 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:55,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:55,665 INFO L82 PathProgramCache]: Analyzing trace with hash 165214383, now seen corresponding path program 2 times [2019-12-26 23:10:55,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:55,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797232211] [2019-12-26 23:10:55,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:55,749 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-26 23:10:55,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797232211] [2019-12-26 23:10:55,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:55,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:10:55,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177801525] [2019-12-26 23:10:55,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:10:55,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:55,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:10:55,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:10:55,751 INFO L87 Difference]: Start difference. First operand 408 states and 705 transitions. Second operand 3 states. [2019-12-26 23:10:55,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:55,786 INFO L93 Difference]: Finished difference Result 407 states and 703 transitions. [2019-12-26 23:10:55,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:10:55,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-26 23:10:55,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:55,788 INFO L225 Difference]: With dead ends: 407 [2019-12-26 23:10:55,788 INFO L226 Difference]: Without dead ends: 407 [2019-12-26 23:10:55,788 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-26 23:10:55,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-12-26 23:10:55,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 341. [2019-12-26 23:10:55,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-12-26 23:10:55,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 587 transitions. [2019-12-26 23:10:55,796 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 587 transitions. Word has length 53 [2019-12-26 23:10:55,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:55,796 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 587 transitions. [2019-12-26 23:10:55,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:10:55,797 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 587 transitions. [2019-12-26 23:10:55,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 23:10:55,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:55,798 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] [2019-12-26 23:10:55,798 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:55,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:55,801 INFO L82 PathProgramCache]: Analyzing trace with hash -798816837, now seen corresponding path program 1 times [2019-12-26 23:10:55,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:55,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579412570] [2019-12-26 23:10:55,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:56,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:10:56,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579412570] [2019-12-26 23:10:56,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:56,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 23:10:56,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434586907] [2019-12-26 23:10:56,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 23:10:56,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:56,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 23:10:56,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:10:56,178 INFO L87 Difference]: Start difference. First operand 341 states and 587 transitions. Second operand 13 states. [2019-12-26 23:10:56,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:56,755 INFO L93 Difference]: Finished difference Result 652 states and 1124 transitions. [2019-12-26 23:10:56,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-26 23:10:56,756 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-26 23:10:56,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:56,757 INFO L225 Difference]: With dead ends: 652 [2019-12-26 23:10:56,757 INFO L226 Difference]: Without dead ends: 283 [2019-12-26 23:10:56,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2019-12-26 23:10:56,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-12-26 23:10:56,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 250. [2019-12-26 23:10:56,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-26 23:10:56,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 417 transitions. [2019-12-26 23:10:56,765 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 417 transitions. Word has length 54 [2019-12-26 23:10:56,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:56,765 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 417 transitions. [2019-12-26 23:10:56,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 23:10:56,766 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 417 transitions. [2019-12-26 23:10:56,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 23:10:56,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:56,767 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] [2019-12-26 23:10:56,767 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:56,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:56,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1642640547, now seen corresponding path program 2 times [2019-12-26 23:10:56,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:56,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312543001] [2019-12-26 23:10:56,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:56,942 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-26 23:10:56,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312543001] [2019-12-26 23:10:56,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:56,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:10:56,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641007184] [2019-12-26 23:10:56,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:10:56,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:56,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:10:56,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:10:56,944 INFO L87 Difference]: Start difference. First operand 250 states and 417 transitions. Second operand 7 states. [2019-12-26 23:10:57,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:57,045 INFO L93 Difference]: Finished difference Result 346 states and 557 transitions. [2019-12-26 23:10:57,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:10:57,046 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-26 23:10:57,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:57,047 INFO L225 Difference]: With dead ends: 346 [2019-12-26 23:10:57,047 INFO L226 Difference]: Without dead ends: 206 [2019-12-26 23:10:57,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:10:57,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-12-26 23:10:57,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 182. [2019-12-26 23:10:57,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-12-26 23:10:57,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 297 transitions. [2019-12-26 23:10:57,052 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 297 transitions. Word has length 54 [2019-12-26 23:10:57,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:57,052 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 297 transitions. [2019-12-26 23:10:57,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:10:57,052 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 297 transitions. [2019-12-26 23:10:57,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 23:10:57,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:57,055 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] [2019-12-26 23:10:57,056 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:57,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:57,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1731930561, now seen corresponding path program 3 times [2019-12-26 23:10:57,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:57,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410917070] [2019-12-26 23:10:57,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:10:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:10:57,189 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:10:57,190 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:10:57,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] ULTIMATE.startENTRY-->L789: Formula: (let ((.cse0 (store |v_#valid_42| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~z~0_122 0) (= v_~y$mem_tmp~0_21 0) (= v_~y$r_buff1_thd1~0_178 0) (= 0 v_~__unbuffered_p1_EBX~0_131) (= v_~weak$$choice2~0_120 0) (= v_~__unbuffered_p1_EAX~0_131 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1607~0.base_19| 4) |v_#length_15|) (= v_~y$r_buff0_thd0~0_347 0) (= 0 v_~y$r_buff1_thd2~0_171) (= v_~x~0_94 0) (= 0 v_~weak$$choice0~0_15) (= (store .cse0 |v_ULTIMATE.start_main_~#t1607~0.base_19| 1) |v_#valid_40|) (= v_~y$read_delayed~0_6 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1607~0.base_19|) (= 0 v_~y$r_buff0_thd2~0_225) (= v_~main$tmp_guard0~0_28 0) (= 0 v_~__unbuffered_cnt~0_63) (= v_~y$r_buff0_thd1~0_109 0) (= v_~y$w_buff0_used~0_663 0) (= v_~y$w_buff1~0_180 0) (= 0 v_~y$flush_delayed~0_36) (= |v_#NULL.offset_5| 0) (= |v_ULTIMATE.start_main_~#t1607~0.offset_14| 0) (= v_~y~0_158 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1607~0.base_19|) 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$r_buff1_thd0~0_274 0) (= 0 v_~y$w_buff0~0_245) (= v_~main$tmp_guard1~0_25 0) (= v_~y$w_buff1_used~0_350 0) (= 0 |v_#NULL.base_5|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1607~0.base_19| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1607~0.base_19|) |v_ULTIMATE.start_main_~#t1607~0.offset_14| 0)) |v_#memory_int_15|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_44|, ULTIMATE.start_main_~#t1608~0.offset=|v_ULTIMATE.start_main_~#t1608~0.offset_13|, ULTIMATE.start_main_~#t1608~0.base=|v_ULTIMATE.start_main_~#t1608~0.base_16|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_25|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_33|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_47|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_37|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_131, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_109, ~y$flush_delayed~0=v_~y$flush_delayed~0_36, #length=|v_#length_15|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_30|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_27|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_23|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_23|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_28|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_46|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_26|, ~weak$$choice0~0=v_~weak$$choice0~0_15, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_27|, ULTIMATE.start_main_~#t1607~0.offset=|v_ULTIMATE.start_main_~#t1607~0.offset_14|, ~y$w_buff1~0=v_~y$w_buff1~0_180, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_225, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_274, ~x~0=v_~x~0_94, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_663, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_25|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_25|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_44|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_25|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_45|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_178, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_42|, ~y$w_buff0~0=v_~y$w_buff0~0_245, ~y~0=v_~y~0_158, ULTIMATE.start_main_~#t1607~0.base=|v_ULTIMATE.start_main_~#t1607~0.base_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_131, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_31|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_23|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_30|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_29|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_34|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_171, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_347, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_16|, ~z~0=v_~z~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_350} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1608~0.offset, ULTIMATE.start_main_~#t1608~0.base, #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_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #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, ULTIMATE.start_main_~#t1607~0.offset, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_~#t1607~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, 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-26 23:10:57,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L789-1-->L791: Formula: (and (= |v_ULTIMATE.start_main_~#t1608~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1608~0.base_11|)) (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1608~0.base_11| 1) |v_#valid_23|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1608~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1608~0.base_11|) |v_ULTIMATE.start_main_~#t1608~0.offset_10| 1)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1608~0.base_11|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1608~0.base_11| 4)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1608~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1608~0.offset=|v_ULTIMATE.start_main_~#t1608~0.offset_10|, ULTIMATE.start_main_~#t1608~0.base=|v_ULTIMATE.start_main_~#t1608~0.base_11|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1608~0.offset, ULTIMATE.start_main_~#t1608~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-26 23:10:57,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] P1ENTRY-->L4-3: Formula: (and (= 0 (mod v_~y$w_buff1_used~0_47 256)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_7) (= v_P1Thread1of1ForFork1_~arg.base_7 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7| 1) (= 1 v_~y$w_buff0_used~0_86) (= 2 v_~y$w_buff0~0_19) (= v_~y$w_buff0~0_20 v_~y$w_buff1~0_21) (= v_~y$w_buff1_used~0_47 v_~y$w_buff0_used~0_87)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_87, ~y$w_buff0~0=v_~y$w_buff0~0_20, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_86, ~y$w_buff1~0=v_~y$w_buff1~0_21, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_7, ~y$w_buff0~0=v_~y$w_buff0~0_19, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_47} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 23:10:57,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L732-2-->L732-5: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-111216896 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-111216896 256) 0)) (.cse1 (= |P0Thread1of1ForFork0_#t~ite3_Out-111216896| |P0Thread1of1ForFork0_#t~ite4_Out-111216896|))) (or (and (not .cse0) .cse1 (= |P0Thread1of1ForFork0_#t~ite3_Out-111216896| ~y$w_buff1~0_In-111216896) (not .cse2)) (and (or .cse2 .cse0) (= |P0Thread1of1ForFork0_#t~ite3_Out-111216896| ~y~0_In-111216896) .cse1))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-111216896, ~y$w_buff1~0=~y$w_buff1~0_In-111216896, ~y~0=~y~0_In-111216896, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-111216896} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-111216896, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-111216896|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-111216896|, ~y$w_buff1~0=~y$w_buff1~0_In-111216896, ~y~0=~y~0_In-111216896, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-111216896} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-26 23:10:57,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L733-->L733-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In1628043037 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1628043037 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1628043037| 0)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1628043037| ~y$w_buff0_used~0_In1628043037)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1628043037, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1628043037} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1628043037|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1628043037, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1628043037} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:10:57,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L734-->L734-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1558919758 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-1558919758 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1558919758 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-1558919758 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1558919758|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-1558919758 |P0Thread1of1ForFork0_#t~ite6_Out-1558919758|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1558919758, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1558919758, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1558919758, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1558919758} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1558919758|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1558919758, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1558919758, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1558919758, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1558919758} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:10:57,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L735-->L735-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1958359777 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1958359777 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-1958359777|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In-1958359777 |P0Thread1of1ForFork0_#t~ite7_Out-1958359777|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1958359777, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1958359777} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1958359777, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1958359777|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1958359777} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-26 23:10:57,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L736-->L736-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In179807262 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In179807262 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In179807262 256))) (.cse2 (= (mod ~y$r_buff1_thd1~0_In179807262 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd1~0_In179807262 |P0Thread1of1ForFork0_#t~ite8_Out179807262|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out179807262|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In179807262, ~y$w_buff0_used~0=~y$w_buff0_used~0_In179807262, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In179807262, ~y$w_buff1_used~0=~y$w_buff1_used~0_In179807262} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In179807262, ~y$w_buff0_used~0=~y$w_buff0_used~0_In179807262, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out179807262|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In179807262, ~y$w_buff1_used~0=~y$w_buff1_used~0_In179807262} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:10:57,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L736-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1)) (= v_~y$r_buff1_thd1~0_125 |v_P0Thread1of1ForFork0_#t~ite8_32|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_125, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 23:10:57,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1737176795 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1737176795 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1737176795| ~y$w_buff0_used~0_In-1737176795)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-1737176795|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1737176795, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1737176795} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1737176795, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1737176795, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1737176795|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-26 23:10:57,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1187244043 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1187244043 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1187244043 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1187244043 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out-1187244043| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite12_Out-1187244043| ~y$w_buff1_used~0_In-1187244043) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1187244043, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1187244043, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1187244043, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1187244043} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1187244043, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1187244043, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1187244043, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1187244043|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1187244043} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 23:10:57,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L769-->L770: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2068623291 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2068623291 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-2068623291 ~y$r_buff0_thd2~0_Out-2068623291)) (and (= 0 ~y$r_buff0_thd2~0_Out-2068623291) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2068623291, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2068623291} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2068623291, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-2068623291, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-2068623291|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-26 23:10:57,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2105159459 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2105159459 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2105159459 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-2105159459 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-2105159459 |P1Thread1of1ForFork1_#t~ite14_Out-2105159459|) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out-2105159459| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2105159459, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2105159459, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2105159459, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2105159459} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2105159459, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2105159459, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2105159459, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-2105159459|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2105159459} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 23:10:57,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~y$r_buff1_thd2~0_144 |v_P1Thread1of1ForFork1_#t~ite14_32|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_144, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 23:10:57,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L795-->L797-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= 0 (mod v_~y$r_buff0_thd0~0_132 256)) (= 0 (mod v_~y$w_buff0_used~0_236 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_236, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_132, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_236, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_132, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 23:10:57,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L797-2-->L797-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In544319038 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In544319038 256)))) (or (and (= ~y~0_In544319038 |ULTIMATE.start_main_#t~ite17_Out544319038|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite17_Out544319038| ~y$w_buff1~0_In544319038) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In544319038, ~y~0=~y~0_In544319038, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In544319038, ~y$w_buff1_used~0=~y$w_buff1_used~0_In544319038} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out544319038|, ~y$w_buff1~0=~y$w_buff1~0_In544319038, ~y~0=~y~0_In544319038, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In544319038, ~y$w_buff1_used~0=~y$w_buff1_used~0_In544319038} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-26 23:10:57,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [619] [619] L797-4-->L798: Formula: (= v_~y~0_44 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_7|, ~y~0=v_~y~0_44} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~y~0] because there is no mapped edge [2019-12-26 23:10:57,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2042825923 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-2042825923 256)))) (or (and (= |ULTIMATE.start_main_#t~ite19_Out-2042825923| ~y$w_buff0_used~0_In-2042825923) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite19_Out-2042825923| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2042825923, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2042825923} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2042825923, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-2042825923|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2042825923} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-26 23:10:57,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In1817744935 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1817744935 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1817744935 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1817744935 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite20_Out1817744935|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In1817744935 |ULTIMATE.start_main_#t~ite20_Out1817744935|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1817744935, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1817744935, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1817744935, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1817744935} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1817744935, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1817744935, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1817744935|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1817744935, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1817744935} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-26 23:10:57,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In992523715 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In992523715 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite21_Out992523715| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite21_Out992523715| ~y$r_buff0_thd0~0_In992523715)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In992523715, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In992523715} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In992523715, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In992523715, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out992523715|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-26 23:10:57,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-852629737 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-852629737 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-852629737 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-852629737 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out-852629737| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite22_Out-852629737| ~y$r_buff1_thd0~0_In-852629737)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-852629737, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-852629737, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-852629737, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-852629737} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-852629737, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-852629737, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-852629737, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-852629737|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-852629737} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-26 23:10:57,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L812-->L812-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-132051117 256)))) (or (and (= |ULTIMATE.start_main_#t~ite37_In-132051117| |ULTIMATE.start_main_#t~ite37_Out-132051117|) (= ~y$w_buff1_used~0_In-132051117 |ULTIMATE.start_main_#t~ite38_Out-132051117|) (not .cse0)) (and (= ~y$w_buff1_used~0_In-132051117 |ULTIMATE.start_main_#t~ite37_Out-132051117|) .cse0 (= |ULTIMATE.start_main_#t~ite37_Out-132051117| |ULTIMATE.start_main_#t~ite38_Out-132051117|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-132051117 256) 0))) (or (and (= (mod ~y$r_buff1_thd0~0_In-132051117 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-132051117 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-132051117 256) 0))))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-132051117, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-132051117, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In-132051117|, ~weak$$choice2~0=~weak$$choice2~0_In-132051117, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-132051117, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-132051117} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-132051117, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-132051117, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-132051117|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-132051117|, ~weak$$choice2~0=~weak$$choice2~0_In-132051117, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-132051117, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-132051117} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-26 23:10:57,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [607] [607] L813-->L814: Formula: (and (= v_~y$r_buff0_thd0~0_98 v_~y$r_buff0_thd0~0_97) (not (= 0 (mod v_~weak$$choice2~0_26 256)))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_98, ~weak$$choice2~0=v_~weak$$choice2~0_26} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_97, ~weak$$choice2~0=v_~weak$$choice2~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-26 23:10:57,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L816-->L819-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_16 256)) (not (= (mod v_~y$flush_delayed~0_27 256) 0)) (= v_~y~0_114 v_~y$mem_tmp~0_17) (= 0 v_~y$flush_delayed~0_26)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~y~0=v_~y~0_114, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_18|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:10:57,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L819-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) 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_12, 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-26 23:10:57,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:10:57 BasicIcfg [2019-12-26 23:10:57,347 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:10:57,350 INFO L168 Benchmark]: Toolchain (without parser) took 13499.30 ms. Allocated memory was 135.8 MB in the beginning and 547.9 MB in the end (delta: 412.1 MB). Free memory was 97.8 MB in the beginning and 334.4 MB in the end (delta: -236.6 MB). Peak memory consumption was 175.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:10:57,353 INFO L168 Benchmark]: CDTParser took 1.05 ms. Allocated memory is still 135.8 MB. Free memory was 117.7 MB in the beginning and 117.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 23:10:57,354 INFO L168 Benchmark]: CACSL2BoogieTranslator took 738.97 ms. Allocated memory was 135.8 MB in the beginning and 200.3 MB in the end (delta: 64.5 MB). Free memory was 97.4 MB in the beginning and 154.9 MB in the end (delta: -57.5 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:10:57,355 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.11 ms. Allocated memory is still 200.3 MB. Free memory was 154.9 MB in the beginning and 151.4 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:10:57,356 INFO L168 Benchmark]: Boogie Preprocessor took 52.43 ms. Allocated memory is still 200.3 MB. Free memory was 151.4 MB in the beginning and 149.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-26 23:10:57,361 INFO L168 Benchmark]: RCFGBuilder took 791.61 ms. Allocated memory is still 200.3 MB. Free memory was 149.3 MB in the beginning and 104.6 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:10:57,362 INFO L168 Benchmark]: TraceAbstraction took 11835.71 ms. Allocated memory was 200.3 MB in the beginning and 547.9 MB in the end (delta: 347.6 MB). Free memory was 104.6 MB in the beginning and 334.4 MB in the end (delta: -229.8 MB). Peak memory consumption was 117.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:10:57,372 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.05 ms. Allocated memory is still 135.8 MB. Free memory was 117.7 MB in the beginning and 117.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 738.97 ms. Allocated memory was 135.8 MB in the beginning and 200.3 MB in the end (delta: 64.5 MB). Free memory was 97.4 MB in the beginning and 154.9 MB in the end (delta: -57.5 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.11 ms. Allocated memory is still 200.3 MB. Free memory was 154.9 MB in the beginning and 151.4 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.43 ms. Allocated memory is still 200.3 MB. Free memory was 151.4 MB in the beginning and 149.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 791.61 ms. Allocated memory is still 200.3 MB. Free memory was 149.3 MB in the beginning and 104.6 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11835.71 ms. Allocated memory was 200.3 MB in the beginning and 547.9 MB in the end (delta: 347.6 MB). Free memory was 104.6 MB in the beginning and 334.4 MB in the end (delta: -229.8 MB). Peak memory consumption was 117.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.5s, 148 ProgramPointsBefore, 78 ProgramPointsAfterwards, 182 TransitionsBefore, 90 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 25 ChoiceCompositions, 3838 VarBasedMoverChecksPositive, 191 VarBasedMoverChecksNegative, 62 SemBasedMoverChecksPositive, 187 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 46553 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L789] FCALL, FORK 0 pthread_create(&t1607, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK 0 pthread_create(&t1608, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L751] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L752] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L753] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L754] 2 y$r_buff0_thd2 = (_Bool)1 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L726] 1 x = 1 [L729] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L734] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L735] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L766] 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) [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] 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 [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] 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 [L800] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] 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 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 y$flush_delayed = weak$$choice2 [L807] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 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) [L809] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] 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)) [L810] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 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)) [L811] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 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)) [L812] 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)) [L814] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 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)) [L815] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.5s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1270 SDtfs, 1193 SDslu, 2470 SDs, 0 SdLazy, 1283 SolverSat, 102 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 14 SyntacticMatches, 8 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11568occurred 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: 1.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 2099 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 496 NumberOfCodeBlocks, 496 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 430 ConstructedInterpolants, 0 QuantifiedInterpolants, 70292 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...