/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi003_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:54:35,466 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:54:35,469 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:54:35,489 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:54:35,489 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:54:35,491 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:54:35,493 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:54:35,507 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:54:35,509 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:54:35,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:54:35,513 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:54:35,514 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:54:35,514 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:54:35,515 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:54:35,520 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:54:35,521 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:54:35,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:54:35,527 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:54:35,529 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:54:35,534 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:54:35,537 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:54:35,538 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:54:35,539 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:54:35,540 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:54:35,542 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:54:35,542 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:54:35,543 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:54:35,543 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:54:35,544 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:54:35,545 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:54:35,545 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:54:35,546 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:54:35,546 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:54:35,548 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:54:35,549 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:54:35,549 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:54:35,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:54:35,551 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:54:35,551 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:54:35,552 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:54:35,555 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:54:35,556 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:54:35,577 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:54:35,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:54:35,579 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:54:35,579 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:54:35,580 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:54:35,580 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:54:35,580 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:54:35,580 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:54:35,580 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:54:35,581 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:54:35,582 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:54:35,582 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:54:35,582 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:54:35,583 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:54:35,583 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:54:35,583 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:54:35,583 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:54:35,584 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:54:35,584 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:54:35,584 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:54:35,584 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:54:35,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:54:35,585 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:54:35,585 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:54:35,585 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:54:35,585 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:54:35,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:54:35,586 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:54:35,586 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:54:35,586 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:54:35,587 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:54:35,588 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:54:35,874 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:54:35,895 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:54:35,899 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:54:35,900 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:54:35,901 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:54:35,902 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_tso.oepc.i [2019-12-27 21:54:35,977 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/598c55636/4f4dc474a53a4f108b6fa4d053456acb/FLAGcb9d7a9ce [2019-12-27 21:54:36,594 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:54:36,595 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_tso.oepc.i [2019-12-27 21:54:36,618 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/598c55636/4f4dc474a53a4f108b6fa4d053456acb/FLAGcb9d7a9ce [2019-12-27 21:54:36,812 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/598c55636/4f4dc474a53a4f108b6fa4d053456acb [2019-12-27 21:54:36,822 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:54:36,827 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:54:36,828 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:54:36,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:54:36,832 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:54:36,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:54:36" (1/1) ... [2019-12-27 21:54:36,835 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62d511c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:36, skipping insertion in model container [2019-12-27 21:54:36,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:54:36" (1/1) ... [2019-12-27 21:54:36,843 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:54:36,901 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:54:37,483 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:54:37,508 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:54:37,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:54:37,702 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:54:37,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:37 WrapperNode [2019-12-27 21:54:37,703 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:54:37,703 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:54:37,703 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:54:37,703 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:54:37,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:37" (1/1) ... [2019-12-27 21:54:37,733 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:37" (1/1) ... [2019-12-27 21:54:37,790 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:54:37,790 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:54:37,790 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:54:37,790 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:54:37,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:37" (1/1) ... [2019-12-27 21:54:37,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:37" (1/1) ... [2019-12-27 21:54:37,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:37" (1/1) ... [2019-12-27 21:54:37,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:37" (1/1) ... [2019-12-27 21:54:37,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:37" (1/1) ... [2019-12-27 21:54:37,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:37" (1/1) ... [2019-12-27 21:54:37,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:37" (1/1) ... [2019-12-27 21:54:37,835 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:54:37,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:54:37,836 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:54:37,836 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:54:37,837 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:54:37,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:54:37,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:54:37,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:54:37,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:54:37,929 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:54:37,930 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:54:37,930 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:54:37,931 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:54:37,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:54:37,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:54:37,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:54:37,934 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 21:54:39,027 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:54:39,028 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:54:39,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:54:39 BoogieIcfgContainer [2019-12-27 21:54:39,029 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:54:39,030 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:54:39,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:54:39,035 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:54:39,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:54:36" (1/3) ... [2019-12-27 21:54:39,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@252db816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:54:39, skipping insertion in model container [2019-12-27 21:54:39,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:37" (2/3) ... [2019-12-27 21:54:39,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@252db816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:54:39, skipping insertion in model container [2019-12-27 21:54:39,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:54:39" (3/3) ... [2019-12-27 21:54:39,040 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_tso.oepc.i [2019-12-27 21:54:39,051 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:54:39,051 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:54:39,066 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:54:39,067 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:54:39,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,138 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,138 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,155 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,155 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,156 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,156 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,156 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,230 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,232 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,243 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,244 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,246 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:54:39,262 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 21:54:39,283 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:54:39,283 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:54:39,283 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:54:39,283 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:54:39,283 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:54:39,284 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:54:39,284 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:54:39,284 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:54:39,310 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-27 21:54:39,311 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-27 21:54:39,476 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-27 21:54:39,477 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:54:39,526 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 796 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-27 21:54:39,623 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-27 21:54:39,752 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-27 21:54:39,753 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:54:39,773 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 796 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-27 21:54:39,821 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 49222 [2019-12-27 21:54:39,823 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:54:43,667 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 21:54:43,782 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 21:54:43,907 INFO L206 etLargeBlockEncoding]: Checked pairs total: 300794 [2019-12-27 21:54:43,907 INFO L214 etLargeBlockEncoding]: Total number of compositions: 136 [2019-12-27 21:54:43,910 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 159 places, 198 transitions [2019-12-27 21:54:53,335 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 92954 states. [2019-12-27 21:54:53,337 INFO L276 IsEmpty]: Start isEmpty. Operand 92954 states. [2019-12-27 21:54:53,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 21:54:53,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:54:53,348 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 21:54:53,348 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:54:53,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:54:53,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1344850552, now seen corresponding path program 1 times [2019-12-27 21:54:53,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:54:53,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266264620] [2019-12-27 21:54:53,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:54:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:54:53,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:54:53,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266264620] [2019-12-27 21:54:53,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:54:53,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:54:53,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1890687856] [2019-12-27 21:54:53,586 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:54:53,590 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:54:53,604 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 21:54:53,605 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:54:53,610 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:54:53,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:54:53,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:54:53,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:54:53,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:54:53,632 INFO L87 Difference]: Start difference. First operand 92954 states. Second operand 3 states. [2019-12-27 21:54:56,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:56,790 INFO L93 Difference]: Finished difference Result 92864 states and 336420 transitions. [2019-12-27 21:54:56,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:54:56,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 21:54:56,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:57,312 INFO L225 Difference]: With dead ends: 92864 [2019-12-27 21:54:57,312 INFO L226 Difference]: Without dead ends: 91016 [2019-12-27 21:54:57,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:55:00,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91016 states. [2019-12-27 21:55:03,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91016 to 91016. [2019-12-27 21:55:03,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91016 states. [2019-12-27 21:55:03,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91016 states to 91016 states and 330175 transitions. [2019-12-27 21:55:03,379 INFO L78 Accepts]: Start accepts. Automaton has 91016 states and 330175 transitions. Word has length 5 [2019-12-27 21:55:03,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:55:03,379 INFO L462 AbstractCegarLoop]: Abstraction has 91016 states and 330175 transitions. [2019-12-27 21:55:03,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:55:03,379 INFO L276 IsEmpty]: Start isEmpty. Operand 91016 states and 330175 transitions. [2019-12-27 21:55:03,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:55:03,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:55:03,382 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:55:03,382 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:55:03,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:55:03,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1965407364, now seen corresponding path program 1 times [2019-12-27 21:55:03,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:55:03,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322993287] [2019-12-27 21:55:03,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:55:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:55:03,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:55:03,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322993287] [2019-12-27 21:55:03,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:55:03,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:55:03,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [53578919] [2019-12-27 21:55:03,481 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:55:03,482 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:55:03,487 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 21:55:03,487 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:55:03,523 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:55:03,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:55:03,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:55:03,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:55:03,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:55:03,526 INFO L87 Difference]: Start difference. First operand 91016 states and 330175 transitions. Second operand 5 states. [2019-12-27 21:55:07,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:55:07,660 INFO L93 Difference]: Finished difference Result 136127 states and 476904 transitions. [2019-12-27 21:55:07,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:55:07,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-27 21:55:07,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:55:08,152 INFO L225 Difference]: With dead ends: 136127 [2019-12-27 21:55:08,152 INFO L226 Difference]: Without dead ends: 136127 [2019-12-27 21:55:08,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:55:14,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136127 states. [2019-12-27 21:55:16,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136127 to 135155. [2019-12-27 21:55:16,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135155 states. [2019-12-27 21:55:16,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135155 states to 135155 states and 474192 transitions. [2019-12-27 21:55:16,652 INFO L78 Accepts]: Start accepts. Automaton has 135155 states and 474192 transitions. Word has length 11 [2019-12-27 21:55:16,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:55:16,652 INFO L462 AbstractCegarLoop]: Abstraction has 135155 states and 474192 transitions. [2019-12-27 21:55:16,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:55:16,653 INFO L276 IsEmpty]: Start isEmpty. Operand 135155 states and 474192 transitions. [2019-12-27 21:55:16,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:55:16,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:55:16,655 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:55:16,656 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:55:16,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:55:16,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1027571428, now seen corresponding path program 1 times [2019-12-27 21:55:16,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:55:16,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606797115] [2019-12-27 21:55:16,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:55:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:55:16,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:55:16,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606797115] [2019-12-27 21:55:16,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:55:16,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:55:16,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1039032352] [2019-12-27 21:55:16,718 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:55:16,719 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:55:16,720 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:55:16,720 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:55:16,720 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:55:16,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:55:16,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:55:16,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:55:16,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:55:16,721 INFO L87 Difference]: Start difference. First operand 135155 states and 474192 transitions. Second operand 3 states. [2019-12-27 21:55:16,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:55:16,757 INFO L93 Difference]: Finished difference Result 8128 states and 19851 transitions. [2019-12-27 21:55:16,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:55:16,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 21:55:16,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:55:16,771 INFO L225 Difference]: With dead ends: 8128 [2019-12-27 21:55:16,771 INFO L226 Difference]: Without dead ends: 8128 [2019-12-27 21:55:16,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:55:16,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8128 states. [2019-12-27 21:55:16,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8128 to 8088. [2019-12-27 21:55:16,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8088 states. [2019-12-27 21:55:16,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8088 states to 8088 states and 19771 transitions. [2019-12-27 21:55:16,903 INFO L78 Accepts]: Start accepts. Automaton has 8088 states and 19771 transitions. Word has length 11 [2019-12-27 21:55:16,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:55:16,903 INFO L462 AbstractCegarLoop]: Abstraction has 8088 states and 19771 transitions. [2019-12-27 21:55:16,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:55:16,903 INFO L276 IsEmpty]: Start isEmpty. Operand 8088 states and 19771 transitions. [2019-12-27 21:55:16,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 21:55:16,906 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:55:16,906 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] [2019-12-27 21:55:16,907 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:55:16,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:55:16,907 INFO L82 PathProgramCache]: Analyzing trace with hash 650384325, now seen corresponding path program 1 times [2019-12-27 21:55:16,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:55:16,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157317243] [2019-12-27 21:55:16,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:55:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:55:17,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:55:17,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157317243] [2019-12-27 21:55:17,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:55:17,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:55:17,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [541299536] [2019-12-27 21:55:17,064 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:55:17,067 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:55:17,074 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 90 transitions. [2019-12-27 21:55:17,075 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:55:17,109 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:55:17,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:55:17,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:55:17,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:55:17,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:55:17,110 INFO L87 Difference]: Start difference. First operand 8088 states and 19771 transitions. Second operand 7 states. [2019-12-27 21:55:19,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:55:19,470 INFO L93 Difference]: Finished difference Result 9516 states and 22790 transitions. [2019-12-27 21:55:19,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:55:19,470 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 21:55:19,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:55:19,484 INFO L225 Difference]: With dead ends: 9516 [2019-12-27 21:55:19,484 INFO L226 Difference]: Without dead ends: 9516 [2019-12-27 21:55:19,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:55:19,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9516 states. [2019-12-27 21:55:19,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9516 to 9310. [2019-12-27 21:55:19,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9310 states. [2019-12-27 21:55:19,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9310 states to 9310 states and 22404 transitions. [2019-12-27 21:55:19,590 INFO L78 Accepts]: Start accepts. Automaton has 9310 states and 22404 transitions. Word has length 22 [2019-12-27 21:55:19,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:55:19,590 INFO L462 AbstractCegarLoop]: Abstraction has 9310 states and 22404 transitions. [2019-12-27 21:55:19,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:55:19,590 INFO L276 IsEmpty]: Start isEmpty. Operand 9310 states and 22404 transitions. [2019-12-27 21:55:19,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 21:55:19,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:55:19,594 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] [2019-12-27 21:55:19,594 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:55:19,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:55:19,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1389704286, now seen corresponding path program 1 times [2019-12-27 21:55:19,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:55:19,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463310368] [2019-12-27 21:55:19,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:55:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:55:19,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:55:19,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463310368] [2019-12-27 21:55:19,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:55:19,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:55:19,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1885352382] [2019-12-27 21:55:19,669 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:55:19,674 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:55:19,693 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 81 states and 126 transitions. [2019-12-27 21:55:19,693 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:55:19,711 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:55:19,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:55:19,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:55:19,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:55:19,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:55:19,713 INFO L87 Difference]: Start difference. First operand 9310 states and 22404 transitions. Second operand 5 states. [2019-12-27 21:55:19,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:55:19,753 INFO L93 Difference]: Finished difference Result 3456 states and 7722 transitions. [2019-12-27 21:55:19,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:55:19,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-27 21:55:19,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:55:19,759 INFO L225 Difference]: With dead ends: 3456 [2019-12-27 21:55:19,760 INFO L226 Difference]: Without dead ends: 3456 [2019-12-27 21:55:19,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:55:19,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3456 states. [2019-12-27 21:55:19,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3456 to 3380. [2019-12-27 21:55:19,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3380 states. [2019-12-27 21:55:19,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3380 states to 3380 states and 7581 transitions. [2019-12-27 21:55:19,805 INFO L78 Accepts]: Start accepts. Automaton has 3380 states and 7581 transitions. Word has length 34 [2019-12-27 21:55:19,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:55:19,806 INFO L462 AbstractCegarLoop]: Abstraction has 3380 states and 7581 transitions. [2019-12-27 21:55:19,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:55:19,806 INFO L276 IsEmpty]: Start isEmpty. Operand 3380 states and 7581 transitions. [2019-12-27 21:55:19,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 21:55:19,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:55:19,819 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:55:19,819 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:55:19,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:55:19,819 INFO L82 PathProgramCache]: Analyzing trace with hash 389888815, now seen corresponding path program 1 times [2019-12-27 21:55:19,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:55:19,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049164522] [2019-12-27 21:55:19,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:55:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:55:20,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:55:20,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049164522] [2019-12-27 21:55:20,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:55:20,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:55:20,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1900542398] [2019-12-27 21:55:20,044 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:55:20,085 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:55:20,228 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 166 states and 237 transitions. [2019-12-27 21:55:20,229 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:55:20,241 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:55:20,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:55:20,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:55:20,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:55:20,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:55:20,242 INFO L87 Difference]: Start difference. First operand 3380 states and 7581 transitions. Second operand 6 states. [2019-12-27 21:55:21,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:55:21,577 INFO L93 Difference]: Finished difference Result 6537 states and 14135 transitions. [2019-12-27 21:55:21,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 21:55:21,578 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-27 21:55:21,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:55:21,586 INFO L225 Difference]: With dead ends: 6537 [2019-12-27 21:55:21,586 INFO L226 Difference]: Without dead ends: 6537 [2019-12-27 21:55:21,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:55:21,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6537 states. [2019-12-27 21:55:21,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6537 to 5143. [2019-12-27 21:55:21,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5143 states. [2019-12-27 21:55:21,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5143 states to 5143 states and 11298 transitions. [2019-12-27 21:55:21,682 INFO L78 Accepts]: Start accepts. Automaton has 5143 states and 11298 transitions. Word has length 93 [2019-12-27 21:55:21,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:55:21,683 INFO L462 AbstractCegarLoop]: Abstraction has 5143 states and 11298 transitions. [2019-12-27 21:55:21,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:55:21,683 INFO L276 IsEmpty]: Start isEmpty. Operand 5143 states and 11298 transitions. [2019-12-27 21:55:21,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 21:55:21,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:55:21,696 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:55:21,696 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:55:21,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:55:21,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1945699553, now seen corresponding path program 2 times [2019-12-27 21:55:21,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:55:21,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781376590] [2019-12-27 21:55:21,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:55:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:55:21,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:55:21,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781376590] [2019-12-27 21:55:21,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:55:21,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:55:21,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [19560343] [2019-12-27 21:55:21,814 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:55:21,855 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:55:22,081 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 212 states and 329 transitions. [2019-12-27 21:55:22,082 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:55:22,103 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:55:22,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:55:22,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:55:22,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:55:22,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:55:22,105 INFO L87 Difference]: Start difference. First operand 5143 states and 11298 transitions. Second operand 6 states. [2019-12-27 21:55:23,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:55:23,074 INFO L93 Difference]: Finished difference Result 6146 states and 13475 transitions. [2019-12-27 21:55:23,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:55:23,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-27 21:55:23,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:55:23,082 INFO L225 Difference]: With dead ends: 6146 [2019-12-27 21:55:23,082 INFO L226 Difference]: Without dead ends: 6146 [2019-12-27 21:55:23,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:55:23,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6146 states. [2019-12-27 21:55:23,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6146 to 5172. [2019-12-27 21:55:23,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5172 states. [2019-12-27 21:55:23,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5172 states to 5172 states and 11355 transitions. [2019-12-27 21:55:23,139 INFO L78 Accepts]: Start accepts. Automaton has 5172 states and 11355 transitions. Word has length 93 [2019-12-27 21:55:23,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:55:23,140 INFO L462 AbstractCegarLoop]: Abstraction has 5172 states and 11355 transitions. [2019-12-27 21:55:23,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:55:23,140 INFO L276 IsEmpty]: Start isEmpty. Operand 5172 states and 11355 transitions. [2019-12-27 21:55:23,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 21:55:23,150 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:55:23,150 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:55:23,151 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:55:23,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:55:23,151 INFO L82 PathProgramCache]: Analyzing trace with hash -2069303761, now seen corresponding path program 3 times [2019-12-27 21:55:23,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:55:23,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313729479] [2019-12-27 21:55:23,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:55:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:55:23,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:55:23,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313729479] [2019-12-27 21:55:23,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:55:23,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:55:23,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1455446705] [2019-12-27 21:55:23,279 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:55:23,319 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:55:23,568 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 166 states and 237 transitions. [2019-12-27 21:55:23,568 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:55:23,579 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:55:23,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:55:23,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:55:23,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:55:23,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:55:23,580 INFO L87 Difference]: Start difference. First operand 5172 states and 11355 transitions. Second operand 7 states. [2019-12-27 21:55:24,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:55:24,706 INFO L93 Difference]: Finished difference Result 6147 states and 13443 transitions. [2019-12-27 21:55:24,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:55:24,706 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-12-27 21:55:24,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:55:24,713 INFO L225 Difference]: With dead ends: 6147 [2019-12-27 21:55:24,714 INFO L226 Difference]: Without dead ends: 6147 [2019-12-27 21:55:24,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:55:24,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6147 states. [2019-12-27 21:55:24,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6147 to 5348. [2019-12-27 21:55:24,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5348 states. [2019-12-27 21:55:24,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5348 states to 5348 states and 11727 transitions. [2019-12-27 21:55:24,772 INFO L78 Accepts]: Start accepts. Automaton has 5348 states and 11727 transitions. Word has length 93 [2019-12-27 21:55:24,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:55:24,772 INFO L462 AbstractCegarLoop]: Abstraction has 5348 states and 11727 transitions. [2019-12-27 21:55:24,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:55:24,773 INFO L276 IsEmpty]: Start isEmpty. Operand 5348 states and 11727 transitions. [2019-12-27 21:55:24,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 21:55:24,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:55:24,780 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:55:24,780 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:55:24,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:55:24,780 INFO L82 PathProgramCache]: Analyzing trace with hash 779772427, now seen corresponding path program 4 times [2019-12-27 21:55:24,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:55:24,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087656770] [2019-12-27 21:55:24,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:55:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:55:24,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:55:24,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087656770] [2019-12-27 21:55:24,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:55:24,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:55:24,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1025387179] [2019-12-27 21:55:24,887 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:55:24,924 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:55:25,068 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 147 states and 197 transitions. [2019-12-27 21:55:25,069 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:55:25,070 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:55:25,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:55:25,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:55:25,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:55:25,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:55:25,071 INFO L87 Difference]: Start difference. First operand 5348 states and 11727 transitions. Second operand 5 states. [2019-12-27 21:55:25,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:55:25,862 INFO L93 Difference]: Finished difference Result 6377 states and 13880 transitions. [2019-12-27 21:55:25,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:55:25,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-12-27 21:55:25,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:55:25,871 INFO L225 Difference]: With dead ends: 6377 [2019-12-27 21:55:25,871 INFO L226 Difference]: Without dead ends: 6377 [2019-12-27 21:55:25,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:55:25,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6377 states. [2019-12-27 21:55:25,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6377 to 5494. [2019-12-27 21:55:25,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5494 states. [2019-12-27 21:55:25,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5494 states to 5494 states and 12071 transitions. [2019-12-27 21:55:25,935 INFO L78 Accepts]: Start accepts. Automaton has 5494 states and 12071 transitions. Word has length 93 [2019-12-27 21:55:25,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:55:25,935 INFO L462 AbstractCegarLoop]: Abstraction has 5494 states and 12071 transitions. [2019-12-27 21:55:25,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:55:25,935 INFO L276 IsEmpty]: Start isEmpty. Operand 5494 states and 12071 transitions. [2019-12-27 21:55:25,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 21:55:25,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:55:25,943 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:55:25,943 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:55:25,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:55:25,943 INFO L82 PathProgramCache]: Analyzing trace with hash -326394763, now seen corresponding path program 5 times [2019-12-27 21:55:25,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:55:25,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047168405] [2019-12-27 21:55:25,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:55:25,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:55:26,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:55:26,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047168405] [2019-12-27 21:55:26,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:55:26,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:55:26,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1040837407] [2019-12-27 21:55:26,061 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:55:26,096 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:55:26,380 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 180 states and 256 transitions. [2019-12-27 21:55:26,380 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:55:26,510 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 21:55:26,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:55:26,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:55:26,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:55:26,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:55:26,511 INFO L87 Difference]: Start difference. First operand 5494 states and 12071 transitions. Second operand 12 states. [2019-12-27 21:55:28,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:55:28,277 INFO L93 Difference]: Finished difference Result 8652 states and 18578 transitions. [2019-12-27 21:55:28,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:55:28,277 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2019-12-27 21:55:28,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:55:28,288 INFO L225 Difference]: With dead ends: 8652 [2019-12-27 21:55:28,288 INFO L226 Difference]: Without dead ends: 8652 [2019-12-27 21:55:28,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-12-27 21:55:28,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8652 states. [2019-12-27 21:55:28,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8652 to 4643. [2019-12-27 21:55:28,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4643 states. [2019-12-27 21:55:28,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4643 states to 4643 states and 10039 transitions. [2019-12-27 21:55:28,373 INFO L78 Accepts]: Start accepts. Automaton has 4643 states and 10039 transitions. Word has length 93 [2019-12-27 21:55:28,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:55:28,373 INFO L462 AbstractCegarLoop]: Abstraction has 4643 states and 10039 transitions. [2019-12-27 21:55:28,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:55:28,373 INFO L276 IsEmpty]: Start isEmpty. Operand 4643 states and 10039 transitions. [2019-12-27 21:55:28,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 21:55:28,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:55:28,379 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:55:28,379 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:55:28,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:55:28,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1476050659, now seen corresponding path program 1 times [2019-12-27 21:55:28,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:55:28,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287927438] [2019-12-27 21:55:28,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:55:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:55:28,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:55:28,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287927438] [2019-12-27 21:55:28,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:55:28,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:55:28,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1193404590] [2019-12-27 21:55:28,504 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:55:28,543 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:55:28,874 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 204 states and 310 transitions. [2019-12-27 21:55:28,874 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:55:28,877 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:55:28,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:55:28,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:55:28,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:55:28,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:55:28,878 INFO L87 Difference]: Start difference. First operand 4643 states and 10039 transitions. Second operand 5 states. [2019-12-27 21:55:29,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:55:29,269 INFO L93 Difference]: Finished difference Result 4911 states and 10535 transitions. [2019-12-27 21:55:29,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:55:29,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-27 21:55:29,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:55:29,276 INFO L225 Difference]: With dead ends: 4911 [2019-12-27 21:55:29,276 INFO L226 Difference]: Without dead ends: 4911 [2019-12-27 21:55:29,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:55:29,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4911 states. [2019-12-27 21:55:29,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4911 to 4731. [2019-12-27 21:55:29,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4731 states. [2019-12-27 21:55:29,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4731 states to 4731 states and 10212 transitions. [2019-12-27 21:55:29,326 INFO L78 Accepts]: Start accepts. Automaton has 4731 states and 10212 transitions. Word has length 95 [2019-12-27 21:55:29,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:55:29,326 INFO L462 AbstractCegarLoop]: Abstraction has 4731 states and 10212 transitions. [2019-12-27 21:55:29,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:55:29,326 INFO L276 IsEmpty]: Start isEmpty. Operand 4731 states and 10212 transitions. [2019-12-27 21:55:29,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 21:55:29,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:55:29,332 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:55:29,333 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:55:29,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:55:29,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1866657661, now seen corresponding path program 2 times [2019-12-27 21:55:29,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:55:29,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515027875] [2019-12-27 21:55:29,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:55:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:55:29,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:55:29,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515027875] [2019-12-27 21:55:29,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:55:29,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:55:29,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1492068492] [2019-12-27 21:55:29,424 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:55:29,462 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:55:29,684 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 161 states and 222 transitions. [2019-12-27 21:55:29,685 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:55:29,685 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:55:29,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:55:29,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:55:29,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:55:29,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:55:29,687 INFO L87 Difference]: Start difference. First operand 4731 states and 10212 transitions. Second operand 3 states. [2019-12-27 21:55:29,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:55:29,740 INFO L93 Difference]: Finished difference Result 4730 states and 10210 transitions. [2019-12-27 21:55:29,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:55:29,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-12-27 21:55:29,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:55:29,747 INFO L225 Difference]: With dead ends: 4730 [2019-12-27 21:55:29,747 INFO L226 Difference]: Without dead ends: 4730 [2019-12-27 21:55:29,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:55:29,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4730 states. [2019-12-27 21:55:29,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4730 to 4479. [2019-12-27 21:55:29,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4479 states. [2019-12-27 21:55:29,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4479 states to 4479 states and 9736 transitions. [2019-12-27 21:55:29,821 INFO L78 Accepts]: Start accepts. Automaton has 4479 states and 9736 transitions. Word has length 95 [2019-12-27 21:55:29,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:55:29,822 INFO L462 AbstractCegarLoop]: Abstraction has 4479 states and 9736 transitions. [2019-12-27 21:55:29,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:55:29,822 INFO L276 IsEmpty]: Start isEmpty. Operand 4479 states and 9736 transitions. [2019-12-27 21:55:29,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:55:29,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:55:29,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:55:29,833 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:55:29,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:55:29,834 INFO L82 PathProgramCache]: Analyzing trace with hash -545872847, now seen corresponding path program 1 times [2019-12-27 21:55:29,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:55:29,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156809531] [2019-12-27 21:55:29,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:55:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:55:30,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:55:30,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156809531] [2019-12-27 21:55:30,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:55:30,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:55:30,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [801944529] [2019-12-27 21:55:30,194 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:55:30,235 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:55:30,455 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 311 transitions. [2019-12-27 21:55:30,456 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:55:30,681 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 21:55:30,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 21:55:30,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:55:30,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 21:55:30,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:55:30,682 INFO L87 Difference]: Start difference. First operand 4479 states and 9736 transitions. Second operand 13 states. [2019-12-27 21:55:34,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:55:34,213 INFO L93 Difference]: Finished difference Result 12799 states and 26669 transitions. [2019-12-27 21:55:34,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 21:55:34,214 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-12-27 21:55:34,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:55:34,228 INFO L225 Difference]: With dead ends: 12799 [2019-12-27 21:55:34,228 INFO L226 Difference]: Without dead ends: 12344 [2019-12-27 21:55:34,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 13 SyntacticMatches, 9 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=329, Invalid=1153, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 21:55:34,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12344 states. [2019-12-27 21:55:34,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12344 to 7067. [2019-12-27 21:55:34,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7067 states. [2019-12-27 21:55:34,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7067 states to 7067 states and 15205 transitions. [2019-12-27 21:55:34,336 INFO L78 Accepts]: Start accepts. Automaton has 7067 states and 15205 transitions. Word has length 96 [2019-12-27 21:55:34,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:55:34,337 INFO L462 AbstractCegarLoop]: Abstraction has 7067 states and 15205 transitions. [2019-12-27 21:55:34,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 21:55:34,337 INFO L276 IsEmpty]: Start isEmpty. Operand 7067 states and 15205 transitions. [2019-12-27 21:55:34,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:55:34,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:55:34,347 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:55:34,347 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:55:34,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:55:34,348 INFO L82 PathProgramCache]: Analyzing trace with hash 846982815, now seen corresponding path program 2 times [2019-12-27 21:55:34,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:55:34,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351219357] [2019-12-27 21:55:34,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:55:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:55:34,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:55:34,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351219357] [2019-12-27 21:55:34,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:55:34,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:55:34,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [492182310] [2019-12-27 21:55:34,599 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:55:34,660 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:55:34,856 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 153 states and 207 transitions. [2019-12-27 21:55:34,857 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:55:34,860 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:55:34,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:55:34,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:55:34,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:55:34,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:55:34,861 INFO L87 Difference]: Start difference. First operand 7067 states and 15205 transitions. Second operand 10 states. [2019-12-27 21:55:36,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:55:36,137 INFO L93 Difference]: Finished difference Result 9781 states and 20897 transitions. [2019-12-27 21:55:36,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 21:55:36,138 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 21:55:36,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:55:36,148 INFO L225 Difference]: With dead ends: 9781 [2019-12-27 21:55:36,148 INFO L226 Difference]: Without dead ends: 9781 [2019-12-27 21:55:36,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2019-12-27 21:55:36,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9781 states. [2019-12-27 21:55:36,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9781 to 7179. [2019-12-27 21:55:36,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7179 states. [2019-12-27 21:55:36,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7179 states to 7179 states and 15465 transitions. [2019-12-27 21:55:36,240 INFO L78 Accepts]: Start accepts. Automaton has 7179 states and 15465 transitions. Word has length 96 [2019-12-27 21:55:36,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:55:36,240 INFO L462 AbstractCegarLoop]: Abstraction has 7179 states and 15465 transitions. [2019-12-27 21:55:36,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:55:36,241 INFO L276 IsEmpty]: Start isEmpty. Operand 7179 states and 15465 transitions. [2019-12-27 21:55:36,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:55:36,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:55:36,250 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:55:36,251 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:55:36,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:55:36,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1176218101, now seen corresponding path program 3 times [2019-12-27 21:55:36,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:55:36,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505277421] [2019-12-27 21:55:36,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:55:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:55:36,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-27 21:55:36,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505277421] [2019-12-27 21:55:36,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:55:36,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:55:36,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1718072426] [2019-12-27 21:55:36,473 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:55:36,527 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:55:36,801 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 168 states and 238 transitions. [2019-12-27 21:55:36,802 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:55:36,915 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:55:36,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 21:55:36,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:55:36,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 21:55:36,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:55:36,917 INFO L87 Difference]: Start difference. First operand 7179 states and 15465 transitions. Second operand 13 states. [2019-12-27 21:55:38,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:55:38,180 INFO L93 Difference]: Finished difference Result 8146 states and 17267 transitions. [2019-12-27 21:55:38,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 21:55:38,181 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-12-27 21:55:38,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:55:38,190 INFO L225 Difference]: With dead ends: 8146 [2019-12-27 21:55:38,190 INFO L226 Difference]: Without dead ends: 7943 [2019-12-27 21:55:38,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-27 21:55:38,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7943 states. [2019-12-27 21:55:38,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7943 to 6485. [2019-12-27 21:55:38,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6485 states. [2019-12-27 21:55:38,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6485 states to 6485 states and 13957 transitions. [2019-12-27 21:55:38,261 INFO L78 Accepts]: Start accepts. Automaton has 6485 states and 13957 transitions. Word has length 96 [2019-12-27 21:55:38,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:55:38,261 INFO L462 AbstractCegarLoop]: Abstraction has 6485 states and 13957 transitions. [2019-12-27 21:55:38,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 21:55:38,261 INFO L276 IsEmpty]: Start isEmpty. Operand 6485 states and 13957 transitions. [2019-12-27 21:55:38,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:55:38,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:55:38,270 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:55:38,270 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:55:38,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:55:38,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1951678765, now seen corresponding path program 4 times [2019-12-27 21:55:38,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:55:38,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783833607] [2019-12-27 21:55:38,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:55:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:55:38,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:55:38,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783833607] [2019-12-27 21:55:38,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:55:38,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 21:55:38,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1680963141] [2019-12-27 21:55:38,566 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:55:38,604 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:55:38,936 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 236 transitions. [2019-12-27 21:55:38,936 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:55:38,953 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:55:38,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:55:38,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:55:38,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:55:38,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:55:38,955 INFO L87 Difference]: Start difference. First operand 6485 states and 13957 transitions. Second operand 11 states. [2019-12-27 21:55:40,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:55:40,956 INFO L93 Difference]: Finished difference Result 10142 states and 21549 transitions. [2019-12-27 21:55:40,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 21:55:40,957 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-27 21:55:40,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:55:40,968 INFO L225 Difference]: With dead ends: 10142 [2019-12-27 21:55:40,968 INFO L226 Difference]: Without dead ends: 10142 [2019-12-27 21:55:40,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2019-12-27 21:55:40,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10142 states. [2019-12-27 21:55:41,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10142 to 6812. [2019-12-27 21:55:41,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6812 states. [2019-12-27 21:55:41,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6812 states to 6812 states and 14734 transitions. [2019-12-27 21:55:41,056 INFO L78 Accepts]: Start accepts. Automaton has 6812 states and 14734 transitions. Word has length 96 [2019-12-27 21:55:41,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:55:41,056 INFO L462 AbstractCegarLoop]: Abstraction has 6812 states and 14734 transitions. [2019-12-27 21:55:41,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:55:41,056 INFO L276 IsEmpty]: Start isEmpty. Operand 6812 states and 14734 transitions. [2019-12-27 21:55:41,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:55:41,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:55:41,063 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:55:41,064 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:55:41,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:55:41,064 INFO L82 PathProgramCache]: Analyzing trace with hash 10241457, now seen corresponding path program 5 times [2019-12-27 21:55:41,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:55:41,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584032067] [2019-12-27 21:55:41,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:55:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:55:41,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:55:41,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584032067] [2019-12-27 21:55:41,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:55:41,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 21:55:41,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1263446644] [2019-12-27 21:55:41,398 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:55:41,423 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:55:41,708 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 197 states and 296 transitions. [2019-12-27 21:55:41,708 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:55:41,839 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 21:55:41,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 21:55:41,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:55:41,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 21:55:41,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-12-27 21:55:41,840 INFO L87 Difference]: Start difference. First operand 6812 states and 14734 transitions. Second operand 15 states. [2019-12-27 21:55:47,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:55:47,264 INFO L93 Difference]: Finished difference Result 23001 states and 48456 transitions. [2019-12-27 21:55:47,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 21:55:47,265 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2019-12-27 21:55:47,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:55:47,288 INFO L225 Difference]: With dead ends: 23001 [2019-12-27 21:55:47,288 INFO L226 Difference]: Without dead ends: 23001 [2019-12-27 21:55:47,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=497, Invalid=2053, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 21:55:47,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23001 states. [2019-12-27 21:55:47,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23001 to 8560. [2019-12-27 21:55:47,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8560 states. [2019-12-27 21:55:47,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8560 states to 8560 states and 18629 transitions. [2019-12-27 21:55:47,462 INFO L78 Accepts]: Start accepts. Automaton has 8560 states and 18629 transitions. Word has length 96 [2019-12-27 21:55:47,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:55:47,463 INFO L462 AbstractCegarLoop]: Abstraction has 8560 states and 18629 transitions. [2019-12-27 21:55:47,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 21:55:47,463 INFO L276 IsEmpty]: Start isEmpty. Operand 8560 states and 18629 transitions. [2019-12-27 21:55:47,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:55:47,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:55:47,470 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:55:47,470 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:55:47,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:55:47,470 INFO L82 PathProgramCache]: Analyzing trace with hash 248386647, now seen corresponding path program 6 times [2019-12-27 21:55:47,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:55:47,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481664557] [2019-12-27 21:55:47,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:55:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:55:47,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:55:47,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481664557] [2019-12-27 21:55:47,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:55:47,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:55:47,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [392594894] [2019-12-27 21:55:47,691 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:55:47,709 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:55:47,884 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 193 states and 287 transitions. [2019-12-27 21:55:47,884 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:55:47,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:55:47,977 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 21:55:47,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:55:47,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:55:47,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:55:47,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:55:47,979 INFO L87 Difference]: Start difference. First operand 8560 states and 18629 transitions. Second operand 12 states. [2019-12-27 21:55:50,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:55:50,745 INFO L93 Difference]: Finished difference Result 21019 states and 43661 transitions. [2019-12-27 21:55:50,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 21:55:50,746 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-27 21:55:50,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:55:50,766 INFO L225 Difference]: With dead ends: 21019 [2019-12-27 21:55:50,766 INFO L226 Difference]: Without dead ends: 20361 [2019-12-27 21:55:50,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=426, Unknown=0, NotChecked=0, Total=600 [2019-12-27 21:55:50,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20361 states. [2019-12-27 21:55:50,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20361 to 10081. [2019-12-27 21:55:50,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10081 states. [2019-12-27 21:55:50,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10081 states to 10081 states and 22006 transitions. [2019-12-27 21:55:50,936 INFO L78 Accepts]: Start accepts. Automaton has 10081 states and 22006 transitions. Word has length 96 [2019-12-27 21:55:50,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:55:50,937 INFO L462 AbstractCegarLoop]: Abstraction has 10081 states and 22006 transitions. [2019-12-27 21:55:50,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:55:50,937 INFO L276 IsEmpty]: Start isEmpty. Operand 10081 states and 22006 transitions. [2019-12-27 21:55:50,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:55:50,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:55:50,946 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:55:50,946 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:55:50,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:55:50,946 INFO L82 PathProgramCache]: Analyzing trace with hash -215557519, now seen corresponding path program 7 times [2019-12-27 21:55:50,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:55:50,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320020129] [2019-12-27 21:55:50,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:55:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:55:51,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:55:51,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320020129] [2019-12-27 21:55:51,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:55:51,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 21:55:51,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [541872091] [2019-12-27 21:55:51,307 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:55:51,326 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:55:51,533 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 312 transitions. [2019-12-27 21:55:51,533 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:55:51,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:55:51,639 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:55:51,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 21:55:51,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:55:51,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 21:55:51,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-27 21:55:51,640 INFO L87 Difference]: Start difference. First operand 10081 states and 22006 transitions. Second operand 16 states. [2019-12-27 21:55:56,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:55:56,533 INFO L93 Difference]: Finished difference Result 21716 states and 46308 transitions. [2019-12-27 21:55:56,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 21:55:56,534 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 96 [2019-12-27 21:55:56,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:55:56,556 INFO L225 Difference]: With dead ends: 21716 [2019-12-27 21:55:56,556 INFO L226 Difference]: Without dead ends: 21415 [2019-12-27 21:55:56,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=383, Invalid=1687, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 21:55:56,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21415 states. [2019-12-27 21:55:56,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21415 to 10183. [2019-12-27 21:55:56,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10183 states. [2019-12-27 21:55:56,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10183 states to 10183 states and 22192 transitions. [2019-12-27 21:55:56,715 INFO L78 Accepts]: Start accepts. Automaton has 10183 states and 22192 transitions. Word has length 96 [2019-12-27 21:55:56,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:55:56,715 INFO L462 AbstractCegarLoop]: Abstraction has 10183 states and 22192 transitions. [2019-12-27 21:55:56,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 21:55:56,715 INFO L276 IsEmpty]: Start isEmpty. Operand 10183 states and 22192 transitions. [2019-12-27 21:55:56,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:55:56,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:55:56,724 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:55:56,724 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:55:56,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:55:56,724 INFO L82 PathProgramCache]: Analyzing trace with hash 2106241879, now seen corresponding path program 8 times [2019-12-27 21:55:56,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:55:56,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491033603] [2019-12-27 21:55:56,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:55:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:55:57,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:55:57,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491033603] [2019-12-27 21:55:57,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:55:57,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 21:55:57,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1652395666] [2019-12-27 21:55:57,034 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:55:57,053 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:55:57,216 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 173 states and 247 transitions. [2019-12-27 21:55:57,216 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:55:57,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:55:57,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:55:57,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:55:57,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 21:55:57,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:55:57,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:55:57,390 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:55:57,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 21:55:57,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:55:57,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 21:55:57,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-27 21:55:57,392 INFO L87 Difference]: Start difference. First operand 10183 states and 22192 transitions. Second operand 18 states. [2019-12-27 21:56:03,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:56:03,214 INFO L93 Difference]: Finished difference Result 25056 states and 53210 transitions. [2019-12-27 21:56:03,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 21:56:03,215 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 96 [2019-12-27 21:56:03,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:56:03,242 INFO L225 Difference]: With dead ends: 25056 [2019-12-27 21:56:03,242 INFO L226 Difference]: Without dead ends: 24559 [2019-12-27 21:56:03,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=427, Invalid=1829, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 21:56:03,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24559 states. [2019-12-27 21:56:03,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24559 to 10112. [2019-12-27 21:56:03,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10112 states. [2019-12-27 21:56:03,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10112 states to 10112 states and 22072 transitions. [2019-12-27 21:56:03,449 INFO L78 Accepts]: Start accepts. Automaton has 10112 states and 22072 transitions. Word has length 96 [2019-12-27 21:56:03,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:56:03,450 INFO L462 AbstractCegarLoop]: Abstraction has 10112 states and 22072 transitions. [2019-12-27 21:56:03,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 21:56:03,450 INFO L276 IsEmpty]: Start isEmpty. Operand 10112 states and 22072 transitions. [2019-12-27 21:56:03,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 21:56:03,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:56:03,461 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:56:03,461 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:56:03,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:56:03,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1789224143, now seen corresponding path program 1 times [2019-12-27 21:56:03,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:56:03,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288762909] [2019-12-27 21:56:03,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:56:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:56:03,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:56:03,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288762909] [2019-12-27 21:56:03,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:56:03,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 21:56:03,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1777119013] [2019-12-27 21:56:03,795 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:56:03,814 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:56:03,953 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 241 transitions. [2019-12-27 21:56:03,953 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:56:04,220 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 21:56:04,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 21:56:04,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:56:04,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 21:56:04,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2019-12-27 21:56:04,222 INFO L87 Difference]: Start difference. First operand 10112 states and 22072 transitions. Second operand 20 states. [2019-12-27 21:56:06,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:56:06,358 INFO L93 Difference]: Finished difference Result 19442 states and 42186 transitions. [2019-12-27 21:56:06,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 21:56:06,358 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2019-12-27 21:56:06,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:56:06,372 INFO L225 Difference]: With dead ends: 19442 [2019-12-27 21:56:06,372 INFO L226 Difference]: Without dead ends: 13542 [2019-12-27 21:56:06,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=236, Invalid=1024, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 21:56:06,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13542 states. [2019-12-27 21:56:06,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13542 to 11032. [2019-12-27 21:56:06,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11032 states. [2019-12-27 21:56:06,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11032 states to 11032 states and 23982 transitions. [2019-12-27 21:56:06,497 INFO L78 Accepts]: Start accepts. Automaton has 11032 states and 23982 transitions. Word has length 97 [2019-12-27 21:56:06,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:56:06,498 INFO L462 AbstractCegarLoop]: Abstraction has 11032 states and 23982 transitions. [2019-12-27 21:56:06,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 21:56:06,498 INFO L276 IsEmpty]: Start isEmpty. Operand 11032 states and 23982 transitions. [2019-12-27 21:56:06,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 21:56:06,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:56:06,511 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:56:06,511 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:56:06,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:56:06,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1131062681, now seen corresponding path program 2 times [2019-12-27 21:56:06,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:56:06,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580717141] [2019-12-27 21:56:06,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:56:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:56:06,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:56:06,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580717141] [2019-12-27 21:56:06,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:56:06,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:56:06,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1897806515] [2019-12-27 21:56:06,645 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:56:06,671 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:56:06,918 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 200 states and 301 transitions. [2019-12-27 21:56:06,918 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:56:06,955 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:56:06,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:56:06,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:56:06,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:56:06,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:56:06,956 INFO L87 Difference]: Start difference. First operand 11032 states and 23982 transitions. Second operand 7 states. [2019-12-27 21:56:07,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:56:07,340 INFO L93 Difference]: Finished difference Result 15926 states and 34298 transitions. [2019-12-27 21:56:07,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 21:56:07,341 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-27 21:56:07,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:56:07,346 INFO L225 Difference]: With dead ends: 15926 [2019-12-27 21:56:07,346 INFO L226 Difference]: Without dead ends: 4461 [2019-12-27 21:56:07,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:56:07,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4461 states. [2019-12-27 21:56:07,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4461 to 3803. [2019-12-27 21:56:07,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3803 states. [2019-12-27 21:56:07,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3803 states to 3803 states and 7963 transitions. [2019-12-27 21:56:07,388 INFO L78 Accepts]: Start accepts. Automaton has 3803 states and 7963 transitions. Word has length 97 [2019-12-27 21:56:07,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:56:07,388 INFO L462 AbstractCegarLoop]: Abstraction has 3803 states and 7963 transitions. [2019-12-27 21:56:07,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:56:07,389 INFO L276 IsEmpty]: Start isEmpty. Operand 3803 states and 7963 transitions. [2019-12-27 21:56:07,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-27 21:56:07,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:56:07,392 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:56:07,392 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:56:07,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:56:07,392 INFO L82 PathProgramCache]: Analyzing trace with hash -560120904, now seen corresponding path program 1 times [2019-12-27 21:56:07,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:56:07,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349079013] [2019-12-27 21:56:07,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:56:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:56:07,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:56:07,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349079013] [2019-12-27 21:56:07,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:56:07,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 21:56:07,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2140102445] [2019-12-27 21:56:07,747 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:56:07,774 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:56:07,962 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 204 states and 308 transitions. [2019-12-27 21:56:07,963 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:56:07,966 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 21:56:07,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 21:56:07,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:56:07,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 21:56:07,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-12-27 21:56:07,967 INFO L87 Difference]: Start difference. First operand 3803 states and 7963 transitions. Second operand 17 states. [2019-12-27 21:56:08,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:56:08,925 INFO L93 Difference]: Finished difference Result 5575 states and 11612 transitions. [2019-12-27 21:56:08,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 21:56:08,925 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 98 [2019-12-27 21:56:08,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:56:08,932 INFO L225 Difference]: With dead ends: 5575 [2019-12-27 21:56:08,932 INFO L226 Difference]: Without dead ends: 5535 [2019-12-27 21:56:08,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2019-12-27 21:56:08,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5535 states. [2019-12-27 21:56:08,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5535 to 4189. [2019-12-27 21:56:08,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4189 states. [2019-12-27 21:56:08,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4189 states to 4189 states and 8734 transitions. [2019-12-27 21:56:08,975 INFO L78 Accepts]: Start accepts. Automaton has 4189 states and 8734 transitions. Word has length 98 [2019-12-27 21:56:08,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:56:08,975 INFO L462 AbstractCegarLoop]: Abstraction has 4189 states and 8734 transitions. [2019-12-27 21:56:08,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 21:56:08,975 INFO L276 IsEmpty]: Start isEmpty. Operand 4189 states and 8734 transitions. [2019-12-27 21:56:08,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-27 21:56:08,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:56:08,978 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:56:08,978 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:56:08,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:56:08,979 INFO L82 PathProgramCache]: Analyzing trace with hash 261378931, now seen corresponding path program 1 times [2019-12-27 21:56:08,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:56:08,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132318866] [2019-12-27 21:56:08,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:56:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:56:09,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:56:09,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132318866] [2019-12-27 21:56:09,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:56:09,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 21:56:09,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1849143513] [2019-12-27 21:56:09,252 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:56:09,279 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:56:09,416 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 200 transitions. [2019-12-27 21:56:09,416 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:56:09,452 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:56:09,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 21:56:09,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:56:09,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 21:56:09,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-12-27 21:56:09,453 INFO L87 Difference]: Start difference. First operand 4189 states and 8734 transitions. Second operand 15 states. [2019-12-27 21:56:10,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:56:10,225 INFO L93 Difference]: Finished difference Result 7129 states and 14678 transitions. [2019-12-27 21:56:10,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 21:56:10,226 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 98 [2019-12-27 21:56:10,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:56:10,233 INFO L225 Difference]: With dead ends: 7129 [2019-12-27 21:56:10,233 INFO L226 Difference]: Without dead ends: 7089 [2019-12-27 21:56:10,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2019-12-27 21:56:10,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7089 states. [2019-12-27 21:56:10,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7089 to 5420. [2019-12-27 21:56:10,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5420 states. [2019-12-27 21:56:10,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5420 states to 5420 states and 11395 transitions. [2019-12-27 21:56:10,292 INFO L78 Accepts]: Start accepts. Automaton has 5420 states and 11395 transitions. Word has length 98 [2019-12-27 21:56:10,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:56:10,292 INFO L462 AbstractCegarLoop]: Abstraction has 5420 states and 11395 transitions. [2019-12-27 21:56:10,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 21:56:10,292 INFO L276 IsEmpty]: Start isEmpty. Operand 5420 states and 11395 transitions. [2019-12-27 21:56:10,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-27 21:56:10,296 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:56:10,296 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:56:10,296 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:56:10,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:56:10,297 INFO L82 PathProgramCache]: Analyzing trace with hash 10041230, now seen corresponding path program 2 times [2019-12-27 21:56:10,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:56:10,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197820863] [2019-12-27 21:56:10,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:56:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:56:10,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:56:10,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197820863] [2019-12-27 21:56:10,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:56:10,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 21:56:10,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2082914213] [2019-12-27 21:56:10,611 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:56:10,630 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:56:10,799 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 186 states and 268 transitions. [2019-12-27 21:56:10,800 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:56:10,887 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:56:10,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 21:56:10,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:56:10,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 21:56:10,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-12-27 21:56:10,889 INFO L87 Difference]: Start difference. First operand 5420 states and 11395 transitions. Second operand 15 states. [2019-12-27 21:56:13,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:56:13,146 INFO L93 Difference]: Finished difference Result 10534 states and 21968 transitions. [2019-12-27 21:56:13,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 21:56:13,146 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 98 [2019-12-27 21:56:13,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:56:13,158 INFO L225 Difference]: With dead ends: 10534 [2019-12-27 21:56:13,158 INFO L226 Difference]: Without dead ends: 10534 [2019-12-27 21:56:13,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=277, Invalid=479, Unknown=0, NotChecked=0, Total=756 [2019-12-27 21:56:13,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10534 states. [2019-12-27 21:56:13,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10534 to 5681. [2019-12-27 21:56:13,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5681 states. [2019-12-27 21:56:13,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5681 states to 5681 states and 11984 transitions. [2019-12-27 21:56:13,235 INFO L78 Accepts]: Start accepts. Automaton has 5681 states and 11984 transitions. Word has length 98 [2019-12-27 21:56:13,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:56:13,235 INFO L462 AbstractCegarLoop]: Abstraction has 5681 states and 11984 transitions. [2019-12-27 21:56:13,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 21:56:13,236 INFO L276 IsEmpty]: Start isEmpty. Operand 5681 states and 11984 transitions. [2019-12-27 21:56:13,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-27 21:56:13,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:56:13,240 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:56:13,240 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:56:13,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:56:13,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1336468560, now seen corresponding path program 3 times [2019-12-27 21:56:13,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:56:13,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59394634] [2019-12-27 21:56:13,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:56:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:56:13,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:56:13,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59394634] [2019-12-27 21:56:13,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:56:13,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 21:56:13,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [840883509] [2019-12-27 21:56:13,595 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:56:13,616 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:56:13,778 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 258 transitions. [2019-12-27 21:56:13,778 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:56:13,877 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 21:56:13,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 21:56:13,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:56:13,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 21:56:13,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-12-27 21:56:13,878 INFO L87 Difference]: Start difference. First operand 5681 states and 11984 transitions. Second operand 16 states. [2019-12-27 21:56:15,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:56:15,906 INFO L93 Difference]: Finished difference Result 10747 states and 22317 transitions. [2019-12-27 21:56:15,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 21:56:15,906 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 98 [2019-12-27 21:56:15,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:56:15,918 INFO L225 Difference]: With dead ends: 10747 [2019-12-27 21:56:15,919 INFO L226 Difference]: Without dead ends: 10747 [2019-12-27 21:56:15,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=292, Invalid=520, Unknown=0, NotChecked=0, Total=812 [2019-12-27 21:56:15,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10747 states. [2019-12-27 21:56:15,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10747 to 5071. [2019-12-27 21:56:15,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5071 states. [2019-12-27 21:56:15,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5071 states to 5071 states and 10618 transitions. [2019-12-27 21:56:15,991 INFO L78 Accepts]: Start accepts. Automaton has 5071 states and 10618 transitions. Word has length 98 [2019-12-27 21:56:15,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:56:15,991 INFO L462 AbstractCegarLoop]: Abstraction has 5071 states and 10618 transitions. [2019-12-27 21:56:15,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 21:56:15,991 INFO L276 IsEmpty]: Start isEmpty. Operand 5071 states and 10618 transitions. [2019-12-27 21:56:15,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-27 21:56:15,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:56:15,995 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:56:15,995 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:56:15,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:56:15,996 INFO L82 PathProgramCache]: Analyzing trace with hash 379515091, now seen corresponding path program 2 times [2019-12-27 21:56:15,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:56:15,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949536263] [2019-12-27 21:56:15,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:56:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:56:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:56:16,140 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:56:16,141 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:56:16,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1385] [1385] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_48| 0 0))) (and (= v_~x~0_11 0) (= 0 v_~weak$$choice2~0_47) (= v_~y$r_buff0_thd1~0_31 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= |v_#NULL.offset_7| 0) (= 0 v_~__unbuffered_p1_EAX~0_11) (= v_~main$tmp_guard0~0_9 0) (= 0 v_~__unbuffered_p0_EAX~0_10) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd1~0_28) (= v_~y$r_buff0_thd0~0_64 0) (= 0 v_~__unbuffered_cnt~0_17) (= 0 v_~y$w_buff0~0_46) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1645~0.base_19|)) (= 0 v_~y$r_buff0_thd2~0_126) (= v_~y$w_buff1_used~0_108 0) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1645~0.base_19| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1645~0.base_19|) |v_ULTIMATE.start_main_~#t1645~0.offset_15| 0)) |v_#memory_int_9|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1645~0.base_19| 4)) (= v_~y$w_buff0_used~0_199 0) (= v_~y~0_45 0) (= 0 v_~y$r_buff1_thd0~0_37) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1645~0.base_19|) (= 0 v_~y$r_buff1_thd2~0_60) (= 0 v_~y$flush_delayed~0_23) (= 0 v_~weak$$choice0~0_11) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 |v_#NULL.base_7|) (= v_~y$mem_tmp~0_14 0) (= 0 |v_ULTIMATE.start_main_~#t1645~0.offset_15|) (= v_~main$tmp_guard1~0_15 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1645~0.base_19| 1) |v_#valid_46|) (= v_~__unbuffered_p1_EBX~0_10 0) (= 0 v_~y$w_buff1~0_45) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~nondet76=|v_ULTIMATE.start_main_#t~nondet76_7|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_13|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_13|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_9|, ULTIMATE.start_main_#t~ite96=|v_ULTIMATE.start_main_#t~ite96_11|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_9|, ULTIMATE.start_main_#t~ite94=|v_ULTIMATE.start_main_#t~ite94_12|, ~y$mem_tmp~0=v_~y$mem_tmp~0_14, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite92=|v_ULTIMATE.start_main_#t~ite92_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ULTIMATE.start_main_~#t1645~0.base=|v_ULTIMATE.start_main_~#t1645~0.base_19|, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_11|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_31, ~y$flush_delayed~0=v_~y$flush_delayed~0_23, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet68=|v_ULTIMATE.start_main_#t~nondet68_7|, ULTIMATE.start_main_~#t1645~0.offset=|v_ULTIMATE.start_main_~#t1645~0.offset_15|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_12|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_11|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_12|, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_11|, ~y$w_buff1~0=v_~y$w_buff1~0_45, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_14|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_126, ULTIMATE.start_main_~#t1646~0.offset=|v_ULTIMATE.start_main_~#t1646~0.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_37, ~x~0=v_~x~0_11, ULTIMATE.start_main_#t~nondet75=|v_ULTIMATE.start_main_#t~nondet75_7|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_11|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_12|, ULTIMATE.start_main_~#t1646~0.base=|v_ULTIMATE.start_main_~#t1646~0.base_17|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_13|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_9|, ULTIMATE.start_main_#t~ite95=|v_ULTIMATE.start_main_#t~ite95_13|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_28, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_9|, ULTIMATE.start_main_#t~ite93=|v_ULTIMATE.start_main_#t~ite93_11|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_11|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_12|, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_45, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_11|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_17|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_12|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_60, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_12|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_12|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_9|, ~weak$$choice2~0=v_~weak$$choice2~0_47, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_108} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet76, #NULL.offset, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite73, ULTIMATE.start_main_#t~ite96, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ULTIMATE.start_main_#t~ite94, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_#t~ite92, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1645~0.base, ULTIMATE.start_main_#t~ite90, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet68, ULTIMATE.start_main_~#t1645~0.offset, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite80, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_~#t1646~0.offset, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_#t~nondet75, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_~#t1646~0.base, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite74, ULTIMATE.start_main_#t~ite95, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite93, ULTIMATE.start_main_#t~ite70, ULTIMATE.start_main_#t~ite91, ~y$w_buff0~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet67, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite78, #NULL.base, ULTIMATE.start_main_#t~ite97, ULTIMATE.start_main_#t~ite85, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 21:56:16,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1350] [1350] L822-1-->L824: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1646~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1646~0.base_11|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1646~0.base_11| 4)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1646~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1646~0.base_11|) |v_ULTIMATE.start_main_~#t1646~0.offset_10| 1)) |v_#memory_int_5|) (not (= 0 |v_ULTIMATE.start_main_~#t1646~0.base_11|)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1646~0.base_11|)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1646~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_6|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~#t1646~0.offset=|v_ULTIMATE.start_main_~#t1646~0.offset_10|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1646~0.base=|v_ULTIMATE.start_main_~#t1646~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet67, #valid, #memory_int, ULTIMATE.start_main_~#t1646~0.offset, #length, ULTIMATE.start_main_~#t1646~0.base] because there is no mapped edge [2019-12-27 21:56:16,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1320] [1320] L729-2-->L729-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out-1964094332| |P0Thread1of1ForFork0_#t~ite3_Out-1964094332|)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-1964094332 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1964094332 256) 0))) (or (and (= ~y$w_buff1~0_In-1964094332 |P0Thread1of1ForFork0_#t~ite3_Out-1964094332|) .cse0 (not .cse1) (not .cse2)) (and .cse0 (or .cse2 .cse1) (= ~y~0_In-1964094332 |P0Thread1of1ForFork0_#t~ite3_Out-1964094332|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1964094332, ~y$w_buff1~0=~y$w_buff1~0_In-1964094332, ~y~0=~y~0_In-1964094332, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1964094332} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1964094332, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1964094332|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-1964094332|, ~y$w_buff1~0=~y$w_buff1~0_In-1964094332, ~y~0=~y~0_In-1964094332, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1964094332} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 21:56:16,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1302] [1302] L730-->L730-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In1428262090 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1428262090 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1428262090| 0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out1428262090| ~y$w_buff0_used~0_In1428262090) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1428262090, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1428262090} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1428262090|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1428262090, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1428262090} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 21:56:16,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1298] [1298] L731-->L731-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1298686754 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In1298686754 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1298686754 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In1298686754 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out1298686754| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1298686754 |P0Thread1of1ForFork0_#t~ite6_Out1298686754|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1298686754, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1298686754, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1298686754, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1298686754} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1298686754|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1298686754, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1298686754, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1298686754, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1298686754} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 21:56:16,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1330] [1330] L732-->L732-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In161340881 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In161340881 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In161340881 |P0Thread1of1ForFork0_#t~ite7_Out161340881|)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out161340881|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In161340881, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In161340881} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In161340881, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out161340881|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In161340881} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 21:56:16,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1295] [1295] L733-->L733-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In1052995017 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1052995017 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1052995017 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In1052995017 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out1052995017| ~y$r_buff1_thd1~0_In1052995017) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out1052995017| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1052995017, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1052995017, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1052995017, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1052995017} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1052995017, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1052995017, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1052995017|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1052995017, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1052995017} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 21:56:16,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1314] [1314] L739-2-->L739-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite9_Out1354883325| |P0Thread1of1ForFork0_#t~ite10_Out1354883325|)) (.cse2 (= (mod ~y$w_buff1_used~0_In1354883325 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In1354883325 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= ~y~0_In1354883325 |P0Thread1of1ForFork0_#t~ite9_Out1354883325|)) (and (= |P0Thread1of1ForFork0_#t~ite9_Out1354883325| ~y$w_buff1~0_In1354883325) .cse0 (not .cse2) (not .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1354883325, ~y$w_buff1~0=~y$w_buff1~0_In1354883325, ~y~0=~y~0_In1354883325, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1354883325} OutVars{P0Thread1of1ForFork0_#t~ite10=|P0Thread1of1ForFork0_#t~ite10_Out1354883325|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1354883325, P0Thread1of1ForFork0_#t~ite9=|P0Thread1of1ForFork0_#t~ite9_Out1354883325|, ~y$w_buff1~0=~y$w_buff1~0_In1354883325, ~y~0=~y~0_In1354883325, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1354883325} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite10, P0Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 21:56:16,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1261] [1261] P1ENTRY-->L4-3: Formula: (and (= 1 v_~x~0_5) (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= 1 v_~y$w_buff0~0_34) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= v_~y$w_buff0_used~0_162 1) (= v_~y$w_buff0~0_35 v_~y$w_buff1~0_32) (= v_~y$w_buff1_used~0_93 v_~y$w_buff0_used~0_163) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= 0 (mod v_~y$w_buff1_used~0_93 256))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, ~y$w_buff0~0=v_~y$w_buff0~0_35, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_162, ~y$w_buff1~0=v_~y$w_buff1~0_32, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~y$w_buff0~0=v_~y$w_buff0~0_34, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x~0=v_~x~0_5, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} 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, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 21:56:16,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1328] [1328] L771-2-->L771-4: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In688600690 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In688600690 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite17_Out688600690| ~y$w_buff0~0_In688600690)) (and (or .cse0 .cse1) (= ~y$w_buff1~0_In688600690 |P1Thread1of1ForFork1_#t~ite17_Out688600690|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In688600690, ~y$w_buff1~0=~y$w_buff1~0_In688600690, ~y$w_buff0~0=~y$w_buff0~0_In688600690, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In688600690} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In688600690, ~y$w_buff1~0=~y$w_buff1~0_In688600690, ~y$w_buff0~0=~y$w_buff0~0_In688600690, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In688600690, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out688600690|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 21:56:16,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1231] [1231] L771-4-->L772: Formula: (= v_~y~0_28 |v_P1Thread1of1ForFork1_#t~ite17_8|) InVars {P1Thread1of1ForFork1_#t~ite17=|v_P1Thread1of1ForFork1_#t~ite17_8|} OutVars{P1Thread1of1ForFork1_#t~ite18=|v_P1Thread1of1ForFork1_#t~ite18_7|, ~y~0=v_~y~0_28, P1Thread1of1ForFork1_#t~ite17=|v_P1Thread1of1ForFork1_#t~ite17_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, ~y~0, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 21:56:16,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1292] [1292] L776-->L777: Formula: (and (not (= (mod v_~weak$$choice2~0_43 256) 0)) (= v_~y$r_buff0_thd2~0_106 v_~y$r_buff0_thd2~0_105)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_106, ~weak$$choice2~0=v_~weak$$choice2~0_43} OutVars{P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_9|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_105, P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_10|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_8|, ~weak$$choice2~0=v_~weak$$choice2~0_43} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 21:56:16,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1312] [1312] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-2119180314 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-2119180314| ~y$mem_tmp~0_In-2119180314) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-2119180314| ~y~0_In-2119180314) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-2119180314, ~y$flush_delayed~0=~y$flush_delayed~0_In-2119180314, ~y~0=~y~0_In-2119180314} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-2119180314, ~y$flush_delayed~0=~y$flush_delayed~0_In-2119180314, ~y~0=~y~0_In-2119180314, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-2119180314|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 21:56:16,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1306] [1306] L787-2-->L787-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork1_#t~ite41_Out-1536278314| |P1Thread1of1ForFork1_#t~ite40_Out-1536278314|)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1536278314 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1536278314 256)))) (or (and (not .cse0) .cse1 (= |P1Thread1of1ForFork1_#t~ite40_Out-1536278314| ~y$w_buff0~0_In-1536278314) (not .cse2)) (and (= |P1Thread1of1ForFork1_#t~ite40_Out-1536278314| ~y$w_buff1~0_In-1536278314) .cse1 (or .cse0 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1536278314, ~y$w_buff1~0=~y$w_buff1~0_In-1536278314, ~y$w_buff0~0=~y$w_buff0~0_In-1536278314, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1536278314} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1536278314, ~y$w_buff1~0=~y$w_buff1~0_In-1536278314, P1Thread1of1ForFork1_#t~ite41=|P1Thread1of1ForFork1_#t~ite41_Out-1536278314|, P1Thread1of1ForFork1_#t~ite40=|P1Thread1of1ForFork1_#t~ite40_Out-1536278314|, ~y$w_buff0~0=~y$w_buff0~0_In-1536278314, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1536278314} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite41, P1Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-27 21:56:16,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1227] [1227] L792-->L793: Formula: (and (= v_~y$r_buff0_thd2~0_81 v_~y$r_buff0_thd2~0_80) (not (= (mod v_~weak$$choice2~0_41 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_81, ~weak$$choice2~0=v_~weak$$choice2~0_41} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_80, P1Thread1of1ForFork1_#t~ite56=|v_P1Thread1of1ForFork1_#t~ite56_9|, P1Thread1of1ForFork1_#t~ite55=|v_P1Thread1of1ForFork1_#t~ite55_11|, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_10|, ~weak$$choice2~0=v_~weak$$choice2~0_41} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite56, P1Thread1of1ForFork1_#t~ite55, P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-27 21:56:16,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1321] [1321] L795-->L795-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1606758256 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite60_Out1606758256| ~y$mem_tmp~0_In1606758256) (not .cse0)) (and (= ~y~0_In1606758256 |P1Thread1of1ForFork1_#t~ite60_Out1606758256|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1606758256, ~y$flush_delayed~0=~y$flush_delayed~0_In1606758256, ~y~0=~y~0_In1606758256} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1606758256, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out1606758256|, ~y$flush_delayed~0=~y$flush_delayed~0_In1606758256, ~y~0=~y~0_In1606758256} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-27 21:56:16,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1313] [1313] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1876745935 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1876745935 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1876745935 |P1Thread1of1ForFork1_#t~ite63_Out-1876745935|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite63_Out-1876745935|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1876745935, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1876745935} OutVars{P1Thread1of1ForFork1_#t~ite63=|P1Thread1of1ForFork1_#t~ite63_Out-1876745935|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1876745935, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1876745935} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite63] because there is no mapped edge [2019-12-27 21:56:16,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1297] [1297] L740-->L740-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1025541973 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1025541973 256) 0))) (or (and (= ~y$w_buff0_used~0_In1025541973 |P0Thread1of1ForFork0_#t~ite11_Out1025541973|) (or .cse0 .cse1)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite11_Out1025541973| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1025541973, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1025541973} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out1025541973|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1025541973, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1025541973} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 21:56:16,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1337] [1337] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1541739473 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1541739473 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In1541739473 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1541739473 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1541739473 |P1Thread1of1ForFork1_#t~ite64_Out1541739473|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite64_Out1541739473|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1541739473, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1541739473, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1541739473, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1541739473} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1541739473, P1Thread1of1ForFork1_#t~ite64=|P1Thread1of1ForFork1_#t~ite64_Out1541739473|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1541739473, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1541739473, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1541739473} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite64] because there is no mapped edge [2019-12-27 21:56:16,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1316] [1316] L802-->L803: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In46669188 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In46669188 256)))) (or (and (= ~y$r_buff0_thd2~0_Out46669188 0) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd2~0_Out46669188 ~y$r_buff0_thd2~0_In46669188) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In46669188, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In46669188} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In46669188, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out46669188, P1Thread1of1ForFork1_#t~ite65=|P1Thread1of1ForFork1_#t~ite65_Out46669188|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite65] because there is no mapped edge [2019-12-27 21:56:16,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1325] [1325] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1601986365 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1601986365 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In1601986365 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1601986365 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite66_Out1601986365| ~y$r_buff1_thd2~0_In1601986365) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite66_Out1601986365|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1601986365, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1601986365, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1601986365, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1601986365} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1601986365, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1601986365, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1601986365, P1Thread1of1ForFork1_#t~ite66=|P1Thread1of1ForFork1_#t~ite66_Out1601986365|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1601986365} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite66] because there is no mapped edge [2019-12-27 21:56:16,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1355] [1355] L803-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_53 |v_P1Thread1of1ForFork1_#t~ite66_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#t~ite66=|v_P1Thread1of1ForFork1_#t~ite66_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_53, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite66=|v_P1Thread1of1ForFork1_#t~ite66_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite66, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 21:56:16,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1310] [1310] L741-->L741-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-796731940 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-796731940 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-796731940 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-796731940 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite12_Out-796731940| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite12_Out-796731940| ~y$w_buff1_used~0_In-796731940) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-796731940, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-796731940, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-796731940, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-796731940} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-796731940, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-796731940, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-796731940, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out-796731940|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-796731940} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 21:56:16,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1304] [1304] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1614383748 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1614383748 256) 0))) (or (and (= ~y$r_buff0_thd1~0_In-1614383748 |P0Thread1of1ForFork0_#t~ite13_Out-1614383748|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite13_Out-1614383748|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1614383748, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1614383748} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1614383748, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1614383748, P0Thread1of1ForFork0_#t~ite13=|P0Thread1of1ForFork0_#t~ite13_Out-1614383748|} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 21:56:16,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1338] [1338] L743-->L743-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In842861983 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In842861983 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In842861983 256))) (.cse3 (= (mod ~y$r_buff1_thd1~0_In842861983 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite14_Out842861983| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite14_Out842861983| ~y$r_buff1_thd1~0_In842861983) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In842861983, ~y$w_buff0_used~0=~y$w_buff0_used~0_In842861983, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In842861983, ~y$w_buff1_used~0=~y$w_buff1_used~0_In842861983} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In842861983, ~y$w_buff0_used~0=~y$w_buff0_used~0_In842861983, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In842861983, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_Out842861983|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In842861983} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 21:56:16,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1340] [1340] L743-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_23 |v_P0Thread1of1ForFork0_#t~ite14_8|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P0Thread1of1ForFork0_#t~ite14=|v_P0Thread1of1ForFork0_#t~ite14_8|} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P0Thread1of1ForFork0_#t~ite14=|v_P0Thread1of1ForFork0_#t~ite14_7|} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 21:56:16,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1274] [1274] L824-1-->L830: Formula: (and (= v_~__unbuffered_cnt~0_8 2) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{ULTIMATE.start_main_#t~nondet68=|v_ULTIMATE.start_main_#t~nondet68_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet68, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 21:56:16,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1336] [1336] L830-2-->L830-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1031799257 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1031799257 256) 0))) (or (and (= ~y~0_In-1031799257 |ULTIMATE.start_main_#t~ite69_Out-1031799257|) (or .cse0 .cse1)) (and (not .cse0) (= ~y$w_buff1~0_In-1031799257 |ULTIMATE.start_main_#t~ite69_Out-1031799257|) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1031799257, ~y~0=~y~0_In-1031799257, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1031799257, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1031799257} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1031799257, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out-1031799257|, ~y~0=~y~0_In-1031799257, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1031799257, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1031799257} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite69] because there is no mapped edge [2019-12-27 21:56:16,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1254] [1254] L830-4-->L831: Formula: (= v_~y~0_32 |v_ULTIMATE.start_main_#t~ite69_8|) InVars {ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_8|} OutVars{ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_7|, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_7|, ~y~0=v_~y~0_32} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite70, ULTIMATE.start_main_#t~ite69, ~y~0] because there is no mapped edge [2019-12-27 21:56:16,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1311] [1311] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1746683729 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1746683729 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite71_Out1746683729| ~y$w_buff0_used~0_In1746683729)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite71_Out1746683729| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1746683729, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1746683729} OutVars{ULTIMATE.start_main_#t~ite71=|ULTIMATE.start_main_#t~ite71_Out1746683729|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1746683729, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1746683729} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite71] because there is no mapped edge [2019-12-27 21:56:16,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1335] [1335] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1020553881 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1020553881 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-1020553881 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1020553881 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1020553881 |ULTIMATE.start_main_#t~ite72_Out-1020553881|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite72_Out-1020553881|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1020553881, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1020553881, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1020553881, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1020553881} OutVars{ULTIMATE.start_main_#t~ite72=|ULTIMATE.start_main_#t~ite72_Out-1020553881|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1020553881, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1020553881, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1020553881, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1020553881} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite72] because there is no mapped edge [2019-12-27 21:56:16,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1300] [1300] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2071946183 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-2071946183 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In-2071946183 |ULTIMATE.start_main_#t~ite73_Out-2071946183|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite73_Out-2071946183|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2071946183, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2071946183} OutVars{ULTIMATE.start_main_#t~ite73=|ULTIMATE.start_main_#t~ite73_Out-2071946183|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2071946183, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2071946183} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite73] because there is no mapped edge [2019-12-27 21:56:16,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1332] [1332] L834-->L834-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1959086655 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1959086655 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1959086655 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1959086655 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite74_Out-1959086655|)) (and (= |ULTIMATE.start_main_#t~ite74_Out-1959086655| ~y$r_buff1_thd0~0_In-1959086655) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1959086655, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1959086655, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1959086655, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1959086655} OutVars{ULTIMATE.start_main_#t~ite74=|ULTIMATE.start_main_#t~ite74_Out-1959086655|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1959086655, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1959086655, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1959086655, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1959086655} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite74] because there is no mapped edge [2019-12-27 21:56:16,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1296] [1296] L849-->L849-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1858166689 256) 0))) (or (and .cse0 (= ~y~0_In-1858166689 |ULTIMATE.start_main_#t~ite97_Out-1858166689|)) (and (not .cse0) (= ~y$mem_tmp~0_In-1858166689 |ULTIMATE.start_main_#t~ite97_Out-1858166689|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1858166689, ~y$flush_delayed~0=~y$flush_delayed~0_In-1858166689, ~y~0=~y~0_In-1858166689} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1858166689, ~y$flush_delayed~0=~y$flush_delayed~0_In-1858166689, ~y~0=~y~0_In-1858166689, ULTIMATE.start_main_#t~ite97=|ULTIMATE.start_main_#t~ite97_Out-1858166689|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite97] because there is no mapped edge [2019-12-27 21:56:16,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1379] [1379] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= 0 v_~y$flush_delayed~0_18) (= v_~y~0_41 |v_ULTIMATE.start_main_#t~ite97_12|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_11 256))) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_12|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~y$flush_delayed~0=v_~y$flush_delayed~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~y~0=v_~y~0_41, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite97] because there is no mapped edge [2019-12-27 21:56:16,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:56:16 BasicIcfg [2019-12-27 21:56:16,278 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:56:16,279 INFO L168 Benchmark]: Toolchain (without parser) took 99455.90 ms. Allocated memory was 137.9 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 101.0 MB in the beginning and 767.5 MB in the end (delta: -666.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 21:56:16,280 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 21:56:16,280 INFO L168 Benchmark]: CACSL2BoogieTranslator took 874.81 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 101.0 MB in the beginning and 153.0 MB in the end (delta: -52.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:56:16,281 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.69 ms. Allocated memory is still 202.4 MB. Free memory was 153.0 MB in the beginning and 149.1 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:56:16,281 INFO L168 Benchmark]: Boogie Preprocessor took 44.99 ms. Allocated memory is still 202.4 MB. Free memory was 149.1 MB in the beginning and 146.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:56:16,282 INFO L168 Benchmark]: RCFGBuilder took 1194.05 ms. Allocated memory was 202.4 MB in the beginning and 234.4 MB in the end (delta: 32.0 MB). Free memory was 146.1 MB in the beginning and 189.8 MB in the end (delta: -43.6 MB). Peak memory consumption was 66.2 MB. Max. memory is 7.1 GB. [2019-12-27 21:56:16,282 INFO L168 Benchmark]: TraceAbstraction took 97247.53 ms. Allocated memory was 234.4 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 189.8 MB in the beginning and 767.5 MB in the end (delta: -577.7 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 21:56:16,285 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 874.81 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 101.0 MB in the beginning and 153.0 MB in the end (delta: -52.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 86.69 ms. Allocated memory is still 202.4 MB. Free memory was 153.0 MB in the beginning and 149.1 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.99 ms. Allocated memory is still 202.4 MB. Free memory was 149.1 MB in the beginning and 146.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1194.05 ms. Allocated memory was 202.4 MB in the beginning and 234.4 MB in the end (delta: 32.0 MB). Free memory was 146.1 MB in the beginning and 189.8 MB in the end (delta: -43.6 MB). Peak memory consumption was 66.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 97247.53 ms. Allocated memory was 234.4 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 189.8 MB in the beginning and 767.5 MB in the end (delta: -577.7 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.5s, 244 ProgramPointsBefore, 159 ProgramPointsAfterwards, 326 TransitionsBefore, 198 TransitionsAfterwards, 49222 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 76 ConcurrentYvCompositions, 46 ChoiceCompositions, 15325 VarBasedMoverChecksPositive, 324 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 300794 CheckedPairsTotal, 136 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1645, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L726] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=0, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L729] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __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=0, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L824] FCALL, FORK 0 pthread_create(&t1646, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=0, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L729] 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) [L730] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L731] 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 [L732] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L733] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L736] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=0, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L739] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __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=0, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L761] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L762] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L763] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L764] 2 y$r_buff0_thd2 = (_Bool)1 [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L771] 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L772] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, 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=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L772] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, 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=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L773] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, 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=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L774] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, 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=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L775] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, 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=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L777] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=3, weak$$choice2=1, x=1, y=1, 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=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L779] 2 y = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$flush_delayed = (_Bool)0 [L783] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 2 y$flush_delayed = weak$$choice2 [L786] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=2, 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=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L787] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=2, 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=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L787] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L788] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=2, weak$$choice2=1, x=1, y=1, 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=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L788] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L789] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=2, weak$$choice2=1, x=1, y=1, 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=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L789] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L790] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=2, weak$$choice2=1, x=1, y=1, 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=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L790] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L791] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=2, weak$$choice2=1, x=1, y=1, 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=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L791] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=2, weak$$choice2=1, x=1, y=1, 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=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L793] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L794] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, 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=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L795] 2 y = y$flush_delayed ? y$mem_tmp : y [L796] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, 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=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L799] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, 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=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L799] 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) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L739] 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) [L801] 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 [L740] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L741] 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 [L742] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L830] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L831] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L832] 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 [L833] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L834] 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 [L837] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L838] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L839] 0 y$flush_delayed = weak$$choice2 [L840] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L841] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L841] 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) [L842] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L842] 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)) [L843] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L843] 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)) [L844] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L844] 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)) [L845] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L845] 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)) [L846] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L846] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L847] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L847] 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)) [L848] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 238 locations, 2 error locations. Result: UNSAFE, OverallTime: 96.8s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 53.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8965 SDtfs, 19653 SDslu, 42478 SDs, 0 SdLazy, 33880 SolverSat, 2200 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 31.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 737 GetRequests, 205 SyntacticMatches, 68 SemanticMatches, 464 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3261 ImplicationChecksByTransitivity, 10.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135155occurred 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: 16.7s AutomataMinimizationTime, 26 MinimizatonAttempts, 89563 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 2190 NumberOfCodeBlocks, 2190 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2066 ConstructedInterpolants, 0 QuantifiedInterpolants, 806605 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...