/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/rfi008_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:50:05,858 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:50:05,861 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:50:05,879 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:50:05,879 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:50:05,881 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:50:05,883 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:50:05,892 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:50:05,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:50:05,899 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:50:05,901 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:50:05,902 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:50:05,902 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:50:05,904 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:50:05,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:50:05,908 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:50:05,908 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:50:05,909 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:50:05,911 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:50:05,915 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:50:05,919 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:50:05,923 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:50:05,924 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:50:05,925 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:50:05,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:50:05,927 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:50:05,927 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:50:05,929 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:50:05,929 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:50:05,929 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:50:05,930 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:50:05,930 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:50:05,931 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:50:05,931 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:50:05,932 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:50:05,932 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:50:05,933 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:50:05,933 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:50:05,933 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:50:05,934 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:50:05,935 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:50:05,935 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:50:05,949 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:50:05,949 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:50:05,950 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:50:05,951 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:50:05,951 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:50:05,951 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:50:05,951 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:50:05,951 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:50:05,952 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:50:05,952 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:50:05,952 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:50:05,952 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:50:05,952 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:50:05,952 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:50:05,953 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:50:05,953 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:50:05,953 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:50:05,953 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:50:05,953 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:50:05,954 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:50:05,954 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:50:05,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:50:05,954 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:50:05,954 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:50:05,955 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:50:05,955 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:50:05,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:50:05,955 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:50:05,955 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:50:05,955 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:50:05,956 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:50:06,228 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:50:06,247 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:50:06,250 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:50:06,251 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:50:06,251 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:50:06,253 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi008_power.opt.i [2019-12-27 17:50:06,324 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d78f51ff/2a2b73ca21904f7bab68d643aeb8c1ec/FLAG8fdea4154 [2019-12-27 17:50:06,901 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:50:06,902 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008_power.opt.i [2019-12-27 17:50:06,917 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d78f51ff/2a2b73ca21904f7bab68d643aeb8c1ec/FLAG8fdea4154 [2019-12-27 17:50:07,193 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d78f51ff/2a2b73ca21904f7bab68d643aeb8c1ec [2019-12-27 17:50:07,202 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:50:07,204 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:50:07,205 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:50:07,205 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:50:07,208 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:50:07,209 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:50:07" (1/1) ... [2019-12-27 17:50:07,212 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c1335d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:07, skipping insertion in model container [2019-12-27 17:50:07,212 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:50:07" (1/1) ... [2019-12-27 17:50:07,220 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:50:07,277 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:50:07,819 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:50:07,830 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:50:07,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:50:07,994 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:50:07,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:07 WrapperNode [2019-12-27 17:50:07,994 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:50:07,995 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:50:07,995 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:50:07,995 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:50:08,006 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:50:07" (1/1) ... [2019-12-27 17:50:08,026 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:50:07" (1/1) ... [2019-12-27 17:50:08,067 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:50:08,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:50:08,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:50:08,068 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:50:08,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:07" (1/1) ... [2019-12-27 17:50:08,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:07" (1/1) ... [2019-12-27 17:50:08,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:07" (1/1) ... [2019-12-27 17:50:08,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:07" (1/1) ... [2019-12-27 17:50:08,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:07" (1/1) ... [2019-12-27 17:50:08,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:07" (1/1) ... [2019-12-27 17:50:08,110 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:07" (1/1) ... [2019-12-27 17:50:08,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:50:08,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:50:08,116 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:50:08,116 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:50:08,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:07" (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:50:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:50:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:50:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:50:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:50:08,182 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:50:08,182 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:50:08,182 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:50:08,182 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:50:08,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:50:08,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:50:08,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:50:08,185 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:50:08,955 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:50:08,956 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:50:08,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:50:08 BoogieIcfgContainer [2019-12-27 17:50:08,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:50:08,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:50:08,960 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:50:08,964 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:50:08,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:50:07" (1/3) ... [2019-12-27 17:50:08,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d7f9f94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:50:08, skipping insertion in model container [2019-12-27 17:50:08,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:07" (2/3) ... [2019-12-27 17:50:08,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d7f9f94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:50:08, skipping insertion in model container [2019-12-27 17:50:08,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:50:08" (3/3) ... [2019-12-27 17:50:08,970 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi008_power.opt.i [2019-12-27 17:50:08,980 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:50:08,982 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:50:08,993 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:50:08,994 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:50:09,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,067 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,068 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,088 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,089 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,089 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,089 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,089 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,116 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,118 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,129 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,131 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,134 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:09,151 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 17:50:09,173 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:50:09,173 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:50:09,173 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:50:09,173 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:50:09,173 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:50:09,173 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:50:09,174 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:50:09,175 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:50:09,192 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 228 transitions [2019-12-27 17:50:09,193 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-27 17:50:09,350 INFO L132 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-27 17:50:09,351 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:50:09,370 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 551 event pairs. 0/168 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-27 17:50:09,395 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-27 17:50:09,456 INFO L132 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-27 17:50:09,457 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:50:09,465 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 551 event pairs. 0/168 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-27 17:50:09,491 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-27 17:50:09,493 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:50:14,847 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 17:50:14,990 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 17:50:15,043 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125257 [2019-12-27 17:50:15,044 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 17:50:15,047 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 105 places, 129 transitions [2019-12-27 17:50:16,430 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25272 states. [2019-12-27 17:50:16,431 INFO L276 IsEmpty]: Start isEmpty. Operand 25272 states. [2019-12-27 17:50:16,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 17:50:16,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:16,437 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 17:50:16,437 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:50:16,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:16,442 INFO L82 PathProgramCache]: Analyzing trace with hash 961433507, now seen corresponding path program 1 times [2019-12-27 17:50:16,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:16,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679798310] [2019-12-27 17:50:16,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:16,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:50:16,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679798310] [2019-12-27 17:50:16,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:16,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:50:16,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1442118865] [2019-12-27 17:50:16,663 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:16,667 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:16,679 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 17:50:16,680 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:16,683 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:50:16,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:50:16,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:16,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:50:16,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:50:16,698 INFO L87 Difference]: Start difference. First operand 25272 states. Second operand 3 states. [2019-12-27 17:50:17,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:17,222 INFO L93 Difference]: Finished difference Result 25080 states and 89817 transitions. [2019-12-27 17:50:17,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:50:17,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 17:50:17,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:17,400 INFO L225 Difference]: With dead ends: 25080 [2019-12-27 17:50:17,401 INFO L226 Difference]: Without dead ends: 23470 [2019-12-27 17:50:17,402 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:50:18,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23470 states. [2019-12-27 17:50:19,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23470 to 23470. [2019-12-27 17:50:19,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23470 states. [2019-12-27 17:50:19,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23470 states to 23470 states and 83991 transitions. [2019-12-27 17:50:19,455 INFO L78 Accepts]: Start accepts. Automaton has 23470 states and 83991 transitions. Word has length 5 [2019-12-27 17:50:19,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:19,455 INFO L462 AbstractCegarLoop]: Abstraction has 23470 states and 83991 transitions. [2019-12-27 17:50:19,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:50:19,456 INFO L276 IsEmpty]: Start isEmpty. Operand 23470 states and 83991 transitions. [2019-12-27 17:50:19,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:50:19,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:19,460 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:50:19,460 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:50:19,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:19,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1303916439, now seen corresponding path program 1 times [2019-12-27 17:50:19,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:19,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049609306] [2019-12-27 17:50:19,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:19,591 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:50:19,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049609306] [2019-12-27 17:50:19,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:19,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:50:19,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [530548759] [2019-12-27 17:50:19,592 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:19,597 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:19,600 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:50:19,600 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:19,601 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:50:19,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:50:19,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:19,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:50:19,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:50:19,604 INFO L87 Difference]: Start difference. First operand 23470 states and 83991 transitions. Second operand 4 states. [2019-12-27 17:50:20,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:20,213 INFO L93 Difference]: Finished difference Result 36446 states and 124910 transitions. [2019-12-27 17:50:20,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:50:20,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:50:20,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:21,462 INFO L225 Difference]: With dead ends: 36446 [2019-12-27 17:50:21,463 INFO L226 Difference]: Without dead ends: 36430 [2019-12-27 17:50:21,464 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:50:21,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36430 states. [2019-12-27 17:50:22,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36430 to 35607. [2019-12-27 17:50:22,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35607 states. [2019-12-27 17:50:22,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35607 states to 35607 states and 122732 transitions. [2019-12-27 17:50:22,890 INFO L78 Accepts]: Start accepts. Automaton has 35607 states and 122732 transitions. Word has length 11 [2019-12-27 17:50:22,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:22,891 INFO L462 AbstractCegarLoop]: Abstraction has 35607 states and 122732 transitions. [2019-12-27 17:50:22,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:50:22,891 INFO L276 IsEmpty]: Start isEmpty. Operand 35607 states and 122732 transitions. [2019-12-27 17:50:22,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 17:50:22,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:22,897 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:50:22,897 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:50:22,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:22,898 INFO L82 PathProgramCache]: Analyzing trace with hash -273660052, now seen corresponding path program 1 times [2019-12-27 17:50:22,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:22,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799522485] [2019-12-27 17:50:22,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:23,036 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:50:23,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799522485] [2019-12-27 17:50:23,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:23,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:50:23,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [171750489] [2019-12-27 17:50:23,039 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:23,041 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:23,045 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 17:50:23,045 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:23,094 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:50:23,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:50:23,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:23,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:50:23,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:50:23,096 INFO L87 Difference]: Start difference. First operand 35607 states and 122732 transitions. Second operand 5 states. [2019-12-27 17:50:24,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:24,083 INFO L93 Difference]: Finished difference Result 46394 states and 157073 transitions. [2019-12-27 17:50:24,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:50:24,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 17:50:24,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:24,203 INFO L225 Difference]: With dead ends: 46394 [2019-12-27 17:50:24,203 INFO L226 Difference]: Without dead ends: 46379 [2019-12-27 17:50:24,204 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:50:24,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46379 states. [2019-12-27 17:50:25,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46379 to 41501. [2019-12-27 17:50:25,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41501 states. [2019-12-27 17:50:25,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41501 states to 41501 states and 142005 transitions. [2019-12-27 17:50:25,943 INFO L78 Accepts]: Start accepts. Automaton has 41501 states and 142005 transitions. Word has length 14 [2019-12-27 17:50:25,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:25,944 INFO L462 AbstractCegarLoop]: Abstraction has 41501 states and 142005 transitions. [2019-12-27 17:50:25,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:50:25,944 INFO L276 IsEmpty]: Start isEmpty. Operand 41501 states and 142005 transitions. [2019-12-27 17:50:25,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 17:50:25,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:25,949 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:50:25,949 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:50:25,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:25,949 INFO L82 PathProgramCache]: Analyzing trace with hash 106501689, now seen corresponding path program 1 times [2019-12-27 17:50:25,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:25,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382469504] [2019-12-27 17:50:25,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:25,996 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:50:25,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382469504] [2019-12-27 17:50:25,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:25,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:50:25,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [365181721] [2019-12-27 17:50:25,997 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:26,002 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:26,006 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 55 transitions. [2019-12-27 17:50:26,006 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:26,039 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:50:26,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:50:26,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:26,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:50:26,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:50:26,040 INFO L87 Difference]: Start difference. First operand 41501 states and 142005 transitions. Second operand 5 states. [2019-12-27 17:50:26,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:26,415 INFO L93 Difference]: Finished difference Result 67890 states and 222025 transitions. [2019-12-27 17:50:26,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:50:26,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-27 17:50:26,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:28,388 INFO L225 Difference]: With dead ends: 67890 [2019-12-27 17:50:28,388 INFO L226 Difference]: Without dead ends: 67890 [2019-12-27 17:50:28,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:50:28,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67890 states. [2019-12-27 17:50:29,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67890 to 60518. [2019-12-27 17:50:29,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60518 states. [2019-12-27 17:50:29,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60518 states to 60518 states and 201033 transitions. [2019-12-27 17:50:29,958 INFO L78 Accepts]: Start accepts. Automaton has 60518 states and 201033 transitions. Word has length 15 [2019-12-27 17:50:29,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:29,958 INFO L462 AbstractCegarLoop]: Abstraction has 60518 states and 201033 transitions. [2019-12-27 17:50:29,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:50:29,958 INFO L276 IsEmpty]: Start isEmpty. Operand 60518 states and 201033 transitions. [2019-12-27 17:50:29,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:50:29,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:29,964 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:50:29,965 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:50:29,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:29,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1396090736, now seen corresponding path program 1 times [2019-12-27 17:50:29,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:29,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192097818] [2019-12-27 17:50:29,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:30,024 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:50:30,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192097818] [2019-12-27 17:50:30,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:30,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:50:30,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [829326316] [2019-12-27 17:50:30,026 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:30,027 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:30,029 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 17:50:30,029 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:30,030 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:50:30,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:50:30,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:30,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:50:30,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:50:30,031 INFO L87 Difference]: Start difference. First operand 60518 states and 201033 transitions. Second operand 3 states. [2019-12-27 17:50:30,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:30,291 INFO L93 Difference]: Finished difference Result 57116 states and 189493 transitions. [2019-12-27 17:50:30,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:50:30,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 17:50:30,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:30,429 INFO L225 Difference]: With dead ends: 57116 [2019-12-27 17:50:30,429 INFO L226 Difference]: Without dead ends: 57116 [2019-12-27 17:50:30,430 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:50:31,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57116 states. [2019-12-27 17:50:32,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57116 to 57116. [2019-12-27 17:50:32,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57116 states. [2019-12-27 17:50:32,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57116 states to 57116 states and 189493 transitions. [2019-12-27 17:50:32,683 INFO L78 Accepts]: Start accepts. Automaton has 57116 states and 189493 transitions. Word has length 16 [2019-12-27 17:50:32,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:32,683 INFO L462 AbstractCegarLoop]: Abstraction has 57116 states and 189493 transitions. [2019-12-27 17:50:32,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:50:32,684 INFO L276 IsEmpty]: Start isEmpty. Operand 57116 states and 189493 transitions. [2019-12-27 17:50:32,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 17:50:32,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:32,691 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:50:32,692 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:50:32,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:32,692 INFO L82 PathProgramCache]: Analyzing trace with hash -717781961, now seen corresponding path program 1 times [2019-12-27 17:50:32,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:32,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413406902] [2019-12-27 17:50:32,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:32,750 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:50:32,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413406902] [2019-12-27 17:50:32,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:32,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:50:32,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [393864247] [2019-12-27 17:50:32,751 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:32,754 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:32,759 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 65 transitions. [2019-12-27 17:50:32,759 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:32,786 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:50:32,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:50:32,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:32,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:50:32,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:50:32,788 INFO L87 Difference]: Start difference. First operand 57116 states and 189493 transitions. Second operand 5 states. [2019-12-27 17:50:33,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:33,383 INFO L93 Difference]: Finished difference Result 71016 states and 232026 transitions. [2019-12-27 17:50:33,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:50:33,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 17:50:33,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:33,520 INFO L225 Difference]: With dead ends: 71016 [2019-12-27 17:50:33,521 INFO L226 Difference]: Without dead ends: 70999 [2019-12-27 17:50:33,521 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:50:34,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70999 states. [2019-12-27 17:50:36,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70999 to 57888. [2019-12-27 17:50:36,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57888 states. [2019-12-27 17:50:36,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57888 states to 57888 states and 192018 transitions. [2019-12-27 17:50:36,895 INFO L78 Accepts]: Start accepts. Automaton has 57888 states and 192018 transitions. Word has length 17 [2019-12-27 17:50:36,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:36,895 INFO L462 AbstractCegarLoop]: Abstraction has 57888 states and 192018 transitions. [2019-12-27 17:50:36,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:50:36,895 INFO L276 IsEmpty]: Start isEmpty. Operand 57888 states and 192018 transitions. [2019-12-27 17:50:36,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 17:50:36,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:36,911 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:50:36,911 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:50:36,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:36,911 INFO L82 PathProgramCache]: Analyzing trace with hash 211035802, now seen corresponding path program 1 times [2019-12-27 17:50:36,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:36,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244854782] [2019-12-27 17:50:36,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:37,012 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:50:37,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244854782] [2019-12-27 17:50:37,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:37,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:50:37,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [940994318] [2019-12-27 17:50:37,013 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:37,016 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:37,022 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 70 transitions. [2019-12-27 17:50:37,022 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:37,033 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:50:37,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:50:37,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:37,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:50:37,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:50:37,034 INFO L87 Difference]: Start difference. First operand 57888 states and 192018 transitions. Second operand 6 states. [2019-12-27 17:50:39,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:39,009 INFO L93 Difference]: Finished difference Result 174093 states and 563478 transitions. [2019-12-27 17:50:39,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 17:50:39,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-12-27 17:50:39,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:39,352 INFO L225 Difference]: With dead ends: 174093 [2019-12-27 17:50:39,353 INFO L226 Difference]: Without dead ends: 174052 [2019-12-27 17:50:39,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:50:43,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174052 states. [2019-12-27 17:50:44,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174052 to 63502. [2019-12-27 17:50:44,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63502 states. [2019-12-27 17:50:44,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63502 states to 63502 states and 209528 transitions. [2019-12-27 17:50:44,790 INFO L78 Accepts]: Start accepts. Automaton has 63502 states and 209528 transitions. Word has length 20 [2019-12-27 17:50:44,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:44,790 INFO L462 AbstractCegarLoop]: Abstraction has 63502 states and 209528 transitions. [2019-12-27 17:50:44,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:50:44,790 INFO L276 IsEmpty]: Start isEmpty. Operand 63502 states and 209528 transitions. [2019-12-27 17:50:44,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 17:50:44,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:44,815 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:50:44,815 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:50:44,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:44,816 INFO L82 PathProgramCache]: Analyzing trace with hash 432950251, now seen corresponding path program 1 times [2019-12-27 17:50:44,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:44,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502585993] [2019-12-27 17:50:44,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:44,883 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:50:44,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502585993] [2019-12-27 17:50:44,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:44,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:50:44,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [24929269] [2019-12-27 17:50:44,884 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:44,887 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:44,896 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 44 states and 63 transitions. [2019-12-27 17:50:44,896 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:44,897 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:50:44,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:50:44,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:44,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:50:44,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:50:44,900 INFO L87 Difference]: Start difference. First operand 63502 states and 209528 transitions. Second operand 5 states. [2019-12-27 17:50:45,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:45,800 INFO L93 Difference]: Finished difference Result 93725 states and 301299 transitions. [2019-12-27 17:50:45,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 17:50:45,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 17:50:45,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:45,997 INFO L225 Difference]: With dead ends: 93725 [2019-12-27 17:50:45,997 INFO L226 Difference]: Without dead ends: 93697 [2019-12-27 17:50:45,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 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:50:46,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93697 states. [2019-12-27 17:50:48,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93697 to 64134. [2019-12-27 17:50:48,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64134 states. [2019-12-27 17:50:48,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64134 states to 64134 states and 211525 transitions. [2019-12-27 17:50:48,257 INFO L78 Accepts]: Start accepts. Automaton has 64134 states and 211525 transitions. Word has length 23 [2019-12-27 17:50:48,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:48,257 INFO L462 AbstractCegarLoop]: Abstraction has 64134 states and 211525 transitions. [2019-12-27 17:50:48,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:50:48,257 INFO L276 IsEmpty]: Start isEmpty. Operand 64134 states and 211525 transitions. [2019-12-27 17:50:48,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 17:50:48,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:48,314 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:50:48,314 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:50:48,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:48,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1492209156, now seen corresponding path program 1 times [2019-12-27 17:50:48,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:48,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313756867] [2019-12-27 17:50:48,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:48,383 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:50:48,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313756867] [2019-12-27 17:50:48,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:48,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:50:48,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [117664621] [2019-12-27 17:50:48,384 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:48,389 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:48,399 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 68 transitions. [2019-12-27 17:50:48,399 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:48,400 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:50:48,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:50:48,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:48,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:50:48,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:50:48,401 INFO L87 Difference]: Start difference. First operand 64134 states and 211525 transitions. Second operand 3 states. [2019-12-27 17:50:48,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:48,732 INFO L93 Difference]: Finished difference Result 64095 states and 211410 transitions. [2019-12-27 17:50:48,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:50:48,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-27 17:50:48,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:48,885 INFO L225 Difference]: With dead ends: 64095 [2019-12-27 17:50:48,885 INFO L226 Difference]: Without dead ends: 64095 [2019-12-27 17:50:48,885 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:50:51,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64095 states. [2019-12-27 17:50:52,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64095 to 64095. [2019-12-27 17:50:52,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64095 states. [2019-12-27 17:50:52,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64095 states to 64095 states and 211410 transitions. [2019-12-27 17:50:52,332 INFO L78 Accepts]: Start accepts. Automaton has 64095 states and 211410 transitions. Word has length 30 [2019-12-27 17:50:52,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:52,332 INFO L462 AbstractCegarLoop]: Abstraction has 64095 states and 211410 transitions. [2019-12-27 17:50:52,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:50:52,333 INFO L276 IsEmpty]: Start isEmpty. Operand 64095 states and 211410 transitions. [2019-12-27 17:50:52,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 17:50:52,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:52,390 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:50:52,390 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:50:52,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:52,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1740768700, now seen corresponding path program 1 times [2019-12-27 17:50:52,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:52,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998443325] [2019-12-27 17:50:52,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:52,464 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:50:52,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998443325] [2019-12-27 17:50:52,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:52,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:50:52,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1946221999] [2019-12-27 17:50:52,466 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:52,471 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:52,485 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 86 transitions. [2019-12-27 17:50:52,485 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:52,487 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:50:52,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:50:52,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:52,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:50:52,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:50:52,488 INFO L87 Difference]: Start difference. First operand 64095 states and 211410 transitions. Second operand 4 states. [2019-12-27 17:50:53,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:53,643 INFO L93 Difference]: Finished difference Result 119831 states and 388698 transitions. [2019-12-27 17:50:53,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:50:53,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-12-27 17:50:53,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:53,900 INFO L225 Difference]: With dead ends: 119831 [2019-12-27 17:50:53,900 INFO L226 Difference]: Without dead ends: 119831 [2019-12-27 17:50:53,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:50:54,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119831 states. [2019-12-27 17:50:58,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119831 to 81205. [2019-12-27 17:50:58,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81205 states. [2019-12-27 17:50:58,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81205 states to 81205 states and 268981 transitions. [2019-12-27 17:50:58,813 INFO L78 Accepts]: Start accepts. Automaton has 81205 states and 268981 transitions. Word has length 31 [2019-12-27 17:50:58,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:58,813 INFO L462 AbstractCegarLoop]: Abstraction has 81205 states and 268981 transitions. [2019-12-27 17:50:58,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:50:58,813 INFO L276 IsEmpty]: Start isEmpty. Operand 81205 states and 268981 transitions. [2019-12-27 17:50:58,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 17:50:58,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:58,888 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:50:58,888 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:50:58,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:58,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1176144700, now seen corresponding path program 2 times [2019-12-27 17:50:58,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:58,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415482337] [2019-12-27 17:50:58,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:58,932 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:50:58,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415482337] [2019-12-27 17:50:58,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:58,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:50:58,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1566004644] [2019-12-27 17:50:58,933 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:58,939 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:58,951 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 74 transitions. [2019-12-27 17:50:58,951 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:58,952 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:50:58,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:50:58,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:58,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:50:58,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:50:58,953 INFO L87 Difference]: Start difference. First operand 81205 states and 268981 transitions. Second operand 3 states. [2019-12-27 17:50:59,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:59,290 INFO L93 Difference]: Finished difference Result 76354 states and 249559 transitions. [2019-12-27 17:50:59,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:50:59,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-27 17:50:59,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:59,448 INFO L225 Difference]: With dead ends: 76354 [2019-12-27 17:50:59,449 INFO L226 Difference]: Without dead ends: 76354 [2019-12-27 17:50:59,449 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:51:00,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76354 states. [2019-12-27 17:51:01,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76354 to 75156. [2019-12-27 17:51:01,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75156 states. [2019-12-27 17:51:01,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75156 states to 75156 states and 245983 transitions. [2019-12-27 17:51:01,534 INFO L78 Accepts]: Start accepts. Automaton has 75156 states and 245983 transitions. Word has length 31 [2019-12-27 17:51:01,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:51:01,534 INFO L462 AbstractCegarLoop]: Abstraction has 75156 states and 245983 transitions. [2019-12-27 17:51:01,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:51:01,535 INFO L276 IsEmpty]: Start isEmpty. Operand 75156 states and 245983 transitions. [2019-12-27 17:51:01,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 17:51:01,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:51:01,590 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:51:01,590 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:51:01,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:51:01,590 INFO L82 PathProgramCache]: Analyzing trace with hash -885277103, now seen corresponding path program 1 times [2019-12-27 17:51:01,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:51:01,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104812576] [2019-12-27 17:51:01,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:51:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:51:01,696 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:51:01,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104812576] [2019-12-27 17:51:01,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:51:01,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:51:01,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [898867309] [2019-12-27 17:51:01,697 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:51:01,703 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:51:01,714 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 43 states and 52 transitions. [2019-12-27 17:51:01,714 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:51:01,716 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:51:01,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:51:01,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:51:01,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:51:01,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:51:01,717 INFO L87 Difference]: Start difference. First operand 75156 states and 245983 transitions. Second operand 7 states. [2019-12-27 17:51:02,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:51:02,865 INFO L93 Difference]: Finished difference Result 171262 states and 558414 transitions. [2019-12-27 17:51:02,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 17:51:02,865 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-12-27 17:51:02,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:51:03,133 INFO L225 Difference]: With dead ends: 171262 [2019-12-27 17:51:03,133 INFO L226 Difference]: Without dead ends: 138314 [2019-12-27 17:51:03,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-12-27 17:51:05,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138314 states. [2019-12-27 17:51:06,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138314 to 120067. [2019-12-27 17:51:06,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120067 states. [2019-12-27 17:51:11,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120067 states to 120067 states and 393174 transitions. [2019-12-27 17:51:11,913 INFO L78 Accepts]: Start accepts. Automaton has 120067 states and 393174 transitions. Word has length 32 [2019-12-27 17:51:11,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:51:11,914 INFO L462 AbstractCegarLoop]: Abstraction has 120067 states and 393174 transitions. [2019-12-27 17:51:11,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:51:11,914 INFO L276 IsEmpty]: Start isEmpty. Operand 120067 states and 393174 transitions. [2019-12-27 17:51:12,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 17:51:12,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:51:12,039 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:51:12,039 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:51:12,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:51:12,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1444501905, now seen corresponding path program 2 times [2019-12-27 17:51:12,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:51:12,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230140409] [2019-12-27 17:51:12,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:51:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:51:12,155 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:51:12,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230140409] [2019-12-27 17:51:12,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:51:12,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:51:12,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [331950724] [2019-12-27 17:51:12,156 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:51:12,162 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:51:12,174 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 52 states and 68 transitions. [2019-12-27 17:51:12,174 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:51:12,178 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:51:12,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:51:12,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:51:12,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:51:12,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:51:12,179 INFO L87 Difference]: Start difference. First operand 120067 states and 393174 transitions. Second operand 7 states. [2019-12-27 17:51:13,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:51:13,987 INFO L93 Difference]: Finished difference Result 247414 states and 808254 transitions. [2019-12-27 17:51:13,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 17:51:13,987 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-12-27 17:51:13,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:51:14,479 INFO L225 Difference]: With dead ends: 247414 [2019-12-27 17:51:14,479 INFO L226 Difference]: Without dead ends: 228685 [2019-12-27 17:51:14,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-12-27 17:51:16,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228685 states. [2019-12-27 17:51:23,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228685 to 121917. [2019-12-27 17:51:23,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121917 states. [2019-12-27 17:51:23,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121917 states to 121917 states and 399475 transitions. [2019-12-27 17:51:23,563 INFO L78 Accepts]: Start accepts. Automaton has 121917 states and 399475 transitions. Word has length 32 [2019-12-27 17:51:23,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:51:23,563 INFO L462 AbstractCegarLoop]: Abstraction has 121917 states and 399475 transitions. [2019-12-27 17:51:23,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:51:23,563 INFO L276 IsEmpty]: Start isEmpty. Operand 121917 states and 399475 transitions. [2019-12-27 17:51:23,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 17:51:23,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:51:23,671 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:51:23,671 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:51:23,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:51:23,671 INFO L82 PathProgramCache]: Analyzing trace with hash -2141068655, now seen corresponding path program 3 times [2019-12-27 17:51:23,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:51:23,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282304884] [2019-12-27 17:51:23,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:51:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:51:23,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:51:23,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282304884] [2019-12-27 17:51:23,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:51:23,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:51:23,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [631709646] [2019-12-27 17:51:23,778 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:51:23,784 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:51:23,799 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 94 transitions. [2019-12-27 17:51:23,800 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:51:23,802 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:51:23,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:51:23,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:51:23,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:51:23,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:51:23,803 INFO L87 Difference]: Start difference. First operand 121917 states and 399475 transitions. Second operand 9 states. [2019-12-27 17:51:25,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:51:25,401 INFO L93 Difference]: Finished difference Result 213937 states and 696199 transitions. [2019-12-27 17:51:25,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 17:51:25,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2019-12-27 17:51:25,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:51:25,822 INFO L225 Difference]: With dead ends: 213937 [2019-12-27 17:51:25,822 INFO L226 Difference]: Without dead ends: 199430 [2019-12-27 17:51:25,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2019-12-27 17:51:27,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199430 states. [2019-12-27 17:51:30,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199430 to 122464. [2019-12-27 17:51:30,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122464 states. [2019-12-27 17:51:30,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122464 states to 122464 states and 401168 transitions. [2019-12-27 17:51:30,956 INFO L78 Accepts]: Start accepts. Automaton has 122464 states and 401168 transitions. Word has length 32 [2019-12-27 17:51:30,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:51:30,956 INFO L462 AbstractCegarLoop]: Abstraction has 122464 states and 401168 transitions. [2019-12-27 17:51:30,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:51:30,957 INFO L276 IsEmpty]: Start isEmpty. Operand 122464 states and 401168 transitions. [2019-12-27 17:51:31,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 17:51:31,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:51:31,073 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] [2019-12-27 17:51:31,073 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:51:31,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:51:31,073 INFO L82 PathProgramCache]: Analyzing trace with hash 488930896, now seen corresponding path program 1 times [2019-12-27 17:51:31,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:51:31,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874516864] [2019-12-27 17:51:31,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:51:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:51:31,156 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:51:31,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874516864] [2019-12-27 17:51:31,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:51:31,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:51:31,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [39504573] [2019-12-27 17:51:31,157 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:51:31,163 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:51:31,173 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 44 states and 53 transitions. [2019-12-27 17:51:31,174 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:51:31,175 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:51:31,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:51:31,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:51:31,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:51:31,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:51:31,177 INFO L87 Difference]: Start difference. First operand 122464 states and 401168 transitions. Second operand 4 states. [2019-12-27 17:51:31,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:51:31,249 INFO L93 Difference]: Finished difference Result 17481 states and 48034 transitions. [2019-12-27 17:51:31,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:51:31,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-27 17:51:31,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:51:31,262 INFO L225 Difference]: With dead ends: 17481 [2019-12-27 17:51:31,263 INFO L226 Difference]: Without dead ends: 10118 [2019-12-27 17:51:31,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:51:31,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10118 states. [2019-12-27 17:51:31,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10118 to 9239. [2019-12-27 17:51:31,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9239 states. [2019-12-27 17:51:31,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9239 states to 9239 states and 21599 transitions. [2019-12-27 17:51:31,368 INFO L78 Accepts]: Start accepts. Automaton has 9239 states and 21599 transitions. Word has length 33 [2019-12-27 17:51:31,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:51:31,368 INFO L462 AbstractCegarLoop]: Abstraction has 9239 states and 21599 transitions. [2019-12-27 17:51:31,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:51:31,368 INFO L276 IsEmpty]: Start isEmpty. Operand 9239 states and 21599 transitions. [2019-12-27 17:51:31,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 17:51:31,376 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:51:31,376 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] [2019-12-27 17:51:31,376 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:51:31,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:51:31,376 INFO L82 PathProgramCache]: Analyzing trace with hash 123397759, now seen corresponding path program 1 times [2019-12-27 17:51:31,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:51:31,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189291448] [2019-12-27 17:51:31,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:51:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:51:31,430 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:51:31,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189291448] [2019-12-27 17:51:31,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:51:31,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:51:31,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1896788713] [2019-12-27 17:51:31,431 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:51:31,441 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:51:31,454 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 53 transitions. [2019-12-27 17:51:31,455 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:51:31,468 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:51:31,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:51:31,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:51:31,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:51:31,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:51:31,469 INFO L87 Difference]: Start difference. First operand 9239 states and 21599 transitions. Second operand 5 states. [2019-12-27 17:51:31,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:51:31,542 INFO L93 Difference]: Finished difference Result 10477 states and 24397 transitions. [2019-12-27 17:51:31,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:51:31,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-27 17:51:31,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:51:31,556 INFO L225 Difference]: With dead ends: 10477 [2019-12-27 17:51:31,557 INFO L226 Difference]: Without dead ends: 8482 [2019-12-27 17:51:31,557 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:51:31,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8482 states. [2019-12-27 17:51:31,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8482 to 8050. [2019-12-27 17:51:31,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8050 states. [2019-12-27 17:51:31,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8050 states to 8050 states and 18884 transitions. [2019-12-27 17:51:31,688 INFO L78 Accepts]: Start accepts. Automaton has 8050 states and 18884 transitions. Word has length 44 [2019-12-27 17:51:31,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:51:31,688 INFO L462 AbstractCegarLoop]: Abstraction has 8050 states and 18884 transitions. [2019-12-27 17:51:31,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:51:31,688 INFO L276 IsEmpty]: Start isEmpty. Operand 8050 states and 18884 transitions. [2019-12-27 17:51:31,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 17:51:31,695 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:51:31,695 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] [2019-12-27 17:51:31,695 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:51:31,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:51:31,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1389551641, now seen corresponding path program 2 times [2019-12-27 17:51:31,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:51:31,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956028276] [2019-12-27 17:51:31,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:51:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:51:31,773 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:51:31,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956028276] [2019-12-27 17:51:31,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:51:31,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:51:31,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [969258410] [2019-12-27 17:51:31,774 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:51:31,784 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:51:31,803 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 64 transitions. [2019-12-27 17:51:31,803 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:51:31,806 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:51:31,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:51:31,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:51:31,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:51:31,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:51:31,807 INFO L87 Difference]: Start difference. First operand 8050 states and 18884 transitions. Second operand 5 states. [2019-12-27 17:51:31,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:51:31,857 INFO L93 Difference]: Finished difference Result 6017 states and 14259 transitions. [2019-12-27 17:51:31,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:51:31,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-27 17:51:31,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:51:31,859 INFO L225 Difference]: With dead ends: 6017 [2019-12-27 17:51:31,859 INFO L226 Difference]: Without dead ends: 668 [2019-12-27 17:51:31,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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:51:31,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2019-12-27 17:51:31,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 664. [2019-12-27 17:51:31,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-12-27 17:51:31,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1456 transitions. [2019-12-27 17:51:31,867 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1456 transitions. Word has length 44 [2019-12-27 17:51:31,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:51:31,867 INFO L462 AbstractCegarLoop]: Abstraction has 664 states and 1456 transitions. [2019-12-27 17:51:31,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:51:31,868 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1456 transitions. [2019-12-27 17:51:31,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 17:51:31,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:51:31,868 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:51:31,869 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:51:31,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:51:31,869 INFO L82 PathProgramCache]: Analyzing trace with hash 256933109, now seen corresponding path program 1 times [2019-12-27 17:51:31,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:51:31,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585012215] [2019-12-27 17:51:31,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:51:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:51:31,974 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:51:31,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585012215] [2019-12-27 17:51:31,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:51:31,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:51:31,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1993255592] [2019-12-27 17:51:31,976 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:51:31,998 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:51:32,081 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 103 states and 144 transitions. [2019-12-27 17:51:32,082 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:51:32,120 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:51:32,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:51:32,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:51:32,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:51:32,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:51:32,121 INFO L87 Difference]: Start difference. First operand 664 states and 1456 transitions. Second operand 8 states. [2019-12-27 17:51:32,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:51:32,352 INFO L93 Difference]: Finished difference Result 1207 states and 2594 transitions. [2019-12-27 17:51:32,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 17:51:32,353 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-12-27 17:51:32,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:51:32,354 INFO L225 Difference]: With dead ends: 1207 [2019-12-27 17:51:32,355 INFO L226 Difference]: Without dead ends: 900 [2019-12-27 17:51:32,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:51:32,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2019-12-27 17:51:32,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 738. [2019-12-27 17:51:32,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-12-27 17:51:32,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1584 transitions. [2019-12-27 17:51:32,366 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1584 transitions. Word has length 60 [2019-12-27 17:51:32,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:51:32,366 INFO L462 AbstractCegarLoop]: Abstraction has 738 states and 1584 transitions. [2019-12-27 17:51:32,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:51:32,366 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1584 transitions. [2019-12-27 17:51:32,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 17:51:32,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:51:32,368 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:51:32,368 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:51:32,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:51:32,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1155043701, now seen corresponding path program 2 times [2019-12-27 17:51:32,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:51:32,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307187196] [2019-12-27 17:51:32,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:51:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:51:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:51:32,481 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:51:32,481 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:51:32,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 |v_ULTIMATE.start_main_~#t1723~0.offset_20|) (= v_~y~0_249 0) (= 0 v_~y$w_buff0~0_205) (= v_~y$w_buff0_used~0_843 0) (= v_~y$w_buff1_used~0_439 0) (= 0 v_~weak$$choice0~0_156) (= (store .cse0 |v_ULTIMATE.start_main_~#t1723~0.base_28| 1) |v_#valid_53|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1723~0.base_28| 4)) (= v_~main$tmp_guard1~0_42 0) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~__unbuffered_p0_EAX~0_77) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1723~0.base_28|) (= v_~__unbuffered_p0_EBX~0_51 0) (= v_~y$read_delayed~0_6 0) (= v_~weak$$choice2~0_238 0) (= v_~y$r_buff0_thd0~0_100 0) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_6|) (= 0 v_~y$r_buff1_thd2~0_306) (= v_~x~0_52 0) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1723~0.base_28| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1723~0.base_28|) |v_ULTIMATE.start_main_~#t1723~0.offset_20| 0))) (= 0 v_~y$r_buff0_thd2~0_438) (= v_~y$r_buff1_thd1~0_261 0) (= 0 v_~__unbuffered_cnt~0_49) (= v_~__unbuffered_p1_EBX~0_47 0) (= 0 v_~__unbuffered_p1_EAX~0_65) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1723~0.base_28|)) (= v_~y$w_buff1~0_192 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$flush_delayed~0_191 0) (= v_~y$mem_tmp~0_167 0) (= v_~y$r_buff0_thd1~0_295 0) (= v_~y$r_buff1_thd0~0_204 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1723~0.base=|v_ULTIMATE.start_main_~#t1723~0.base_28|, ULTIMATE.start_main_~#t1724~0.offset=|v_ULTIMATE.start_main_~#t1724~0.offset_14|, ~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_843, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_14|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_261, ~y$mem_tmp~0=v_~y$mem_tmp~0_167, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_77, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_65, ~y$w_buff0~0=v_~y$w_buff0~0_205, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_295, ~y$flush_delayed~0=v_~y$flush_delayed~0_191, #length=|v_#length_15|, ~y~0=v_~y~0_249, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_47, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_51, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_132|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_103|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_147|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_85|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_306, ~weak$$choice0~0=v_~weak$$choice0~0_156, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_115|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_29|, ULTIMATE.start_main_~#t1723~0.offset=|v_ULTIMATE.start_main_~#t1723~0.offset_20|, ~y$w_buff1~0=v_~y$w_buff1~0_192, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_100, #valid=|v_#valid_53|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_438, #memory_int=|v_#memory_int_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, ULTIMATE.start_main_~#t1724~0.base=|v_ULTIMATE.start_main_~#t1724~0.base_17|, ~weak$$choice2~0=v_~weak$$choice2~0_238, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_204, ~x~0=v_~x~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_439} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1723~0.base, ULTIMATE.start_main_~#t1724~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #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, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t1723~0.offset, ~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, ULTIMATE.start_main_~#t1724~0.base, ~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:51:32,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L813-1-->L815: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1724~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1724~0.base_13|) |v_ULTIMATE.start_main_~#t1724~0.offset_11| 1)) |v_#memory_int_9|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1724~0.base_13| 4) |v_#length_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1724~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t1724~0.base_13| 0)) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1724~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t1724~0.offset_11|) (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1724~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1724~0.offset=|v_ULTIMATE.start_main_~#t1724~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1724~0.base=|v_ULTIMATE.start_main_~#t1724~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1724~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1724~0.base] because there is no mapped edge [2019-12-27 17:51:32,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [862] [862] P1ENTRY-->L5-3: Formula: (and (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| 1) (= v_~y$w_buff0~0_39 v_~y$w_buff1~0_51) (= 1 v_~y$w_buff0~0_38) (= |v_P1Thread1of1ForFork1_#in~arg.offset_8| v_P1Thread1of1ForFork1_~arg.offset_8) (= v_~y$w_buff0_used~0_162 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_10) (= (mod v_~y$w_buff1_used~0_84 256) 0) (= v_~y$w_buff1_used~0_84 v_~y$w_buff0_used~0_163) (= v_P1Thread1of1ForFork1_~arg.base_8 |v_P1Thread1of1ForFork1_#in~arg.base_8|)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, ~y$w_buff0~0=v_~y$w_buff0~0_39, 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_162, ~y$w_buff1~0=v_~y$w_buff1~0_51, 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_38, 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_84} 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:51:32,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L775-2-->L775-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1733047392 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1733047392 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff0~0_In-1733047392 |P1Thread1of1ForFork1_#t~ite28_Out-1733047392|)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out-1733047392| ~y$w_buff1~0_In-1733047392)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1733047392, ~y$w_buff1~0=~y$w_buff1~0_In-1733047392, ~y$w_buff0~0=~y$w_buff0~0_In-1733047392, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1733047392} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1733047392, ~y$w_buff1~0=~y$w_buff1~0_In-1733047392, ~y$w_buff0~0=~y$w_buff0~0_In-1733047392, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1733047392, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1733047392|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 17:51:32,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L775-4-->L776: Formula: (= v_~y~0_77 |v_P1Thread1of1ForFork1_#t~ite28_10|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_10|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_13|, ~y~0=v_~y~0_77, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~y~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 17:51:32,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L780-->L781: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_44 256))) (= v_~y$r_buff0_thd2~0_85 v_~y$r_buff0_thd2~0_84)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_44} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_84, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_11|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_11|, ~weak$$choice2~0=v_~weak$$choice2~0_44} 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:51:32,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In883242958 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite48_Out883242958| ~y$mem_tmp~0_In883242958)) (and .cse0 (= ~y~0_In883242958 |P1Thread1of1ForFork1_#t~ite48_Out883242958|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In883242958, ~y$flush_delayed~0=~y$flush_delayed~0_In883242958, ~y~0=~y~0_In883242958} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In883242958, ~y$flush_delayed~0=~y$flush_delayed~0_In883242958, ~y~0=~y~0_In883242958, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out883242958|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-27 17:51:32,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-986818791 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-986818791 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite51_Out-986818791| ~y$w_buff0_used~0_In-986818791)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite51_Out-986818791| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-986818791, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-986818791} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-986818791, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-986818791|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-986818791} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-27 17:51:32,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L792-->L792-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2072161 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-2072161 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2072161 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-2072161 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite52_Out-2072161|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-2072161 |P1Thread1of1ForFork1_#t~ite52_Out-2072161|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2072161, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2072161, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2072161, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2072161} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2072161, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2072161, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out-2072161|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2072161, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2072161} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-27 17:51:32,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L793-->L794: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-688046855 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-688046855 256) 0))) (or (and (= ~y$r_buff0_thd2~0_In-688046855 ~y$r_buff0_thd2~0_Out-688046855) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 ~y$r_buff0_thd2~0_Out-688046855)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-688046855, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-688046855} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-688046855|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-688046855, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-688046855} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 17:51:32,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L794-->L794-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In579596828 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In579596828 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In579596828 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In579596828 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite54_Out579596828| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$r_buff1_thd2~0_In579596828 |P1Thread1of1ForFork1_#t~ite54_Out579596828|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In579596828, ~y$w_buff0_used~0=~y$w_buff0_used~0_In579596828, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In579596828, ~y$w_buff1_used~0=~y$w_buff1_used~0_In579596828} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In579596828, ~y$w_buff0_used~0=~y$w_buff0_used~0_In579596828, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In579596828, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out579596828|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In579596828} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-27 17:51:32,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~y$r_buff1_thd2~0_119 |v_P1Thread1of1ForFork1_#t~ite54_20|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_20|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_119, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, 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:51:32,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1187644340 256)))) (or (and .cse0 (= ~y~0_In-1187644340 |P0Thread1of1ForFork0_#t~ite25_Out-1187644340|)) (and (= ~y$mem_tmp~0_In-1187644340 |P0Thread1of1ForFork0_#t~ite25_Out-1187644340|) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1187644340, ~y$flush_delayed~0=~y$flush_delayed~0_In-1187644340, ~y~0=~y~0_In-1187644340} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1187644340, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out-1187644340|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1187644340, ~y~0=~y~0_In-1187644340} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-27 17:51:32,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L747-2-->P0EXIT: Formula: (and (= v_~y~0_124 |v_P0Thread1of1ForFork0_#t~ite25_20|) (= v_~__unbuffered_cnt~0_26 (+ v_~__unbuffered_cnt~0_27 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 0 v_~y$flush_delayed~0_78) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_19|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_78, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~y~0=v_~y~0_124} 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:51:32,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L819-->L821-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_32 256)) (= 0 (mod v_~y$w_buff0_used~0_212 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_212, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_212, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 17:51:32,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L821-2-->L821-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In1365232456 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1365232456 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In1365232456 |ULTIMATE.start_main_#t~ite57_Out1365232456|) (not .cse1)) (and (= ~y~0_In1365232456 |ULTIMATE.start_main_#t~ite57_Out1365232456|) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1365232456, ~y~0=~y~0_In1365232456, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1365232456, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1365232456} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1365232456, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out1365232456|, ~y~0=~y~0_In1365232456, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1365232456, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1365232456} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-27 17:51:32,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-4-->L822: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite57_9|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_9|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_10|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_8|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~y~0] because there is no mapped edge [2019-12-27 17:51:32,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-334818422 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-334818422 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite59_Out-334818422| ~y$w_buff0_used~0_In-334818422) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite59_Out-334818422| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-334818422, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-334818422} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-334818422, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-334818422, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-334818422|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 17:51:32,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [935] [935] L823-->L823-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In532285704 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In532285704 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In532285704 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In532285704 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In532285704 |ULTIMATE.start_main_#t~ite60_Out532285704|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite60_Out532285704|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In532285704, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In532285704, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In532285704, ~y$w_buff1_used~0=~y$w_buff1_used~0_In532285704} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out532285704|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In532285704, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In532285704, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In532285704, ~y$w_buff1_used~0=~y$w_buff1_used~0_In532285704} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-27 17:51:32,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1288787890 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1288787890 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-1288787890 |ULTIMATE.start_main_#t~ite61_Out-1288787890|)) (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-1288787890|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1288787890, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1288787890} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1288787890|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1288787890, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1288787890} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 17:51:32,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L825-->L825-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In1622350838 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1622350838 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1622350838 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1622350838 256)))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out1622350838| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite62_Out1622350838| ~y$r_buff1_thd0~0_In1622350838) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1622350838, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1622350838, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1622350838, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1622350838} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1622350838|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1622350838, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1622350838, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1622350838, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1622350838} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 17:51:32,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [969] [969] L825-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_20 0) (= v_~__unbuffered_p1_EBX~0_25 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= 1 v_~__unbuffered_p0_EAX~0_55) (= v_~y$r_buff1_thd0~0_175 |v_ULTIMATE.start_main_#t~ite62_45|) (= v_~__unbuffered_p0_EBX~0_29 0) (= 1 v_~__unbuffered_p1_EAX~0_36)) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_55, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_55, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_175, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} 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:51:32,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:51:32 BasicIcfg [2019-12-27 17:51:32,620 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:51:32,622 INFO L168 Benchmark]: Toolchain (without parser) took 85418.49 ms. Allocated memory was 138.4 MB in the beginning and 3.7 GB in the end (delta: 3.6 GB). Free memory was 101.7 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-27 17:51:32,622 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.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:51:32,623 INFO L168 Benchmark]: CACSL2BoogieTranslator took 790.03 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.3 MB in the beginning and 156.2 MB in the end (delta: -54.9 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:51:32,624 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.53 ms. Allocated memory is still 202.9 MB. Free memory was 156.2 MB in the beginning and 152.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 17:51:32,624 INFO L168 Benchmark]: Boogie Preprocessor took 47.13 ms. Allocated memory is still 202.9 MB. Free memory was 152.8 MB in the beginning and 150.2 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:51:32,625 INFO L168 Benchmark]: RCFGBuilder took 842.10 ms. Allocated memory is still 202.9 MB. Free memory was 150.2 MB in the beginning and 97.7 MB in the end (delta: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 7.1 GB. [2019-12-27 17:51:32,625 INFO L168 Benchmark]: TraceAbstraction took 83660.56 ms. Allocated memory was 202.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 97.0 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-12-27 17:51:32,629 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.20 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 790.03 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.3 MB in the beginning and 156.2 MB in the end (delta: -54.9 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.53 ms. Allocated memory is still 202.9 MB. Free memory was 156.2 MB in the beginning and 152.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.13 ms. Allocated memory is still 202.9 MB. Free memory was 152.8 MB in the beginning and 150.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 842.10 ms. Allocated memory is still 202.9 MB. Free memory was 150.2 MB in the beginning and 97.7 MB in the end (delta: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 83660.56 ms. Allocated memory was 202.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 97.0 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 179 ProgramPointsBefore, 105 ProgramPointsAfterwards, 228 TransitionsBefore, 129 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 28 ChoiceCompositions, 9059 VarBasedMoverChecksPositive, 283 VarBasedMoverChecksNegative, 68 SemBasedMoverChecksPositive, 299 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 125257 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t1723, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L815] FCALL, FORK 0 pthread_create(&t1724, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 y$flush_delayed = weak$$choice2 [L774] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L775] 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_p0_EBX=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] [L776] 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_p0_EBX=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_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)) [L777] 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_p0_EBX=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] [L777] 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)) [L778] 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_p0_EBX=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$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)) [L779] 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_p0_EBX=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] [L779] 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)) [L781] 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_p0_EBX=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] [L781] 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)) [L782] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L783] 2 y = y$flush_delayed ? y$mem_tmp : y [L784] 2 y$flush_delayed = (_Bool)0 [L787] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L790] 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_p0_EBX=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] [L729] 1 x = 1 [L732] 1 __unbuffered_p0_EAX = x [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 y$flush_delayed = weak$$choice2 [L738] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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] [L739] 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=1, __unbuffered_p0_EBX=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] [L790] 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) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 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 [L739] 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) [L740] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 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)) [L741] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 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)) [L742] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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))=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=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 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)) [L743] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, y$w_buff1=0, y$w_buff1_used=0] [L743] 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)) [L744] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, y$w_buff1=0, y$w_buff1_used=0] [L744] 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)) [L745] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, y$w_buff1=0, y$w_buff1_used=0] [L745] 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)) [L746] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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] [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 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 [L824] 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, 173 locations, 2 error locations. Result: UNSAFE, OverallTime: 83.3s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 19.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4521 SDtfs, 5359 SDslu, 8826 SDs, 0 SdLazy, 3540 SolverSat, 252 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 162 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122464occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 53.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 409579 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 550 NumberOfCodeBlocks, 550 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 472 ConstructedInterpolants, 0 QuantifiedInterpolants, 47442 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...