/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/safe022_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:54:31,918 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:54:31,922 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:54:31,933 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:54:31,934 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:54:31,935 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:54:31,936 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:54:31,938 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:54:31,948 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:54:31,949 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:54:31,952 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:54:31,955 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:54:31,955 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:54:31,956 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:54:31,957 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:54:31,960 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:54:31,962 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:54:31,962 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:54:31,967 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:54:31,969 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:54:31,970 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:54:31,974 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:54:31,975 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:54:31,978 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:54:31,980 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:54:31,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:54:31,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:54:31,985 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:54:31,986 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:54:31,988 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:54:31,988 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:54:31,990 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:54:31,990 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:54:31,991 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:54:31,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:54:31,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:54:31,996 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:54:31,996 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:54:31,996 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:54:31,999 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:54:32,000 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:54:32,001 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:54:32,027 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:54:32,027 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:54:32,029 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:54:32,030 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:54:32,030 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:54:32,030 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:54:32,031 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:54:32,031 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:54:32,031 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:54:32,031 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:54:32,032 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:54:32,033 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:54:32,033 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:54:32,033 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:54:32,033 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:54:32,034 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:54:32,034 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:54:32,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:54:32,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:54:32,034 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:54:32,035 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:54:32,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:54:32,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:54:32,035 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:54:32,036 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:54:32,036 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:54:32,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:54:32,036 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:54:32,036 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:54:32,036 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:54:32,356 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:54:32,375 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:54:32,379 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:54:32,380 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:54:32,381 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:54:32,382 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe022_power.opt.i [2019-12-18 14:54:32,444 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/363f0d878/f1809fdae18d498f843717da45897ae0/FLAG3c746bf43 [2019-12-18 14:54:33,006 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:54:33,007 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_power.opt.i [2019-12-18 14:54:33,030 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/363f0d878/f1809fdae18d498f843717da45897ae0/FLAG3c746bf43 [2019-12-18 14:54:33,321 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/363f0d878/f1809fdae18d498f843717da45897ae0 [2019-12-18 14:54:33,330 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:54:33,332 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:54:33,333 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:54:33,333 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:54:33,337 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:54:33,338 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:54:33" (1/1) ... [2019-12-18 14:54:33,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b9bda4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:33, skipping insertion in model container [2019-12-18 14:54:33,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:54:33" (1/1) ... [2019-12-18 14:54:33,348 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:54:33,403 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:54:33,901 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:54:33,917 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:54:34,000 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:54:34,077 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:54:34,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:34 WrapperNode [2019-12-18 14:54:34,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:54:34,079 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:54:34,079 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:54:34,079 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:54:34,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:34" (1/1) ... [2019-12-18 14:54:34,107 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:34" (1/1) ... [2019-12-18 14:54:34,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:54:34,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:54:34,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:54:34,139 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:54:34,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:34" (1/1) ... [2019-12-18 14:54:34,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:34" (1/1) ... [2019-12-18 14:54:34,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:34" (1/1) ... [2019-12-18 14:54:34,152 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:34" (1/1) ... [2019-12-18 14:54:34,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:34" (1/1) ... [2019-12-18 14:54:34,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:34" (1/1) ... [2019-12-18 14:54:34,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:34" (1/1) ... [2019-12-18 14:54:34,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:54:34,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:54:34,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:54:34,176 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:54:34,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:54:34,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:54:34,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:54:34,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:54:34,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:54:34,251 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:54:34,252 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:54:34,252 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:54:34,253 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:54:34,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:54:34,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:54:34,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:54:34,256 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 14:54:34,949 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:54:34,950 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:54:34,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:54:34 BoogieIcfgContainer [2019-12-18 14:54:34,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:54:34,953 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:54:34,953 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:54:34,956 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:54:34,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:54:33" (1/3) ... [2019-12-18 14:54:34,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78eebe9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:54:34, skipping insertion in model container [2019-12-18 14:54:34,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:54:34" (2/3) ... [2019-12-18 14:54:34,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78eebe9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:54:34, skipping insertion in model container [2019-12-18 14:54:34,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:54:34" (3/3) ... [2019-12-18 14:54:34,964 INFO L109 eAbstractionObserver]: Analyzing ICFG safe022_power.opt.i [2019-12-18 14:54:34,976 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:54:34,976 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:54:34,989 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:54:34,990 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:54:35,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,027 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,027 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,028 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,028 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,029 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,038 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,039 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,072 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,072 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,073 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,079 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,105 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:54:35,121 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 14:54:35,142 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:54:35,142 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:54:35,143 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:54:35,143 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:54:35,143 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:54:35,143 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:54:35,143 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:54:35,143 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:54:35,165 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-18 14:54:35,167 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 14:54:35,239 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 14:54:35,240 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:54:35,257 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 345 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 14:54:35,280 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 14:54:35,334 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 14:54:35,334 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:54:35,340 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 345 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 14:54:35,354 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 14:54:35,355 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:54:39,819 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 14:54:40,005 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-12-18 14:54:40,005 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-18 14:54:40,008 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-18 14:54:40,458 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-12-18 14:54:40,461 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-12-18 14:54:40,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 14:54:40,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:54:40,469 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 14:54:40,469 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:54:40,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:54:40,476 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-12-18 14:54:40,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:54:40,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614498563] [2019-12-18 14:54:40,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:54:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:54:40,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:54:40,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614498563] [2019-12-18 14:54:40,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:54:40,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:54:40,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211256014] [2019-12-18 14:54:40,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:54:40,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:54:40,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:54:40,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:54:40,779 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-12-18 14:54:41,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:54:41,036 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-12-18 14:54:41,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:54:41,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 14:54:41,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:54:41,133 INFO L225 Difference]: With dead ends: 8074 [2019-12-18 14:54:41,133 INFO L226 Difference]: Without dead ends: 7606 [2019-12-18 14:54:41,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:54:41,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-12-18 14:54:41,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-12-18 14:54:41,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-12-18 14:54:41,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-12-18 14:54:41,515 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-12-18 14:54:41,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:54:41,515 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-12-18 14:54:41,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:54:41,516 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-12-18 14:54:41,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:54:41,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:54:41,523 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:54:41,523 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:54:41,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:54:41,524 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-12-18 14:54:41,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:54:41,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328020557] [2019-12-18 14:54:41,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:54:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:54:41,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:54:41,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328020557] [2019-12-18 14:54:41,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:54:41,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:54:41,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257428945] [2019-12-18 14:54:41,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:54:41,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:54:41,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:54:41,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:54:41,648 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-12-18 14:54:42,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:54:42,097 INFO L93 Difference]: Finished difference Result 11630 states and 36033 transitions. [2019-12-18 14:54:42,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:54:42,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:54:42,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:54:42,169 INFO L225 Difference]: With dead ends: 11630 [2019-12-18 14:54:42,170 INFO L226 Difference]: Without dead ends: 11623 [2019-12-18 14:54:42,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:54:42,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-12-18 14:54:42,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 10415. [2019-12-18 14:54:42,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2019-12-18 14:54:42,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32855 transitions. [2019-12-18 14:54:42,678 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32855 transitions. Word has length 11 [2019-12-18 14:54:42,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:54:42,679 INFO L462 AbstractCegarLoop]: Abstraction has 10415 states and 32855 transitions. [2019-12-18 14:54:42,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:54:42,679 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32855 transitions. [2019-12-18 14:54:42,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:54:42,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:54:42,689 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:54:42,689 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:54:42,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:54:42,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-12-18 14:54:42,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:54:42,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004062640] [2019-12-18 14:54:42,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:54:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:54:42,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:54:42,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004062640] [2019-12-18 14:54:42,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:54:42,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:54:42,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806503589] [2019-12-18 14:54:42,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:54:42,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:54:42,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:54:42,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:54:42,806 INFO L87 Difference]: Start difference. First operand 10415 states and 32855 transitions. Second operand 5 states. [2019-12-18 14:54:43,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:54:43,143 INFO L93 Difference]: Finished difference Result 14471 states and 44955 transitions. [2019-12-18 14:54:43,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:54:43,144 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 14:54:43,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:54:43,192 INFO L225 Difference]: With dead ends: 14471 [2019-12-18 14:54:43,192 INFO L226 Difference]: Without dead ends: 14471 [2019-12-18 14:54:43,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:54:43,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states. [2019-12-18 14:54:44,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11360. [2019-12-18 14:54:44,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11360 states. [2019-12-18 14:54:44,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11360 states to 11360 states and 35793 transitions. [2019-12-18 14:54:44,182 INFO L78 Accepts]: Start accepts. Automaton has 11360 states and 35793 transitions. Word has length 14 [2019-12-18 14:54:44,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:54:44,185 INFO L462 AbstractCegarLoop]: Abstraction has 11360 states and 35793 transitions. [2019-12-18 14:54:44,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:54:44,186 INFO L276 IsEmpty]: Start isEmpty. Operand 11360 states and 35793 transitions. [2019-12-18 14:54:44,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 14:54:44,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:54:44,190 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:54:44,190 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:54:44,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:54:44,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1120571574, now seen corresponding path program 1 times [2019-12-18 14:54:44,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:54:44,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65187944] [2019-12-18 14:54:44,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:54:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:54:44,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:54:44,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65187944] [2019-12-18 14:54:44,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:54:44,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:54:44,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308008783] [2019-12-18 14:54:44,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:54:44,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:54:44,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:54:44,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:54:44,292 INFO L87 Difference]: Start difference. First operand 11360 states and 35793 transitions. Second operand 3 states. [2019-12-18 14:54:44,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:54:44,341 INFO L93 Difference]: Finished difference Result 11335 states and 35719 transitions. [2019-12-18 14:54:44,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:54:44,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 14:54:44,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:54:44,389 INFO L225 Difference]: With dead ends: 11335 [2019-12-18 14:54:44,390 INFO L226 Difference]: Without dead ends: 11335 [2019-12-18 14:54:44,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:54:44,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11335 states. [2019-12-18 14:54:44,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11335 to 11335. [2019-12-18 14:54:44,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11335 states. [2019-12-18 14:54:44,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11335 states to 11335 states and 35719 transitions. [2019-12-18 14:54:44,693 INFO L78 Accepts]: Start accepts. Automaton has 11335 states and 35719 transitions. Word has length 16 [2019-12-18 14:54:44,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:54:44,694 INFO L462 AbstractCegarLoop]: Abstraction has 11335 states and 35719 transitions. [2019-12-18 14:54:44,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:54:44,694 INFO L276 IsEmpty]: Start isEmpty. Operand 11335 states and 35719 transitions. [2019-12-18 14:54:44,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 14:54:44,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:54:44,699 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:54:44,699 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:54:44,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:54:44,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1732892148, now seen corresponding path program 1 times [2019-12-18 14:54:44,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:54:44,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814801284] [2019-12-18 14:54:44,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:54:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:54:44,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:54:44,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814801284] [2019-12-18 14:54:44,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:54:44,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:54:44,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082972362] [2019-12-18 14:54:44,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:54:44,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:54:44,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:54:44,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:54:44,761 INFO L87 Difference]: Start difference. First operand 11335 states and 35719 transitions. Second operand 4 states. [2019-12-18 14:54:44,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:54:44,965 INFO L93 Difference]: Finished difference Result 18566 states and 58786 transitions. [2019-12-18 14:54:44,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:54:44,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 14:54:44,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:54:44,992 INFO L225 Difference]: With dead ends: 18566 [2019-12-18 14:54:44,992 INFO L226 Difference]: Without dead ends: 9176 [2019-12-18 14:54:44,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:54:45,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9176 states. [2019-12-18 14:54:45,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9176 to 9176. [2019-12-18 14:54:45,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9176 states. [2019-12-18 14:54:45,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9176 states to 9176 states and 28440 transitions. [2019-12-18 14:54:45,259 INFO L78 Accepts]: Start accepts. Automaton has 9176 states and 28440 transitions. Word has length 17 [2019-12-18 14:54:45,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:54:45,259 INFO L462 AbstractCegarLoop]: Abstraction has 9176 states and 28440 transitions. [2019-12-18 14:54:45,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:54:45,259 INFO L276 IsEmpty]: Start isEmpty. Operand 9176 states and 28440 transitions. [2019-12-18 14:54:45,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 14:54:45,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:54:45,263 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:54:45,264 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:54:45,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:54:45,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1167521807, now seen corresponding path program 1 times [2019-12-18 14:54:45,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:54:45,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343403420] [2019-12-18 14:54:45,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:54:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:54:45,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:54:45,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343403420] [2019-12-18 14:54:45,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:54:45,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:54:45,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291865076] [2019-12-18 14:54:45,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:54:45,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:54:45,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:54:45,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:54:45,331 INFO L87 Difference]: Start difference. First operand 9176 states and 28440 transitions. Second operand 4 states. [2019-12-18 14:54:45,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:54:45,370 INFO L93 Difference]: Finished difference Result 1638 states and 4028 transitions. [2019-12-18 14:54:45,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:54:45,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-18 14:54:45,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:54:45,374 INFO L225 Difference]: With dead ends: 1638 [2019-12-18 14:54:45,374 INFO L226 Difference]: Without dead ends: 1206 [2019-12-18 14:54:45,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:54:45,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2019-12-18 14:54:45,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1206. [2019-12-18 14:54:45,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1206 states. [2019-12-18 14:54:45,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 2674 transitions. [2019-12-18 14:54:45,394 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 2674 transitions. Word has length 18 [2019-12-18 14:54:45,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:54:45,395 INFO L462 AbstractCegarLoop]: Abstraction has 1206 states and 2674 transitions. [2019-12-18 14:54:45,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:54:45,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 2674 transitions. [2019-12-18 14:54:45,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 14:54:45,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:54:45,397 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] [2019-12-18 14:54:45,397 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:54:45,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:54:45,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-12-18 14:54:45,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:54:45,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204586905] [2019-12-18 14:54:45,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:54:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:54:45,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:54:45,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204586905] [2019-12-18 14:54:45,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:54:45,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:54:45,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259032409] [2019-12-18 14:54:45,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:54:45,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:54:45,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:54:45,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:54:45,500 INFO L87 Difference]: Start difference. First operand 1206 states and 2674 transitions. Second operand 6 states. [2019-12-18 14:54:45,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:54:45,680 INFO L93 Difference]: Finished difference Result 1222 states and 2679 transitions. [2019-12-18 14:54:45,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 14:54:45,681 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-18 14:54:45,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:54:45,683 INFO L225 Difference]: With dead ends: 1222 [2019-12-18 14:54:45,683 INFO L226 Difference]: Without dead ends: 1170 [2019-12-18 14:54:45,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:54:45,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-12-18 14:54:45,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1149. [2019-12-18 14:54:45,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1149 states. [2019-12-18 14:54:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 2552 transitions. [2019-12-18 14:54:45,708 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 2552 transitions. Word has length 24 [2019-12-18 14:54:45,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:54:45,708 INFO L462 AbstractCegarLoop]: Abstraction has 1149 states and 2552 transitions. [2019-12-18 14:54:45,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:54:45,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 2552 transitions. [2019-12-18 14:54:45,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 14:54:45,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:54:45,713 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-18 14:54:45,714 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:54:45,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:54:45,714 INFO L82 PathProgramCache]: Analyzing trace with hash -451164714, now seen corresponding path program 1 times [2019-12-18 14:54:45,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:54:45,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568008885] [2019-12-18 14:54:45,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:54:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:54:45,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:54:45,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568008885] [2019-12-18 14:54:45,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:54:45,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:54:45,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982617685] [2019-12-18 14:54:45,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:54:45,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:54:45,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:54:45,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:54:45,812 INFO L87 Difference]: Start difference. First operand 1149 states and 2552 transitions. Second operand 5 states. [2019-12-18 14:54:46,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:54:46,386 INFO L93 Difference]: Finished difference Result 1862 states and 4038 transitions. [2019-12-18 14:54:46,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:54:46,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 14:54:46,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:54:46,389 INFO L225 Difference]: With dead ends: 1862 [2019-12-18 14:54:46,389 INFO L226 Difference]: Without dead ends: 1862 [2019-12-18 14:54:46,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:54:46,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2019-12-18 14:54:46,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1665. [2019-12-18 14:54:46,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1665 states. [2019-12-18 14:54:46,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 3660 transitions. [2019-12-18 14:54:46,424 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 3660 transitions. Word has length 27 [2019-12-18 14:54:46,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:54:46,425 INFO L462 AbstractCegarLoop]: Abstraction has 1665 states and 3660 transitions. [2019-12-18 14:54:46,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:54:46,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 3660 transitions. [2019-12-18 14:54:46,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 14:54:46,428 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:54:46,428 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] [2019-12-18 14:54:46,428 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:54:46,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:54:46,429 INFO L82 PathProgramCache]: Analyzing trace with hash 747998845, now seen corresponding path program 1 times [2019-12-18 14:54:46,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:54:46,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543673184] [2019-12-18 14:54:46,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:54:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:54:46,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:54:46,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543673184] [2019-12-18 14:54:46,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:54:46,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:54:46,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918925489] [2019-12-18 14:54:46,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:54:46,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:54:46,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:54:46,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:54:46,530 INFO L87 Difference]: Start difference. First operand 1665 states and 3660 transitions. Second operand 5 states. [2019-12-18 14:54:46,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:54:46,592 INFO L93 Difference]: Finished difference Result 974 states and 2029 transitions. [2019-12-18 14:54:46,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:54:46,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 14:54:46,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:54:46,596 INFO L225 Difference]: With dead ends: 974 [2019-12-18 14:54:46,597 INFO L226 Difference]: Without dead ends: 842 [2019-12-18 14:54:46,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:54:46,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-12-18 14:54:46,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 800. [2019-12-18 14:54:46,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2019-12-18 14:54:46,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1708 transitions. [2019-12-18 14:54:46,617 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1708 transitions. Word has length 28 [2019-12-18 14:54:46,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:54:46,618 INFO L462 AbstractCegarLoop]: Abstraction has 800 states and 1708 transitions. [2019-12-18 14:54:46,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:54:46,618 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1708 transitions. [2019-12-18 14:54:46,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 14:54:46,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:54:46,624 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] [2019-12-18 14:54:46,625 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:54:46,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:54:46,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1290466760, now seen corresponding path program 1 times [2019-12-18 14:54:46,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:54:46,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069716039] [2019-12-18 14:54:46,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:54:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:54:46,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:54:46,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069716039] [2019-12-18 14:54:46,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:54:46,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:54:46,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821699701] [2019-12-18 14:54:46,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:54:46,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:54:46,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:54:46,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:54:46,788 INFO L87 Difference]: Start difference. First operand 800 states and 1708 transitions. Second operand 7 states. [2019-12-18 14:54:47,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:54:47,051 INFO L93 Difference]: Finished difference Result 1394 states and 2892 transitions. [2019-12-18 14:54:47,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 14:54:47,052 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-18 14:54:47,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:54:47,053 INFO L225 Difference]: With dead ends: 1394 [2019-12-18 14:54:47,053 INFO L226 Difference]: Without dead ends: 931 [2019-12-18 14:54:47,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:54:47,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2019-12-18 14:54:47,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 792. [2019-12-18 14:54:47,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2019-12-18 14:54:47,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1676 transitions. [2019-12-18 14:54:47,069 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1676 transitions. Word has length 50 [2019-12-18 14:54:47,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:54:47,070 INFO L462 AbstractCegarLoop]: Abstraction has 792 states and 1676 transitions. [2019-12-18 14:54:47,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:54:47,070 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1676 transitions. [2019-12-18 14:54:47,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 14:54:47,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:54:47,073 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:54:47,073 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:54:47,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:54:47,074 INFO L82 PathProgramCache]: Analyzing trace with hash 50774886, now seen corresponding path program 2 times [2019-12-18 14:54:47,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:54:47,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102522772] [2019-12-18 14:54:47,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:54:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:54:47,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:54:47,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102522772] [2019-12-18 14:54:47,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:54:47,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:54:47,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826684083] [2019-12-18 14:54:47,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:54:47,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:54:47,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:54:47,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:54:47,196 INFO L87 Difference]: Start difference. First operand 792 states and 1676 transitions. Second operand 3 states. [2019-12-18 14:54:47,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:54:47,246 INFO L93 Difference]: Finished difference Result 1051 states and 2216 transitions. [2019-12-18 14:54:47,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:54:47,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-18 14:54:47,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:54:47,248 INFO L225 Difference]: With dead ends: 1051 [2019-12-18 14:54:47,248 INFO L226 Difference]: Without dead ends: 1051 [2019-12-18 14:54:47,248 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-18 14:54:47,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2019-12-18 14:54:47,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 849. [2019-12-18 14:54:47,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2019-12-18 14:54:47,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1815 transitions. [2019-12-18 14:54:47,265 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1815 transitions. Word has length 50 [2019-12-18 14:54:47,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:54:47,265 INFO L462 AbstractCegarLoop]: Abstraction has 849 states and 1815 transitions. [2019-12-18 14:54:47,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:54:47,266 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1815 transitions. [2019-12-18 14:54:47,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 14:54:47,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:54:47,268 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-18 14:54:47,268 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:54:47,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:54:47,269 INFO L82 PathProgramCache]: Analyzing trace with hash 925752847, now seen corresponding path program 1 times [2019-12-18 14:54:47,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:54:47,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80728277] [2019-12-18 14:54:47,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:54:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:54:47,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:54:47,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80728277] [2019-12-18 14:54:47,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:54:47,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:54:47,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255668728] [2019-12-18 14:54:47,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:54:47,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:54:47,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:54:47,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:54:47,380 INFO L87 Difference]: Start difference. First operand 849 states and 1815 transitions. Second operand 6 states. [2019-12-18 14:54:47,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:54:47,856 INFO L93 Difference]: Finished difference Result 1004 states and 2107 transitions. [2019-12-18 14:54:47,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:54:47,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-18 14:54:47,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:54:47,859 INFO L225 Difference]: With dead ends: 1004 [2019-12-18 14:54:47,859 INFO L226 Difference]: Without dead ends: 1004 [2019-12-18 14:54:47,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:54:47,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2019-12-18 14:54:47,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 909. [2019-12-18 14:54:47,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-12-18 14:54:47,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1931 transitions. [2019-12-18 14:54:47,876 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1931 transitions. Word has length 51 [2019-12-18 14:54:47,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:54:47,876 INFO L462 AbstractCegarLoop]: Abstraction has 909 states and 1931 transitions. [2019-12-18 14:54:47,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:54:47,876 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1931 transitions. [2019-12-18 14:54:47,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 14:54:47,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:54:47,879 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-18 14:54:47,879 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:54:47,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:54:47,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1086861075, now seen corresponding path program 2 times [2019-12-18 14:54:47,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:54:47,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208561537] [2019-12-18 14:54:47,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:54:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:54:47,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:54:47,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208561537] [2019-12-18 14:54:47,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:54:47,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:54:47,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718926315] [2019-12-18 14:54:47,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:54:47,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:54:47,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:54:47,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:54:47,963 INFO L87 Difference]: Start difference. First operand 909 states and 1931 transitions. Second operand 3 states. [2019-12-18 14:54:47,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:54:47,975 INFO L93 Difference]: Finished difference Result 908 states and 1929 transitions. [2019-12-18 14:54:47,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:54:47,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 14:54:47,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:54:47,977 INFO L225 Difference]: With dead ends: 908 [2019-12-18 14:54:47,977 INFO L226 Difference]: Without dead ends: 908 [2019-12-18 14:54:47,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:54:47,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2019-12-18 14:54:47,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 754. [2019-12-18 14:54:47,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-12-18 14:54:47,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1638 transitions. [2019-12-18 14:54:47,991 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1638 transitions. Word has length 51 [2019-12-18 14:54:47,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:54:47,992 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1638 transitions. [2019-12-18 14:54:47,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:54:47,992 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1638 transitions. [2019-12-18 14:54:47,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 14:54:47,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:54:47,994 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-18 14:54:47,994 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:54:47,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:54:47,995 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 1 times [2019-12-18 14:54:47,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:54:47,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653673441] [2019-12-18 14:54:47,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:54:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:54:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:54:48,176 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:54:48,176 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:54:48,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_86 0) (= |v_#NULL.offset_6| 0) (= v_~weak$$choice2~0_112 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= 0 v_~y$r_buff0_thd2~0_324) (= v_~y$r_buff1_thd0~0_129 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2307~0.base_48|) (= v_~y$read_delayed~0_6 0) (= v_~__unbuffered_p1_EBX~0_49 0) (= 0 v_~weak$$choice0~0_29) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~main$tmp_guard1~0_41 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2307~0.base_48| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2307~0.base_48|) |v_ULTIMATE.start_main_~#t2307~0.offset_31| 0)) |v_#memory_int_17|) (= 0 |v_#NULL.base_6|) (= |v_ULTIMATE.start_main_~#t2307~0.offset_31| 0) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~__unbuffered_p1_EAX~0_55) (= v_~y~0_137 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2307~0.base_48| 1) |v_#valid_73|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2307~0.base_48| 4)) (= v_~y$r_buff0_thd0~0_125 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2307~0.base_48|)) (= 0 v_~y$flush_delayed~0_38) (= v_~y$mem_tmp~0_31 0) (= v_~y$w_buff1_used~0_311 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_223) (= v_~y$r_buff1_thd1~0_115 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, ULTIMATE.start_main_~#t2308~0.base=|v_ULTIMATE.start_main_~#t2308~0.base_49|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_84|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ULTIMATE.start_main_~#t2307~0.offset=|v_ULTIMATE.start_main_~#t2307~0.offset_31|, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_38, #length=|v_#length_17|, ~y~0=v_~y~0_137, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ULTIMATE.start_main_~#t2307~0.base=|v_ULTIMATE.start_main_~#t2307~0.base_48|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_223, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_73|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ULTIMATE.start_main_~#t2308~0.offset=|v_ULTIMATE.start_main_~#t2308~0.offset_31|, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_129, ~x~0=v_~x~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t2308~0.base, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t2307~0.offset, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2307~0.base, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2308~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 14:54:48,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2308~0.base_13|) 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2308~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2308~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t2308~0.base_13|)) (= |v_ULTIMATE.start_main_~#t2308~0.offset_11| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2308~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2308~0.base_13|) |v_ULTIMATE.start_main_~#t2308~0.offset_11| 1)) |v_#memory_int_11|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t2308~0.base_13| 4) |v_#length_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t2308~0.base=|v_ULTIMATE.start_main_~#t2308~0.base_13|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2308~0.offset=|v_ULTIMATE.start_main_~#t2308~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2308~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2308~0.offset] because there is no mapped edge [2019-12-18 14:54:48,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1326706588)) (= ~y$r_buff1_thd0~0_Out1326706588 ~y$r_buff0_thd0~0_In1326706588) (= ~x~0_Out1326706588 1) (= 1 ~y$r_buff0_thd1~0_Out1326706588) (= ~y$r_buff1_thd2~0_Out1326706588 ~y$r_buff0_thd2~0_In1326706588) (= ~y$r_buff1_thd1~0_Out1326706588 ~y$r_buff0_thd1~0_In1326706588)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1326706588, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1326706588, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1326706588, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1326706588} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out1326706588, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out1326706588, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1326706588, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1326706588, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1326706588, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1326706588, ~x~0=~x~0_Out1326706588, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1326706588} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 14:54:48,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1500313427 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-1500313427 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1500313427| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1500313427| ~y$w_buff0_used~0_In-1500313427)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1500313427, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1500313427} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1500313427|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1500313427, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1500313427} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 14:54:48,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1281136664 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1281136664 256)))) (or (= (mod ~y$w_buff0_used~0_In1281136664 256) 0) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In1281136664 256))) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1281136664 256))))) (= |P1Thread1of1ForFork1_#t~ite21_Out1281136664| |P1Thread1of1ForFork1_#t~ite20_Out1281136664|) (= ~y$w_buff0_used~0_In1281136664 |P1Thread1of1ForFork1_#t~ite20_Out1281136664|) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite20_In1281136664| |P1Thread1of1ForFork1_#t~ite20_Out1281136664|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite21_Out1281136664| ~y$w_buff0_used~0_In1281136664)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1281136664, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1281136664, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1281136664|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1281136664, ~weak$$choice2~0=~weak$$choice2~0_In1281136664, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1281136664} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1281136664, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1281136664, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1281136664|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1281136664, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1281136664|, ~weak$$choice2~0=~weak$$choice2~0_In1281136664, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1281136664} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 14:54:48,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1666632639 256) 0)) (.cse5 (= 0 (mod ~y$w_buff1_used~0_In-1666632639 256))) (.cse6 (= 0 (mod ~y$r_buff0_thd2~0_In-1666632639 256))) (.cse4 (= (mod ~y$r_buff1_thd2~0_In-1666632639 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite24_Out-1666632639| |P1Thread1of1ForFork1_#t~ite23_Out-1666632639|)) (.cse1 (= 0 (mod ~weak$$choice2~0_In-1666632639 256)))) (or (let ((.cse3 (not .cse6))) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite22_Out-1666632639| 0) .cse1 .cse2 (= |P1Thread1of1ForFork1_#t~ite23_Out-1666632639| |P1Thread1of1ForFork1_#t~ite22_Out-1666632639|) (or .cse3 (not .cse4)) (or .cse3 (not .cse5)))) (and (or (and (or .cse0 (and .cse5 .cse6) (and .cse6 .cse4)) .cse1 (= |P1Thread1of1ForFork1_#t~ite23_Out-1666632639| ~y$w_buff1_used~0_In-1666632639) .cse2) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite23_Out-1666632639| |P1Thread1of1ForFork1_#t~ite23_In-1666632639|) (= |P1Thread1of1ForFork1_#t~ite24_Out-1666632639| ~y$w_buff1_used~0_In-1666632639))) (= |P1Thread1of1ForFork1_#t~ite22_In-1666632639| |P1Thread1of1ForFork1_#t~ite22_Out-1666632639|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1666632639, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1666632639, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1666632639, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1666632639|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-1666632639|, ~weak$$choice2~0=~weak$$choice2~0_In-1666632639, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1666632639} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1666632639, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1666632639, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1666632639, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1666632639|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1666632639|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-1666632639|, ~weak$$choice2~0=~weak$$choice2~0_In-1666632639, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1666632639} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-18 14:54:48,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In570862028 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In570862028 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In570862028 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In570862028 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out570862028| ~y$w_buff1_used~0_In570862028) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out570862028| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In570862028, ~y$w_buff0_used~0=~y$w_buff0_used~0_In570862028, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In570862028, ~y$w_buff1_used~0=~y$w_buff1_used~0_In570862028} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out570862028|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In570862028, ~y$w_buff0_used~0=~y$w_buff0_used~0_In570862028, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In570862028, ~y$w_buff1_used~0=~y$w_buff1_used~0_In570862028} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 14:54:48,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1675604045 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1675604045 256)))) (or (and (= ~y$r_buff0_thd1~0_Out-1675604045 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In-1675604045 ~y$r_buff0_thd1~0_Out-1675604045)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1675604045, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1675604045} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1675604045, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1675604045|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1675604045} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 14:54:48,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-2032763310 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2032763310 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-2032763310 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-2032763310 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-2032763310|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-2032763310| ~y$r_buff1_thd1~0_In-2032763310) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2032763310, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2032763310, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2032763310, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2032763310} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2032763310, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2032763310, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-2032763310|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2032763310, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2032763310} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 14:54:48,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_29|) (not (= (mod v_~weak$$choice2~0_92 256) 0)) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_29|, ~weak$$choice2~0=v_~weak$$choice2~0_92} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_28|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_28|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_24|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_29|, ~weak$$choice2~0=v_~weak$$choice2~0_92, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_31|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_34|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 14:54:48,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In648927101 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In648927101 |P1Thread1of1ForFork1_#t~ite29_Out648927101|) (= |P1Thread1of1ForFork1_#t~ite30_Out648927101| |P1Thread1of1ForFork1_#t~ite29_Out648927101|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In648927101 256) 0))) (or (= (mod ~y$w_buff0_used~0_In648927101 256) 0) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In648927101 256))) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In648927101 256))))) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite29_In648927101| |P1Thread1of1ForFork1_#t~ite29_Out648927101|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite30_Out648927101| ~y$r_buff1_thd2~0_In648927101)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In648927101, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In648927101|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In648927101, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In648927101, ~weak$$choice2~0=~weak$$choice2~0_In648927101, ~y$w_buff1_used~0=~y$w_buff1_used~0_In648927101} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In648927101, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out648927101|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out648927101|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In648927101, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In648927101, ~weak$$choice2~0=~weak$$choice2~0_In648927101, ~y$w_buff1_used~0=~y$w_buff1_used~0_In648927101} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 14:54:48,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-18 14:54:48,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-139409483 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-139409483 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In-139409483 |P1Thread1of1ForFork1_#t~ite32_Out-139409483|) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In-139409483 |P1Thread1of1ForFork1_#t~ite32_Out-139409483|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-139409483, ~y$w_buff1~0=~y$w_buff1~0_In-139409483, ~y~0=~y~0_In-139409483, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-139409483} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-139409483, ~y$w_buff1~0=~y$w_buff1~0_In-139409483, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-139409483|, ~y~0=~y~0_In-139409483, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-139409483} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 14:54:48,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_10|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_10|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_9|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_13|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-18 14:54:48,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1180825853 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1180825853 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out-1180825853| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out-1180825853| ~y$w_buff0_used~0_In-1180825853) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1180825853, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1180825853} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1180825853, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1180825853, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1180825853|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 14:54:48,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1626773959 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1626773959 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1626773959 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1626773959 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1626773959 |P1Thread1of1ForFork1_#t~ite35_Out1626773959|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite35_Out1626773959| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1626773959, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1626773959, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1626773959, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1626773959} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1626773959, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1626773959, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1626773959, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1626773959|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1626773959} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 14:54:48,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1766177896 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1766177896 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out1766177896|) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In1766177896 |P1Thread1of1ForFork1_#t~ite36_Out1766177896|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1766177896, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1766177896} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1766177896, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1766177896, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1766177896|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 14:54:48,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-637485606 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-637485606 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-637485606 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-637485606 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-637485606 |P1Thread1of1ForFork1_#t~ite37_Out-637485606|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-637485606|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-637485606, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-637485606, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-637485606, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-637485606} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-637485606, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-637485606, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-637485606, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-637485606|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-637485606} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 14:54:48,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 14:54:48,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 14:54:48,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 14:54:48,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-630304747 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-630304747 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-630304747| ~y$w_buff1~0_In-630304747)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-630304747| ~y~0_In-630304747)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-630304747, ~y~0=~y~0_In-630304747, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-630304747, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-630304747} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-630304747|, ~y$w_buff1~0=~y$w_buff1~0_In-630304747, ~y~0=~y~0_In-630304747, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-630304747, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-630304747} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 14:54:48,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-18 14:54:48,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-2098409161 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-2098409161 256) 0))) (or (and (= ~y$w_buff0_used~0_In-2098409161 |ULTIMATE.start_main_#t~ite42_Out-2098409161|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite42_Out-2098409161| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2098409161, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2098409161} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2098409161, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2098409161, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-2098409161|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 14:54:48,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In794295616 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In794295616 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In794295616 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In794295616 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In794295616 |ULTIMATE.start_main_#t~ite43_Out794295616|)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out794295616|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In794295616, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In794295616, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In794295616, ~y$w_buff1_used~0=~y$w_buff1_used~0_In794295616} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In794295616, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In794295616, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out794295616|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In794295616, ~y$w_buff1_used~0=~y$w_buff1_used~0_In794295616} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 14:54:48,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1580927052 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1580927052 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In1580927052 |ULTIMATE.start_main_#t~ite44_Out1580927052|)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out1580927052|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1580927052, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1580927052} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1580927052, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1580927052, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1580927052|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 14:54:48,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1963785696 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In1963785696 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1963785696 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1963785696 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out1963785696| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1963785696| ~y$r_buff1_thd0~0_In1963785696)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1963785696, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1963785696, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1963785696, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1963785696} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1963785696, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1963785696, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1963785696, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1963785696|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1963785696} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 14:54:48,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_~__unbuffered_p1_EBX~0_17 0) (= v_~main$tmp_guard1~0_13 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 1 v_~__unbuffered_p1_EAX~0_21)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:54:48,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:54:48 BasicIcfg [2019-12-18 14:54:48,337 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:54:48,341 INFO L168 Benchmark]: Toolchain (without parser) took 15007.57 ms. Allocated memory was 136.8 MB in the beginning and 645.9 MB in the end (delta: 509.1 MB). Free memory was 98.8 MB in the beginning and 170.5 MB in the end (delta: -71.7 MB). Peak memory consumption was 437.4 MB. Max. memory is 7.1 GB. [2019-12-18 14:54:48,342 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 136.8 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 14:54:48,343 INFO L168 Benchmark]: CACSL2BoogieTranslator took 744.99 ms. Allocated memory was 136.8 MB in the beginning and 199.8 MB in the end (delta: 62.9 MB). Free memory was 98.4 MB in the beginning and 153.6 MB in the end (delta: -55.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:54:48,344 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.62 ms. Allocated memory is still 199.8 MB. Free memory was 153.6 MB in the beginning and 151.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 14:54:48,349 INFO L168 Benchmark]: Boogie Preprocessor took 36.70 ms. Allocated memory is still 199.8 MB. Free memory was 151.6 MB in the beginning and 148.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:54:48,353 INFO L168 Benchmark]: RCFGBuilder took 775.87 ms. Allocated memory is still 199.8 MB. Free memory was 148.9 MB in the beginning and 104.6 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-12-18 14:54:48,354 INFO L168 Benchmark]: TraceAbstraction took 13384.86 ms. Allocated memory was 199.8 MB in the beginning and 645.9 MB in the end (delta: 446.2 MB). Free memory was 104.6 MB in the beginning and 170.5 MB in the end (delta: -65.8 MB). Peak memory consumption was 380.3 MB. Max. memory is 7.1 GB. [2019-12-18 14:54:48,363 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.50 ms. Allocated memory is still 136.8 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 744.99 ms. Allocated memory was 136.8 MB in the beginning and 199.8 MB in the end (delta: 62.9 MB). Free memory was 98.4 MB in the beginning and 153.6 MB in the end (delta: -55.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.62 ms. Allocated memory is still 199.8 MB. Free memory was 153.6 MB in the beginning and 151.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.70 ms. Allocated memory is still 199.8 MB. Free memory was 151.6 MB in the beginning and 148.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 775.87 ms. Allocated memory is still 199.8 MB. Free memory was 148.9 MB in the beginning and 104.6 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13384.86 ms. Allocated memory was 199.8 MB in the beginning and 645.9 MB in the end (delta: 446.2 MB). Free memory was 104.6 MB in the beginning and 170.5 MB in the end (delta: -65.8 MB). Peak memory consumption was 380.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.8s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4569 VarBasedMoverChecksPositive, 175 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 211 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t2307, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t2308, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 __unbuffered_p1_EAX = x [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.0s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1459 SDtfs, 1573 SDslu, 2642 SDs, 0 SdLazy, 1477 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 18 SyntacticMatches, 7 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11360occurred 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.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 5169 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 412 NumberOfCodeBlocks, 412 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 347 ConstructedInterpolants, 0 QuantifiedInterpolants, 37039 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...