/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/rfi007_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:18:05,869 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:18:05,872 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:18:05,900 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:18:05,901 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:18:05,902 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:18:05,925 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:18:05,927 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:18:05,929 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:18:05,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:18:05,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:18:05,932 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:18:05,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:18:05,933 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:18:05,934 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:18:05,939 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:18:05,940 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:18:05,941 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:18:05,942 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:18:05,947 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:18:05,951 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:18:05,955 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:18:05,957 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:18:05,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:18:05,960 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:18:05,960 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:18:05,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:18:05,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:18:05,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:18:05,965 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:18:05,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:18:05,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:18:05,969 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:18:05,970 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:18:05,974 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:18:05,974 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:18:05,976 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:18:05,976 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:18:05,976 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:18:05,980 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:18:05,981 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:18:05,982 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:18:06,002 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:18:06,003 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:18:06,004 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:18:06,004 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:18:06,004 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:18:06,005 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:18:06,005 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:18:06,005 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:18:06,005 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:18:06,005 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:18:06,006 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:18:06,006 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:18:06,006 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:18:06,006 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:18:06,006 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:18:06,007 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:18:06,007 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:18:06,007 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:18:06,007 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:18:06,007 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:18:06,008 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:18:06,008 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:18:06,008 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:18:06,008 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:18:06,008 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:18:06,009 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:18:06,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:18:06,009 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:18:06,009 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:18:06,009 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:18:06,271 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:18:06,280 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:18:06,284 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:18:06,286 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:18:06,286 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:18:06,287 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc.i [2019-12-26 23:18:06,355 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9ef0fb49/e734ad00b6094fd59b6f7cb72ee83ebe/FLAG26d20e1cc [2019-12-26 23:18:06,966 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:18:06,967 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc.i [2019-12-26 23:18:06,980 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9ef0fb49/e734ad00b6094fd59b6f7cb72ee83ebe/FLAG26d20e1cc [2019-12-26 23:18:07,201 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9ef0fb49/e734ad00b6094fd59b6f7cb72ee83ebe [2019-12-26 23:18:07,214 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:18:07,216 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:18:07,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:18:07,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:18:07,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:18:07,224 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:18:07" (1/1) ... [2019-12-26 23:18:07,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@730866ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:07, skipping insertion in model container [2019-12-26 23:18:07,227 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:18:07" (1/1) ... [2019-12-26 23:18:07,235 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:18:07,296 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:18:07,844 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:18:07,856 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:18:07,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:18:08,004 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:18:08,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:08 WrapperNode [2019-12-26 23:18:08,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:18:08,006 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:18:08,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:18:08,006 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:18:08,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:08" (1/1) ... [2019-12-26 23:18:08,034 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:08" (1/1) ... [2019-12-26 23:18:08,064 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:18:08,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:18:08,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:18:08,065 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:18:08,075 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:08" (1/1) ... [2019-12-26 23:18:08,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:08" (1/1) ... [2019-12-26 23:18:08,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:08" (1/1) ... [2019-12-26 23:18:08,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:08" (1/1) ... [2019-12-26 23:18:08,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:08" (1/1) ... [2019-12-26 23:18:08,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:08" (1/1) ... [2019-12-26 23:18:08,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:08" (1/1) ... [2019-12-26 23:18:08,113 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:18:08,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:18:08,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:18:08,114 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:18:08,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:18:08,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:18:08,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:18:08,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:18:08,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:18:08,173 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:18:08,173 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:18:08,173 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:18:08,173 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:18:08,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:18:08,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:18:08,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:18:08,175 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:18:08,927 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:18:08,927 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:18:08,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:18:08 BoogieIcfgContainer [2019-12-26 23:18:08,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:18:08,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:18:08,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:18:08,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:18:08,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:18:07" (1/3) ... [2019-12-26 23:18:08,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e7e406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:18:08, skipping insertion in model container [2019-12-26 23:18:08,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:18:08" (2/3) ... [2019-12-26 23:18:08,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e7e406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:18:08, skipping insertion in model container [2019-12-26 23:18:08,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:18:08" (3/3) ... [2019-12-26 23:18:08,941 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_power.oepc.i [2019-12-26 23:18:08,954 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:18:08,954 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:18:08,969 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:18:08,970 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:18:09,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,031 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,031 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,032 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,032 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,033 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,045 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,047 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,117 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,118 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,118 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,124 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,127 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:18:09,143 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 23:18:09,164 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:18:09,165 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:18:09,165 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:18:09,165 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:18:09,165 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:18:09,165 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:18:09,165 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:18:09,165 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:18:09,182 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-26 23:18:09,184 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-26 23:18:09,282 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-26 23:18:09,282 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:18:09,297 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 23:18:09,317 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-26 23:18:09,363 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-26 23:18:09,363 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:18:09,369 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 23:18:09,384 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-26 23:18:09,385 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:18:14,265 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-26 23:18:14,389 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-26 23:18:14,735 INFO L206 etLargeBlockEncoding]: Checked pairs total: 76691 [2019-12-26 23:18:14,735 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-26 23:18:14,739 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 90 transitions [2019-12-26 23:18:15,295 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9438 states. [2019-12-26 23:18:15,298 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states. [2019-12-26 23:18:15,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 23:18:15,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:18:15,305 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 23:18:15,305 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:18:15,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:18:15,312 INFO L82 PathProgramCache]: Analyzing trace with hash 790297, now seen corresponding path program 1 times [2019-12-26 23:18:15,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:18:15,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122663581] [2019-12-26 23:18:15,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:18:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:18:15,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:18:15,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122663581] [2019-12-26 23:18:15,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:18:15,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:18:15,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181735339] [2019-12-26 23:18:15,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:18:15,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:18:15,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:18:15,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:18:15,565 INFO L87 Difference]: Start difference. First operand 9438 states. Second operand 3 states. [2019-12-26 23:18:15,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:18:15,832 INFO L93 Difference]: Finished difference Result 9266 states and 29920 transitions. [2019-12-26 23:18:15,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:18:15,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 23:18:15,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:18:15,995 INFO L225 Difference]: With dead ends: 9266 [2019-12-26 23:18:15,995 INFO L226 Difference]: Without dead ends: 8258 [2019-12-26 23:18:15,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:18:16,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8258 states. [2019-12-26 23:18:16,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8258 to 8258. [2019-12-26 23:18:16,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8258 states. [2019-12-26 23:18:16,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8258 states to 8258 states and 26572 transitions. [2019-12-26 23:18:16,577 INFO L78 Accepts]: Start accepts. Automaton has 8258 states and 26572 transitions. Word has length 3 [2019-12-26 23:18:16,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:18:16,578 INFO L462 AbstractCegarLoop]: Abstraction has 8258 states and 26572 transitions. [2019-12-26 23:18:16,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:18:16,578 INFO L276 IsEmpty]: Start isEmpty. Operand 8258 states and 26572 transitions. [2019-12-26 23:18:16,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:18:16,581 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:18:16,582 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:18:16,582 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:18:16,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:18:16,582 INFO L82 PathProgramCache]: Analyzing trace with hash 316025548, now seen corresponding path program 1 times [2019-12-26 23:18:16,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:18:16,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790612229] [2019-12-26 23:18:16,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:18:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:18:16,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:18:16,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790612229] [2019-12-26 23:18:16,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:18:16,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:18:16,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914474110] [2019-12-26 23:18:16,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:18:16,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:18:16,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:18:16,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:18:16,683 INFO L87 Difference]: Start difference. First operand 8258 states and 26572 transitions. Second operand 4 states. [2019-12-26 23:18:17,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:18:17,190 INFO L93 Difference]: Finished difference Result 12603 states and 38772 transitions. [2019-12-26 23:18:17,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:18:17,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:18:17,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:18:17,264 INFO L225 Difference]: With dead ends: 12603 [2019-12-26 23:18:17,264 INFO L226 Difference]: Without dead ends: 12589 [2019-12-26 23:18:17,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:18:17,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12589 states. [2019-12-26 23:18:17,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12589 to 11299. [2019-12-26 23:18:17,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11299 states. [2019-12-26 23:18:18,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11299 states to 11299 states and 35365 transitions. [2019-12-26 23:18:18,472 INFO L78 Accepts]: Start accepts. Automaton has 11299 states and 35365 transitions. Word has length 11 [2019-12-26 23:18:18,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:18:18,472 INFO L462 AbstractCegarLoop]: Abstraction has 11299 states and 35365 transitions. [2019-12-26 23:18:18,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:18:18,472 INFO L276 IsEmpty]: Start isEmpty. Operand 11299 states and 35365 transitions. [2019-12-26 23:18:18,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:18:18,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:18:18,484 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:18:18,484 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:18:18,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:18:18,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1209477957, now seen corresponding path program 1 times [2019-12-26 23:18:18,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:18:18,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744237064] [2019-12-26 23:18:18,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:18:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:18:18,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:18:18,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744237064] [2019-12-26 23:18:18,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:18:18,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:18:18,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911853448] [2019-12-26 23:18:18,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:18:18,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:18:18,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:18:18,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:18:18,597 INFO L87 Difference]: Start difference. First operand 11299 states and 35365 transitions. Second operand 4 states. [2019-12-26 23:18:18,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:18:18,955 INFO L93 Difference]: Finished difference Result 13736 states and 42816 transitions. [2019-12-26 23:18:18,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:18:18,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 23:18:18,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:18:19,006 INFO L225 Difference]: With dead ends: 13736 [2019-12-26 23:18:19,007 INFO L226 Difference]: Without dead ends: 13736 [2019-12-26 23:18:19,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:18:19,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13736 states. [2019-12-26 23:18:19,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13736 to 12234. [2019-12-26 23:18:19,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12234 states. [2019-12-26 23:18:19,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12234 states to 12234 states and 38359 transitions. [2019-12-26 23:18:19,473 INFO L78 Accepts]: Start accepts. Automaton has 12234 states and 38359 transitions. Word has length 14 [2019-12-26 23:18:19,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:18:19,474 INFO L462 AbstractCegarLoop]: Abstraction has 12234 states and 38359 transitions. [2019-12-26 23:18:19,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:18:19,476 INFO L276 IsEmpty]: Start isEmpty. Operand 12234 states and 38359 transitions. [2019-12-26 23:18:19,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 23:18:19,480 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:18:19,480 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:18:19,481 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:18:19,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:18:19,481 INFO L82 PathProgramCache]: Analyzing trace with hash -572907870, now seen corresponding path program 1 times [2019-12-26 23:18:19,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:18:19,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161199776] [2019-12-26 23:18:19,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:18:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:18:19,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:18:19,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161199776] [2019-12-26 23:18:19,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:18:19,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:18:19,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905408118] [2019-12-26 23:18:19,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:18:19,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:18:19,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:18:19,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:18:19,676 INFO L87 Difference]: Start difference. First operand 12234 states and 38359 transitions. Second operand 3 states. [2019-12-26 23:18:19,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:18:19,824 INFO L93 Difference]: Finished difference Result 12209 states and 38285 transitions. [2019-12-26 23:18:19,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:18:19,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-26 23:18:19,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:18:19,867 INFO L225 Difference]: With dead ends: 12209 [2019-12-26 23:18:19,868 INFO L226 Difference]: Without dead ends: 12209 [2019-12-26 23:18:19,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:18:19,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12209 states. [2019-12-26 23:18:20,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12209 to 12209. [2019-12-26 23:18:20,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12209 states. [2019-12-26 23:18:20,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12209 states to 12209 states and 38285 transitions. [2019-12-26 23:18:20,252 INFO L78 Accepts]: Start accepts. Automaton has 12209 states and 38285 transitions. Word has length 16 [2019-12-26 23:18:20,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:18:20,252 INFO L462 AbstractCegarLoop]: Abstraction has 12209 states and 38285 transitions. [2019-12-26 23:18:20,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:18:20,253 INFO L276 IsEmpty]: Start isEmpty. Operand 12209 states and 38285 transitions. [2019-12-26 23:18:20,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 23:18:20,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:18:20,257 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:18:20,258 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:18:20,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:18:20,258 INFO L82 PathProgramCache]: Analyzing trace with hash -574911552, now seen corresponding path program 1 times [2019-12-26 23:18:20,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:18:20,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122984061] [2019-12-26 23:18:20,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:18:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:18:20,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:18:20,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122984061] [2019-12-26 23:18:20,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:18:20,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:18:20,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762043023] [2019-12-26 23:18:20,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:18:20,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:18:20,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:18:20,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:18:20,368 INFO L87 Difference]: Start difference. First operand 12209 states and 38285 transitions. Second operand 4 states. [2019-12-26 23:18:20,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:18:20,415 INFO L93 Difference]: Finished difference Result 2335 states and 5845 transitions. [2019-12-26 23:18:20,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:18:20,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-26 23:18:20,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:18:20,420 INFO L225 Difference]: With dead ends: 2335 [2019-12-26 23:18:20,420 INFO L226 Difference]: Without dead ends: 1651 [2019-12-26 23:18:20,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:18:20,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2019-12-26 23:18:20,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1635. [2019-12-26 23:18:20,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1635 states. [2019-12-26 23:18:20,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 3657 transitions. [2019-12-26 23:18:20,452 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 3657 transitions. Word has length 17 [2019-12-26 23:18:20,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:18:20,452 INFO L462 AbstractCegarLoop]: Abstraction has 1635 states and 3657 transitions. [2019-12-26 23:18:20,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:18:20,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 3657 transitions. [2019-12-26 23:18:20,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:18:20,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:18:20,455 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] [2019-12-26 23:18:20,455 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:18:20,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:18:20,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1133745070, now seen corresponding path program 1 times [2019-12-26 23:18:20,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:18:20,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452903091] [2019-12-26 23:18:20,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:18:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:18:20,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:18:20,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452903091] [2019-12-26 23:18:20,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:18:20,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:18:20,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428582790] [2019-12-26 23:18:20,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:18:20,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:18:20,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:18:20,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:18:20,560 INFO L87 Difference]: Start difference. First operand 1635 states and 3657 transitions. Second operand 6 states. [2019-12-26 23:18:21,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:18:21,239 INFO L93 Difference]: Finished difference Result 4528 states and 9998 transitions. [2019-12-26 23:18:21,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:18:21,240 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-26 23:18:21,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:18:21,251 INFO L225 Difference]: With dead ends: 4528 [2019-12-26 23:18:21,251 INFO L226 Difference]: Without dead ends: 4493 [2019-12-26 23:18:21,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:18:21,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4493 states. [2019-12-26 23:18:21,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4493 to 2195. [2019-12-26 23:18:21,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2195 states. [2019-12-26 23:18:21,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 2195 states and 4961 transitions. [2019-12-26 23:18:21,310 INFO L78 Accepts]: Start accepts. Automaton has 2195 states and 4961 transitions. Word has length 25 [2019-12-26 23:18:21,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:18:21,310 INFO L462 AbstractCegarLoop]: Abstraction has 2195 states and 4961 transitions. [2019-12-26 23:18:21,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:18:21,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2195 states and 4961 transitions. [2019-12-26 23:18:21,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 23:18:21,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:18:21,314 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:18:21,314 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:18:21,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:18:21,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1963896570, now seen corresponding path program 1 times [2019-12-26 23:18:21,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:18:21,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186966020] [2019-12-26 23:18:21,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:18:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:18:21,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:18:21,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186966020] [2019-12-26 23:18:21,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:18:21,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:18:21,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436482436] [2019-12-26 23:18:21,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:18:21,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:18:21,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:18:21,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:18:21,432 INFO L87 Difference]: Start difference. First operand 2195 states and 4961 transitions. Second operand 6 states. [2019-12-26 23:18:21,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:18:21,964 INFO L93 Difference]: Finished difference Result 4412 states and 9625 transitions. [2019-12-26 23:18:21,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:18:21,965 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-26 23:18:21,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:18:21,976 INFO L225 Difference]: With dead ends: 4412 [2019-12-26 23:18:21,976 INFO L226 Difference]: Without dead ends: 4383 [2019-12-26 23:18:21,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:18:21,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4383 states. [2019-12-26 23:18:22,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4383 to 2070. [2019-12-26 23:18:22,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2070 states. [2019-12-26 23:18:22,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 4705 transitions. [2019-12-26 23:18:22,029 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 4705 transitions. Word has length 26 [2019-12-26 23:18:22,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:18:22,030 INFO L462 AbstractCegarLoop]: Abstraction has 2070 states and 4705 transitions. [2019-12-26 23:18:22,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:18:22,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 4705 transitions. [2019-12-26 23:18:22,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 23:18:22,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:18:22,033 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] [2019-12-26 23:18:22,033 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:18:22,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:18:22,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1827812304, now seen corresponding path program 1 times [2019-12-26 23:18:22,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:18:22,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463067547] [2019-12-26 23:18:22,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:18:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:18:22,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:18:22,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463067547] [2019-12-26 23:18:22,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:18:22,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:18:22,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924682389] [2019-12-26 23:18:22,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:18:22,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:18:22,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:18:22,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:18:22,109 INFO L87 Difference]: Start difference. First operand 2070 states and 4705 transitions. Second operand 5 states. [2019-12-26 23:18:22,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:18:22,151 INFO L93 Difference]: Finished difference Result 1107 states and 2423 transitions. [2019-12-26 23:18:22,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:18:22,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-26 23:18:22,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:18:22,154 INFO L225 Difference]: With dead ends: 1107 [2019-12-26 23:18:22,154 INFO L226 Difference]: Without dead ends: 1004 [2019-12-26 23:18:22,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:18:22,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2019-12-26 23:18:22,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 970. [2019-12-26 23:18:22,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2019-12-26 23:18:22,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 2136 transitions. [2019-12-26 23:18:22,170 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 2136 transitions. Word has length 27 [2019-12-26 23:18:22,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:18:22,171 INFO L462 AbstractCegarLoop]: Abstraction has 970 states and 2136 transitions. [2019-12-26 23:18:22,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:18:22,171 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 2136 transitions. [2019-12-26 23:18:22,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 23:18:22,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:18:22,174 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] [2019-12-26 23:18:22,175 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:18:22,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:18:22,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1528690992, now seen corresponding path program 1 times [2019-12-26 23:18:22,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:18:22,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429742886] [2019-12-26 23:18:22,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:18:22,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:18:22,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:18:22,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429742886] [2019-12-26 23:18:22,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:18:22,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:18:22,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505283910] [2019-12-26 23:18:22,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:18:22,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:18:22,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:18:22,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:18:22,325 INFO L87 Difference]: Start difference. First operand 970 states and 2136 transitions. Second operand 7 states. [2019-12-26 23:18:22,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:18:22,658 INFO L93 Difference]: Finished difference Result 3329 states and 7085 transitions. [2019-12-26 23:18:22,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:18:22,658 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-26 23:18:22,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:18:22,662 INFO L225 Difference]: With dead ends: 3329 [2019-12-26 23:18:22,663 INFO L226 Difference]: Without dead ends: 2239 [2019-12-26 23:18:22,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:18:22,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2239 states. [2019-12-26 23:18:22,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2239 to 1098. [2019-12-26 23:18:22,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1098 states. [2019-12-26 23:18:22,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 2411 transitions. [2019-12-26 23:18:22,688 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 2411 transitions. Word has length 51 [2019-12-26 23:18:22,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:18:22,689 INFO L462 AbstractCegarLoop]: Abstraction has 1098 states and 2411 transitions. [2019-12-26 23:18:22,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:18:22,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 2411 transitions. [2019-12-26 23:18:22,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 23:18:22,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:18:22,692 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] [2019-12-26 23:18:22,692 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:18:22,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:18:22,693 INFO L82 PathProgramCache]: Analyzing trace with hash 517037056, now seen corresponding path program 2 times [2019-12-26 23:18:22,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:18:22,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499482991] [2019-12-26 23:18:22,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:18:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:18:22,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:18:22,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499482991] [2019-12-26 23:18:22,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:18:22,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:18:22,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695886068] [2019-12-26 23:18:22,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:18:22,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:18:22,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:18:22,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:18:22,780 INFO L87 Difference]: Start difference. First operand 1098 states and 2411 transitions. Second operand 3 states. [2019-12-26 23:18:22,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:18:22,851 INFO L93 Difference]: Finished difference Result 1428 states and 3093 transitions. [2019-12-26 23:18:22,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:18:22,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-26 23:18:22,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:18:22,853 INFO L225 Difference]: With dead ends: 1428 [2019-12-26 23:18:22,854 INFO L226 Difference]: Without dead ends: 1428 [2019-12-26 23:18:22,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:18:22,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-12-26 23:18:22,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1212. [2019-12-26 23:18:22,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2019-12-26 23:18:22,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 2667 transitions. [2019-12-26 23:18:22,874 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 2667 transitions. Word has length 51 [2019-12-26 23:18:22,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:18:22,875 INFO L462 AbstractCegarLoop]: Abstraction has 1212 states and 2667 transitions. [2019-12-26 23:18:22,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:18:22,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 2667 transitions. [2019-12-26 23:18:22,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:18:22,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:18:22,878 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:18:22,879 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:18:22,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:18:22,879 INFO L82 PathProgramCache]: Analyzing trace with hash -975275625, now seen corresponding path program 1 times [2019-12-26 23:18:22,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:18:22,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032241631] [2019-12-26 23:18:22,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:18:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:18:23,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:18:23,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032241631] [2019-12-26 23:18:23,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:18:23,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:18:23,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735703259] [2019-12-26 23:18:23,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:18:23,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:18:23,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:18:23,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:18:23,012 INFO L87 Difference]: Start difference. First operand 1212 states and 2667 transitions. Second operand 3 states. [2019-12-26 23:18:23,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:18:23,028 INFO L93 Difference]: Finished difference Result 1211 states and 2665 transitions. [2019-12-26 23:18:23,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:18:23,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-26 23:18:23,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:18:23,030 INFO L225 Difference]: With dead ends: 1211 [2019-12-26 23:18:23,031 INFO L226 Difference]: Without dead ends: 1211 [2019-12-26 23:18:23,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:18:23,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2019-12-26 23:18:23,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 942. [2019-12-26 23:18:23,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2019-12-26 23:18:23,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 2088 transitions. [2019-12-26 23:18:23,047 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 2088 transitions. Word has length 52 [2019-12-26 23:18:23,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:18:23,048 INFO L462 AbstractCegarLoop]: Abstraction has 942 states and 2088 transitions. [2019-12-26 23:18:23,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:18:23,048 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 2088 transitions. [2019-12-26 23:18:23,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 23:18:23,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:18:23,051 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:18:23,051 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:18:23,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:18:23,052 INFO L82 PathProgramCache]: Analyzing trace with hash 238171223, now seen corresponding path program 1 times [2019-12-26 23:18:23,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:18:23,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935629616] [2019-12-26 23:18:23,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:18:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:18:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:18:23,229 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:18:23,229 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:18:23,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~x$r_buff1_thd1~0_165 0) (= 0 v_~x~0_148) (= v_~x$r_buff0_thd0~0_133 0) (= v_~x$r_buff0_thd1~0_227 0) (= v_~weak$$choice2~0_120 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_40 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1705~0.base_24|) (= 0 |v_ULTIMATE.start_main_~#t1705~0.offset_18|) (= 0 v_~x$read_delayed_var~0.base_7) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t1705~0.base_24| 1)) (= 0 v_~__unbuffered_cnt~0_63) (= v_~main$tmp_guard1~0_41 0) (= v_~y~0_147 0) (= 0 |v_#NULL.base_6|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_24 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1705~0.base_24|)) (= 0 v_~x$w_buff1_used~0_507) (= 0 v_~weak$$choice0~0_22) (= v_~x$r_buff1_thd0~0_183 0) (= 0 v_~x$w_buff1~0_317) (= 0 v_~x$w_buff0~0_542) (= 0 v_~x$r_buff0_thd2~0_359) (= 0 v_~x$read_delayed_var~0.offset_7) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1705~0.base_24| 4) |v_#length_13|) (= 0 v_~x$w_buff0_used~0_792) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1705~0.base_24| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1705~0.base_24|) |v_ULTIMATE.start_main_~#t1705~0.offset_18| 0)) |v_#memory_int_13|) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x$r_buff1_thd2~0_331) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_542, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_227, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, ULTIMATE.start_main_~#t1706~0.base=|v_ULTIMATE.start_main_~#t1706~0.base_16|, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, #length=|v_#length_13|, ~y~0=v_~y~0_147, ULTIMATE.start_main_~#t1705~0.offset=|v_ULTIMATE.start_main_~#t1705~0.offset_18|, ULTIMATE.start_main_~#t1705~0.base=|v_ULTIMATE.start_main_~#t1705~0.base_24|, ULTIMATE.start_main_~#t1706~0.offset=|v_ULTIMATE.start_main_~#t1706~0.offset_14|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_133, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_507, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_331, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_359, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_792, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~x~0=v_~x~0_148, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1706~0.base, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p1_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t1705~0.offset, ULTIMATE.start_main_~#t1705~0.base, ULTIMATE.start_main_~#t1706~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-26 23:18:23,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= 1 v_~x$r_buff0_thd1~0_40) (= v_~x$r_buff1_thd1~0_23 v_~x$r_buff0_thd1~0_41) (= v_~x$r_buff1_thd2~0_64 v_~x$r_buff0_thd2~0_110) (= v_~y~0_18 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74 0)) (= v_~x$r_buff1_thd0~0_37 v_~x$r_buff0_thd0~0_53)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~y~0=v_~y~0_18, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_37} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-26 23:18:23,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-1-->L799: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1706~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t1706~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t1706~0.base_12| 0)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1706~0.base_12| 1) |v_#valid_27|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1706~0.base_12|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1706~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1706~0.base_12|) |v_ULTIMATE.start_main_~#t1706~0.offset_10| 1)) |v_#memory_int_9|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1706~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1706~0.offset=|v_ULTIMATE.start_main_~#t1706~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1706~0.base=|v_ULTIMATE.start_main_~#t1706~0.base_12|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1706~0.offset, ULTIMATE.start_main_~#t1706~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-26 23:18:23,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In952461441 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In952461441 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out952461441| ~x$w_buff0_used~0_In952461441)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out952461441| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In952461441, ~x$w_buff0_used~0=~x$w_buff0_used~0_In952461441} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out952461441|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In952461441, ~x$w_buff0_used~0=~x$w_buff0_used~0_In952461441} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:18:23,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L763-->L763-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1802635423 256) 0))) (or (and (= ~x$w_buff0~0_In1802635423 |P1Thread1of1ForFork1_#t~ite14_Out1802635423|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1802635423 256)))) (or (and (= (mod ~x$r_buff1_thd2~0_In1802635423 256) 0) .cse0) (= (mod ~x$w_buff0_used~0_In1802635423 256) 0) (and (= (mod ~x$w_buff1_used~0_In1802635423 256) 0) .cse0))) (= |P1Thread1of1ForFork1_#t~ite15_Out1802635423| |P1Thread1of1ForFork1_#t~ite14_Out1802635423|) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite14_In1802635423| |P1Thread1of1ForFork1_#t~ite14_Out1802635423|) (= |P1Thread1of1ForFork1_#t~ite15_Out1802635423| ~x$w_buff0~0_In1802635423)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1802635423, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1802635423, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1802635423, ~weak$$choice2~0=~weak$$choice2~0_In1802635423, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1802635423, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1802635423|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1802635423} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1802635423, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1802635423, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1802635423, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1802635423|, ~weak$$choice2~0=~weak$$choice2~0_In1802635423, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1802635423, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1802635423|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1802635423} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 23:18:23,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1623344699 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1623344699 256))) (.cse2 (= (mod ~x$r_buff0_thd1~0_In1623344699 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1623344699 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1623344699|)) (and (= ~x$w_buff1_used~0_In1623344699 |P0Thread1of1ForFork0_#t~ite6_Out1623344699|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1623344699, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1623344699, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1623344699, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1623344699} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1623344699|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1623344699, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1623344699, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1623344699, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1623344699} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:18:23,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-584229785 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-584229785 256)))) (or (and (= ~x$r_buff0_thd1~0_Out-584229785 ~x$r_buff0_thd1~0_In-584229785) (or .cse0 .cse1)) (and (not .cse1) (= 0 ~x$r_buff0_thd1~0_Out-584229785) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-584229785, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-584229785} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-584229785, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-584229785|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-584229785} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-26 23:18:23,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In946197832 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In946197832 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In946197832 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In946197832 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd1~0_In946197832 |P0Thread1of1ForFork0_#t~ite8_Out946197832|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out946197832|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In946197832, ~x$w_buff1_used~0=~x$w_buff1_used~0_In946197832, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In946197832, ~x$w_buff0_used~0=~x$w_buff0_used~0_In946197832} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In946197832, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out946197832|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In946197832, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In946197832, ~x$w_buff0_used~0=~x$w_buff0_used~0_In946197832} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:18:23,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd1~0_128 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_128} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-26 23:18:23,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1800182143 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite18_Out1800182143| ~x$w_buff1~0_In1800182143) (= |P1Thread1of1ForFork1_#t~ite17_In1800182143| |P1Thread1of1ForFork1_#t~ite17_Out1800182143|) (not .cse0)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite17_Out1800182143| |P1Thread1of1ForFork1_#t~ite18_Out1800182143|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1800182143 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In1800182143 256)) (and .cse1 (= (mod ~x$r_buff1_thd2~0_In1800182143 256) 0)) (and (= 0 (mod ~x$w_buff1_used~0_In1800182143 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite17_Out1800182143| ~x$w_buff1~0_In1800182143)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1800182143, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1800182143, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1800182143, ~weak$$choice2~0=~weak$$choice2~0_In1800182143, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1800182143, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In1800182143|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1800182143} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out1800182143|, ~x$w_buff1~0=~x$w_buff1~0_In1800182143, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1800182143, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1800182143, ~weak$$choice2~0=~weak$$choice2~0_In1800182143, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1800182143, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1800182143|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1800182143} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-26 23:18:23,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1365086145 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out-1365086145| |P1Thread1of1ForFork1_#t~ite20_Out-1365086145|) .cse0 (= ~x$w_buff0_used~0_In-1365086145 |P1Thread1of1ForFork1_#t~ite20_Out-1365086145|) (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1365086145 256) 0))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-1365086145 256)) .cse1) (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1365086145 256))) (= 0 (mod ~x$w_buff0_used~0_In-1365086145 256))))) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In-1365086145| |P1Thread1of1ForFork1_#t~ite20_Out-1365086145|) (= ~x$w_buff0_used~0_In-1365086145 |P1Thread1of1ForFork1_#t~ite21_Out-1365086145|)))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1365086145|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1365086145, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1365086145, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1365086145, ~weak$$choice2~0=~weak$$choice2~0_In-1365086145, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1365086145} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1365086145|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1365086145, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1365086145, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1365086145|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1365086145, ~weak$$choice2~0=~weak$$choice2~0_In-1365086145, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1365086145} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-26 23:18:23,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd2~0_135 v_~x$r_buff0_thd2~0_134)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_27, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_14|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-26 23:18:23,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1433280653 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_In1433280653| |P1Thread1of1ForFork1_#t~ite29_Out1433280653|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite30_Out1433280653| ~x$r_buff1_thd2~0_In1433280653)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite30_Out1433280653| |P1Thread1of1ForFork1_#t~ite29_Out1433280653|) (= |P1Thread1of1ForFork1_#t~ite29_Out1433280653| ~x$r_buff1_thd2~0_In1433280653) (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1433280653 256) 0))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1433280653 256))) (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1433280653 256))) (= (mod ~x$w_buff0_used~0_In1433280653 256) 0)))))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1433280653|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1433280653, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1433280653, ~weak$$choice2~0=~weak$$choice2~0_In1433280653, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1433280653, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1433280653} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1433280653|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1433280653|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1433280653, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1433280653, ~weak$$choice2~0=~weak$$choice2~0_In1433280653, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1433280653, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1433280653} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-26 23:18:23,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-26 23:18:23,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1865500119 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-1865500119 256) 0))) (or (and (not .cse0) (= ~x$w_buff1~0_In-1865500119 |P1Thread1of1ForFork1_#t~ite32_Out-1865500119|) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out-1865500119| ~x~0_In-1865500119) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1865500119, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1865500119, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1865500119, ~x~0=~x~0_In-1865500119} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1865500119, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1865500119, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1865500119, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1865500119|, ~x~0=~x~0_In-1865500119} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-26 23:18:23,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_29 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-26 23:18:23,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-2074354193 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2074354193 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-2074354193 |P1Thread1of1ForFork1_#t~ite34_Out-2074354193|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-2074354193|) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2074354193, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2074354193} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-2074354193|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2074354193, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2074354193} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-26 23:18:23,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd2~0_In1556049804 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In1556049804 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In1556049804 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1556049804 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1556049804|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1556049804 |P1Thread1of1ForFork1_#t~ite35_Out1556049804|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1556049804, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1556049804, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1556049804, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1556049804} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1556049804, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1556049804, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1556049804|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1556049804, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1556049804} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-26 23:18:23,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1362027859 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1362027859 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out1362027859|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_In1362027859 |P1Thread1of1ForFork1_#t~ite36_Out1362027859|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1362027859, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1362027859} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1362027859, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1362027859|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1362027859} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-26 23:18:23,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1854467361 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1854467361 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In1854467361 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In1854467361 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out1854467361| ~x$r_buff1_thd2~0_In1854467361) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out1854467361| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1854467361, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1854467361, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1854467361, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1854467361} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1854467361, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1854467361, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1854467361, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1854467361|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1854467361} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 23:18:23,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_269 |v_P1Thread1of1ForFork1_#t~ite37_42|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_41|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 23:18:23,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_64 256)) (= (mod v_~x$w_buff0_used~0_301 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 23:18:23,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In1057767915 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1057767915 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1057767915| ~x$w_buff1~0_In1057767915)) (and (or .cse1 .cse0) (= ~x~0_In1057767915 |ULTIMATE.start_main_#t~ite40_Out1057767915|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1057767915, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1057767915, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1057767915, ~x~0=~x~0_In1057767915} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1057767915|, ~x$w_buff1~0=~x$w_buff1~0_In1057767915, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1057767915, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1057767915, ~x~0=~x~0_In1057767915} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-26 23:18:23,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_46 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x~0=v_~x~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-26 23:18:23,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In149784839 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In149784839 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In149784839 |ULTIMATE.start_main_#t~ite42_Out149784839|)) (and (= |ULTIMATE.start_main_#t~ite42_Out149784839| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In149784839, ~x$w_buff0_used~0=~x$w_buff0_used~0_In149784839} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In149784839, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out149784839|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In149784839} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 23:18:23,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In388369111 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In388369111 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In388369111 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In388369111 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out388369111|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In388369111 |ULTIMATE.start_main_#t~ite43_Out388369111|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In388369111, ~x$w_buff1_used~0=~x$w_buff1_used~0_In388369111, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In388369111, ~x$w_buff0_used~0=~x$w_buff0_used~0_In388369111} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In388369111, ~x$w_buff1_used~0=~x$w_buff1_used~0_In388369111, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out388369111|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In388369111, ~x$w_buff0_used~0=~x$w_buff0_used~0_In388369111} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-26 23:18:23,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-99120966 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-99120966 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-99120966|)) (and (= ~x$r_buff0_thd0~0_In-99120966 |ULTIMATE.start_main_#t~ite44_Out-99120966|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-99120966, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-99120966} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-99120966, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-99120966|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-99120966} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 23:18:23,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd0~0_In1790936999 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1790936999 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1790936999 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1790936999 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1790936999| ~x$r_buff1_thd0~0_In1790936999) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite45_Out1790936999|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1790936999, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1790936999, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1790936999, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1790936999} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1790936999, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1790936999, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1790936999, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1790936999|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1790936999} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 23:18:23,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~main$tmp_guard1~0_20 0) (= v_~y~0_126 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 2 v_~__unbuffered_p1_EAX~0_27) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite45_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y~0=v_~y~0_126, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_126, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:18:23,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:18:23 BasicIcfg [2019-12-26 23:18:23,376 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:18:23,378 INFO L168 Benchmark]: Toolchain (without parser) took 16162.86 ms. Allocated memory was 141.0 MB in the beginning and 677.9 MB in the end (delta: 536.9 MB). Free memory was 100.7 MB in the beginning and 502.3 MB in the end (delta: -401.6 MB). Peak memory consumption was 135.2 MB. Max. memory is 7.1 GB. [2019-12-26 23:18:23,379 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 141.0 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-26 23:18:23,380 INFO L168 Benchmark]: CACSL2BoogieTranslator took 788.67 ms. Allocated memory was 141.0 MB in the beginning and 203.9 MB in the end (delta: 62.9 MB). Free memory was 100.2 MB in the beginning and 158.8 MB in the end (delta: -58.6 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:18:23,381 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.27 ms. Allocated memory is still 203.9 MB. Free memory was 158.8 MB in the beginning and 156.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 23:18:23,383 INFO L168 Benchmark]: Boogie Preprocessor took 48.22 ms. Allocated memory is still 203.9 MB. Free memory was 156.2 MB in the beginning and 154.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 23:18:23,389 INFO L168 Benchmark]: RCFGBuilder took 815.51 ms. Allocated memory is still 203.9 MB. Free memory was 154.3 MB in the beginning and 109.9 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2019-12-26 23:18:23,390 INFO L168 Benchmark]: TraceAbstraction took 14445.30 ms. Allocated memory was 203.9 MB in the beginning and 677.9 MB in the end (delta: 474.0 MB). Free memory was 109.2 MB in the beginning and 502.3 MB in the end (delta: -393.1 MB). Peak memory consumption was 80.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:18:23,402 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.49 ms. Allocated memory is still 141.0 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 788.67 ms. Allocated memory was 141.0 MB in the beginning and 203.9 MB in the end (delta: 62.9 MB). Free memory was 100.2 MB in the beginning and 158.8 MB in the end (delta: -58.6 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.27 ms. Allocated memory is still 203.9 MB. Free memory was 158.8 MB in the beginning and 156.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.22 ms. Allocated memory is still 203.9 MB. Free memory was 156.2 MB in the beginning and 154.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 815.51 ms. Allocated memory is still 203.9 MB. Free memory was 154.3 MB in the beginning and 109.9 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14445.30 ms. Allocated memory was 203.9 MB in the beginning and 677.9 MB in the end (delta: 474.0 MB). Free memory was 109.2 MB in the beginning and 502.3 MB in the end (delta: -393.1 MB). Peak memory consumption was 80.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 147 ProgramPointsBefore, 79 ProgramPointsAfterwards, 181 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 29 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 26 ChoiceCompositions, 4894 VarBasedMoverChecksPositive, 354 VarBasedMoverChecksNegative, 269 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 76691 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1705, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 x$w_buff1 = x$w_buff0 [L725] 1 x$w_buff0 = 1 [L726] 1 x$w_buff1_used = x$w_buff0_used [L727] 1 x$w_buff0_used = (_Bool)1 [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] FCALL, FORK 0 pthread_create(&t1706, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L752] 2 y = 2 [L755] 2 __unbuffered_p1_EAX = y [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 x$flush_delayed = weak$$choice2 [L761] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L762] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L763] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L764] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L765] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.0s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1468 SDtfs, 1612 SDslu, 2822 SDs, 0 SdLazy, 1311 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12234occurred 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: 2.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 9079 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 346 NumberOfCodeBlocks, 346 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 27960 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...