/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/safe002_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:24:48,128 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:24:48,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:24:48,146 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:24:48,147 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:24:48,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:24:48,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:24:48,160 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:24:48,164 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:24:48,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:24:48,169 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:24:48,172 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:24:48,172 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:24:48,175 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:24:48,178 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:24:48,179 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:24:48,181 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:24:48,182 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:24:48,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:24:48,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:24:48,192 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:24:48,196 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:24:48,198 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:24:48,198 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:24:48,200 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:24:48,201 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:24:48,201 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:24:48,203 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:24:48,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:24:48,205 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:24:48,205 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:24:48,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:24:48,210 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:24:48,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:24:48,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:24:48,212 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:24:48,213 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:24:48,213 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:24:48,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:24:48,214 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:24:48,215 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:24:48,216 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:24:48,252 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:24:48,256 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:24:48,257 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:24:48,257 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:24:48,258 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:24:48,261 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:24:48,261 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:24:48,261 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:24:48,262 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:24:48,262 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:24:48,262 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:24:48,262 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:24:48,262 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:24:48,263 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:24:48,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:24:48,263 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:24:48,263 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:24:48,263 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:24:48,264 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:24:48,265 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:24:48,265 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:24:48,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:24:48,266 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:24:48,266 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:24:48,266 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:24:48,266 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:24:48,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:24:48,266 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:24:48,267 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:24:48,269 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:24:48,537 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:24:48,559 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:24:48,563 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:24:48,564 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:24:48,565 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:24:48,566 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_rmo.opt.i [2019-12-18 14:24:48,645 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1909d602b/dd5b67f6e61d4f75b6092e5d7965c7b8/FLAGc0e24bd30 [2019-12-18 14:24:49,200 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:24:49,202 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_rmo.opt.i [2019-12-18 14:24:49,221 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1909d602b/dd5b67f6e61d4f75b6092e5d7965c7b8/FLAGc0e24bd30 [2019-12-18 14:24:49,544 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1909d602b/dd5b67f6e61d4f75b6092e5d7965c7b8 [2019-12-18 14:24:49,553 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:24:49,555 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:24:49,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:24:49,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:24:49,559 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:24:49,561 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:24:49" (1/1) ... [2019-12-18 14:24:49,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61995816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:24:49, skipping insertion in model container [2019-12-18 14:24:49,564 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:24:49" (1/1) ... [2019-12-18 14:24:49,571 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:24:49,635 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:24:50,113 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:24:50,126 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:24:50,259 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:24:50,353 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:24:50,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:24:50 WrapperNode [2019-12-18 14:24:50,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:24:50,355 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:24:50,355 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:24:50,355 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:24:50,364 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:24:50" (1/1) ... [2019-12-18 14:24:50,404 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:24:50" (1/1) ... [2019-12-18 14:24:50,436 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:24:50,436 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:24:50,436 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:24:50,436 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:24:50,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:24:50" (1/1) ... [2019-12-18 14:24:50,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:24:50" (1/1) ... [2019-12-18 14:24:50,450 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:24:50" (1/1) ... [2019-12-18 14:24:50,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:24:50" (1/1) ... [2019-12-18 14:24:50,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:24:50" (1/1) ... [2019-12-18 14:24:50,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:24:50" (1/1) ... [2019-12-18 14:24:50,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:24:50" (1/1) ... [2019-12-18 14:24:50,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:24:50,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:24:50,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:24:50,474 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:24:50,475 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:24:50" (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:24:50,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:24:50,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:24:50,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:24:50,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:24:50,544 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:24:50,544 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:24:50,544 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:24:50,545 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:24:50,545 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 14:24:50,545 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 14:24:50,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:24:50,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:24:50,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:24:50,547 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:24:51,290 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:24:51,290 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:24:51,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:24:51 BoogieIcfgContainer [2019-12-18 14:24:51,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:24:51,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:24:51,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:24:51,296 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:24:51,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:24:49" (1/3) ... [2019-12-18 14:24:51,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e71721d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:24:51, skipping insertion in model container [2019-12-18 14:24:51,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:24:50" (2/3) ... [2019-12-18 14:24:51,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e71721d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:24:51, skipping insertion in model container [2019-12-18 14:24:51,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:24:51" (3/3) ... [2019-12-18 14:24:51,301 INFO L109 eAbstractionObserver]: Analyzing ICFG safe002_rmo.opt.i [2019-12-18 14:24:51,311 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:24:51,311 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:24:51,319 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:24:51,321 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:24:51,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,366 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,367 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,391 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,391 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,391 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,391 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,392 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,399 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,399 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,430 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,430 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,430 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,436 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,437 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,441 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,442 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:51,461 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 14:24:51,482 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:24:51,483 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:24:51,483 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:24:51,483 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:24:51,483 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:24:51,483 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:24:51,483 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:24:51,484 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:24:51,504 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-18 14:24:51,506 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 14:24:51,602 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 14:24:51,603 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:24:51,627 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 14:24:51,652 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 14:24:51,714 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 14:24:51,715 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:24:51,722 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 14:24:51,742 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 14:24:51,743 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:24:57,411 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 14:24:57,560 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 14:24:57,577 INFO L206 etLargeBlockEncoding]: Checked pairs total: 64859 [2019-12-18 14:24:57,577 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-18 14:24:57,581 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 91 transitions [2019-12-18 14:25:07,652 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80448 states. [2019-12-18 14:25:07,654 INFO L276 IsEmpty]: Start isEmpty. Operand 80448 states. [2019-12-18 14:25:07,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 14:25:07,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:07,662 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 14:25:07,662 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:07,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:07,671 INFO L82 PathProgramCache]: Analyzing trace with hash 798334706, now seen corresponding path program 1 times [2019-12-18 14:25:07,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:07,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694226728] [2019-12-18 14:25:07,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:07,980 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:25:07,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694226728] [2019-12-18 14:25:07,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:07,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:25:07,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966304185] [2019-12-18 14:25:07,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:25:07,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:08,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:25:08,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:25:08,004 INFO L87 Difference]: Start difference. First operand 80448 states. Second operand 3 states. [2019-12-18 14:25:09,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:09,133 INFO L93 Difference]: Finished difference Result 79498 states and 344058 transitions. [2019-12-18 14:25:09,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:25:09,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 14:25:09,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:12,007 INFO L225 Difference]: With dead ends: 79498 [2019-12-18 14:25:12,007 INFO L226 Difference]: Without dead ends: 74626 [2019-12-18 14:25:12,008 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:25:14,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74626 states. [2019-12-18 14:25:16,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74626 to 74626. [2019-12-18 14:25:16,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74626 states. [2019-12-18 14:25:17,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74626 states to 74626 states and 322484 transitions. [2019-12-18 14:25:17,225 INFO L78 Accepts]: Start accepts. Automaton has 74626 states and 322484 transitions. Word has length 5 [2019-12-18 14:25:17,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:17,225 INFO L462 AbstractCegarLoop]: Abstraction has 74626 states and 322484 transitions. [2019-12-18 14:25:17,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:25:17,226 INFO L276 IsEmpty]: Start isEmpty. Operand 74626 states and 322484 transitions. [2019-12-18 14:25:17,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:25:17,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:17,236 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:25:17,236 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:17,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:17,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1987891641, now seen corresponding path program 1 times [2019-12-18 14:25:17,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:17,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103452278] [2019-12-18 14:25:17,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:17,342 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:25:17,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103452278] [2019-12-18 14:25:17,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:17,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:25:17,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498452838] [2019-12-18 14:25:17,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:25:17,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:17,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:25:17,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:25:17,349 INFO L87 Difference]: Start difference. First operand 74626 states and 322484 transitions. Second operand 3 states. [2019-12-18 14:25:17,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:17,605 INFO L93 Difference]: Finished difference Result 19918 states and 69198 transitions. [2019-12-18 14:25:17,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:25:17,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 14:25:17,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:17,665 INFO L225 Difference]: With dead ends: 19918 [2019-12-18 14:25:17,665 INFO L226 Difference]: Without dead ends: 19918 [2019-12-18 14:25:17,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:25:17,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19918 states. [2019-12-18 14:25:18,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19918 to 19918. [2019-12-18 14:25:18,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19918 states. [2019-12-18 14:25:21,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19918 states to 19918 states and 69198 transitions. [2019-12-18 14:25:21,210 INFO L78 Accepts]: Start accepts. Automaton has 19918 states and 69198 transitions. Word has length 13 [2019-12-18 14:25:21,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:21,211 INFO L462 AbstractCegarLoop]: Abstraction has 19918 states and 69198 transitions. [2019-12-18 14:25:21,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:25:21,211 INFO L276 IsEmpty]: Start isEmpty. Operand 19918 states and 69198 transitions. [2019-12-18 14:25:21,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:25:21,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:21,214 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:25:21,214 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:21,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:21,214 INFO L82 PathProgramCache]: Analyzing trace with hash -225338063, now seen corresponding path program 1 times [2019-12-18 14:25:21,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:21,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016780619] [2019-12-18 14:25:21,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:21,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:25:21,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016780619] [2019-12-18 14:25:21,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:21,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:25:21,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382402597] [2019-12-18 14:25:21,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:25:21,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:21,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:25:21,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:25:21,324 INFO L87 Difference]: Start difference. First operand 19918 states and 69198 transitions. Second operand 4 states. [2019-12-18 14:25:21,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:21,709 INFO L93 Difference]: Finished difference Result 29603 states and 99212 transitions. [2019-12-18 14:25:21,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:25:21,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 14:25:21,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:21,917 INFO L225 Difference]: With dead ends: 29603 [2019-12-18 14:25:21,918 INFO L226 Difference]: Without dead ends: 29589 [2019-12-18 14:25:21,918 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:25:22,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29589 states. [2019-12-18 14:25:22,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29589 to 26899. [2019-12-18 14:25:22,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26899 states. [2019-12-18 14:25:22,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26899 states to 26899 states and 90919 transitions. [2019-12-18 14:25:22,740 INFO L78 Accepts]: Start accepts. Automaton has 26899 states and 90919 transitions. Word has length 13 [2019-12-18 14:25:22,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:22,741 INFO L462 AbstractCegarLoop]: Abstraction has 26899 states and 90919 transitions. [2019-12-18 14:25:22,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:25:22,741 INFO L276 IsEmpty]: Start isEmpty. Operand 26899 states and 90919 transitions. [2019-12-18 14:25:22,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:25:22,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:22,743 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:25:22,743 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:22,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:22,744 INFO L82 PathProgramCache]: Analyzing trace with hash -457982250, now seen corresponding path program 1 times [2019-12-18 14:25:22,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:22,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421647526] [2019-12-18 14:25:22,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:22,827 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:25:22,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421647526] [2019-12-18 14:25:22,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:22,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:25:22,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44091508] [2019-12-18 14:25:22,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:25:22,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:22,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:25:22,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:25:22,830 INFO L87 Difference]: Start difference. First operand 26899 states and 90919 transitions. Second operand 5 states. [2019-12-18 14:25:23,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:23,332 INFO L93 Difference]: Finished difference Result 40028 states and 132579 transitions. [2019-12-18 14:25:23,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:25:23,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 14:25:23,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:23,634 INFO L225 Difference]: With dead ends: 40028 [2019-12-18 14:25:23,634 INFO L226 Difference]: Without dead ends: 40010 [2019-12-18 14:25:23,635 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:25:23,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40010 states. [2019-12-18 14:25:24,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40010 to 31276. [2019-12-18 14:25:24,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31276 states. [2019-12-18 14:25:24,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31276 states to 31276 states and 104921 transitions. [2019-12-18 14:25:24,579 INFO L78 Accepts]: Start accepts. Automaton has 31276 states and 104921 transitions. Word has length 14 [2019-12-18 14:25:24,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:24,580 INFO L462 AbstractCegarLoop]: Abstraction has 31276 states and 104921 transitions. [2019-12-18 14:25:24,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:25:24,580 INFO L276 IsEmpty]: Start isEmpty. Operand 31276 states and 104921 transitions. [2019-12-18 14:25:24,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 14:25:24,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:24,591 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] [2019-12-18 14:25:24,591 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:24,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:24,591 INFO L82 PathProgramCache]: Analyzing trace with hash -620486811, now seen corresponding path program 1 times [2019-12-18 14:25:24,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:24,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179934340] [2019-12-18 14:25:24,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:24,730 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:25:24,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179934340] [2019-12-18 14:25:24,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:24,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:25:24,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041266861] [2019-12-18 14:25:24,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:25:24,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:24,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:25:24,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:25:24,732 INFO L87 Difference]: Start difference. First operand 31276 states and 104921 transitions. Second operand 6 states. [2019-12-18 14:25:25,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:25,889 INFO L93 Difference]: Finished difference Result 54414 states and 177321 transitions. [2019-12-18 14:25:25,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:25:25,890 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 14:25:25,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:25,986 INFO L225 Difference]: With dead ends: 54414 [2019-12-18 14:25:25,986 INFO L226 Difference]: Without dead ends: 54384 [2019-12-18 14:25:25,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:25:26,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54384 states. [2019-12-18 14:25:26,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54384 to 36377. [2019-12-18 14:25:26,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36377 states. [2019-12-18 14:25:26,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36377 states to 36377 states and 120495 transitions. [2019-12-18 14:25:26,823 INFO L78 Accepts]: Start accepts. Automaton has 36377 states and 120495 transitions. Word has length 22 [2019-12-18 14:25:26,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:26,823 INFO L462 AbstractCegarLoop]: Abstraction has 36377 states and 120495 transitions. [2019-12-18 14:25:26,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:25:26,824 INFO L276 IsEmpty]: Start isEmpty. Operand 36377 states and 120495 transitions. [2019-12-18 14:25:26,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 14:25:26,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:26,834 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] [2019-12-18 14:25:26,834 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:26,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:26,834 INFO L82 PathProgramCache]: Analyzing trace with hash -2022809675, now seen corresponding path program 2 times [2019-12-18 14:25:26,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:26,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509412048] [2019-12-18 14:25:26,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:26,998 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:25:26,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509412048] [2019-12-18 14:25:26,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:26,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:25:26,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268824518] [2019-12-18 14:25:26,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:25:27,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:27,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:25:27,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:25:27,000 INFO L87 Difference]: Start difference. First operand 36377 states and 120495 transitions. Second operand 7 states. [2019-12-18 14:25:28,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:28,208 INFO L93 Difference]: Finished difference Result 54885 states and 178707 transitions. [2019-12-18 14:25:28,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 14:25:28,208 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-18 14:25:28,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:28,305 INFO L225 Difference]: With dead ends: 54885 [2019-12-18 14:25:28,306 INFO L226 Difference]: Without dead ends: 54843 [2019-12-18 14:25:28,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:25:28,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54843 states. [2019-12-18 14:25:28,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54843 to 31795. [2019-12-18 14:25:28,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31795 states. [2019-12-18 14:25:28,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31795 states to 31795 states and 106002 transitions. [2019-12-18 14:25:28,994 INFO L78 Accepts]: Start accepts. Automaton has 31795 states and 106002 transitions. Word has length 22 [2019-12-18 14:25:28,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:28,995 INFO L462 AbstractCegarLoop]: Abstraction has 31795 states and 106002 transitions. [2019-12-18 14:25:28,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:25:28,995 INFO L276 IsEmpty]: Start isEmpty. Operand 31795 states and 106002 transitions. [2019-12-18 14:25:29,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:25:29,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:29,010 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:25:29,010 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:29,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:29,011 INFO L82 PathProgramCache]: Analyzing trace with hash -364842915, now seen corresponding path program 1 times [2019-12-18 14:25:29,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:29,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825727543] [2019-12-18 14:25:29,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:29,058 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:25:29,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825727543] [2019-12-18 14:25:29,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:29,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:25:29,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282371252] [2019-12-18 14:25:29,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:25:29,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:29,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:25:29,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:25:29,060 INFO L87 Difference]: Start difference. First operand 31795 states and 106002 transitions. Second operand 4 states. [2019-12-18 14:25:29,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:29,134 INFO L93 Difference]: Finished difference Result 12400 states and 38387 transitions. [2019-12-18 14:25:29,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:25:29,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 14:25:29,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:29,158 INFO L225 Difference]: With dead ends: 12400 [2019-12-18 14:25:29,158 INFO L226 Difference]: Without dead ends: 12400 [2019-12-18 14:25:29,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:25:29,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12400 states. [2019-12-18 14:25:29,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12400 to 12304. [2019-12-18 14:25:29,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12304 states. [2019-12-18 14:25:29,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12304 states to 12304 states and 38107 transitions. [2019-12-18 14:25:29,368 INFO L78 Accepts]: Start accepts. Automaton has 12304 states and 38107 transitions. Word has length 25 [2019-12-18 14:25:29,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:29,369 INFO L462 AbstractCegarLoop]: Abstraction has 12304 states and 38107 transitions. [2019-12-18 14:25:29,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:25:29,369 INFO L276 IsEmpty]: Start isEmpty. Operand 12304 states and 38107 transitions. [2019-12-18 14:25:29,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 14:25:29,386 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:29,387 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] [2019-12-18 14:25:29,387 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:29,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:29,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1598965693, now seen corresponding path program 1 times [2019-12-18 14:25:29,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:29,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526021752] [2019-12-18 14:25:29,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:29,444 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:25:29,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526021752] [2019-12-18 14:25:29,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:29,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:25:29,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190768421] [2019-12-18 14:25:29,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:25:29,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:29,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:25:29,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:25:29,446 INFO L87 Difference]: Start difference. First operand 12304 states and 38107 transitions. Second operand 3 states. [2019-12-18 14:25:29,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:29,487 INFO L93 Difference]: Finished difference Result 12303 states and 38105 transitions. [2019-12-18 14:25:29,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:25:29,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 14:25:29,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:29,504 INFO L225 Difference]: With dead ends: 12303 [2019-12-18 14:25:29,505 INFO L226 Difference]: Without dead ends: 12303 [2019-12-18 14:25:29,505 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:25:29,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12303 states. [2019-12-18 14:25:29,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12303 to 12303. [2019-12-18 14:25:29,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12303 states. [2019-12-18 14:25:29,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12303 states to 12303 states and 38105 transitions. [2019-12-18 14:25:29,756 INFO L78 Accepts]: Start accepts. Automaton has 12303 states and 38105 transitions. Word has length 39 [2019-12-18 14:25:29,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:29,757 INFO L462 AbstractCegarLoop]: Abstraction has 12303 states and 38105 transitions. [2019-12-18 14:25:29,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:25:29,757 INFO L276 IsEmpty]: Start isEmpty. Operand 12303 states and 38105 transitions. [2019-12-18 14:25:29,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:25:29,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:29,776 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] [2019-12-18 14:25:29,776 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:29,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:29,777 INFO L82 PathProgramCache]: Analyzing trace with hash 790151032, now seen corresponding path program 1 times [2019-12-18 14:25:29,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:29,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065599933] [2019-12-18 14:25:29,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:29,845 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:25:29,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065599933] [2019-12-18 14:25:29,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:29,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:25:29,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954801718] [2019-12-18 14:25:29,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:25:29,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:29,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:25:29,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:25:29,848 INFO L87 Difference]: Start difference. First operand 12303 states and 38105 transitions. Second operand 5 states. [2019-12-18 14:25:29,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:29,931 INFO L93 Difference]: Finished difference Result 11071 states and 34927 transitions. [2019-12-18 14:25:29,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:25:29,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 14:25:29,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:29,953 INFO L225 Difference]: With dead ends: 11071 [2019-12-18 14:25:29,953 INFO L226 Difference]: Without dead ends: 11071 [2019-12-18 14:25:29,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:25:30,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11071 states. [2019-12-18 14:25:30,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11071 to 10759. [2019-12-18 14:25:30,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10759 states. [2019-12-18 14:25:30,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10759 states to 10759 states and 34051 transitions. [2019-12-18 14:25:30,156 INFO L78 Accepts]: Start accepts. Automaton has 10759 states and 34051 transitions. Word has length 40 [2019-12-18 14:25:30,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:30,156 INFO L462 AbstractCegarLoop]: Abstraction has 10759 states and 34051 transitions. [2019-12-18 14:25:30,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:25:30,156 INFO L276 IsEmpty]: Start isEmpty. Operand 10759 states and 34051 transitions. [2019-12-18 14:25:30,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:25:30,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:30,171 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:25:30,172 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:30,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:30,172 INFO L82 PathProgramCache]: Analyzing trace with hash 166042611, now seen corresponding path program 1 times [2019-12-18 14:25:30,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:30,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081714576] [2019-12-18 14:25:30,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:30,228 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:25:30,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081714576] [2019-12-18 14:25:30,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:30,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:25:30,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485297514] [2019-12-18 14:25:30,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:25:30,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:30,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:25:30,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:25:30,230 INFO L87 Difference]: Start difference. First operand 10759 states and 34051 transitions. Second operand 3 states. [2019-12-18 14:25:30,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:30,323 INFO L93 Difference]: Finished difference Result 14663 states and 46512 transitions. [2019-12-18 14:25:30,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:25:30,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 14:25:30,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:30,352 INFO L225 Difference]: With dead ends: 14663 [2019-12-18 14:25:30,353 INFO L226 Difference]: Without dead ends: 14663 [2019-12-18 14:25:30,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:25:30,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14663 states. [2019-12-18 14:25:30,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14663 to 12155. [2019-12-18 14:25:30,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12155 states. [2019-12-18 14:25:30,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12155 states to 12155 states and 39013 transitions. [2019-12-18 14:25:30,684 INFO L78 Accepts]: Start accepts. Automaton has 12155 states and 39013 transitions. Word has length 54 [2019-12-18 14:25:30,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:30,685 INFO L462 AbstractCegarLoop]: Abstraction has 12155 states and 39013 transitions. [2019-12-18 14:25:30,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:25:30,685 INFO L276 IsEmpty]: Start isEmpty. Operand 12155 states and 39013 transitions. [2019-12-18 14:25:30,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:25:30,711 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:30,711 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:25:30,711 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:30,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:30,711 INFO L82 PathProgramCache]: Analyzing trace with hash -2131568022, now seen corresponding path program 1 times [2019-12-18 14:25:30,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:30,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449026807] [2019-12-18 14:25:30,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:30,787 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:25:30,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449026807] [2019-12-18 14:25:30,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:30,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:25:30,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941640855] [2019-12-18 14:25:30,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:25:30,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:30,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:25:30,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:25:30,791 INFO L87 Difference]: Start difference. First operand 12155 states and 39013 transitions. Second operand 4 states. [2019-12-18 14:25:30,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:30,904 INFO L93 Difference]: Finished difference Result 23229 states and 74774 transitions. [2019-12-18 14:25:30,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:25:30,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-18 14:25:30,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:30,927 INFO L225 Difference]: With dead ends: 23229 [2019-12-18 14:25:30,928 INFO L226 Difference]: Without dead ends: 11383 [2019-12-18 14:25:30,928 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:25:30,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11383 states. [2019-12-18 14:25:31,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11383 to 11383. [2019-12-18 14:25:31,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11383 states. [2019-12-18 14:25:31,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11383 states to 11383 states and 36651 transitions. [2019-12-18 14:25:31,228 INFO L78 Accepts]: Start accepts. Automaton has 11383 states and 36651 transitions. Word has length 54 [2019-12-18 14:25:31,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:31,228 INFO L462 AbstractCegarLoop]: Abstraction has 11383 states and 36651 transitions. [2019-12-18 14:25:31,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:25:31,228 INFO L276 IsEmpty]: Start isEmpty. Operand 11383 states and 36651 transitions. [2019-12-18 14:25:31,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:25:31,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:31,259 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:25:31,260 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:31,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:31,260 INFO L82 PathProgramCache]: Analyzing trace with hash 794798576, now seen corresponding path program 2 times [2019-12-18 14:25:31,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:31,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755596456] [2019-12-18 14:25:31,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:31,398 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:25:31,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755596456] [2019-12-18 14:25:31,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:31,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:25:31,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405237723] [2019-12-18 14:25:31,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:25:31,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:31,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:25:31,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:25:31,400 INFO L87 Difference]: Start difference. First operand 11383 states and 36651 transitions. Second operand 4 states. [2019-12-18 14:25:31,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:31,547 INFO L93 Difference]: Finished difference Result 29018 states and 95263 transitions. [2019-12-18 14:25:31,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:25:31,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-18 14:25:31,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:31,559 INFO L225 Difference]: With dead ends: 29018 [2019-12-18 14:25:31,559 INFO L226 Difference]: Without dead ends: 5072 [2019-12-18 14:25:31,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:25:31,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5072 states. [2019-12-18 14:25:31,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5072 to 5072. [2019-12-18 14:25:31,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5072 states. [2019-12-18 14:25:31,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5072 states to 5072 states and 17135 transitions. [2019-12-18 14:25:31,689 INFO L78 Accepts]: Start accepts. Automaton has 5072 states and 17135 transitions. Word has length 54 [2019-12-18 14:25:31,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:31,689 INFO L462 AbstractCegarLoop]: Abstraction has 5072 states and 17135 transitions. [2019-12-18 14:25:31,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:25:31,689 INFO L276 IsEmpty]: Start isEmpty. Operand 5072 states and 17135 transitions. [2019-12-18 14:25:31,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:25:31,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:31,699 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:25:31,699 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:31,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:31,700 INFO L82 PathProgramCache]: Analyzing trace with hash 370181420, now seen corresponding path program 3 times [2019-12-18 14:25:31,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:31,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657202104] [2019-12-18 14:25:31,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:31,904 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:25:31,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657202104] [2019-12-18 14:25:31,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:31,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:25:31,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394873013] [2019-12-18 14:25:31,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:25:31,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:31,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:25:31,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:25:31,907 INFO L87 Difference]: Start difference. First operand 5072 states and 17135 transitions. Second operand 7 states. [2019-12-18 14:25:32,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:32,204 INFO L93 Difference]: Finished difference Result 9562 states and 31657 transitions. [2019-12-18 14:25:32,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:25:32,205 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 14:25:32,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:32,222 INFO L225 Difference]: With dead ends: 9562 [2019-12-18 14:25:32,222 INFO L226 Difference]: Without dead ends: 6984 [2019-12-18 14:25:32,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:25:32,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6984 states. [2019-12-18 14:25:32,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6984 to 6241. [2019-12-18 14:25:32,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6241 states. [2019-12-18 14:25:32,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6241 states to 6241 states and 21010 transitions. [2019-12-18 14:25:32,389 INFO L78 Accepts]: Start accepts. Automaton has 6241 states and 21010 transitions. Word has length 54 [2019-12-18 14:25:32,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:32,389 INFO L462 AbstractCegarLoop]: Abstraction has 6241 states and 21010 transitions. [2019-12-18 14:25:32,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:25:32,390 INFO L276 IsEmpty]: Start isEmpty. Operand 6241 states and 21010 transitions. [2019-12-18 14:25:32,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:25:32,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:32,402 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:25:32,402 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:32,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:32,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1876082156, now seen corresponding path program 4 times [2019-12-18 14:25:32,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:32,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652489724] [2019-12-18 14:25:32,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:32,482 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:25:32,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652489724] [2019-12-18 14:25:32,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:32,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:25:32,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926394732] [2019-12-18 14:25:32,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:25:32,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:32,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:25:32,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:25:32,484 INFO L87 Difference]: Start difference. First operand 6241 states and 21010 transitions. Second operand 7 states. [2019-12-18 14:25:32,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:32,769 INFO L93 Difference]: Finished difference Result 11586 states and 38057 transitions. [2019-12-18 14:25:32,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:25:32,769 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 14:25:32,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:32,783 INFO L225 Difference]: With dead ends: 11586 [2019-12-18 14:25:32,783 INFO L226 Difference]: Without dead ends: 8529 [2019-12-18 14:25:32,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:25:32,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8529 states. [2019-12-18 14:25:32,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8529 to 7599. [2019-12-18 14:25:32,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7599 states. [2019-12-18 14:25:32,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7599 states to 7599 states and 25347 transitions. [2019-12-18 14:25:32,912 INFO L78 Accepts]: Start accepts. Automaton has 7599 states and 25347 transitions. Word has length 54 [2019-12-18 14:25:32,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:32,912 INFO L462 AbstractCegarLoop]: Abstraction has 7599 states and 25347 transitions. [2019-12-18 14:25:32,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:25:32,912 INFO L276 IsEmpty]: Start isEmpty. Operand 7599 states and 25347 transitions. [2019-12-18 14:25:32,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:25:32,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:32,922 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:25:32,922 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:32,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:32,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1222512202, now seen corresponding path program 5 times [2019-12-18 14:25:32,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:32,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710168288] [2019-12-18 14:25:32,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:33,007 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:25:33,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710168288] [2019-12-18 14:25:33,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:33,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:25:33,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633449532] [2019-12-18 14:25:33,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:25:33,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:33,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:25:33,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:25:33,010 INFO L87 Difference]: Start difference. First operand 7599 states and 25347 transitions. Second operand 7 states. [2019-12-18 14:25:33,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:33,355 INFO L93 Difference]: Finished difference Result 16599 states and 53966 transitions. [2019-12-18 14:25:33,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 14:25:33,356 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 14:25:33,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:33,386 INFO L225 Difference]: With dead ends: 16599 [2019-12-18 14:25:33,387 INFO L226 Difference]: Without dead ends: 14168 [2019-12-18 14:25:33,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:25:33,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14168 states. [2019-12-18 14:25:33,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14168 to 7739. [2019-12-18 14:25:33,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7739 states. [2019-12-18 14:25:33,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7739 states to 7739 states and 25816 transitions. [2019-12-18 14:25:33,647 INFO L78 Accepts]: Start accepts. Automaton has 7739 states and 25816 transitions. Word has length 54 [2019-12-18 14:25:33,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:33,647 INFO L462 AbstractCegarLoop]: Abstraction has 7739 states and 25816 transitions. [2019-12-18 14:25:33,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:25:33,647 INFO L276 IsEmpty]: Start isEmpty. Operand 7739 states and 25816 transitions. [2019-12-18 14:25:33,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:25:33,658 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:33,659 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:25:33,659 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:33,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:33,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1952183562, now seen corresponding path program 6 times [2019-12-18 14:25:33,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:33,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340537705] [2019-12-18 14:25:33,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:33,727 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:25:33,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340537705] [2019-12-18 14:25:33,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:33,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:25:33,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134584881] [2019-12-18 14:25:33,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:25:33,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:33,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:25:33,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:25:33,729 INFO L87 Difference]: Start difference. First operand 7739 states and 25816 transitions. Second operand 3 states. [2019-12-18 14:25:33,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:33,767 INFO L93 Difference]: Finished difference Result 6206 states and 20080 transitions. [2019-12-18 14:25:33,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:25:33,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 14:25:33,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:33,780 INFO L225 Difference]: With dead ends: 6206 [2019-12-18 14:25:33,780 INFO L226 Difference]: Without dead ends: 6206 [2019-12-18 14:25:33,780 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:25:33,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6206 states. [2019-12-18 14:25:33,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6206 to 5926. [2019-12-18 14:25:33,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5926 states. [2019-12-18 14:25:33,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5926 states to 5926 states and 19190 transitions. [2019-12-18 14:25:33,924 INFO L78 Accepts]: Start accepts. Automaton has 5926 states and 19190 transitions. Word has length 54 [2019-12-18 14:25:33,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:33,924 INFO L462 AbstractCegarLoop]: Abstraction has 5926 states and 19190 transitions. [2019-12-18 14:25:33,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:25:33,924 INFO L276 IsEmpty]: Start isEmpty. Operand 5926 states and 19190 transitions. [2019-12-18 14:25:33,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 14:25:33,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:33,934 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:25:33,935 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:33,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:33,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1490833915, now seen corresponding path program 1 times [2019-12-18 14:25:33,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:33,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365824085] [2019-12-18 14:25:33,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:34,050 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:25:34,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365824085] [2019-12-18 14:25:34,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:34,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:25:34,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127295494] [2019-12-18 14:25:34,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:25:34,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:34,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:25:34,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:25:34,053 INFO L87 Difference]: Start difference. First operand 5926 states and 19190 transitions. Second operand 3 states. [2019-12-18 14:25:34,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:34,086 INFO L93 Difference]: Finished difference Result 5926 states and 19188 transitions. [2019-12-18 14:25:34,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:25:34,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 14:25:34,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:34,097 INFO L225 Difference]: With dead ends: 5926 [2019-12-18 14:25:34,097 INFO L226 Difference]: Without dead ends: 5926 [2019-12-18 14:25:34,098 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:25:34,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5926 states. [2019-12-18 14:25:34,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5926 to 5926. [2019-12-18 14:25:34,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5926 states. [2019-12-18 14:25:34,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5926 states to 5926 states and 19188 transitions. [2019-12-18 14:25:34,190 INFO L78 Accepts]: Start accepts. Automaton has 5926 states and 19188 transitions. Word has length 55 [2019-12-18 14:25:34,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:34,190 INFO L462 AbstractCegarLoop]: Abstraction has 5926 states and 19188 transitions. [2019-12-18 14:25:34,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:25:34,190 INFO L276 IsEmpty]: Start isEmpty. Operand 5926 states and 19188 transitions. [2019-12-18 14:25:34,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:25:34,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:34,198 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:25:34,198 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:34,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:34,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1692402453, now seen corresponding path program 1 times [2019-12-18 14:25:34,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:34,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277615854] [2019-12-18 14:25:34,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:34,597 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:25:34,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277615854] [2019-12-18 14:25:34,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:34,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:25:34,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65251445] [2019-12-18 14:25:34,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:25:34,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:34,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:25:34,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:25:34,599 INFO L87 Difference]: Start difference. First operand 5926 states and 19188 transitions. Second operand 11 states. [2019-12-18 14:25:35,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:35,532 INFO L93 Difference]: Finished difference Result 9280 states and 29862 transitions. [2019-12-18 14:25:35,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 14:25:35,534 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 14:25:35,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:35,547 INFO L225 Difference]: With dead ends: 9280 [2019-12-18 14:25:35,547 INFO L226 Difference]: Without dead ends: 8970 [2019-12-18 14:25:35,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2019-12-18 14:25:35,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8970 states. [2019-12-18 14:25:35,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8970 to 8294. [2019-12-18 14:25:35,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8294 states. [2019-12-18 14:25:35,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8294 states to 8294 states and 26956 transitions. [2019-12-18 14:25:35,685 INFO L78 Accepts]: Start accepts. Automaton has 8294 states and 26956 transitions. Word has length 56 [2019-12-18 14:25:35,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:35,685 INFO L462 AbstractCegarLoop]: Abstraction has 8294 states and 26956 transitions. [2019-12-18 14:25:35,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:25:35,685 INFO L276 IsEmpty]: Start isEmpty. Operand 8294 states and 26956 transitions. [2019-12-18 14:25:35,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:25:35,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:35,696 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:25:35,696 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:35,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:35,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1877323349, now seen corresponding path program 2 times [2019-12-18 14:25:35,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:35,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846627830] [2019-12-18 14:25:35,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:35,985 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:25:35,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846627830] [2019-12-18 14:25:35,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:35,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:25:35,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62631649] [2019-12-18 14:25:35,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:25:35,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:35,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:25:35,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:25:35,988 INFO L87 Difference]: Start difference. First operand 8294 states and 26956 transitions. Second operand 11 states. [2019-12-18 14:25:37,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:37,919 INFO L93 Difference]: Finished difference Result 13441 states and 42443 transitions. [2019-12-18 14:25:37,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 14:25:37,919 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 14:25:37,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:37,935 INFO L225 Difference]: With dead ends: 13441 [2019-12-18 14:25:37,936 INFO L226 Difference]: Without dead ends: 9855 [2019-12-18 14:25:37,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2019-12-18 14:25:37,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9855 states. [2019-12-18 14:25:38,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9855 to 8126. [2019-12-18 14:25:38,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8126 states. [2019-12-18 14:25:38,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8126 states to 8126 states and 25897 transitions. [2019-12-18 14:25:38,078 INFO L78 Accepts]: Start accepts. Automaton has 8126 states and 25897 transitions. Word has length 56 [2019-12-18 14:25:38,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:38,078 INFO L462 AbstractCegarLoop]: Abstraction has 8126 states and 25897 transitions. [2019-12-18 14:25:38,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:25:38,078 INFO L276 IsEmpty]: Start isEmpty. Operand 8126 states and 25897 transitions. [2019-12-18 14:25:38,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:25:38,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:38,087 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:25:38,088 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:38,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:38,088 INFO L82 PathProgramCache]: Analyzing trace with hash 105084255, now seen corresponding path program 3 times [2019-12-18 14:25:38,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:38,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969035865] [2019-12-18 14:25:38,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:38,387 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:25:38,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969035865] [2019-12-18 14:25:38,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:38,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:25:38,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178757846] [2019-12-18 14:25:38,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:25:38,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:38,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:25:38,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:25:38,389 INFO L87 Difference]: Start difference. First operand 8126 states and 25897 transitions. Second operand 11 states. [2019-12-18 14:25:39,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:39,251 INFO L93 Difference]: Finished difference Result 9158 states and 28617 transitions. [2019-12-18 14:25:39,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 14:25:39,251 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 14:25:39,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:39,263 INFO L225 Difference]: With dead ends: 9158 [2019-12-18 14:25:39,263 INFO L226 Difference]: Without dead ends: 6898 [2019-12-18 14:25:39,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 14:25:39,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6898 states. [2019-12-18 14:25:39,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6898 to 5992. [2019-12-18 14:25:39,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5992 states. [2019-12-18 14:25:39,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5992 states to 5992 states and 19034 transitions. [2019-12-18 14:25:39,367 INFO L78 Accepts]: Start accepts. Automaton has 5992 states and 19034 transitions. Word has length 56 [2019-12-18 14:25:39,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:39,367 INFO L462 AbstractCegarLoop]: Abstraction has 5992 states and 19034 transitions. [2019-12-18 14:25:39,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:25:39,367 INFO L276 IsEmpty]: Start isEmpty. Operand 5992 states and 19034 transitions. [2019-12-18 14:25:39,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:25:39,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:39,375 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:25:39,375 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:39,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:39,376 INFO L82 PathProgramCache]: Analyzing trace with hash 208159905, now seen corresponding path program 4 times [2019-12-18 14:25:39,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:39,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999461097] [2019-12-18 14:25:39,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:39,763 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:25:39,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999461097] [2019-12-18 14:25:39,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:39,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:25:39,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502088545] [2019-12-18 14:25:39,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 14:25:39,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:39,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 14:25:39,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:25:39,766 INFO L87 Difference]: Start difference. First operand 5992 states and 19034 transitions. Second operand 12 states. [2019-12-18 14:25:40,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:40,538 INFO L93 Difference]: Finished difference Result 7032 states and 21769 transitions. [2019-12-18 14:25:40,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 14:25:40,539 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-18 14:25:40,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:40,550 INFO L225 Difference]: With dead ends: 7032 [2019-12-18 14:25:40,550 INFO L226 Difference]: Without dead ends: 6698 [2019-12-18 14:25:40,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 14:25:40,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6698 states. [2019-12-18 14:25:40,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6698 to 5790. [2019-12-18 14:25:40,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5790 states. [2019-12-18 14:25:40,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5790 states to 5790 states and 18449 transitions. [2019-12-18 14:25:40,647 INFO L78 Accepts]: Start accepts. Automaton has 5790 states and 18449 transitions. Word has length 56 [2019-12-18 14:25:40,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:40,647 INFO L462 AbstractCegarLoop]: Abstraction has 5790 states and 18449 transitions. [2019-12-18 14:25:40,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 14:25:40,647 INFO L276 IsEmpty]: Start isEmpty. Operand 5790 states and 18449 transitions. [2019-12-18 14:25:40,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:25:40,654 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:40,654 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:25:40,654 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:40,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:40,654 INFO L82 PathProgramCache]: Analyzing trace with hash -374963123, now seen corresponding path program 5 times [2019-12-18 14:25:40,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:40,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243239554] [2019-12-18 14:25:40,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:25:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:25:40,763 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:25:40,764 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:25:40,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_310 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff0_thd1~0_312 0) (= v_~x$flush_delayed~0_79 0) (= v_~main$tmp_guard0~0_19 0) (= v_~x$r_buff1_thd0~0_282 0) (= 0 v_~__unbuffered_p0_EAX~0_82) (= |v_#NULL.offset_3| 0) (= 0 v_~x$w_buff1_used~0_528) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1840~0.base_39| 4)) (= 0 v_~x$r_buff0_thd2~0_267) (= 0 v_~x$r_buff1_thd2~0_231) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1840~0.base_39|)) (= v_~main$tmp_guard1~0_61 0) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t1840~0.base_39| 1)) (= 0 |v_ULTIMATE.start_main_~#t1840~0.offset_25|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1840~0.base_39|) (= v_~y~0_262 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~weak$$choice2~0_142 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_p2_EAX~0_70) (= 0 v_~x$w_buff1~0_255) (= v_~x$mem_tmp~0_46 0) (= v_~__unbuffered_cnt~0_141 0) (= 0 |v_#NULL.base_3|) (= 0 v_~x~0_186) (= 0 v_~x$r_buff1_thd3~0_228) (= 0 v_~weak$$choice0~0_40) (= 0 v_~x$w_buff0~0_335) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1840~0.base_39| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1840~0.base_39|) |v_ULTIMATE.start_main_~#t1840~0.offset_25| 0))) (= v_~__unbuffered_p0_EBX~0_68 0) (= 0 v_~x$r_buff0_thd3~0_132) (= v_~x$r_buff0_thd0~0_156 0) (= 0 v_~x$w_buff0_used~0_798))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_335, ~x$flush_delayed~0=v_~x$flush_delayed~0_79, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_310, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_132, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, #length=|v_#length_23|, ULTIMATE.start_main_~#t1841~0.base=|v_ULTIMATE.start_main_~#t1841~0.base_37|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_70, ULTIMATE.start_main_~#t1840~0.offset=|v_ULTIMATE.start_main_~#t1840~0.offset_25|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_68, ~x$w_buff1~0=v_~x$w_buff1~0_255, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_528, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_231, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_40, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ULTIMATE.start_main_~#t1840~0.base=|v_ULTIMATE.start_main_~#t1840~0.base_39|, ~x~0=v_~x~0_186, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_312, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_123|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_228, ULTIMATE.start_main_~#t1841~0.offset=|v_ULTIMATE.start_main_~#t1841~0.offset_25|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_61, ~x$mem_tmp~0=v_~x$mem_tmp~0_46, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_230|, ~y~0=v_~y~0_262, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_18|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_282, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_267, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_798, ULTIMATE.start_main_~#t1842~0.base=|v_ULTIMATE.start_main_~#t1842~0.base_29|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ULTIMATE.start_main_~#t1842~0.offset=|v_ULTIMATE.start_main_~#t1842~0.offset_16|, ~weak$$choice2~0=v_~weak$$choice2~0_142, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ULTIMATE.start_main_~#t1841~0.offset, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, #length, ULTIMATE.start_main_~#t1841~0.base, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1840~0.offset, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1842~0.base, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1840~0.base, ULTIMATE.start_main_~#t1842~0.offset, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 14:25:40,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L816-1-->L818: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1841~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t1841~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1841~0.base_10|)) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1841~0.base_10|)) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1841~0.base_10| 1) |v_#valid_37|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1841~0.base_10| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1841~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1841~0.base_10|) |v_ULTIMATE.start_main_~#t1841~0.offset_10| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t1841~0.base=|v_ULTIMATE.start_main_~#t1841~0.base_10|, ULTIMATE.start_main_~#t1841~0.offset=|v_ULTIMATE.start_main_~#t1841~0.offset_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1841~0.base, ULTIMATE.start_main_~#t1841~0.offset, #length] because there is no mapped edge [2019-12-18 14:25:40,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L818-1-->L820: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1842~0.base_10| 0)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1842~0.base_10|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1842~0.base_10|) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1842~0.base_10| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1842~0.base_10| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1842~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1842~0.base_10|) |v_ULTIMATE.start_main_~#t1842~0.offset_9| 2)) |v_#memory_int_11|) (= 0 |v_ULTIMATE.start_main_~#t1842~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1842~0.base=|v_ULTIMATE.start_main_~#t1842~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|, ULTIMATE.start_main_~#t1842~0.offset=|v_ULTIMATE.start_main_~#t1842~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1842~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1842~0.offset] because there is no mapped edge [2019-12-18 14:25:40,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L5-->L773: Formula: (and (= v_~x$r_buff1_thd1~0_19 v_~x$r_buff0_thd1~0_39) (= v_~x$r_buff1_thd0~0_10 v_~x$r_buff0_thd0~0_14) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6)) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_7) (= v_~x$r_buff1_thd3~0_10 v_~x$r_buff0_thd3~0_14) (= 1 v_~x$r_buff0_thd2~0_15)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_10, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~y~0=v_~y~0_7, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 14:25:40,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L793-2-->L793-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1834762960 256))) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-1834762960 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite32_Out-1834762960| ~x~0_In-1834762960) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite32_Out-1834762960| ~x$w_buff1~0_In-1834762960) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1834762960, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1834762960, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1834762960, ~x~0=~x~0_In-1834762960} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-1834762960|, ~x$w_buff1~0=~x$w_buff1~0_In-1834762960, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1834762960, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1834762960, ~x~0=~x~0_In-1834762960} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 14:25:40,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1755331754 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1755331754 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out1755331754| ~x$w_buff0_used~0_In1755331754)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out1755331754| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1755331754, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1755331754} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1755331754, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1755331754|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1755331754} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 14:25:40,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L793-4-->L794: Formula: (= v_~x~0_69 |v_P2Thread1of1ForFork1_#t~ite32_22|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_22|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_21|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_39|, ~x~0=v_~x~0_69} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 14:25:40,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L794-->L794-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In637652807 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In637652807 256)))) (or (and (= ~x$w_buff0_used~0_In637652807 |P2Thread1of1ForFork1_#t~ite34_Out637652807|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out637652807|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In637652807, ~x$w_buff0_used~0=~x$w_buff0_used~0_In637652807} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out637652807|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In637652807, ~x$w_buff0_used~0=~x$w_buff0_used~0_In637652807} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 14:25:40,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In2129302611 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In2129302611 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In2129302611 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In2129302611 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out2129302611|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite29_Out2129302611| ~x$w_buff1_used~0_In2129302611)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2129302611, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2129302611, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2129302611, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2129302611} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In2129302611, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2129302611, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2129302611, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out2129302611|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2129302611} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 14:25:40,783 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L776-->L777: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In287910911 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In287910911 256) 0))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out287910911) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_In287910911 ~x$r_buff0_thd2~0_Out287910911)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In287910911, ~x$w_buff0_used~0=~x$w_buff0_used~0_In287910911} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out287910911|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out287910911, ~x$w_buff0_used~0=~x$w_buff0_used~0_In287910911} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 14:25:40,783 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-2000066612 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-2000066612 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-2000066612 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-2000066612 256)))) (or (and (= ~x$r_buff1_thd2~0_In-2000066612 |P1Thread1of1ForFork0_#t~ite31_Out-2000066612|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-2000066612|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2000066612, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2000066612, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2000066612, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2000066612} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-2000066612|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2000066612, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2000066612, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2000066612, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2000066612} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 14:25:40,783 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L777-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_68 |v_P1Thread1of1ForFork0_#t~ite31_46|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_45|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_68, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 14:25:40,785 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L795-->L795-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In1356046603 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd3~0_In1356046603 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd3~0_In1356046603 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1356046603 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1356046603 |P2Thread1of1ForFork1_#t~ite35_Out1356046603|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out1356046603|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1356046603, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1356046603, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1356046603, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1356046603} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out1356046603|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1356046603, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1356046603, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1356046603, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1356046603} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 14:25:40,787 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-1258011655 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1258011655 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-1258011655|) (not .cse1)) (and (= ~x$r_buff0_thd3~0_In-1258011655 |P2Thread1of1ForFork1_#t~ite36_Out-1258011655|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1258011655, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1258011655} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1258011655|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1258011655, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1258011655} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 14:25:40,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L739-->L739-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-814491593 256) 0))) (or (and .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-814491593 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In-814491593 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In-814491593 256) 0) (and (= 0 (mod ~x$r_buff1_thd1~0_In-814491593 256)) .cse1))) (= |P0Thread1of1ForFork2_#t~ite12_Out-814491593| |P0Thread1of1ForFork2_#t~ite11_Out-814491593|) (= ~x$w_buff1~0_In-814491593 |P0Thread1of1ForFork2_#t~ite11_Out-814491593|)) (and (= |P0Thread1of1ForFork2_#t~ite11_In-814491593| |P0Thread1of1ForFork2_#t~ite11_Out-814491593|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite12_Out-814491593| ~x$w_buff1~0_In-814491593)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-814491593, ~x$w_buff1~0=~x$w_buff1~0_In-814491593, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-814491593, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-814491593, ~weak$$choice2~0=~weak$$choice2~0_In-814491593, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-814491593|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-814491593} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-814491593, ~x$w_buff1~0=~x$w_buff1~0_In-814491593, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-814491593, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-814491593, ~weak$$choice2~0=~weak$$choice2~0_In-814491593, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-814491593|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-814491593|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-814491593} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 14:25:40,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-876534848 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite14_In-876534848| |P0Thread1of1ForFork2_#t~ite14_Out-876534848|) (= ~x$w_buff0_used~0_In-876534848 |P0Thread1of1ForFork2_#t~ite15_Out-876534848|)) (and .cse0 (= ~x$w_buff0_used~0_In-876534848 |P0Thread1of1ForFork2_#t~ite14_Out-876534848|) (= |P0Thread1of1ForFork2_#t~ite14_Out-876534848| |P0Thread1of1ForFork2_#t~ite15_Out-876534848|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-876534848 256)))) (or (= (mod ~x$w_buff0_used~0_In-876534848 256) 0) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-876534848 256) 0)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-876534848 256)))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-876534848, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-876534848, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-876534848, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-876534848|, ~weak$$choice2~0=~weak$$choice2~0_In-876534848, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-876534848} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-876534848, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-876534848, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-876534848|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-876534848, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-876534848|, ~weak$$choice2~0=~weak$$choice2~0_In-876534848, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-876534848} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 14:25:40,797 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_98 v_~x$r_buff0_thd1~0_97) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_98, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_12|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_97, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_13|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 14:25:40,797 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L743-->L743-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1971029213 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite23_Out1971029213| |P0Thread1of1ForFork2_#t~ite24_Out1971029213|) (= ~x$r_buff1_thd1~0_In1971029213 |P0Thread1of1ForFork2_#t~ite23_Out1971029213|) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In1971029213 256) 0))) (or (and (= 0 (mod ~x$w_buff1_used~0_In1971029213 256)) .cse0) (= (mod ~x$w_buff0_used~0_In1971029213 256) 0) (and (= 0 (mod ~x$r_buff1_thd1~0_In1971029213 256)) .cse0))) .cse1) (and (not .cse1) (= |P0Thread1of1ForFork2_#t~ite23_In1971029213| |P0Thread1of1ForFork2_#t~ite23_Out1971029213|) (= ~x$r_buff1_thd1~0_In1971029213 |P0Thread1of1ForFork2_#t~ite24_Out1971029213|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1971029213, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1971029213, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1971029213, ~weak$$choice2~0=~weak$$choice2~0_In1971029213, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In1971029213|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1971029213} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1971029213, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1971029213, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1971029213, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out1971029213|, ~weak$$choice2~0=~weak$$choice2~0_In1971029213, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out1971029213|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1971029213} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-18 14:25:40,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_4 v_~x~0_24) (not (= (mod v_~x$flush_delayed~0_9 256) 0)) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_11|, ~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 14:25:40,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L797-->L797-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-435664404 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd3~0_In-435664404 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-435664404 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-435664404 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite37_Out-435664404| 0)) (and (= |P2Thread1of1ForFork1_#t~ite37_Out-435664404| ~x$r_buff1_thd3~0_In-435664404) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-435664404, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-435664404, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-435664404, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-435664404} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-435664404|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-435664404, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-435664404, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-435664404, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-435664404} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 14:25:40,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L797-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_64 (+ v_~__unbuffered_cnt~0_65 1)) (= v_~x$r_buff1_thd3~0_54 |v_P2Thread1of1ForFork1_#t~ite37_32|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_31|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 14:25:40,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L820-1-->L826: Formula: (and (= 3 v_~__unbuffered_cnt~0_35) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 14:25:40,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L826-2-->L826-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite42_Out-99199617| |ULTIMATE.start_main_#t~ite41_Out-99199617|)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-99199617 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-99199617 256)))) (or (and (not .cse0) .cse1 (= |ULTIMATE.start_main_#t~ite41_Out-99199617| ~x$w_buff1~0_In-99199617) (not .cse2)) (and (= ~x~0_In-99199617 |ULTIMATE.start_main_#t~ite41_Out-99199617|) .cse1 (or .cse2 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-99199617, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-99199617, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-99199617, ~x~0=~x~0_In-99199617} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-99199617|, ~x$w_buff1~0=~x$w_buff1~0_In-99199617, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-99199617, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-99199617, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-99199617|, ~x~0=~x~0_In-99199617} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 14:25:40,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In439417987 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In439417987 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out439417987| ~x$w_buff0_used~0_In439417987)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out439417987|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In439417987, ~x$w_buff0_used~0=~x$w_buff0_used~0_In439417987} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In439417987, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out439417987|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In439417987} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 14:25:40,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L828-->L828-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1311979928 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In-1311979928 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1311979928 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-1311979928 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1311979928| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-1311979928| ~x$w_buff1_used~0_In-1311979928)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1311979928, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1311979928, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1311979928, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1311979928} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1311979928, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1311979928, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1311979928, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1311979928|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1311979928} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 14:25:40,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-739972897 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-739972897 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-739972897| ~x$r_buff0_thd0~0_In-739972897) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-739972897| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-739972897, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-739972897} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-739972897, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-739972897|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-739972897} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 14:25:40,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L830-->L830-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-51061650 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-51061650 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-51061650 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-51061650 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-51061650| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd0~0_In-51061650 |ULTIMATE.start_main_#t~ite46_Out-51061650|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-51061650, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-51061650, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-51061650, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-51061650} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-51061650, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-51061650|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-51061650, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-51061650, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-51061650} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 14:25:40,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_31) (= v_~__unbuffered_p0_EBX~0_30 0) (= v_~main$tmp_guard1~0_24 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_24 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 0) (= v_~y~0_138 2) (= 2 v_~__unbuffered_p0_EAX~0_46) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite46_51|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_51|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~y~0=v_~y~0_138} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_50|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~y~0=v_~y~0_138, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:25:40,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:25:40 BasicIcfg [2019-12-18 14:25:40,877 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:25:40,879 INFO L168 Benchmark]: Toolchain (without parser) took 51324.81 ms. Allocated memory was 137.4 MB in the beginning and 2.2 GB in the end (delta: 2.1 GB). Free memory was 100.4 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 935.5 MB. Max. memory is 7.1 GB. [2019-12-18 14:25:40,880 INFO L168 Benchmark]: CDTParser took 1.41 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 14:25:40,880 INFO L168 Benchmark]: CACSL2BoogieTranslator took 798.22 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 99.9 MB in the beginning and 155.1 MB in the end (delta: -55.2 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:25:40,881 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.32 ms. Allocated memory is still 201.3 MB. Free memory was 155.1 MB in the beginning and 152.5 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:25:40,881 INFO L168 Benchmark]: Boogie Preprocessor took 37.27 ms. Allocated memory is still 201.3 MB. Free memory was 152.5 MB in the beginning and 149.8 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:25:40,882 INFO L168 Benchmark]: RCFGBuilder took 818.18 ms. Allocated memory is still 201.3 MB. Free memory was 149.8 MB in the beginning and 103.2 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:25:40,883 INFO L168 Benchmark]: TraceAbstraction took 49584.51 ms. Allocated memory was 201.3 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 103.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 874.3 MB. Max. memory is 7.1 GB. [2019-12-18 14:25:40,886 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.41 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 798.22 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 99.9 MB in the beginning and 155.1 MB in the end (delta: -55.2 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 81.32 ms. Allocated memory is still 201.3 MB. Free memory was 155.1 MB in the beginning and 152.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.27 ms. Allocated memory is still 201.3 MB. Free memory was 152.5 MB in the beginning and 149.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 818.18 ms. Allocated memory is still 201.3 MB. Free memory was 149.8 MB in the beginning and 103.2 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 49584.51 ms. Allocated memory was 201.3 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 103.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 874.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 163 ProgramPointsBefore, 82 ProgramPointsAfterwards, 194 TransitionsBefore, 91 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 26 ChoiceCompositions, 6655 VarBasedMoverChecksPositive, 264 VarBasedMoverChecksNegative, 98 SemBasedMoverChecksPositive, 236 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 64859 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L816] FCALL, FORK 0 pthread_create(&t1840, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L818] FCALL, FORK 0 pthread_create(&t1841, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 1 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L820] FCALL, FORK 0 pthread_create(&t1842, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 3 __unbuffered_p2_EAX = y [L790] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L793] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 __unbuffered_p0_EAX = y [L733] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L734] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L735] 1 x$flush_delayed = weak$$choice2 [L736] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L737] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L775] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L795] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L738] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L740] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L829] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 49.2s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 14.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3366 SDtfs, 4726 SDslu, 11230 SDs, 0 SdLazy, 5202 SolverSat, 205 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 214 GetRequests, 22 SyntacticMatches, 11 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80448occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.7s AutomataMinimizationTime, 21 MinimizatonAttempts, 67996 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 906 NumberOfCodeBlocks, 906 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 829 ConstructedInterpolants, 0 QuantifiedInterpolants, 213621 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...