/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi010_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:54:45,663 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:54:45,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:54:45,682 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:54:45,683 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:54:45,685 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:54:45,686 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:54:45,696 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:54:45,698 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:54:45,700 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:54:45,702 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:54:45,703 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:54:45,704 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:54:45,707 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:54:45,708 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:54:45,710 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:54:45,712 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:54:45,714 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:54:45,716 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:54:45,721 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:54:45,726 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:54:45,728 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:54:45,729 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:54:45,731 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:54:45,733 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:54:45,733 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:54:45,734 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:54:45,736 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:54:45,737 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:54:45,738 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:54:45,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:54:45,739 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:54:45,740 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:54:45,742 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:54:45,743 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:54:45,743 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:54:45,744 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:54:45,744 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:54:45,744 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:54:45,747 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:54:45,748 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:54:45,749 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:54:45,768 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:54:45,768 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:54:45,770 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:54:45,771 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:54:45,771 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:54:45,771 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:54:45,771 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:54:45,772 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:54:45,772 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:54:45,772 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:54:45,773 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:54:45,773 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:54:45,774 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:54:45,774 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:54:45,774 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:54:45,775 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:54:45,775 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:54:45,775 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:54:45,775 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:54:45,775 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:54:45,776 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:54:45,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:54:45,776 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:54:45,776 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:54:45,776 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:54:45,777 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:54:45,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:54:45,777 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:54:45,777 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:54:45,777 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:54:45,779 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:54:46,048 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:54:46,067 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:54:46,071 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:54:46,072 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:54:46,072 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:54:46,073 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi010_rmo.opt.i [2019-12-27 17:54:46,136 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e185ee82/eb40c01daa95415082e19dcadd9c8dec/FLAG0283852c7 [2019-12-27 17:54:46,666 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:54:46,666 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi010_rmo.opt.i [2019-12-27 17:54:46,684 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e185ee82/eb40c01daa95415082e19dcadd9c8dec/FLAG0283852c7 [2019-12-27 17:54:46,947 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e185ee82/eb40c01daa95415082e19dcadd9c8dec [2019-12-27 17:54:46,955 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:54:46,957 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:54:46,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:54:46,958 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:54:46,961 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:54:46,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:54:46" (1/1) ... [2019-12-27 17:54:46,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52b0d5ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:46, skipping insertion in model container [2019-12-27 17:54:46,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:54:46" (1/1) ... [2019-12-27 17:54:46,970 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:54:47,026 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:54:47,520 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:54:47,534 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:54:47,592 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:54:47,676 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:54:47,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:47 WrapperNode [2019-12-27 17:54:47,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:54:47,677 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:54:47,677 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:54:47,677 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:54:47,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:47" (1/1) ... [2019-12-27 17:54:47,707 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:47" (1/1) ... [2019-12-27 17:54:47,744 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:54:47,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:54:47,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:54:47,745 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:54:47,754 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:47" (1/1) ... [2019-12-27 17:54:47,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:47" (1/1) ... [2019-12-27 17:54:47,760 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:47" (1/1) ... [2019-12-27 17:54:47,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:47" (1/1) ... [2019-12-27 17:54:47,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:47" (1/1) ... [2019-12-27 17:54:47,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:47" (1/1) ... [2019-12-27 17:54:47,779 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:47" (1/1) ... [2019-12-27 17:54:47,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:54:47,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:54:47,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:54:47,785 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:54:47,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:47" (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 17:54:47,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:54:47,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:54:47,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:54:47,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:54:47,849 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:54:47,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:54:47,849 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:54:47,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:54:47,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:54:47,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:54:47,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:54:47,851 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 17:54:48,593 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:54:48,594 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:54:48,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:54:48 BoogieIcfgContainer [2019-12-27 17:54:48,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:54:48,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:54:48,598 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:54:48,601 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:54:48,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:54:46" (1/3) ... [2019-12-27 17:54:48,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6807167e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:54:48, skipping insertion in model container [2019-12-27 17:54:48,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:47" (2/3) ... [2019-12-27 17:54:48,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6807167e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:54:48, skipping insertion in model container [2019-12-27 17:54:48,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:54:48" (3/3) ... [2019-12-27 17:54:48,609 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi010_rmo.opt.i [2019-12-27 17:54:48,620 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:54:48,620 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:54:48,631 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:54:48,632 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:54:48,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,695 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,695 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,721 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,721 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,722 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,722 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,722 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,748 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,750 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,757 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,758 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,760 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:54:48,776 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 17:54:48,796 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:54:48,796 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:54:48,796 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:54:48,796 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:54:48,796 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:54:48,796 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:54:48,797 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:54:48,797 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:54:48,816 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 227 transitions [2019-12-27 17:54:48,819 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 227 transitions [2019-12-27 17:54:48,960 INFO L132 PetriNetUnfolder]: 56/225 cut-off events. [2019-12-27 17:54:48,961 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:54:48,978 INFO L76 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 225 events. 56/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 552 event pairs. 0/167 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-27 17:54:49,004 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 227 transitions [2019-12-27 17:54:49,061 INFO L132 PetriNetUnfolder]: 56/225 cut-off events. [2019-12-27 17:54:49,061 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:54:49,071 INFO L76 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 225 events. 56/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 552 event pairs. 0/167 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-27 17:54:49,097 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-27 17:54:49,099 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:54:53,864 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 17:54:53,988 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 17:54:54,111 INFO L206 etLargeBlockEncoding]: Checked pairs total: 121847 [2019-12-27 17:54:54,111 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-27 17:54:54,119 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 102 places, 126 transitions [2019-12-27 17:54:55,554 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 23697 states. [2019-12-27 17:54:55,556 INFO L276 IsEmpty]: Start isEmpty. Operand 23697 states. [2019-12-27 17:54:55,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 17:54:55,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:54:55,562 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 17:54:55,563 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:54:55,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:54:55,568 INFO L82 PathProgramCache]: Analyzing trace with hash 960453199, now seen corresponding path program 1 times [2019-12-27 17:54:55,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:54:55,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023784559] [2019-12-27 17:54:55,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:54:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:54:55,861 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 17:54:55,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023784559] [2019-12-27 17:54:55,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:54:55,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:54:55,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2039584362] [2019-12-27 17:54:55,866 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:54:55,872 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:54:55,886 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 17:54:55,886 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:54:55,890 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:54:55,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:54:55,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:54:55,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:54:55,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:54:55,907 INFO L87 Difference]: Start difference. First operand 23697 states. Second operand 3 states. [2019-12-27 17:54:56,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:54:56,482 INFO L93 Difference]: Finished difference Result 23505 states and 84597 transitions. [2019-12-27 17:54:56,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:54:56,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 17:54:56,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:54:56,692 INFO L225 Difference]: With dead ends: 23505 [2019-12-27 17:54:56,692 INFO L226 Difference]: Without dead ends: 22000 [2019-12-27 17:54:56,694 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 17:54:57,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22000 states. [2019-12-27 17:54:58,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22000 to 22000. [2019-12-27 17:54:58,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22000 states. [2019-12-27 17:54:58,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22000 states to 22000 states and 79119 transitions. [2019-12-27 17:54:58,751 INFO L78 Accepts]: Start accepts. Automaton has 22000 states and 79119 transitions. Word has length 5 [2019-12-27 17:54:58,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:54:58,751 INFO L462 AbstractCegarLoop]: Abstraction has 22000 states and 79119 transitions. [2019-12-27 17:54:58,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:54:58,752 INFO L276 IsEmpty]: Start isEmpty. Operand 22000 states and 79119 transitions. [2019-12-27 17:54:58,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:54:58,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:54:58,756 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:54:58,756 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:54:58,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:54:58,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1767797629, now seen corresponding path program 1 times [2019-12-27 17:54:58,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:54:58,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117970255] [2019-12-27 17:54:58,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:54:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:54:58,928 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 17:54:58,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117970255] [2019-12-27 17:54:58,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:54:58,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:54:58,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1434266822] [2019-12-27 17:54:58,930 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:54:58,931 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:54:58,934 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:54:58,935 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:54:58,935 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:54:58,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:54:58,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:54:58,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:54:58,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:54:58,937 INFO L87 Difference]: Start difference. First operand 22000 states and 79119 transitions. Second operand 4 states. [2019-12-27 17:54:59,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:54:59,817 INFO L93 Difference]: Finished difference Result 34136 states and 117485 transitions. [2019-12-27 17:54:59,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:54:59,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:54:59,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:54:59,966 INFO L225 Difference]: With dead ends: 34136 [2019-12-27 17:54:59,966 INFO L226 Difference]: Without dead ends: 34120 [2019-12-27 17:54:59,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:55:01,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34120 states. [2019-12-27 17:55:02,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34120 to 32747. [2019-12-27 17:55:02,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32747 states. [2019-12-27 17:55:02,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32747 states to 32747 states and 113702 transitions. [2019-12-27 17:55:02,578 INFO L78 Accepts]: Start accepts. Automaton has 32747 states and 113702 transitions. Word has length 11 [2019-12-27 17:55:02,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:55:02,578 INFO L462 AbstractCegarLoop]: Abstraction has 32747 states and 113702 transitions. [2019-12-27 17:55:02,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:55:02,579 INFO L276 IsEmpty]: Start isEmpty. Operand 32747 states and 113702 transitions. [2019-12-27 17:55:02,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 17:55:02,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:55:02,586 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:55:02,587 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:55:02,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:55:02,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1354653160, now seen corresponding path program 1 times [2019-12-27 17:55:02,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:55:02,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759503335] [2019-12-27 17:55:02,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:55:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:55:02,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:55:02,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759503335] [2019-12-27 17:55:02,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:55:02,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:55:02,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [239949816] [2019-12-27 17:55:02,726 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:55:02,728 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:55:02,735 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 17:55:02,735 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:55:02,804 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:55:02,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:55:02,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:55:02,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:55:02,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:55:02,806 INFO L87 Difference]: Start difference. First operand 32747 states and 113702 transitions. Second operand 5 states. [2019-12-27 17:55:03,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:55:03,405 INFO L93 Difference]: Finished difference Result 42448 states and 144693 transitions. [2019-12-27 17:55:03,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:55:03,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 17:55:03,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:55:03,579 INFO L225 Difference]: With dead ends: 42448 [2019-12-27 17:55:03,580 INFO L226 Difference]: Without dead ends: 42433 [2019-12-27 17:55:03,580 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 17:55:04,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42433 states. [2019-12-27 17:55:05,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42433 to 37509. [2019-12-27 17:55:05,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37509 states. [2019-12-27 17:55:05,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37509 states to 37509 states and 129444 transitions. [2019-12-27 17:55:05,517 INFO L78 Accepts]: Start accepts. Automaton has 37509 states and 129444 transitions. Word has length 14 [2019-12-27 17:55:05,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:55:05,518 INFO L462 AbstractCegarLoop]: Abstraction has 37509 states and 129444 transitions. [2019-12-27 17:55:05,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:55:05,519 INFO L276 IsEmpty]: Start isEmpty. Operand 37509 states and 129444 transitions. [2019-12-27 17:55:05,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:55:05,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:55:05,524 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:55:05,524 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:55:05,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:55:05,525 INFO L82 PathProgramCache]: Analyzing trace with hash 287658910, now seen corresponding path program 1 times [2019-12-27 17:55:05,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:55:05,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458554133] [2019-12-27 17:55:05,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:55:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:55:05,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 17:55:05,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458554133] [2019-12-27 17:55:05,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:55:05,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:55:05,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [66824262] [2019-12-27 17:55:05,566 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:55:05,568 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:55:05,570 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 18 transitions. [2019-12-27 17:55:05,570 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:55:05,570 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:55:05,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:55:05,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:55:05,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:55:05,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:55:05,571 INFO L87 Difference]: Start difference. First operand 37509 states and 129444 transitions. Second operand 3 states. [2019-12-27 17:55:05,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:55:05,754 INFO L93 Difference]: Finished difference Result 35330 states and 121730 transitions. [2019-12-27 17:55:05,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:55:05,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 17:55:05,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:55:05,967 INFO L225 Difference]: With dead ends: 35330 [2019-12-27 17:55:05,967 INFO L226 Difference]: Without dead ends: 35330 [2019-12-27 17:55:05,968 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 17:55:06,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35330 states. [2019-12-27 17:55:08,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35330 to 35330. [2019-12-27 17:55:08,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35330 states. [2019-12-27 17:55:08,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35330 states to 35330 states and 121730 transitions. [2019-12-27 17:55:08,691 INFO L78 Accepts]: Start accepts. Automaton has 35330 states and 121730 transitions. Word has length 16 [2019-12-27 17:55:08,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:55:08,691 INFO L462 AbstractCegarLoop]: Abstraction has 35330 states and 121730 transitions. [2019-12-27 17:55:08,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:55:08,692 INFO L276 IsEmpty]: Start isEmpty. Operand 35330 states and 121730 transitions. [2019-12-27 17:55:08,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 17:55:08,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:55:08,704 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] [2019-12-27 17:55:08,704 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:55:08,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:55:08,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1416377548, now seen corresponding path program 1 times [2019-12-27 17:55:08,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:55:08,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015418001] [2019-12-27 17:55:08,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:55:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:55:08,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 17:55:08,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015418001] [2019-12-27 17:55:08,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:55:08,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:55:08,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [848856046] [2019-12-27 17:55:08,796 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:55:08,799 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:55:08,807 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 98 transitions. [2019-12-27 17:55:08,810 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:55:08,811 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:55:08,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:55:08,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:55:08,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:55:08,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:55:08,812 INFO L87 Difference]: Start difference. First operand 35330 states and 121730 transitions. Second operand 5 states. [2019-12-27 17:55:09,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:55:09,801 INFO L93 Difference]: Finished difference Result 42336 states and 143476 transitions. [2019-12-27 17:55:09,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 17:55:09,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-27 17:55:09,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:55:09,903 INFO L225 Difference]: With dead ends: 42336 [2019-12-27 17:55:09,904 INFO L226 Difference]: Without dead ends: 42308 [2019-12-27 17:55:09,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:55:10,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42308 states. [2019-12-27 17:55:11,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42308 to 35180. [2019-12-27 17:55:11,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35180 states. [2019-12-27 17:55:11,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35180 states to 35180 states and 121282 transitions. [2019-12-27 17:55:11,293 INFO L78 Accepts]: Start accepts. Automaton has 35180 states and 121282 transitions. Word has length 20 [2019-12-27 17:55:11,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:55:11,293 INFO L462 AbstractCegarLoop]: Abstraction has 35180 states and 121282 transitions. [2019-12-27 17:55:11,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:55:11,293 INFO L276 IsEmpty]: Start isEmpty. Operand 35180 states and 121282 transitions. [2019-12-27 17:55:11,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 17:55:11,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:55:11,353 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:55:11,353 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:55:11,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:55:11,354 INFO L82 PathProgramCache]: Analyzing trace with hash -904071527, now seen corresponding path program 1 times [2019-12-27 17:55:11,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:55:11,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880291925] [2019-12-27 17:55:11,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:55:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:55:11,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 17:55:11,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880291925] [2019-12-27 17:55:11,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:55:11,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:55:11,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [248981439] [2019-12-27 17:55:11,424 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:55:11,429 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:55:11,440 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 66 transitions. [2019-12-27 17:55:11,440 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:55:11,441 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:55:11,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:55:11,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:55:11,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:55:11,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:55:11,442 INFO L87 Difference]: Start difference. First operand 35180 states and 121282 transitions. Second operand 3 states. [2019-12-27 17:55:11,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:55:11,584 INFO L93 Difference]: Finished difference Result 33120 states and 112448 transitions. [2019-12-27 17:55:11,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:55:11,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-27 17:55:11,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:55:11,643 INFO L225 Difference]: With dead ends: 33120 [2019-12-27 17:55:11,644 INFO L226 Difference]: Without dead ends: 33120 [2019-12-27 17:55:11,644 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 17:55:11,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33120 states. [2019-12-27 17:55:12,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33120 to 32940. [2019-12-27 17:55:12,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32940 states. [2019-12-27 17:55:12,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32940 states to 32940 states and 111926 transitions. [2019-12-27 17:55:12,848 INFO L78 Accepts]: Start accepts. Automaton has 32940 states and 111926 transitions. Word has length 30 [2019-12-27 17:55:12,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:55:12,848 INFO L462 AbstractCegarLoop]: Abstraction has 32940 states and 111926 transitions. [2019-12-27 17:55:12,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:55:12,848 INFO L276 IsEmpty]: Start isEmpty. Operand 32940 states and 111926 transitions. [2019-12-27 17:55:12,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 17:55:12,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:55:12,889 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] [2019-12-27 17:55:12,889 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:55:12,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:55:12,889 INFO L82 PathProgramCache]: Analyzing trace with hash 879550622, now seen corresponding path program 1 times [2019-12-27 17:55:12,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:55:12,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151441] [2019-12-27 17:55:12,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:55:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:55:12,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:55:12,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151441] [2019-12-27 17:55:12,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:55:12,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:55:12,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [481633484] [2019-12-27 17:55:12,989 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:55:12,996 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:55:13,007 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 67 transitions. [2019-12-27 17:55:13,007 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:55:13,050 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:55:13,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:55:13,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:55:13,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:55:13,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:55:13,051 INFO L87 Difference]: Start difference. First operand 32940 states and 111926 transitions. Second operand 8 states. [2019-12-27 17:55:13,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:55:13,721 INFO L93 Difference]: Finished difference Result 76118 states and 257231 transitions. [2019-12-27 17:55:13,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 17:55:13,722 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-12-27 17:55:13,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:55:13,847 INFO L225 Difference]: With dead ends: 76118 [2019-12-27 17:55:13,848 INFO L226 Difference]: Without dead ends: 62580 [2019-12-27 17:55:13,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-12-27 17:55:14,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62580 states. [2019-12-27 17:55:15,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62580 to 55264. [2019-12-27 17:55:15,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55264 states. [2019-12-27 17:55:18,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55264 states to 55264 states and 189914 transitions. [2019-12-27 17:55:18,263 INFO L78 Accepts]: Start accepts. Automaton has 55264 states and 189914 transitions. Word has length 31 [2019-12-27 17:55:18,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:55:18,264 INFO L462 AbstractCegarLoop]: Abstraction has 55264 states and 189914 transitions. [2019-12-27 17:55:18,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:55:18,264 INFO L276 IsEmpty]: Start isEmpty. Operand 55264 states and 189914 transitions. [2019-12-27 17:55:18,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 17:55:18,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:55:18,327 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] [2019-12-27 17:55:18,328 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:55:18,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:55:18,328 INFO L82 PathProgramCache]: Analyzing trace with hash 2129021544, now seen corresponding path program 2 times [2019-12-27 17:55:18,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:55:18,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876241481] [2019-12-27 17:55:18,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:55:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:55:18,429 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 17:55:18,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876241481] [2019-12-27 17:55:18,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:55:18,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:55:18,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2053773662] [2019-12-27 17:55:18,431 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:55:18,438 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:55:18,455 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 79 states and 124 transitions. [2019-12-27 17:55:18,455 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:55:18,552 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 17:55:18,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:55:18,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:55:18,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:55:18,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:55:18,553 INFO L87 Difference]: Start difference. First operand 55264 states and 189914 transitions. Second operand 10 states. [2019-12-27 17:55:20,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:55:20,556 INFO L93 Difference]: Finished difference Result 98011 states and 338751 transitions. [2019-12-27 17:55:20,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 17:55:20,557 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2019-12-27 17:55:20,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:55:20,741 INFO L225 Difference]: With dead ends: 98011 [2019-12-27 17:55:20,741 INFO L226 Difference]: Without dead ends: 93667 [2019-12-27 17:55:20,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=359, Unknown=0, NotChecked=0, Total=506 [2019-12-27 17:55:21,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93667 states. [2019-12-27 17:55:22,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93667 to 56463. [2019-12-27 17:55:22,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56463 states. [2019-12-27 17:55:22,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56463 states to 56463 states and 194333 transitions. [2019-12-27 17:55:22,522 INFO L78 Accepts]: Start accepts. Automaton has 56463 states and 194333 transitions. Word has length 31 [2019-12-27 17:55:22,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:55:22,523 INFO L462 AbstractCegarLoop]: Abstraction has 56463 states and 194333 transitions. [2019-12-27 17:55:22,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:55:22,523 INFO L276 IsEmpty]: Start isEmpty. Operand 56463 states and 194333 transitions. [2019-12-27 17:55:22,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 17:55:22,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:55:22,580 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] [2019-12-27 17:55:22,581 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:55:22,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:55:22,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1270270174, now seen corresponding path program 3 times [2019-12-27 17:55:22,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:55:22,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239635415] [2019-12-27 17:55:22,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:55:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:55:22,710 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 17:55:22,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239635415] [2019-12-27 17:55:22,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:55:22,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:55:22,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2017390864] [2019-12-27 17:55:22,711 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:55:22,717 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:55:22,730 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 115 transitions. [2019-12-27 17:55:22,731 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:55:22,913 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 17:55:22,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 17:55:22,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:55:22,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 17:55:22,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:55:22,914 INFO L87 Difference]: Start difference. First operand 56463 states and 194333 transitions. Second operand 14 states. [2019-12-27 17:55:23,041 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-12-27 17:55:27,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:55:27,374 INFO L93 Difference]: Finished difference Result 175594 states and 604333 transitions. [2019-12-27 17:55:27,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 17:55:27,375 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-12-27 17:55:27,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:55:27,693 INFO L225 Difference]: With dead ends: 175594 [2019-12-27 17:55:27,693 INFO L226 Difference]: Without dead ends: 153233 [2019-12-27 17:55:27,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=366, Invalid=1274, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 17:55:31,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153233 states. [2019-12-27 17:55:32,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153233 to 76399. [2019-12-27 17:55:32,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76399 states. [2019-12-27 17:55:33,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76399 states to 76399 states and 266193 transitions. [2019-12-27 17:55:33,008 INFO L78 Accepts]: Start accepts. Automaton has 76399 states and 266193 transitions. Word has length 31 [2019-12-27 17:55:33,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:55:33,008 INFO L462 AbstractCegarLoop]: Abstraction has 76399 states and 266193 transitions. [2019-12-27 17:55:33,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 17:55:33,008 INFO L276 IsEmpty]: Start isEmpty. Operand 76399 states and 266193 transitions. [2019-12-27 17:55:33,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 17:55:33,108 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:55:33,108 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] [2019-12-27 17:55:33,108 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:55:33,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:55:33,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1755103544, now seen corresponding path program 1 times [2019-12-27 17:55:33,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:55:33,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702636359] [2019-12-27 17:55:33,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:55:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:55:33,172 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 17:55:33,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702636359] [2019-12-27 17:55:33,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:55:33,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:55:33,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1083826371] [2019-12-27 17:55:33,174 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:55:33,179 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:55:33,190 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 68 transitions. [2019-12-27 17:55:33,191 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:55:33,205 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:55:33,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:55:33,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:55:33,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:55:33,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:55:33,207 INFO L87 Difference]: Start difference. First operand 76399 states and 266193 transitions. Second operand 5 states. [2019-12-27 17:55:33,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:55:33,437 INFO L93 Difference]: Finished difference Result 13364 states and 39155 transitions. [2019-12-27 17:55:33,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:55:33,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-27 17:55:33,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:55:33,452 INFO L225 Difference]: With dead ends: 13364 [2019-12-27 17:55:33,452 INFO L226 Difference]: Without dead ends: 8112 [2019-12-27 17:55:33,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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 17:55:33,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8112 states. [2019-12-27 17:55:33,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8112 to 6016. [2019-12-27 17:55:33,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6016 states. [2019-12-27 17:55:33,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6016 states to 6016 states and 15044 transitions. [2019-12-27 17:55:33,536 INFO L78 Accepts]: Start accepts. Automaton has 6016 states and 15044 transitions. Word has length 32 [2019-12-27 17:55:33,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:55:33,536 INFO L462 AbstractCegarLoop]: Abstraction has 6016 states and 15044 transitions. [2019-12-27 17:55:33,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:55:33,536 INFO L276 IsEmpty]: Start isEmpty. Operand 6016 states and 15044 transitions. [2019-12-27 17:55:33,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 17:55:33,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:55:33,542 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] [2019-12-27 17:55:33,542 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:55:33,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:55:33,543 INFO L82 PathProgramCache]: Analyzing trace with hash 551589791, now seen corresponding path program 1 times [2019-12-27 17:55:33,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:55:33,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130978685] [2019-12-27 17:55:33,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:55:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:55:33,654 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 17:55:33,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130978685] [2019-12-27 17:55:33,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:55:33,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:55:33,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1566926861] [2019-12-27 17:55:33,655 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:55:33,665 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:55:33,681 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 44 states and 43 transitions. [2019-12-27 17:55:33,681 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:55:33,681 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:55:33,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:55:33,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:55:33,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:55:33,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:55:33,682 INFO L87 Difference]: Start difference. First operand 6016 states and 15044 transitions. Second operand 5 states. [2019-12-27 17:55:33,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:55:33,754 INFO L93 Difference]: Finished difference Result 4347 states and 11211 transitions. [2019-12-27 17:55:33,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:55:33,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-27 17:55:33,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:55:33,767 INFO L225 Difference]: With dead ends: 4347 [2019-12-27 17:55:33,767 INFO L226 Difference]: Without dead ends: 4127 [2019-12-27 17:55:33,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:55:33,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4127 states. [2019-12-27 17:55:33,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4127 to 4071. [2019-12-27 17:55:33,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4071 states. [2019-12-27 17:55:33,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4071 states to 4071 states and 10613 transitions. [2019-12-27 17:55:33,853 INFO L78 Accepts]: Start accepts. Automaton has 4071 states and 10613 transitions. Word has length 43 [2019-12-27 17:55:33,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:55:33,854 INFO L462 AbstractCegarLoop]: Abstraction has 4071 states and 10613 transitions. [2019-12-27 17:55:33,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:55:33,854 INFO L276 IsEmpty]: Start isEmpty. Operand 4071 states and 10613 transitions. [2019-12-27 17:55:33,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 17:55:33,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:55:33,865 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:55:33,865 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:55:33,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:55:33,866 INFO L82 PathProgramCache]: Analyzing trace with hash -2085818891, now seen corresponding path program 1 times [2019-12-27 17:55:33,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:55:33,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012559221] [2019-12-27 17:55:33,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:55:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:55:33,987 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 17:55:33,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012559221] [2019-12-27 17:55:33,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:55:33,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:55:33,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [114544450] [2019-12-27 17:55:33,988 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:55:34,007 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:55:34,099 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 207 transitions. [2019-12-27 17:55:34,099 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:55:34,101 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:55:34,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:55:34,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:55:34,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:55:34,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:55:34,103 INFO L87 Difference]: Start difference. First operand 4071 states and 10613 transitions. Second operand 4 states. [2019-12-27 17:55:34,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:55:34,129 INFO L93 Difference]: Finished difference Result 4456 states and 11493 transitions. [2019-12-27 17:55:34,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:55:34,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-27 17:55:34,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:55:34,132 INFO L225 Difference]: With dead ends: 4456 [2019-12-27 17:55:34,132 INFO L226 Difference]: Without dead ends: 441 [2019-12-27 17:55:34,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:55:34,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-12-27 17:55:34,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2019-12-27 17:55:34,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-12-27 17:55:34,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 959 transitions. [2019-12-27 17:55:34,138 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 959 transitions. Word has length 59 [2019-12-27 17:55:34,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:55:34,138 INFO L462 AbstractCegarLoop]: Abstraction has 441 states and 959 transitions. [2019-12-27 17:55:34,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:55:34,139 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 959 transitions. [2019-12-27 17:55:34,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 17:55:34,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:55:34,140 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:55:34,140 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:55:34,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:55:34,140 INFO L82 PathProgramCache]: Analyzing trace with hash -814810737, now seen corresponding path program 1 times [2019-12-27 17:55:34,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:55:34,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220129443] [2019-12-27 17:55:34,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:55:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:55:34,230 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 17:55:34,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220129443] [2019-12-27 17:55:34,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:55:34,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:55:34,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1073201542] [2019-12-27 17:55:34,231 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:55:34,249 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:55:34,318 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 110 states and 158 transitions. [2019-12-27 17:55:34,318 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:55:34,390 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 17:55:34,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:55:34,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:55:34,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:55:34,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:55:34,391 INFO L87 Difference]: Start difference. First operand 441 states and 959 transitions. Second operand 10 states. [2019-12-27 17:55:35,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:55:35,436 INFO L93 Difference]: Finished difference Result 3481 states and 7509 transitions. [2019-12-27 17:55:35,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 17:55:35,437 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2019-12-27 17:55:35,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:55:35,440 INFO L225 Difference]: With dead ends: 3481 [2019-12-27 17:55:35,440 INFO L226 Difference]: Without dead ends: 2092 [2019-12-27 17:55:35,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=296, Invalid=1264, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 17:55:35,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2092 states. [2019-12-27 17:55:35,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2092 to 833. [2019-12-27 17:55:35,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-12-27 17:55:35,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1844 transitions. [2019-12-27 17:55:35,456 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1844 transitions. Word has length 60 [2019-12-27 17:55:35,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:55:35,456 INFO L462 AbstractCegarLoop]: Abstraction has 833 states and 1844 transitions. [2019-12-27 17:55:35,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:55:35,456 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1844 transitions. [2019-12-27 17:55:35,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 17:55:35,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:55:35,457 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:55:35,458 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:55:35,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:55:35,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1249946427, now seen corresponding path program 2 times [2019-12-27 17:55:35,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:55:35,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533870769] [2019-12-27 17:55:35,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:55:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:55:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:55:35,567 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:55:35,567 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:55:35,572 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1771~0.base_19|)) (= 0 v_~y$r_buff0_thd2~0_427) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t1771~0.base_19| 1)) (= 0 v_~__unbuffered_p0_EAX~0_40) (= v_~y$r_buff0_thd0~0_102 0) (= 0 v_~__unbuffered_p1_EAX~0_40) (= 0 v_~y$w_buff0~0_194) (= v_~main$tmp_guard0~0_27 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1771~0.base_19| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1771~0.base_19|) |v_ULTIMATE.start_main_~#t1771~0.offset_14| 0)) |v_#memory_int_17|) (= |v_ULTIMATE.start_main_~#t1771~0.offset_14| 0) (= v_~y$read_delayed~0_6 0) (= v_~y$r_buff1_thd1~0_255 0) (= v_~y$flush_delayed~0_195 0) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_4|) (= v_~weak$$choice2~0_242 0) (= 0 v_~weak$$choice0~0_161) (= v_~y$r_buff0_thd1~0_290 0) (= v_~main$tmp_guard1~0_32 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1771~0.base_19| 4)) (= v_~x~0_50 0) (= 0 v_~__unbuffered_cnt~0_49) (= |v_#NULL.offset_4| 0) (= v_~y$w_buff1~0_196 0) (= v_~y$w_buff0_used~0_766 0) (= v_~y$r_buff1_thd0~0_184 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~__unbuffered_p1_EBX~0_32 0) (= v_~y~0_216 0) (= v_~y$w_buff1_used~0_425 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1771~0.base_19|) (= 0 v_~y$r_buff1_thd2~0_284) (= v_~y$mem_tmp~0_173 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_766, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_15|, ULTIMATE.start_main_~#t1772~0.base=|v_ULTIMATE.start_main_~#t1772~0.base_17|, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_255, ~y$mem_tmp~0=v_~y$mem_tmp~0_173, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, ~y$w_buff0~0=v_~y$w_buff0~0_194, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_290, ~y$flush_delayed~0=v_~y$flush_delayed~0_195, #length=|v_#length_17|, ~y~0=v_~y~0_216, ULTIMATE.start_main_~#t1771~0.base=|v_ULTIMATE.start_main_~#t1771~0.base_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_129|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_84|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_40|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ULTIMATE.start_main_~#t1772~0.offset=|v_ULTIMATE.start_main_~#t1772~0.offset_15|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_61|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_284, ~weak$$choice0~0=v_~weak$$choice0~0_161, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_198|, ULTIMATE.start_main_~#t1771~0.offset=|v_ULTIMATE.start_main_~#t1771~0.offset_14|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_30|, ~y$w_buff1~0=v_~y$w_buff1~0_196, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_102, #valid=|v_#valid_45|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_427, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_242, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_184, ~x~0=v_~x~0_50, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_425} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, ULTIMATE.start_main_~#t1772~0.base, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1771~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1772~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t1771~0.offset, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 17:55:35,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L810-1-->L812: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1772~0.base_11| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1772~0.base_11|) (= |v_ULTIMATE.start_main_~#t1772~0.offset_10| 0) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1772~0.base_11|)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1772~0.base_11| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1772~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1772~0.base_11|) |v_ULTIMATE.start_main_~#t1772~0.offset_10| 1)) |v_#memory_int_11|) (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1772~0.base_11| 1) |v_#valid_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1772~0.base=|v_ULTIMATE.start_main_~#t1772~0.base_11|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1772~0.offset=|v_ULTIMATE.start_main_~#t1772~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t1772~0.base, #length, ULTIMATE.start_main_~#t1772~0.offset] because there is no mapped edge [2019-12-27 17:55:35,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] P1ENTRY-->L5-3: Formula: (and (= v_~y$w_buff0_used~0_154 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| 1) (= 1 v_~y$w_buff0~0_41) (= |v_P1Thread1of1ForFork1_#in~arg.offset_8| v_P1Thread1of1ForFork1_~arg.offset_8) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_10) (= v_~y$w_buff1_used~0_78 v_~y$w_buff0_used~0_155) (= v_P1Thread1of1ForFork1_~arg.base_8 |v_P1Thread1of1ForFork1_#in~arg.base_8|) (= 0 (mod v_~y$w_buff1_used~0_78 256)) (= v_~y$w_buff0~0_42 v_~y$w_buff1~0_30)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_155, ~y$w_buff0~0=v_~y$w_buff0~0_42, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_10, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_154, ~y$w_buff1~0=v_~y$w_buff1~0_30, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_8|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_8, ~y$w_buff0~0=v_~y$w_buff0~0_41, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_78} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 17:55:35,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [927] [927] L772-2-->L772-5: Formula: (let ((.cse2 (= |P1Thread1of1ForFork1_#t~ite29_Out-2145571197| |P1Thread1of1ForFork1_#t~ite28_Out-2145571197|)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-2145571197 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2145571197 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff0~0_In-2145571197 |P1Thread1of1ForFork1_#t~ite28_Out-2145571197|) .cse2) (and (= |P1Thread1of1ForFork1_#t~ite28_Out-2145571197| ~y$w_buff1~0_In-2145571197) .cse2 (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-2145571197, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2145571197, ~y$w_buff0~0=~y$w_buff0~0_In-2145571197, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2145571197} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-2145571197|, ~y$w_buff1~0=~y$w_buff1~0_In-2145571197, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2145571197, ~y$w_buff0~0=~y$w_buff0~0_In-2145571197, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2145571197, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-2145571197|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 17:55:35,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L777-->L778: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_69 256))) (= v_~y$r_buff0_thd2~0_142 v_~y$r_buff0_thd2~0_141)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_142, ~weak$$choice2~0=v_~weak$$choice2~0_69} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_141, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_11|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_13|, ~weak$$choice2~0=v_~weak$$choice2~0_69} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-27 17:55:35,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1102012253 256) 0))) (or (and (= ~y~0_In-1102012253 |P1Thread1of1ForFork1_#t~ite48_Out-1102012253|) .cse0) (and (not .cse0) (= ~y$mem_tmp~0_In-1102012253 |P1Thread1of1ForFork1_#t~ite48_Out-1102012253|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1102012253, ~y$flush_delayed~0=~y$flush_delayed~0_In-1102012253, ~y~0=~y~0_In-1102012253} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1102012253, ~y$flush_delayed~0=~y$flush_delayed~0_In-1102012253, ~y~0=~y~0_In-1102012253, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out-1102012253|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-27 17:55:35,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [918] [918] L744-->L744-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1901458491 256) 0))) (or (and .cse0 (= |P0Thread1of1ForFork0_#t~ite25_Out1901458491| ~y~0_In1901458491)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite25_Out1901458491| ~y$mem_tmp~0_In1901458491)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1901458491, ~y$flush_delayed~0=~y$flush_delayed~0_In1901458491, ~y~0=~y~0_In1901458491} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1901458491, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out1901458491|, ~y$flush_delayed~0=~y$flush_delayed~0_In1901458491, ~y~0=~y~0_In1901458491} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-27 17:55:35,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L744-2-->P0EXIT: Formula: (and (= v_~y$flush_delayed~0_168 0) (= v_~y~0_183 |v_P0Thread1of1ForFork0_#t~ite25_32|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_31|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_168, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~y~0=v_~y~0_183} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-27 17:55:35,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In767576136 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In767576136 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite51_Out767576136|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In767576136 |P1Thread1of1ForFork1_#t~ite51_Out767576136|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In767576136, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In767576136} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In767576136, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out767576136|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In767576136} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-27 17:55:35,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [919] [919] L789-->L789-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In2002183041 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In2002183041 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In2002183041 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In2002183041 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite52_Out2002183041|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In2002183041 |P1Thread1of1ForFork1_#t~ite52_Out2002183041|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2002183041, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2002183041, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2002183041, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2002183041} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2002183041, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2002183041, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out2002183041|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2002183041, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2002183041} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-27 17:55:35,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L790-->L791: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In202716932 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In202716932 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In202716932 ~y$r_buff0_thd2~0_Out202716932)) (and (not .cse1) (not .cse0) (= 0 ~y$r_buff0_thd2~0_Out202716932)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In202716932, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In202716932} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out202716932|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In202716932, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out202716932} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 17:55:35,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [910] [910] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-8119258 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-8119258 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-8119258 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-8119258 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite54_Out-8119258|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$r_buff1_thd2~0_In-8119258 |P1Thread1of1ForFork1_#t~ite54_Out-8119258|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-8119258, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-8119258, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-8119258, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-8119258} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-8119258, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-8119258, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-8119258, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-8119258|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-8119258} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-27 17:55:35,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L791-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_26 1) v_~__unbuffered_cnt~0_25) (= v_~y$r_buff1_thd2~0_210 |v_P1Thread1of1ForFork1_#t~ite54_20|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_20|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_210, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_19|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 17:55:35,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L816-->L818-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= 0 (mod v_~y$w_buff0_used~0_203 256)) (= (mod v_~y$r_buff0_thd0~0_26 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_203, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_203, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 17:55:35,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L818-2-->L818-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1253871017 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1253871017 256)))) (or (and (= |ULTIMATE.start_main_#t~ite57_Out-1253871017| ~y~0_In-1253871017) (or .cse0 .cse1)) (and (= ~y$w_buff1~0_In-1253871017 |ULTIMATE.start_main_#t~ite57_Out-1253871017|) (not .cse1) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1253871017, ~y~0=~y~0_In-1253871017, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1253871017, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1253871017} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1253871017, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-1253871017|, ~y~0=~y~0_In-1253871017, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1253871017, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1253871017} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-27 17:55:35,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L818-4-->L819: Formula: (= v_~y~0_45 |v_ULTIMATE.start_main_#t~ite57_16|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_16|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_26|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_15|, ~y~0=v_~y~0_45} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~y~0] because there is no mapped edge [2019-12-27 17:55:35,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-804998126 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-804998126 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite59_Out-804998126|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-804998126 |ULTIMATE.start_main_#t~ite59_Out-804998126|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-804998126, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-804998126} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-804998126, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-804998126, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-804998126|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 17:55:35,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [911] [911] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In2084883170 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In2084883170 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In2084883170 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In2084883170 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite60_Out2084883170|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In2084883170 |ULTIMATE.start_main_#t~ite60_Out2084883170|) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2084883170, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2084883170, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2084883170, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2084883170} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out2084883170|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2084883170, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2084883170, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2084883170, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2084883170} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-27 17:55:35,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In315147192 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In315147192 256)))) (or (and (= ~y$r_buff0_thd0~0_In315147192 |ULTIMATE.start_main_#t~ite61_Out315147192|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite61_Out315147192| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In315147192, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In315147192} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out315147192|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In315147192, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In315147192} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 17:55:35,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [920] [920] L822-->L822-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In-1198632873 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1198632873 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1198632873 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1198632873 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out-1198632873| ~y$r_buff1_thd0~0_In-1198632873) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite62_Out-1198632873|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1198632873, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1198632873, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1198632873, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1198632873} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1198632873|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1198632873, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1198632873, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1198632873, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1198632873} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 17:55:35,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [969] [969] L822-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_18 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_18 256)) (= v_~y$r_buff1_thd0~0_164 |v_ULTIMATE.start_main_#t~ite62_41|) (= 0 v_~__unbuffered_p0_EAX~0_32) (= 1 v_~__unbuffered_p1_EAX~0_23) (= v_~__unbuffered_p1_EBX~0_23 0)) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_41|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_40|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_164, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 17:55:35,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:55:35 BasicIcfg [2019-12-27 17:55:35,711 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:55:35,713 INFO L168 Benchmark]: Toolchain (without parser) took 48756.05 ms. Allocated memory was 146.3 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 102.6 MB in the beginning and 626.9 MB in the end (delta: -524.2 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 17:55:35,714 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 17:55:35,714 INFO L168 Benchmark]: CACSL2BoogieTranslator took 719.17 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.4 MB in the beginning and 157.7 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 17:55:35,715 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.99 ms. Allocated memory is still 203.9 MB. Free memory was 157.0 MB in the beginning and 154.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:55:35,722 INFO L168 Benchmark]: Boogie Preprocessor took 39.65 ms. Allocated memory is still 203.9 MB. Free memory was 154.4 MB in the beginning and 151.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:55:35,723 INFO L168 Benchmark]: RCFGBuilder took 811.18 ms. Allocated memory is still 203.9 MB. Free memory was 151.8 MB in the beginning and 99.5 MB in the end (delta: 52.3 MB). Peak memory consumption was 52.3 MB. Max. memory is 7.1 GB. [2019-12-27 17:55:35,726 INFO L168 Benchmark]: TraceAbstraction took 47113.64 ms. Allocated memory was 203.9 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 98.9 MB in the beginning and 626.9 MB in the end (delta: -528.0 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 17:55:35,730 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.17 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 719.17 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.4 MB in the beginning and 157.7 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.99 ms. Allocated memory is still 203.9 MB. Free memory was 157.0 MB in the beginning and 154.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.65 ms. Allocated memory is still 203.9 MB. Free memory was 154.4 MB in the beginning and 151.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 811.18 ms. Allocated memory is still 203.9 MB. Free memory was 151.8 MB in the beginning and 99.5 MB in the end (delta: 52.3 MB). Peak memory consumption was 52.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 47113.64 ms. Allocated memory was 203.9 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 98.9 MB in the beginning and 626.9 MB in the end (delta: -528.0 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 178 ProgramPointsBefore, 102 ProgramPointsAfterwards, 227 TransitionsBefore, 126 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 53 ConcurrentYvCompositions, 28 ChoiceCompositions, 9537 VarBasedMoverChecksPositive, 264 VarBasedMoverChecksNegative, 66 SemBasedMoverChecksPositive, 279 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 121847 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t1771, ((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] [L812] FCALL, FORK 0 pthread_create(&t1772, ((void *)0), P1, ((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] [L762] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L763] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L764] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L765] 2 y$r_buff0_thd2 = (_Bool)1 [L768] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 2 y$flush_delayed = weak$$choice2 [L771] 2 y$mem_tmp = y 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=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] 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=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] 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) [L773] 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 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)) [L774] 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L774] 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)) [L775] 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] 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)) [L776] 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] 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)) [L778] 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 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)) [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 2 y = y$flush_delayed ? y$mem_tmp : y [L781] 2 y$flush_delayed = (_Bool)0 [L784] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 x = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 y$flush_delayed = weak$$choice2 [L735] 1 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=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __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=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L737] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? 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, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L738] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? 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, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L739] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_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, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_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, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L787] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) 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, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L742] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_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, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_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=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L787] 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) [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L789] 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 [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] 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 [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 172 locations, 2 error locations. Result: UNSAFE, OverallTime: 46.7s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3327 SDtfs, 5314 SDslu, 9740 SDs, 0 SdLazy, 5574 SolverSat, 263 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 190 GetRequests, 30 SyntacticMatches, 17 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 883 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76399occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 23.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 138370 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 443 NumberOfCodeBlocks, 443 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 370 ConstructedInterpolants, 0 QuantifiedInterpolants, 46656 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...