/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi010_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:19:58,756 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:19:58,759 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:19:58,776 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:19:58,777 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:19:58,779 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:19:58,780 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:19:58,793 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:19:58,795 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:19:58,796 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:19:58,797 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:19:58,799 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:19:58,799 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:19:58,803 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:19:58,806 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:19:58,807 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:19:58,809 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:19:58,811 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:19:58,813 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:19:58,818 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:19:58,823 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:19:58,824 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:19:58,825 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:19:58,826 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:19:58,829 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:19:58,830 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:19:58,830 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:19:58,832 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:19:58,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:19:58,834 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:19:58,834 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:19:58,835 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:19:58,836 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:19:58,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:19:58,838 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:19:58,838 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:19:58,839 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:19:58,839 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:19:58,839 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:19:58,843 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:19:58,845 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:19:58,846 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:19:58,864 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:19:58,864 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:19:58,867 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:19:58,867 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:19:58,868 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:19:58,868 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:19:58,868 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:19:58,869 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:19:58,869 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:19:58,869 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:19:58,870 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:19:58,870 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:19:58,871 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:19:58,871 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:19:58,871 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:19:58,871 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:19:58,872 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:19:58,872 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:19:58,872 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:19:58,872 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:19:58,872 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:19:58,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:19:58,873 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:19:58,874 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:19:58,874 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:19:58,874 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:19:58,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:19:58,875 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:19:58,875 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:19:58,875 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:19:59,154 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:19:59,170 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:19:59,173 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:19:59,175 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:19:59,175 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:19:59,176 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi010_rmo.opt.i [2019-12-18 14:19:59,243 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/818d0a283/e375d2b6824b428a9f7290f758db2c96/FLAGe320c96c5 [2019-12-18 14:19:59,799 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:19:59,800 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi010_rmo.opt.i [2019-12-18 14:19:59,815 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/818d0a283/e375d2b6824b428a9f7290f758db2c96/FLAGe320c96c5 [2019-12-18 14:20:00,147 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/818d0a283/e375d2b6824b428a9f7290f758db2c96 [2019-12-18 14:20:00,155 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:20:00,157 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:20:00,158 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:20:00,158 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:20:00,161 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:20:00,162 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:20:00" (1/1) ... [2019-12-18 14:20:00,165 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce5549b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:20:00, skipping insertion in model container [2019-12-18 14:20:00,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:20:00" (1/1) ... [2019-12-18 14:20:00,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:20:00,234 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:20:00,812 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:20:00,823 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:20:00,884 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:20:00,956 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:20:00,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:20:00 WrapperNode [2019-12-18 14:20:00,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:20:00,958 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:20:00,958 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:20:00,958 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:20:00,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:20:00" (1/1) ... [2019-12-18 14:20:00,987 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:20:00" (1/1) ... [2019-12-18 14:20:01,022 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:20:01,023 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:20:01,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:20:01,023 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:20:01,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:20:00" (1/1) ... [2019-12-18 14:20:01,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:20:00" (1/1) ... [2019-12-18 14:20:01,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:20:00" (1/1) ... [2019-12-18 14:20:01,037 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:20:00" (1/1) ... [2019-12-18 14:20:01,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:20:00" (1/1) ... [2019-12-18 14:20:01,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:20:00" (1/1) ... [2019-12-18 14:20:01,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:20:00" (1/1) ... [2019-12-18 14:20:01,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:20:01,063 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:20:01,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:20:01,063 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:20:01,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:20:00" (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-18 14:20:01,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:20:01,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:20:01,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:20:01,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:20:01,144 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:20:01,144 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:20:01,144 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:20:01,145 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:20:01,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:20:01,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:20:01,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:20:01,147 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 14:20:01,979 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:20:01,980 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:20:01,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:20:01 BoogieIcfgContainer [2019-12-18 14:20:01,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:20:01,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:20:01,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:20:01,994 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:20:01,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:20:00" (1/3) ... [2019-12-18 14:20:01,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fca9a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:20:01, skipping insertion in model container [2019-12-18 14:20:01,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:20:00" (2/3) ... [2019-12-18 14:20:01,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fca9a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:20:01, skipping insertion in model container [2019-12-18 14:20:01,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:20:01" (3/3) ... [2019-12-18 14:20:01,998 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi010_rmo.opt.i [2019-12-18 14:20:02,006 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:20:02,006 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:20:02,013 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:20:02,014 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:20:02,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,073 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,073 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,094 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,094 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,094 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,095 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,095 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,122 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,123 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,130 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,131 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,134 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:20:02,150 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 14:20:02,170 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:20:02,170 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:20:02,170 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:20:02,170 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:20:02,170 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:20:02,170 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:20:02,171 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:20:02,171 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:20:02,187 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 227 transitions [2019-12-18 14:20:02,189 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 227 transitions [2019-12-18 14:20:02,293 INFO L126 PetriNetUnfolder]: 56/225 cut-off events. [2019-12-18 14:20:02,293 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:20:02,324 INFO L76 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 225 events. 56/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 552 event pairs. 6/173 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-18 14:20:02,356 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 227 transitions [2019-12-18 14:20:02,444 INFO L126 PetriNetUnfolder]: 56/225 cut-off events. [2019-12-18 14:20:02,445 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:20:02,457 INFO L76 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 225 events. 56/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 552 event pairs. 6/173 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-18 14:20:02,485 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-18 14:20:02,486 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:20:07,562 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 14:20:07,683 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 14:20:07,823 INFO L206 etLargeBlockEncoding]: Checked pairs total: 121847 [2019-12-18 14:20:07,823 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-18 14:20:07,826 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 102 places, 126 transitions [2019-12-18 14:20:09,317 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 23697 states. [2019-12-18 14:20:09,319 INFO L276 IsEmpty]: Start isEmpty. Operand 23697 states. [2019-12-18 14:20:09,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 14:20:09,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:20:09,327 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 14:20:09,327 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:20:09,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:20:09,333 INFO L82 PathProgramCache]: Analyzing trace with hash 960453199, now seen corresponding path program 1 times [2019-12-18 14:20:09,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:20:09,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507851982] [2019-12-18 14:20:09,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:20:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:20:09,600 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-18 14:20:09,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507851982] [2019-12-18 14:20:09,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:20:09,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:20:09,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806392824] [2019-12-18 14:20:09,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:20:09,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:20:09,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:20:09,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:20:09,626 INFO L87 Difference]: Start difference. First operand 23697 states. Second operand 3 states. [2019-12-18 14:20:10,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:20:10,155 INFO L93 Difference]: Finished difference Result 23505 states and 84597 transitions. [2019-12-18 14:20:10,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:20:10,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 14:20:10,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:20:10,396 INFO L225 Difference]: With dead ends: 23505 [2019-12-18 14:20:10,396 INFO L226 Difference]: Without dead ends: 22000 [2019-12-18 14:20:10,398 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-18 14:20:11,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22000 states. [2019-12-18 14:20:12,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22000 to 22000. [2019-12-18 14:20:12,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22000 states. [2019-12-18 14:20:12,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22000 states to 22000 states and 79119 transitions. [2019-12-18 14:20:12,406 INFO L78 Accepts]: Start accepts. Automaton has 22000 states and 79119 transitions. Word has length 5 [2019-12-18 14:20:12,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:20:12,406 INFO L462 AbstractCegarLoop]: Abstraction has 22000 states and 79119 transitions. [2019-12-18 14:20:12,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:20:12,406 INFO L276 IsEmpty]: Start isEmpty. Operand 22000 states and 79119 transitions. [2019-12-18 14:20:12,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:20:12,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:20:12,420 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:20:12,420 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:20:12,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:20:12,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1767797629, now seen corresponding path program 1 times [2019-12-18 14:20:12,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:20:12,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932402056] [2019-12-18 14:20:12,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:20:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:20:12,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:20:12,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932402056] [2019-12-18 14:20:12,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:20:12,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:20:12,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242651220] [2019-12-18 14:20:12,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:20:12,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:20:12,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:20:12,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:20:12,598 INFO L87 Difference]: Start difference. First operand 22000 states and 79119 transitions. Second operand 4 states. [2019-12-18 14:20:13,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:20:13,341 INFO L93 Difference]: Finished difference Result 34136 states and 117485 transitions. [2019-12-18 14:20:13,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:20:13,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:20:13,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:20:13,495 INFO L225 Difference]: With dead ends: 34136 [2019-12-18 14:20:13,495 INFO L226 Difference]: Without dead ends: 34120 [2019-12-18 14:20:13,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:20:15,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34120 states. [2019-12-18 14:20:15,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34120 to 32747. [2019-12-18 14:20:15,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32747 states. [2019-12-18 14:20:15,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32747 states to 32747 states and 113702 transitions. [2019-12-18 14:20:15,962 INFO L78 Accepts]: Start accepts. Automaton has 32747 states and 113702 transitions. Word has length 11 [2019-12-18 14:20:15,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:20:15,963 INFO L462 AbstractCegarLoop]: Abstraction has 32747 states and 113702 transitions. [2019-12-18 14:20:15,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:20:15,963 INFO L276 IsEmpty]: Start isEmpty. Operand 32747 states and 113702 transitions. [2019-12-18 14:20:15,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:20:15,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:20:15,966 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:20:15,966 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:20:15,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:20:15,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1354653160, now seen corresponding path program 1 times [2019-12-18 14:20:15,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:20:15,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247273421] [2019-12-18 14:20:15,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:20:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:20:16,032 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-18 14:20:16,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247273421] [2019-12-18 14:20:16,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:20:16,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:20:16,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674067121] [2019-12-18 14:20:16,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:20:16,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:20:16,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:20:16,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:20:16,036 INFO L87 Difference]: Start difference. First operand 32747 states and 113702 transitions. Second operand 4 states. [2019-12-18 14:20:16,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:20:16,494 INFO L93 Difference]: Finished difference Result 42448 states and 144693 transitions. [2019-12-18 14:20:16,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:20:16,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 14:20:16,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:20:16,729 INFO L225 Difference]: With dead ends: 42448 [2019-12-18 14:20:16,729 INFO L226 Difference]: Without dead ends: 42433 [2019-12-18 14:20:16,730 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-18 14:20:17,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42433 states. [2019-12-18 14:20:19,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42433 to 37509. [2019-12-18 14:20:19,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37509 states. [2019-12-18 14:20:19,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37509 states to 37509 states and 129444 transitions. [2019-12-18 14:20:19,997 INFO L78 Accepts]: Start accepts. Automaton has 37509 states and 129444 transitions. Word has length 14 [2019-12-18 14:20:19,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:20:19,999 INFO L462 AbstractCegarLoop]: Abstraction has 37509 states and 129444 transitions. [2019-12-18 14:20:19,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:20:19,999 INFO L276 IsEmpty]: Start isEmpty. Operand 37509 states and 129444 transitions. [2019-12-18 14:20:20,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 14:20:20,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:20:20,004 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:20:20,005 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:20:20,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:20:20,005 INFO L82 PathProgramCache]: Analyzing trace with hash 287658910, now seen corresponding path program 1 times [2019-12-18 14:20:20,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:20:20,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229053042] [2019-12-18 14:20:20,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:20:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:20:20,053 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-18 14:20:20,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229053042] [2019-12-18 14:20:20,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:20:20,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:20:20,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553081158] [2019-12-18 14:20:20,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:20:20,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:20:20,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:20:20,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:20:20,058 INFO L87 Difference]: Start difference. First operand 37509 states and 129444 transitions. Second operand 3 states. [2019-12-18 14:20:20,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:20:20,201 INFO L93 Difference]: Finished difference Result 35330 states and 121730 transitions. [2019-12-18 14:20:20,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:20:20,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 14:20:20,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:20:20,309 INFO L225 Difference]: With dead ends: 35330 [2019-12-18 14:20:20,309 INFO L226 Difference]: Without dead ends: 35330 [2019-12-18 14:20:20,310 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-18 14:20:20,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35330 states. [2019-12-18 14:20:21,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35330 to 35330. [2019-12-18 14:20:21,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35330 states. [2019-12-18 14:20:21,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35330 states to 35330 states and 121730 transitions. [2019-12-18 14:20:21,463 INFO L78 Accepts]: Start accepts. Automaton has 35330 states and 121730 transitions. Word has length 16 [2019-12-18 14:20:21,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:20:21,463 INFO L462 AbstractCegarLoop]: Abstraction has 35330 states and 121730 transitions. [2019-12-18 14:20:21,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:20:21,463 INFO L276 IsEmpty]: Start isEmpty. Operand 35330 states and 121730 transitions. [2019-12-18 14:20:21,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 14:20:21,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:20:21,476 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-18 14:20:21,476 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:20:21,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:20:21,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1416377548, now seen corresponding path program 1 times [2019-12-18 14:20:21,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:20:21,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423550376] [2019-12-18 14:20:21,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:20:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:20:21,568 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-18 14:20:21,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423550376] [2019-12-18 14:20:21,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:20:21,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:20:21,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831910066] [2019-12-18 14:20:21,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:20:21,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:20:21,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:20:21,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:20:21,570 INFO L87 Difference]: Start difference. First operand 35330 states and 121730 transitions. Second operand 5 states. [2019-12-18 14:20:22,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:20:22,670 INFO L93 Difference]: Finished difference Result 42336 states and 143476 transitions. [2019-12-18 14:20:22,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:20:22,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-18 14:20:22,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:20:22,765 INFO L225 Difference]: With dead ends: 42336 [2019-12-18 14:20:22,766 INFO L226 Difference]: Without dead ends: 42308 [2019-12-18 14:20:22,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:20:23,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42308 states. [2019-12-18 14:20:24,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42308 to 35180. [2019-12-18 14:20:24,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35180 states. [2019-12-18 14:20:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35180 states to 35180 states and 121282 transitions. [2019-12-18 14:20:24,172 INFO L78 Accepts]: Start accepts. Automaton has 35180 states and 121282 transitions. Word has length 20 [2019-12-18 14:20:24,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:20:24,173 INFO L462 AbstractCegarLoop]: Abstraction has 35180 states and 121282 transitions. [2019-12-18 14:20:24,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:20:24,173 INFO L276 IsEmpty]: Start isEmpty. Operand 35180 states and 121282 transitions. [2019-12-18 14:20:24,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 14:20:24,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:20:24,219 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-18 14:20:24,219 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:20:24,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:20:24,220 INFO L82 PathProgramCache]: Analyzing trace with hash -904071527, now seen corresponding path program 1 times [2019-12-18 14:20:24,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:20:24,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720090927] [2019-12-18 14:20:24,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:20:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:20:24,294 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-18 14:20:24,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720090927] [2019-12-18 14:20:24,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:20:24,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:20:24,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913242109] [2019-12-18 14:20:24,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:20:24,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:20:24,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:20:24,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:20:24,298 INFO L87 Difference]: Start difference. First operand 35180 states and 121282 transitions. Second operand 4 states. [2019-12-18 14:20:24,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:20:24,352 INFO L93 Difference]: Finished difference Result 5875 states and 16524 transitions. [2019-12-18 14:20:24,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:20:24,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-12-18 14:20:24,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:20:24,360 INFO L225 Difference]: With dead ends: 5875 [2019-12-18 14:20:24,360 INFO L226 Difference]: Without dead ends: 3697 [2019-12-18 14:20:24,361 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-18 14:20:24,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3697 states. [2019-12-18 14:20:24,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3697 to 3697. [2019-12-18 14:20:24,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3697 states. [2019-12-18 14:20:24,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3697 states to 3697 states and 9023 transitions. [2019-12-18 14:20:24,420 INFO L78 Accepts]: Start accepts. Automaton has 3697 states and 9023 transitions. Word has length 30 [2019-12-18 14:20:24,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:20:24,421 INFO L462 AbstractCegarLoop]: Abstraction has 3697 states and 9023 transitions. [2019-12-18 14:20:24,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:20:24,421 INFO L276 IsEmpty]: Start isEmpty. Operand 3697 states and 9023 transitions. [2019-12-18 14:20:24,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:20:24,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:20:24,427 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] [2019-12-18 14:20:24,427 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:20:24,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:20:24,428 INFO L82 PathProgramCache]: Analyzing trace with hash 927574064, now seen corresponding path program 1 times [2019-12-18 14:20:24,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:20:24,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542255700] [2019-12-18 14:20:24,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:20:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:20:24,513 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-18 14:20:24,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542255700] [2019-12-18 14:20:24,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:20:24,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:20:24,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063048870] [2019-12-18 14:20:24,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:20:24,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:20:24,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:20:24,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:20:24,516 INFO L87 Difference]: Start difference. First operand 3697 states and 9023 transitions. Second operand 5 states. [2019-12-18 14:20:24,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:20:24,623 INFO L93 Difference]: Finished difference Result 6071 states and 15015 transitions. [2019-12-18 14:20:24,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:20:24,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-18 14:20:24,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:20:24,629 INFO L225 Difference]: With dead ends: 6071 [2019-12-18 14:20:24,629 INFO L226 Difference]: Without dead ends: 4750 [2019-12-18 14:20:24,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:20:24,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4750 states. [2019-12-18 14:20:24,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4750 to 4750. [2019-12-18 14:20:24,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4750 states. [2019-12-18 14:20:24,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4750 states to 4750 states and 11868 transitions. [2019-12-18 14:20:24,699 INFO L78 Accepts]: Start accepts. Automaton has 4750 states and 11868 transitions. Word has length 41 [2019-12-18 14:20:24,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:20:24,700 INFO L462 AbstractCegarLoop]: Abstraction has 4750 states and 11868 transitions. [2019-12-18 14:20:24,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:20:24,700 INFO L276 IsEmpty]: Start isEmpty. Operand 4750 states and 11868 transitions. [2019-12-18 14:20:24,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 14:20:24,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:20:24,707 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] [2019-12-18 14:20:24,707 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:20:24,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:20:24,708 INFO L82 PathProgramCache]: Analyzing trace with hash -759882014, now seen corresponding path program 1 times [2019-12-18 14:20:24,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:20:24,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164829473] [2019-12-18 14:20:24,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:20:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:20:24,800 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-18 14:20:24,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164829473] [2019-12-18 14:20:24,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:20:24,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:20:24,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958417062] [2019-12-18 14:20:24,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:20:24,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:20:24,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:20:24,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:20:24,802 INFO L87 Difference]: Start difference. First operand 4750 states and 11868 transitions. Second operand 5 states. [2019-12-18 14:20:25,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:20:25,232 INFO L93 Difference]: Finished difference Result 5410 states and 13278 transitions. [2019-12-18 14:20:25,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:20:25,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-18 14:20:25,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:20:25,240 INFO L225 Difference]: With dead ends: 5410 [2019-12-18 14:20:25,240 INFO L226 Difference]: Without dead ends: 5410 [2019-12-18 14:20:25,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:20:25,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5410 states. [2019-12-18 14:20:25,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5410 to 5148. [2019-12-18 14:20:25,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5148 states. [2019-12-18 14:20:25,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5148 states to 5148 states and 12759 transitions. [2019-12-18 14:20:25,296 INFO L78 Accepts]: Start accepts. Automaton has 5148 states and 12759 transitions. Word has length 42 [2019-12-18 14:20:25,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:20:25,296 INFO L462 AbstractCegarLoop]: Abstraction has 5148 states and 12759 transitions. [2019-12-18 14:20:25,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:20:25,297 INFO L276 IsEmpty]: Start isEmpty. Operand 5148 states and 12759 transitions. [2019-12-18 14:20:25,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 14:20:25,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:20:25,303 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:20:25,303 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:20:25,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:20:25,303 INFO L82 PathProgramCache]: Analyzing trace with hash -800932999, now seen corresponding path program 1 times [2019-12-18 14:20:25,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:20:25,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562163222] [2019-12-18 14:20:25,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:20:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:20:25,395 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-18 14:20:25,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562163222] [2019-12-18 14:20:25,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:20:25,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:20:25,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097758818] [2019-12-18 14:20:25,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:20:25,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:20:25,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:20:25,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:20:25,398 INFO L87 Difference]: Start difference. First operand 5148 states and 12759 transitions. Second operand 5 states. [2019-12-18 14:20:25,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:20:25,776 INFO L93 Difference]: Finished difference Result 6138 states and 14768 transitions. [2019-12-18 14:20:25,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:20:25,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-18 14:20:25,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:20:25,784 INFO L225 Difference]: With dead ends: 6138 [2019-12-18 14:20:25,784 INFO L226 Difference]: Without dead ends: 6138 [2019-12-18 14:20:25,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:20:25,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6138 states. [2019-12-18 14:20:26,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6138 to 5202. [2019-12-18 14:20:26,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5202 states. [2019-12-18 14:20:26,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5202 states to 5202 states and 12514 transitions. [2019-12-18 14:20:26,109 INFO L78 Accepts]: Start accepts. Automaton has 5202 states and 12514 transitions. Word has length 43 [2019-12-18 14:20:26,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:20:26,109 INFO L462 AbstractCegarLoop]: Abstraction has 5202 states and 12514 transitions. [2019-12-18 14:20:26,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:20:26,109 INFO L276 IsEmpty]: Start isEmpty. Operand 5202 states and 12514 transitions. [2019-12-18 14:20:26,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 14:20:26,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:20:26,115 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:20:26,116 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:20:26,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:20:26,116 INFO L82 PathProgramCache]: Analyzing trace with hash 551589791, now seen corresponding path program 1 times [2019-12-18 14:20:26,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:20:26,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599902599] [2019-12-18 14:20:26,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:20:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:20:26,208 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-18 14:20:26,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599902599] [2019-12-18 14:20:26,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:20:26,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:20:26,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359995456] [2019-12-18 14:20:26,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:20:26,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:20:26,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:20:26,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:20:26,210 INFO L87 Difference]: Start difference. First operand 5202 states and 12514 transitions. Second operand 5 states. [2019-12-18 14:20:26,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:20:26,258 INFO L93 Difference]: Finished difference Result 3468 states and 8399 transitions. [2019-12-18 14:20:26,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:20:26,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-18 14:20:26,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:20:26,264 INFO L225 Difference]: With dead ends: 3468 [2019-12-18 14:20:26,264 INFO L226 Difference]: Without dead ends: 3272 [2019-12-18 14:20:26,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:20:26,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3272 states. [2019-12-18 14:20:26,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3272 to 3137. [2019-12-18 14:20:26,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2019-12-18 14:20:26,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 7692 transitions. [2019-12-18 14:20:26,316 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 7692 transitions. Word has length 43 [2019-12-18 14:20:26,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:20:26,316 INFO L462 AbstractCegarLoop]: Abstraction has 3137 states and 7692 transitions. [2019-12-18 14:20:26,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:20:26,317 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 7692 transitions. [2019-12-18 14:20:26,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 14:20:26,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:20:26,324 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:20:26,324 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:20:26,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:20:26,325 INFO L82 PathProgramCache]: Analyzing trace with hash 856625615, now seen corresponding path program 1 times [2019-12-18 14:20:26,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:20:26,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965215293] [2019-12-18 14:20:26,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:20:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:20:26,427 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-18 14:20:26,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965215293] [2019-12-18 14:20:26,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:20:26,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:20:26,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038567984] [2019-12-18 14:20:26,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:20:26,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:20:26,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:20:26,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:20:26,431 INFO L87 Difference]: Start difference. First operand 3137 states and 7692 transitions. Second operand 4 states. [2019-12-18 14:20:26,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:20:26,462 INFO L93 Difference]: Finished difference Result 3830 states and 9227 transitions. [2019-12-18 14:20:26,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:20:26,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-18 14:20:26,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:20:26,465 INFO L225 Difference]: With dead ends: 3830 [2019-12-18 14:20:26,465 INFO L226 Difference]: Without dead ends: 764 [2019-12-18 14:20:26,465 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-18 14:20:26,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-12-18 14:20:26,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 764. [2019-12-18 14:20:26,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2019-12-18 14:20:26,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1638 transitions. [2019-12-18 14:20:26,477 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1638 transitions. Word has length 59 [2019-12-18 14:20:26,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:20:26,477 INFO L462 AbstractCegarLoop]: Abstraction has 764 states and 1638 transitions. [2019-12-18 14:20:26,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:20:26,478 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1638 transitions. [2019-12-18 14:20:26,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 14:20:26,480 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:20:26,480 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:20:26,481 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:20:26,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:20:26,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1805007936, now seen corresponding path program 1 times [2019-12-18 14:20:26,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:20:26,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489716752] [2019-12-18 14:20:26,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:20:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:20:26,672 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-18 14:20:26,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489716752] [2019-12-18 14:20:26,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:20:26,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:20:26,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930388474] [2019-12-18 14:20:26,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 14:20:26,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:20:26,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 14:20:26,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:20:26,674 INFO L87 Difference]: Start difference. First operand 764 states and 1638 transitions. Second operand 8 states. [2019-12-18 14:20:26,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:20:26,961 INFO L93 Difference]: Finished difference Result 2344 states and 4930 transitions. [2019-12-18 14:20:26,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 14:20:26,961 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-12-18 14:20:26,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:20:26,964 INFO L225 Difference]: With dead ends: 2344 [2019-12-18 14:20:26,964 INFO L226 Difference]: Without dead ends: 1622 [2019-12-18 14:20:26,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-18 14:20:26,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2019-12-18 14:20:26,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 895. [2019-12-18 14:20:26,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-12-18 14:20:26,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1903 transitions. [2019-12-18 14:20:26,976 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1903 transitions. Word has length 59 [2019-12-18 14:20:26,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:20:26,977 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1903 transitions. [2019-12-18 14:20:26,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 14:20:26,977 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1903 transitions. [2019-12-18 14:20:26,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 14:20:26,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:20:26,979 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:20:26,979 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:20:26,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:20:26,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1971095894, now seen corresponding path program 2 times [2019-12-18 14:20:26,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:20:26,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697777228] [2019-12-18 14:20:26,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:20:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:20:27,147 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-18 14:20:27,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697777228] [2019-12-18 14:20:27,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:20:27,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:20:27,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304889107] [2019-12-18 14:20:27,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:20:27,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:20:27,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:20:27,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:20:27,149 INFO L87 Difference]: Start difference. First operand 895 states and 1903 transitions. Second operand 10 states. [2019-12-18 14:20:27,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:20:27,938 INFO L93 Difference]: Finished difference Result 1887 states and 4038 transitions. [2019-12-18 14:20:27,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 14:20:27,939 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-18 14:20:27,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:20:27,942 INFO L225 Difference]: With dead ends: 1887 [2019-12-18 14:20:27,942 INFO L226 Difference]: Without dead ends: 1887 [2019-12-18 14:20:27,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:20:27,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2019-12-18 14:20:27,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1023. [2019-12-18 14:20:27,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2019-12-18 14:20:27,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 2214 transitions. [2019-12-18 14:20:27,956 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 2214 transitions. Word has length 59 [2019-12-18 14:20:27,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:20:27,957 INFO L462 AbstractCegarLoop]: Abstraction has 1023 states and 2214 transitions. [2019-12-18 14:20:27,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:20:27,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 2214 transitions. [2019-12-18 14:20:27,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 14:20:27,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:20:27,959 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:20:27,959 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:20:27,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:20:27,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1333119268, now seen corresponding path program 3 times [2019-12-18 14:20:27,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:20:27,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947443765] [2019-12-18 14:20:27,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:20:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:20:28,049 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-18 14:20:28,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947443765] [2019-12-18 14:20:28,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:20:28,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:20:28,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882882351] [2019-12-18 14:20:28,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:20:28,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:20:28,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:20:28,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:20:28,051 INFO L87 Difference]: Start difference. First operand 1023 states and 2214 transitions. Second operand 6 states. [2019-12-18 14:20:28,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:20:28,474 INFO L93 Difference]: Finished difference Result 1310 states and 2782 transitions. [2019-12-18 14:20:28,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:20:28,474 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-18 14:20:28,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:20:28,476 INFO L225 Difference]: With dead ends: 1310 [2019-12-18 14:20:28,477 INFO L226 Difference]: Without dead ends: 1310 [2019-12-18 14:20:28,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:20:28,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2019-12-18 14:20:28,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1029. [2019-12-18 14:20:28,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2019-12-18 14:20:28,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 2225 transitions. [2019-12-18 14:20:28,494 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 2225 transitions. Word has length 59 [2019-12-18 14:20:28,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:20:28,494 INFO L462 AbstractCegarLoop]: Abstraction has 1029 states and 2225 transitions. [2019-12-18 14:20:28,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:20:28,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 2225 transitions. [2019-12-18 14:20:28,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 14:20:28,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:20:28,497 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:20:28,497 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:20:28,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:20:28,498 INFO L82 PathProgramCache]: Analyzing trace with hash -320938732, now seen corresponding path program 4 times [2019-12-18 14:20:28,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:20:28,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165320297] [2019-12-18 14:20:28,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:20:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:20:28,563 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-18 14:20:28,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165320297] [2019-12-18 14:20:28,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:20:28,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:20:28,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153968708] [2019-12-18 14:20:28,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:20:28,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:20:28,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:20:28,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:20:28,565 INFO L87 Difference]: Start difference. First operand 1029 states and 2225 transitions. Second operand 3 states. [2019-12-18 14:20:28,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:20:28,577 INFO L93 Difference]: Finished difference Result 1028 states and 2223 transitions. [2019-12-18 14:20:28,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:20:28,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 14:20:28,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:20:28,579 INFO L225 Difference]: With dead ends: 1028 [2019-12-18 14:20:28,579 INFO L226 Difference]: Without dead ends: 1028 [2019-12-18 14:20:28,580 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-18 14:20:28,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2019-12-18 14:20:28,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 902. [2019-12-18 14:20:28,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2019-12-18 14:20:28,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1983 transitions. [2019-12-18 14:20:28,592 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1983 transitions. Word has length 59 [2019-12-18 14:20:28,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:20:28,593 INFO L462 AbstractCegarLoop]: Abstraction has 902 states and 1983 transitions. [2019-12-18 14:20:28,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:20:28,593 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1983 transitions. [2019-12-18 14:20:28,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 14:20:28,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:20:28,595 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-18 14:20:28,595 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:20:28,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:20:28,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1249946427, now seen corresponding path program 1 times [2019-12-18 14:20:28,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:20:28,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564547888] [2019-12-18 14:20:28,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:20:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:20:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:20:28,705 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:20:28,706 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:20:28,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1771~0.base_19|)) (= 0 v_~y$r_buff0_thd2~0_427) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t1771~0.base_19| 1)) (= 0 v_~__unbuffered_p0_EAX~0_40) (= v_~y$r_buff0_thd0~0_102 0) (= 0 v_~__unbuffered_p1_EAX~0_40) (= 0 v_~y$w_buff0~0_194) (= v_~main$tmp_guard0~0_27 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1771~0.base_19| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1771~0.base_19|) |v_ULTIMATE.start_main_~#t1771~0.offset_14| 0)) |v_#memory_int_17|) (= |v_ULTIMATE.start_main_~#t1771~0.offset_14| 0) (= v_~y$read_delayed~0_6 0) (= v_~y$r_buff1_thd1~0_255 0) (= v_~y$flush_delayed~0_195 0) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_4|) (= v_~weak$$choice2~0_242 0) (= 0 v_~weak$$choice0~0_161) (= v_~y$r_buff0_thd1~0_290 0) (= v_~main$tmp_guard1~0_32 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1771~0.base_19| 4)) (= v_~x~0_50 0) (= 0 v_~__unbuffered_cnt~0_49) (= |v_#NULL.offset_4| 0) (= v_~y$w_buff1~0_196 0) (= v_~y$w_buff0_used~0_766 0) (= v_~y$r_buff1_thd0~0_184 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~__unbuffered_p1_EBX~0_32 0) (= v_~y~0_216 0) (= v_~y$w_buff1_used~0_425 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1771~0.base_19|) (= 0 v_~y$r_buff1_thd2~0_284) (= v_~y$mem_tmp~0_173 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_766, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_15|, ULTIMATE.start_main_~#t1772~0.base=|v_ULTIMATE.start_main_~#t1772~0.base_17|, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_255, ~y$mem_tmp~0=v_~y$mem_tmp~0_173, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, ~y$w_buff0~0=v_~y$w_buff0~0_194, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_290, ~y$flush_delayed~0=v_~y$flush_delayed~0_195, #length=|v_#length_17|, ~y~0=v_~y~0_216, ULTIMATE.start_main_~#t1771~0.base=|v_ULTIMATE.start_main_~#t1771~0.base_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_129|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_84|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_40|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ULTIMATE.start_main_~#t1772~0.offset=|v_ULTIMATE.start_main_~#t1772~0.offset_15|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_61|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_284, ~weak$$choice0~0=v_~weak$$choice0~0_161, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_198|, ULTIMATE.start_main_~#t1771~0.offset=|v_ULTIMATE.start_main_~#t1771~0.offset_14|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_30|, ~y$w_buff1~0=v_~y$w_buff1~0_196, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_102, #valid=|v_#valid_45|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_427, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_242, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_184, ~x~0=v_~x~0_50, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_425} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, ULTIMATE.start_main_~#t1772~0.base, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1771~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1772~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t1771~0.offset, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 14:20:28,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L810-1-->L812: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1772~0.base_11| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1772~0.base_11|) (= |v_ULTIMATE.start_main_~#t1772~0.offset_10| 0) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1772~0.base_11|)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1772~0.base_11| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1772~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1772~0.base_11|) |v_ULTIMATE.start_main_~#t1772~0.offset_10| 1)) |v_#memory_int_11|) (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1772~0.base_11| 1) |v_#valid_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1772~0.base=|v_ULTIMATE.start_main_~#t1772~0.base_11|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1772~0.offset=|v_ULTIMATE.start_main_~#t1772~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t1772~0.base, #length, ULTIMATE.start_main_~#t1772~0.offset] because there is no mapped edge [2019-12-18 14:20:28,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] P1ENTRY-->L5-3: Formula: (and (= v_~y$w_buff0_used~0_154 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| 1) (= 1 v_~y$w_buff0~0_41) (= |v_P1Thread1of1ForFork1_#in~arg.offset_8| v_P1Thread1of1ForFork1_~arg.offset_8) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_10) (= v_~y$w_buff1_used~0_78 v_~y$w_buff0_used~0_155) (= v_P1Thread1of1ForFork1_~arg.base_8 |v_P1Thread1of1ForFork1_#in~arg.base_8|) (= 0 (mod v_~y$w_buff1_used~0_78 256)) (= v_~y$w_buff0~0_42 v_~y$w_buff1~0_30)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_155, ~y$w_buff0~0=v_~y$w_buff0~0_42, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_10, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_154, ~y$w_buff1~0=v_~y$w_buff1~0_30, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_8|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_8, ~y$w_buff0~0=v_~y$w_buff0~0_41, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_78} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 14:20:28,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [927] [927] L772-2-->L772-5: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd2~0_In1450455449 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1450455449 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite28_Out1450455449| |P1Thread1of1ForFork1_#t~ite29_Out1450455449|))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_Out1450455449| ~y$w_buff0~0_In1450455449) (not .cse0) .cse1 (not .cse2)) (and (or .cse2 .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out1450455449| ~y$w_buff1~0_In1450455449) .cse1))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1450455449, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1450455449, ~y$w_buff0~0=~y$w_buff0~0_In1450455449, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1450455449} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1450455449|, ~y$w_buff1~0=~y$w_buff1~0_In1450455449, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1450455449, ~y$w_buff0~0=~y$w_buff0~0_In1450455449, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1450455449, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1450455449|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 14:20:28,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L777-->L778: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_69 256))) (= v_~y$r_buff0_thd2~0_142 v_~y$r_buff0_thd2~0_141)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_142, ~weak$$choice2~0=v_~weak$$choice2~0_69} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_141, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_11|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_13|, ~weak$$choice2~0=v_~weak$$choice2~0_69} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-18 14:20:28,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-702168170 256)))) (or (and (= ~y~0_In-702168170 |P1Thread1of1ForFork1_#t~ite48_Out-702168170|) .cse0) (and (= |P1Thread1of1ForFork1_#t~ite48_Out-702168170| ~y$mem_tmp~0_In-702168170) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-702168170, ~y$flush_delayed~0=~y$flush_delayed~0_In-702168170, ~y~0=~y~0_In-702168170} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-702168170, ~y$flush_delayed~0=~y$flush_delayed~0_In-702168170, ~y~0=~y~0_In-702168170, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out-702168170|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-18 14:20:28,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [918] [918] L744-->L744-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1260511168 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite25_Out1260511168| ~y~0_In1260511168) .cse0) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite25_Out1260511168| ~y$mem_tmp~0_In1260511168)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1260511168, ~y$flush_delayed~0=~y$flush_delayed~0_In1260511168, ~y~0=~y~0_In1260511168} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1260511168, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out1260511168|, ~y$flush_delayed~0=~y$flush_delayed~0_In1260511168, ~y~0=~y~0_In1260511168} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-18 14:20:28,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L744-2-->P0EXIT: Formula: (and (= v_~y$flush_delayed~0_168 0) (= v_~y~0_183 |v_P0Thread1of1ForFork0_#t~ite25_32|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_31|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_168, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~y~0=v_~y~0_183} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-18 14:20:28,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-324624769 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-324624769 256)))) (or (and (= ~y$w_buff0_used~0_In-324624769 |P1Thread1of1ForFork1_#t~ite51_Out-324624769|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite51_Out-324624769|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-324624769, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-324624769} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-324624769, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-324624769|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-324624769} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-18 14:20:28,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [919] [919] L789-->L789-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In1801877143 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1801877143 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1801877143 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1801877143 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite52_Out1801877143| ~y$w_buff1_used~0_In1801877143) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite52_Out1801877143| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1801877143, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1801877143, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1801877143, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1801877143} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1801877143, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1801877143, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out1801877143|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1801877143, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1801877143} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-18 14:20:28,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L790-->L791: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1940687422 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1940687422 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_Out-1940687422 ~y$r_buff0_thd2~0_In-1940687422)) (and (not .cse1) (= ~y$r_buff0_thd2~0_Out-1940687422 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1940687422, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1940687422} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-1940687422|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1940687422, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1940687422} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 14:20:28,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [910] [910] L791-->L791-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In56184655 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In56184655 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In56184655 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In56184655 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In56184655 |P1Thread1of1ForFork1_#t~ite54_Out56184655|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite54_Out56184655|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In56184655, ~y$w_buff0_used~0=~y$w_buff0_used~0_In56184655, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In56184655, ~y$w_buff1_used~0=~y$w_buff1_used~0_In56184655} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In56184655, ~y$w_buff0_used~0=~y$w_buff0_used~0_In56184655, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In56184655, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out56184655|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In56184655} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-18 14:20:28,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L791-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_26 1) v_~__unbuffered_cnt~0_25) (= v_~y$r_buff1_thd2~0_210 |v_P1Thread1of1ForFork1_#t~ite54_20|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_20|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_210, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_19|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 14:20:28,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L816-->L818-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= 0 (mod v_~y$w_buff0_used~0_203 256)) (= (mod v_~y$r_buff0_thd0~0_26 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_203, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_203, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 14:20:28,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L818-2-->L818-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In152847582 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In152847582 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite57_Out152847582| ~y$w_buff1~0_In152847582) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite57_Out152847582| ~y~0_In152847582) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In152847582, ~y~0=~y~0_In152847582, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In152847582, ~y$w_buff1_used~0=~y$w_buff1_used~0_In152847582} OutVars{~y$w_buff1~0=~y$w_buff1~0_In152847582, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out152847582|, ~y~0=~y~0_In152847582, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In152847582, ~y$w_buff1_used~0=~y$w_buff1_used~0_In152847582} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-18 14:20:28,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L818-4-->L819: Formula: (= v_~y~0_45 |v_ULTIMATE.start_main_#t~ite57_16|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_16|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_26|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_15|, ~y~0=v_~y~0_45} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~y~0] because there is no mapped edge [2019-12-18 14:20:28,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1875274950 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1875274950 256)))) (or (and (= |ULTIMATE.start_main_#t~ite59_Out-1875274950| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite59_Out-1875274950| ~y$w_buff0_used~0_In-1875274950) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1875274950, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1875274950} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1875274950, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1875274950, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1875274950|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-18 14:20:28,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [911] [911] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In211574029 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In211574029 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In211574029 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In211574029 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite60_Out211574029| ~y$w_buff1_used~0_In211574029) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite60_Out211574029| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In211574029, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In211574029, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In211574029, ~y$w_buff1_used~0=~y$w_buff1_used~0_In211574029} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out211574029|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In211574029, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In211574029, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In211574029, ~y$w_buff1_used~0=~y$w_buff1_used~0_In211574029} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-18 14:20:28,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1516758138 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1516758138 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-1516758138| ~y$r_buff0_thd0~0_In-1516758138)) (and (= |ULTIMATE.start_main_#t~ite61_Out-1516758138| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1516758138, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1516758138} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1516758138|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1516758138, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1516758138} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-18 14:20:28,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [920] [920] L822-->L822-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In583990 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In583990 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In583990 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In583990 256)))) (or (and (= ~y$r_buff1_thd0~0_In583990 |ULTIMATE.start_main_#t~ite62_Out583990|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite62_Out583990|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In583990, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In583990, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In583990, ~y$w_buff1_used~0=~y$w_buff1_used~0_In583990} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out583990|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In583990, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In583990, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In583990, ~y$w_buff1_used~0=~y$w_buff1_used~0_In583990} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-18 14:20:28,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [969] [969] L822-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_18 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_18 256)) (= v_~y$r_buff1_thd0~0_164 |v_ULTIMATE.start_main_#t~ite62_41|) (= 0 v_~__unbuffered_p0_EAX~0_32) (= 1 v_~__unbuffered_p1_EAX~0_23) (= v_~__unbuffered_p1_EBX~0_23 0)) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_41|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_40|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_164, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:20:28,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:20:28 BasicIcfg [2019-12-18 14:20:28,857 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:20:28,859 INFO L168 Benchmark]: Toolchain (without parser) took 28702.92 ms. Allocated memory was 146.8 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 102.2 MB in the beginning and 373.2 MB in the end (delta: -271.1 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-18 14:20:28,860 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 146.8 MB. Free memory was 121.9 MB in the beginning and 121.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 14:20:28,861 INFO L168 Benchmark]: CACSL2BoogieTranslator took 799.40 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 101.7 MB in the beginning and 157.0 MB in the end (delta: -55.3 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-18 14:20:28,862 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.96 ms. Allocated memory is still 203.9 MB. Free memory was 157.0 MB in the beginning and 154.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:20:28,862 INFO L168 Benchmark]: Boogie Preprocessor took 39.46 ms. Allocated memory is still 203.9 MB. Free memory was 154.4 MB in the beginning and 151.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:20:28,863 INFO L168 Benchmark]: RCFGBuilder took 918.96 ms. Allocated memory is still 203.9 MB. Free memory was 151.9 MB in the beginning and 98.9 MB in the end (delta: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 7.1 GB. [2019-12-18 14:20:28,864 INFO L168 Benchmark]: TraceAbstraction took 26869.79 ms. Allocated memory was 203.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 98.9 MB in the beginning and 373.2 MB in the end (delta: -274.4 MB). Peak memory consumption was 976.1 MB. Max. memory is 7.1 GB. [2019-12-18 14:20:28,868 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46 ms. Allocated memory is still 146.8 MB. Free memory was 121.9 MB in the beginning and 121.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 799.40 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 101.7 MB in the beginning and 157.0 MB in the end (delta: -55.3 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.96 ms. Allocated memory is still 203.9 MB. Free memory was 157.0 MB in the beginning and 154.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.46 ms. Allocated memory is still 203.9 MB. Free memory was 154.4 MB in the beginning and 151.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 918.96 ms. Allocated memory is still 203.9 MB. Free memory was 151.9 MB in the beginning and 98.9 MB in the end (delta: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26869.79 ms. Allocated memory was 203.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 98.9 MB in the beginning and 373.2 MB in the end (delta: -274.4 MB). Peak memory consumption was 976.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 178 ProgramPointsBefore, 102 ProgramPointsAfterwards, 227 TransitionsBefore, 126 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 53 ConcurrentYvCompositions, 28 ChoiceCompositions, 9537 VarBasedMoverChecksPositive, 264 VarBasedMoverChecksNegative, 66 SemBasedMoverChecksPositive, 279 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 121847 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t1771, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] FCALL, FORK 0 pthread_create(&t1772, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L763] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L764] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L765] 2 y$r_buff0_thd2 = (_Bool)1 [L768] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 2 y$flush_delayed = weak$$choice2 [L771] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L773] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L774] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L775] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L776] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 2 y = y$flush_delayed ? y$mem_tmp : y [L781] 2 y$flush_delayed = (_Bool)0 [L784] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 x = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 y$flush_delayed = weak$$choice2 [L735] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L737] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L738] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L739] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L787] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L742] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L787] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L789] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 172 locations, 2 error locations. Result: UNSAFE, OverallTime: 26.5s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2925 SDtfs, 3327 SDslu, 5355 SDs, 0 SdLazy, 2823 SolverSat, 123 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 24 SyntacticMatches, 11 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37509occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 16756 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 620 NumberOfCodeBlocks, 620 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 545 ConstructedInterpolants, 0 QuantifiedInterpolants, 78825 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...