/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/mix042_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:35:15,086 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:35:15,089 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:35:15,107 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:35:15,108 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:35:15,110 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:35:15,112 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:35:15,125 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:35:15,127 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:35:15,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:35:15,130 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:35:15,132 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:35:15,133 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:35:15,136 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:35:15,139 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:35:15,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:35:15,143 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:35:15,145 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:35:15,147 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:35:15,152 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:35:15,156 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:35:15,159 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:35:15,160 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:35:15,162 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:35:15,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:35:15,164 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:35:15,164 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:35:15,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:35:15,167 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:35:15,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:35:15,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:35:15,170 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:35:15,171 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:35:15,173 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:35:15,174 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:35:15,174 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:35:15,176 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:35:15,176 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:35:15,177 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:35:15,178 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:35:15,180 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:35:15,181 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:35:15,204 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:35:15,205 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:35:15,207 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:35:15,207 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:35:15,208 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:35:15,208 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:35:15,208 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:35:15,208 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:35:15,208 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:35:15,209 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:35:15,210 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:35:15,210 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:35:15,210 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:35:15,211 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:35:15,211 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:35:15,211 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:35:15,211 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:35:15,212 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:35:15,212 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:35:15,212 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:35:15,212 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:35:15,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:35:15,213 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:35:15,213 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:35:15,213 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:35:15,213 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:35:15,213 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:35:15,214 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:35:15,214 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:35:15,214 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:35:15,525 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:35:15,539 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:35:15,542 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:35:15,544 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:35:15,544 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:35:15,545 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_power.opt.i [2019-12-26 22:35:15,611 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5c419240/b28555f65c114e73b8b3e506a9143df7/FLAGd2bc1ec7a [2019-12-26 22:35:16,167 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:35:16,168 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_power.opt.i [2019-12-26 22:35:16,192 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5c419240/b28555f65c114e73b8b3e506a9143df7/FLAGd2bc1ec7a [2019-12-26 22:35:16,406 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5c419240/b28555f65c114e73b8b3e506a9143df7 [2019-12-26 22:35:16,416 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:35:16,419 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:35:16,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:35:16,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:35:16,424 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:35:16,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:35:16" (1/1) ... [2019-12-26 22:35:16,428 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f959a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:16, skipping insertion in model container [2019-12-26 22:35:16,428 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:35:16" (1/1) ... [2019-12-26 22:35:16,436 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:35:16,499 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:35:17,040 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:35:17,056 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:35:17,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:35:17,241 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:35:17,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:17 WrapperNode [2019-12-26 22:35:17,242 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:35:17,243 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:35:17,243 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:35:17,243 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:35:17,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:17" (1/1) ... [2019-12-26 22:35:17,271 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:17" (1/1) ... [2019-12-26 22:35:17,307 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:35:17,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:35:17,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:35:17,308 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:35:17,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:17" (1/1) ... [2019-12-26 22:35:17,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:17" (1/1) ... [2019-12-26 22:35:17,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:17" (1/1) ... [2019-12-26 22:35:17,323 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:17" (1/1) ... [2019-12-26 22:35:17,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:17" (1/1) ... [2019-12-26 22:35:17,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:17" (1/1) ... [2019-12-26 22:35:17,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:17" (1/1) ... [2019-12-26 22:35:17,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:35:17,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:35:17,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:35:17,347 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:35:17,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:35:17,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:35:17,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:35:17,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:35:17,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:35:17,420 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:35:17,420 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:35:17,420 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:35:17,421 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:35:17,421 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:35:17,421 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:35:17,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:35:17,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:35:17,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:35:17,423 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:35:18,152 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:35:18,152 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:35:18,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:35:18 BoogieIcfgContainer [2019-12-26 22:35:18,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:35:18,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:35:18,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:35:18,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:35:18,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:35:16" (1/3) ... [2019-12-26 22:35:18,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f5142f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:35:18, skipping insertion in model container [2019-12-26 22:35:18,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:17" (2/3) ... [2019-12-26 22:35:18,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f5142f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:35:18, skipping insertion in model container [2019-12-26 22:35:18,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:35:18" (3/3) ... [2019-12-26 22:35:18,164 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_power.opt.i [2019-12-26 22:35:18,175 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:35:18,176 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:35:18,184 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:35:18,185 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:35:18,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,224 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,224 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,229 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,229 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,241 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,242 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,243 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,243 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,244 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,256 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,256 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,262 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,263 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,264 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,267 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,268 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:18,300 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 22:35:18,318 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:35:18,318 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:35:18,318 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:35:18,318 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:35:18,318 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:35:18,318 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:35:18,319 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:35:18,319 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:35:18,337 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-26 22:35:18,339 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-26 22:35:18,435 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-26 22:35:18,435 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:35:18,452 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 22:35:18,472 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-26 22:35:18,525 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-26 22:35:18,525 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:35:18,531 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 22:35:18,546 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-26 22:35:18,548 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:35:23,121 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-12-26 22:35:23,234 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-12-26 22:35:23,504 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-26 22:35:23,647 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-26 22:35:23,672 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50142 [2019-12-26 22:35:23,672 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-26 22:35:23,676 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 86 transitions [2019-12-26 22:35:24,860 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14254 states. [2019-12-26 22:35:24,863 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states. [2019-12-26 22:35:24,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-26 22:35:24,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:24,871 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:35:24,872 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:24,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:24,879 INFO L82 PathProgramCache]: Analyzing trace with hash -632784469, now seen corresponding path program 1 times [2019-12-26 22:35:24,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:24,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482608668] [2019-12-26 22:35:24,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:25,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:35:25,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482608668] [2019-12-26 22:35:25,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:25,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:35:25,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568565603] [2019-12-26 22:35:25,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:35:25,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:25,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:35:25,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:35:25,220 INFO L87 Difference]: Start difference. First operand 14254 states. Second operand 3 states. [2019-12-26 22:35:25,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:25,587 INFO L93 Difference]: Finished difference Result 14182 states and 53160 transitions. [2019-12-26 22:35:25,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:35:25,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-26 22:35:25,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:25,739 INFO L225 Difference]: With dead ends: 14182 [2019-12-26 22:35:25,739 INFO L226 Difference]: Without dead ends: 13870 [2019-12-26 22:35:25,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:35:25,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13870 states. [2019-12-26 22:35:26,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13870 to 13870. [2019-12-26 22:35:26,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13870 states. [2019-12-26 22:35:26,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13870 states to 13870 states and 52042 transitions. [2019-12-26 22:35:26,500 INFO L78 Accepts]: Start accepts. Automaton has 13870 states and 52042 transitions. Word has length 7 [2019-12-26 22:35:26,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:26,501 INFO L462 AbstractCegarLoop]: Abstraction has 13870 states and 52042 transitions. [2019-12-26 22:35:26,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:35:26,502 INFO L276 IsEmpty]: Start isEmpty. Operand 13870 states and 52042 transitions. [2019-12-26 22:35:26,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:35:26,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:26,514 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:35:26,514 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:26,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:26,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1056225825, now seen corresponding path program 1 times [2019-12-26 22:35:26,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:26,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348991123] [2019-12-26 22:35:26,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:26,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:35:26,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348991123] [2019-12-26 22:35:26,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:26,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:35:26,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295205396] [2019-12-26 22:35:26,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:35:26,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:26,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:35:26,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:35:26,672 INFO L87 Difference]: Start difference. First operand 13870 states and 52042 transitions. Second operand 4 states. [2019-12-26 22:35:27,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:27,326 INFO L93 Difference]: Finished difference Result 19034 states and 69248 transitions. [2019-12-26 22:35:27,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:35:27,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 22:35:27,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:27,424 INFO L225 Difference]: With dead ends: 19034 [2019-12-26 22:35:27,425 INFO L226 Difference]: Without dead ends: 19034 [2019-12-26 22:35:27,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:35:28,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19034 states. [2019-12-26 22:35:28,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19034 to 18800. [2019-12-26 22:35:28,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18800 states. [2019-12-26 22:35:29,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18800 states to 18800 states and 68487 transitions. [2019-12-26 22:35:29,122 INFO L78 Accepts]: Start accepts. Automaton has 18800 states and 68487 transitions. Word has length 13 [2019-12-26 22:35:29,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:29,122 INFO L462 AbstractCegarLoop]: Abstraction has 18800 states and 68487 transitions. [2019-12-26 22:35:29,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:35:29,123 INFO L276 IsEmpty]: Start isEmpty. Operand 18800 states and 68487 transitions. [2019-12-26 22:35:29,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:35:29,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:29,125 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:35:29,125 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:29,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:29,125 INFO L82 PathProgramCache]: Analyzing trace with hash 746093816, now seen corresponding path program 1 times [2019-12-26 22:35:29,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:29,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248233671] [2019-12-26 22:35:29,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:29,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:35:29,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248233671] [2019-12-26 22:35:29,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:29,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:35:29,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824495493] [2019-12-26 22:35:29,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:35:29,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:29,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:35:29,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:35:29,213 INFO L87 Difference]: Start difference. First operand 18800 states and 68487 transitions. Second operand 4 states. [2019-12-26 22:35:29,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:29,600 INFO L93 Difference]: Finished difference Result 27022 states and 96312 transitions. [2019-12-26 22:35:29,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:35:29,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 22:35:29,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:29,730 INFO L225 Difference]: With dead ends: 27022 [2019-12-26 22:35:29,731 INFO L226 Difference]: Without dead ends: 27008 [2019-12-26 22:35:29,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:35:29,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27008 states. [2019-12-26 22:35:30,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27008 to 22366. [2019-12-26 22:35:30,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22366 states. [2019-12-26 22:35:30,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22366 states to 22366 states and 80994 transitions. [2019-12-26 22:35:30,753 INFO L78 Accepts]: Start accepts. Automaton has 22366 states and 80994 transitions. Word has length 13 [2019-12-26 22:35:30,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:30,754 INFO L462 AbstractCegarLoop]: Abstraction has 22366 states and 80994 transitions. [2019-12-26 22:35:30,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:35:30,757 INFO L276 IsEmpty]: Start isEmpty. Operand 22366 states and 80994 transitions. [2019-12-26 22:35:30,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 22:35:30,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:30,764 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:35:30,764 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:30,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:30,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1347005908, now seen corresponding path program 1 times [2019-12-26 22:35:30,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:30,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940913910] [2019-12-26 22:35:30,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:30,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:30,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:35:30,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940913910] [2019-12-26 22:35:30,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:30,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:35:30,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017979125] [2019-12-26 22:35:30,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:35:30,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:30,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:35:30,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:35:30,897 INFO L87 Difference]: Start difference. First operand 22366 states and 80994 transitions. Second operand 4 states. [2019-12-26 22:35:30,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:30,989 INFO L93 Difference]: Finished difference Result 13191 states and 41157 transitions. [2019-12-26 22:35:30,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:35:30,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-26 22:35:30,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:31,053 INFO L225 Difference]: With dead ends: 13191 [2019-12-26 22:35:31,054 INFO L226 Difference]: Without dead ends: 12661 [2019-12-26 22:35:31,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:35:31,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12661 states. [2019-12-26 22:35:32,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12661 to 12661. [2019-12-26 22:35:32,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12661 states. [2019-12-26 22:35:32,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12661 states to 12661 states and 39651 transitions. [2019-12-26 22:35:32,240 INFO L78 Accepts]: Start accepts. Automaton has 12661 states and 39651 transitions. Word has length 19 [2019-12-26 22:35:32,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:32,241 INFO L462 AbstractCegarLoop]: Abstraction has 12661 states and 39651 transitions. [2019-12-26 22:35:32,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:35:32,241 INFO L276 IsEmpty]: Start isEmpty. Operand 12661 states and 39651 transitions. [2019-12-26 22:35:32,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-26 22:35:32,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:32,245 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:35:32,245 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:32,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:32,246 INFO L82 PathProgramCache]: Analyzing trace with hash -21144877, now seen corresponding path program 1 times [2019-12-26 22:35:32,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:32,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252245620] [2019-12-26 22:35:32,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:32,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:35:32,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252245620] [2019-12-26 22:35:32,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:32,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:35:32,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159690976] [2019-12-26 22:35:32,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:35:32,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:32,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:35:32,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:35:32,321 INFO L87 Difference]: Start difference. First operand 12661 states and 39651 transitions. Second operand 5 states. [2019-12-26 22:35:32,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:32,765 INFO L93 Difference]: Finished difference Result 16929 states and 51829 transitions. [2019-12-26 22:35:32,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:35:32,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-26 22:35:32,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:32,801 INFO L225 Difference]: With dead ends: 16929 [2019-12-26 22:35:32,802 INFO L226 Difference]: Without dead ends: 16922 [2019-12-26 22:35:32,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:35:32,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16922 states. [2019-12-26 22:35:33,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16922 to 12812. [2019-12-26 22:35:33,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12812 states. [2019-12-26 22:35:33,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12812 states to 12812 states and 40017 transitions. [2019-12-26 22:35:33,157 INFO L78 Accepts]: Start accepts. Automaton has 12812 states and 40017 transitions. Word has length 20 [2019-12-26 22:35:33,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:33,157 INFO L462 AbstractCegarLoop]: Abstraction has 12812 states and 40017 transitions. [2019-12-26 22:35:33,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:35:33,157 INFO L276 IsEmpty]: Start isEmpty. Operand 12812 states and 40017 transitions. [2019-12-26 22:35:33,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 22:35:33,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:33,170 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:35:33,170 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:33,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:33,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1806206056, now seen corresponding path program 1 times [2019-12-26 22:35:33,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:33,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783746705] [2019-12-26 22:35:33,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:33,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:35:33,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783746705] [2019-12-26 22:35:33,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:33,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:35:33,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075698908] [2019-12-26 22:35:33,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:35:33,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:33,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:35:33,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:35:33,307 INFO L87 Difference]: Start difference. First operand 12812 states and 40017 transitions. Second operand 6 states. [2019-12-26 22:35:33,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:33,860 INFO L93 Difference]: Finished difference Result 17980 states and 54854 transitions. [2019-12-26 22:35:33,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:35:33,860 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-26 22:35:33,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:33,885 INFO L225 Difference]: With dead ends: 17980 [2019-12-26 22:35:33,885 INFO L226 Difference]: Without dead ends: 17964 [2019-12-26 22:35:33,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:35:33,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17964 states. [2019-12-26 22:35:34,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17964 to 15695. [2019-12-26 22:35:34,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15695 states. [2019-12-26 22:35:34,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15695 states to 15695 states and 48333 transitions. [2019-12-26 22:35:34,342 INFO L78 Accepts]: Start accepts. Automaton has 15695 states and 48333 transitions. Word has length 28 [2019-12-26 22:35:34,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:34,342 INFO L462 AbstractCegarLoop]: Abstraction has 15695 states and 48333 transitions. [2019-12-26 22:35:34,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:35:34,343 INFO L276 IsEmpty]: Start isEmpty. Operand 15695 states and 48333 transitions. [2019-12-26 22:35:34,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 22:35:34,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:34,378 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] [2019-12-26 22:35:34,378 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:34,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:34,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1223733812, now seen corresponding path program 1 times [2019-12-26 22:35:34,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:34,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63032977] [2019-12-26 22:35:34,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:34,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:35:34,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63032977] [2019-12-26 22:35:34,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:34,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:35:34,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799864719] [2019-12-26 22:35:34,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:35:34,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:34,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:35:34,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:35:34,457 INFO L87 Difference]: Start difference. First operand 15695 states and 48333 transitions. Second operand 3 states. [2019-12-26 22:35:34,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:34,619 INFO L93 Difference]: Finished difference Result 19865 states and 61636 transitions. [2019-12-26 22:35:34,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:35:34,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-26 22:35:34,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:34,661 INFO L225 Difference]: With dead ends: 19865 [2019-12-26 22:35:34,661 INFO L226 Difference]: Without dead ends: 19865 [2019-12-26 22:35:34,661 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-26 22:35:34,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19865 states. [2019-12-26 22:35:35,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19865 to 17509. [2019-12-26 22:35:35,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17509 states. [2019-12-26 22:35:35,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17509 states to 17509 states and 54532 transitions. [2019-12-26 22:35:35,278 INFO L78 Accepts]: Start accepts. Automaton has 17509 states and 54532 transitions. Word has length 34 [2019-12-26 22:35:35,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:35,279 INFO L462 AbstractCegarLoop]: Abstraction has 17509 states and 54532 transitions. [2019-12-26 22:35:35,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:35:35,279 INFO L276 IsEmpty]: Start isEmpty. Operand 17509 states and 54532 transitions. [2019-12-26 22:35:35,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 22:35:35,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:35,312 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] [2019-12-26 22:35:35,312 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:35,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:35,312 INFO L82 PathProgramCache]: Analyzing trace with hash 345963664, now seen corresponding path program 1 times [2019-12-26 22:35:35,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:35,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600909447] [2019-12-26 22:35:35,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:35,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:35:35,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600909447] [2019-12-26 22:35:35,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:35,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:35:35,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823629144] [2019-12-26 22:35:35,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:35:35,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:35,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:35:35,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:35:35,400 INFO L87 Difference]: Start difference. First operand 17509 states and 54532 transitions. Second operand 3 states. [2019-12-26 22:35:35,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:35,490 INFO L93 Difference]: Finished difference Result 17509 states and 54339 transitions. [2019-12-26 22:35:35,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:35:35,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-26 22:35:35,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:35,516 INFO L225 Difference]: With dead ends: 17509 [2019-12-26 22:35:35,516 INFO L226 Difference]: Without dead ends: 17509 [2019-12-26 22:35:35,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:35:35,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17509 states. [2019-12-26 22:35:35,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17509 to 17509. [2019-12-26 22:35:35,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17509 states. [2019-12-26 22:35:35,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17509 states to 17509 states and 54339 transitions. [2019-12-26 22:35:35,840 INFO L78 Accepts]: Start accepts. Automaton has 17509 states and 54339 transitions. Word has length 34 [2019-12-26 22:35:35,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:35,840 INFO L462 AbstractCegarLoop]: Abstraction has 17509 states and 54339 transitions. [2019-12-26 22:35:35,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:35:35,840 INFO L276 IsEmpty]: Start isEmpty. Operand 17509 states and 54339 transitions. [2019-12-26 22:35:35,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 22:35:35,863 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:35,863 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] [2019-12-26 22:35:35,864 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:35,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:35,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1096312539, now seen corresponding path program 1 times [2019-12-26 22:35:35,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:35,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051403501] [2019-12-26 22:35:35,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:35,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:35:35,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051403501] [2019-12-26 22:35:35,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:35,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:35:35,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115517331] [2019-12-26 22:35:35,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:35:35,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:35,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:35:35,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:35:35,967 INFO L87 Difference]: Start difference. First operand 17509 states and 54339 transitions. Second operand 7 states. [2019-12-26 22:35:36,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:36,974 INFO L93 Difference]: Finished difference Result 23341 states and 70914 transitions. [2019-12-26 22:35:36,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 22:35:36,975 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-26 22:35:36,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:37,008 INFO L225 Difference]: With dead ends: 23341 [2019-12-26 22:35:37,008 INFO L226 Difference]: Without dead ends: 23313 [2019-12-26 22:35:37,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-26 22:35:37,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23313 states. [2019-12-26 22:35:37,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23313 to 15958. [2019-12-26 22:35:37,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15958 states. [2019-12-26 22:35:37,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15958 states to 15958 states and 49857 transitions. [2019-12-26 22:35:37,336 INFO L78 Accepts]: Start accepts. Automaton has 15958 states and 49857 transitions. Word has length 34 [2019-12-26 22:35:37,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:37,336 INFO L462 AbstractCegarLoop]: Abstraction has 15958 states and 49857 transitions. [2019-12-26 22:35:37,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:35:37,336 INFO L276 IsEmpty]: Start isEmpty. Operand 15958 states and 49857 transitions. [2019-12-26 22:35:37,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 22:35:37,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:37,355 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] [2019-12-26 22:35:37,355 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:37,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:37,356 INFO L82 PathProgramCache]: Analyzing trace with hash -308537285, now seen corresponding path program 1 times [2019-12-26 22:35:37,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:37,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152411463] [2019-12-26 22:35:37,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:37,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:35:37,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152411463] [2019-12-26 22:35:37,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:37,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:35:37,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536229932] [2019-12-26 22:35:37,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:35:37,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:37,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:35:37,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:35:37,427 INFO L87 Difference]: Start difference. First operand 15958 states and 49857 transitions. Second operand 5 states. [2019-12-26 22:35:37,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:37,474 INFO L93 Difference]: Finished difference Result 2712 states and 6343 transitions. [2019-12-26 22:35:37,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:35:37,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-26 22:35:37,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:37,477 INFO L225 Difference]: With dead ends: 2712 [2019-12-26 22:35:37,477 INFO L226 Difference]: Without dead ends: 2403 [2019-12-26 22:35:37,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:35:37,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2019-12-26 22:35:37,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 2403. [2019-12-26 22:35:37,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2403 states. [2019-12-26 22:35:37,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2403 states to 2403 states and 5482 transitions. [2019-12-26 22:35:37,500 INFO L78 Accepts]: Start accepts. Automaton has 2403 states and 5482 transitions. Word has length 34 [2019-12-26 22:35:37,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:37,501 INFO L462 AbstractCegarLoop]: Abstraction has 2403 states and 5482 transitions. [2019-12-26 22:35:37,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:35:37,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2403 states and 5482 transitions. [2019-12-26 22:35:37,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-26 22:35:37,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:37,504 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] [2019-12-26 22:35:37,504 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:37,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:37,504 INFO L82 PathProgramCache]: Analyzing trace with hash 682662632, now seen corresponding path program 1 times [2019-12-26 22:35:37,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:37,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332400646] [2019-12-26 22:35:37,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:37,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:35:37,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332400646] [2019-12-26 22:35:37,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:37,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:35:37,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193774064] [2019-12-26 22:35:37,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:35:37,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:37,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:35:37,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:35:37,593 INFO L87 Difference]: Start difference. First operand 2403 states and 5482 transitions. Second operand 6 states. [2019-12-26 22:35:37,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:37,654 INFO L93 Difference]: Finished difference Result 708 states and 1600 transitions. [2019-12-26 22:35:37,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:35:37,659 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-12-26 22:35:37,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:37,659 INFO L225 Difference]: With dead ends: 708 [2019-12-26 22:35:37,660 INFO L226 Difference]: Without dead ends: 662 [2019-12-26 22:35:37,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:35:37,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-12-26 22:35:37,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 606. [2019-12-26 22:35:37,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-12-26 22:35:37,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1378 transitions. [2019-12-26 22:35:37,669 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1378 transitions. Word has length 45 [2019-12-26 22:35:37,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:37,669 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 1378 transitions. [2019-12-26 22:35:37,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:35:37,669 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1378 transitions. [2019-12-26 22:35:37,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 22:35:37,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:37,671 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:35:37,671 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:37,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:37,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1345831558, now seen corresponding path program 1 times [2019-12-26 22:35:37,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:37,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710999092] [2019-12-26 22:35:37,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:37,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:35:37,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710999092] [2019-12-26 22:35:37,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:37,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:35:37,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902394195] [2019-12-26 22:35:37,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:35:37,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:37,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:35:37,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:35:37,784 INFO L87 Difference]: Start difference. First operand 606 states and 1378 transitions. Second operand 5 states. [2019-12-26 22:35:37,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:37,975 INFO L93 Difference]: Finished difference Result 877 states and 2007 transitions. [2019-12-26 22:35:37,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:35:37,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-26 22:35:37,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:37,978 INFO L225 Difference]: With dead ends: 877 [2019-12-26 22:35:37,978 INFO L226 Difference]: Without dead ends: 877 [2019-12-26 22:35:37,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:35:37,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2019-12-26 22:35:37,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 642. [2019-12-26 22:35:37,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-12-26 22:35:37,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1470 transitions. [2019-12-26 22:35:37,986 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1470 transitions. Word has length 56 [2019-12-26 22:35:37,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:37,986 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 1470 transitions. [2019-12-26 22:35:37,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:35:37,986 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1470 transitions. [2019-12-26 22:35:37,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 22:35:37,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:37,987 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-26 22:35:37,988 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:37,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:37,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1993080434, now seen corresponding path program 2 times [2019-12-26 22:35:37,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:37,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575854584] [2019-12-26 22:35:37,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:38,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:35:38,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575854584] [2019-12-26 22:35:38,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:38,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:35:38,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641518073] [2019-12-26 22:35:38,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:35:38,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:38,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:35:38,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:35:38,123 INFO L87 Difference]: Start difference. First operand 642 states and 1470 transitions. Second operand 3 states. [2019-12-26 22:35:38,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:38,187 INFO L93 Difference]: Finished difference Result 642 states and 1440 transitions. [2019-12-26 22:35:38,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:35:38,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-26 22:35:38,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:38,189 INFO L225 Difference]: With dead ends: 642 [2019-12-26 22:35:38,189 INFO L226 Difference]: Without dead ends: 642 [2019-12-26 22:35:38,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:35:38,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-12-26 22:35:38,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 606. [2019-12-26 22:35:38,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-12-26 22:35:38,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1354 transitions. [2019-12-26 22:35:38,198 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1354 transitions. Word has length 56 [2019-12-26 22:35:38,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:38,198 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 1354 transitions. [2019-12-26 22:35:38,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:35:38,199 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1354 transitions. [2019-12-26 22:35:38,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 22:35:38,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:38,200 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:35:38,200 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:38,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:38,201 INFO L82 PathProgramCache]: Analyzing trace with hash 2052620165, now seen corresponding path program 1 times [2019-12-26 22:35:38,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:38,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817503158] [2019-12-26 22:35:38,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:38,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:35:38,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817503158] [2019-12-26 22:35:38,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:38,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 22:35:38,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825830323] [2019-12-26 22:35:38,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 22:35:38,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:38,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 22:35:38,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:35:38,527 INFO L87 Difference]: Start difference. First operand 606 states and 1354 transitions. Second operand 12 states. [2019-12-26 22:35:39,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:39,186 INFO L93 Difference]: Finished difference Result 1230 states and 2440 transitions. [2019-12-26 22:35:39,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 22:35:39,186 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-26 22:35:39,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:39,188 INFO L225 Difference]: With dead ends: 1230 [2019-12-26 22:35:39,188 INFO L226 Difference]: Without dead ends: 610 [2019-12-26 22:35:39,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2019-12-26 22:35:39,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-12-26 22:35:39,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 544. [2019-12-26 22:35:39,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-12-26 22:35:39,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1175 transitions. [2019-12-26 22:35:39,195 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1175 transitions. Word has length 57 [2019-12-26 22:35:39,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:39,196 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 1175 transitions. [2019-12-26 22:35:39,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 22:35:39,196 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1175 transitions. [2019-12-26 22:35:39,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 22:35:39,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:39,197 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:35:39,197 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:39,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:39,197 INFO L82 PathProgramCache]: Analyzing trace with hash -892812541, now seen corresponding path program 2 times [2019-12-26 22:35:39,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:39,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457587678] [2019-12-26 22:35:39,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:39,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:35:39,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457587678] [2019-12-26 22:35:39,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:39,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-26 22:35:39,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760095042] [2019-12-26 22:35:39,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-26 22:35:39,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:39,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-26 22:35:39,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-12-26 22:35:39,755 INFO L87 Difference]: Start difference. First operand 544 states and 1175 transitions. Second operand 19 states. [2019-12-26 22:35:41,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:41,219 INFO L93 Difference]: Finished difference Result 1305 states and 2899 transitions. [2019-12-26 22:35:41,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-26 22:35:41,220 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2019-12-26 22:35:41,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:41,221 INFO L225 Difference]: With dead ends: 1305 [2019-12-26 22:35:41,221 INFO L226 Difference]: Without dead ends: 1275 [2019-12-26 22:35:41,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=252, Invalid=1230, Unknown=0, NotChecked=0, Total=1482 [2019-12-26 22:35:41,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2019-12-26 22:35:41,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 726. [2019-12-26 22:35:41,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2019-12-26 22:35:41,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1575 transitions. [2019-12-26 22:35:41,231 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1575 transitions. Word has length 57 [2019-12-26 22:35:41,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:41,231 INFO L462 AbstractCegarLoop]: Abstraction has 726 states and 1575 transitions. [2019-12-26 22:35:41,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-26 22:35:41,232 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1575 transitions. [2019-12-26 22:35:41,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 22:35:41,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:41,233 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:35:41,233 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:41,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:41,234 INFO L82 PathProgramCache]: Analyzing trace with hash -495942269, now seen corresponding path program 3 times [2019-12-26 22:35:41,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:41,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912120975] [2019-12-26 22:35:41,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:41,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:35:41,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912120975] [2019-12-26 22:35:41,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:41,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 22:35:41,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245792333] [2019-12-26 22:35:41,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 22:35:41,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:41,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 22:35:41,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-26 22:35:41,600 INFO L87 Difference]: Start difference. First operand 726 states and 1575 transitions. Second operand 14 states. [2019-12-26 22:35:42,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:42,325 INFO L93 Difference]: Finished difference Result 1172 states and 2548 transitions. [2019-12-26 22:35:42,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-26 22:35:42,326 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2019-12-26 22:35:42,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:42,327 INFO L225 Difference]: With dead ends: 1172 [2019-12-26 22:35:42,327 INFO L226 Difference]: Without dead ends: 1142 [2019-12-26 22:35:42,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2019-12-26 22:35:42,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2019-12-26 22:35:42,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 786. [2019-12-26 22:35:42,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2019-12-26 22:35:42,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1721 transitions. [2019-12-26 22:35:42,337 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1721 transitions. Word has length 57 [2019-12-26 22:35:42,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:42,337 INFO L462 AbstractCegarLoop]: Abstraction has 786 states and 1721 transitions. [2019-12-26 22:35:42,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 22:35:42,338 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1721 transitions. [2019-12-26 22:35:42,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 22:35:42,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:42,339 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:35:42,340 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:42,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:42,340 INFO L82 PathProgramCache]: Analyzing trace with hash 60491955, now seen corresponding path program 4 times [2019-12-26 22:35:42,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:42,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002878930] [2019-12-26 22:35:42,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:42,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:35:42,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002878930] [2019-12-26 22:35:42,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:42,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 22:35:42,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470208493] [2019-12-26 22:35:42,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 22:35:42,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:42,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 22:35:42,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-26 22:35:42,627 INFO L87 Difference]: Start difference. First operand 786 states and 1721 transitions. Second operand 14 states. [2019-12-26 22:35:43,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:43,284 INFO L93 Difference]: Finished difference Result 1160 states and 2516 transitions. [2019-12-26 22:35:43,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 22:35:43,285 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2019-12-26 22:35:43,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:43,287 INFO L225 Difference]: With dead ends: 1160 [2019-12-26 22:35:43,287 INFO L226 Difference]: Without dead ends: 1130 [2019-12-26 22:35:43,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2019-12-26 22:35:43,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2019-12-26 22:35:43,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 782. [2019-12-26 22:35:43,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-12-26 22:35:43,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1711 transitions. [2019-12-26 22:35:43,299 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1711 transitions. Word has length 57 [2019-12-26 22:35:43,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:43,299 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1711 transitions. [2019-12-26 22:35:43,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 22:35:43,299 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1711 transitions. [2019-12-26 22:35:43,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 22:35:43,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:43,301 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:35:43,301 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:43,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:43,301 INFO L82 PathProgramCache]: Analyzing trace with hash 729108355, now seen corresponding path program 5 times [2019-12-26 22:35:43,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:43,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902484111] [2019-12-26 22:35:43,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:35:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:35:43,418 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:35:43,419 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:35:43,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] ULTIMATE.startENTRY-->L812: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= v_~y$w_buff0_used~0_565 0) (= v_~y$w_buff1_used~0_304 0) (= v_~main$tmp_guard0~0_30 0) (= v_~y$r_buff0_thd0~0_292 0) (= 0 v_~weak$$choice2~0_82) (= 0 v_~y$read_delayed_var~0.offset_8) (= 0 v_~__unbuffered_cnt~0_94) (= 0 v_~y$r_buff1_thd3~0_89) (= v_~y$read_delayed~0_8 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1108~0.base_27| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1108~0.base_27|) |v_ULTIMATE.start_main_~#t1108~0.offset_21| 0)) |v_#memory_int_15|) (= 0 v_~y$r_buff1_thd2~0_113) (= v_~main$tmp_guard1~0_30 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1108~0.base_27| 1) |v_#valid_54|) (= v_~x~0_51 0) (= v_~y$w_buff1~0_136 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1108~0.base_27| 4)) (= 0 v_~y$r_buff0_thd2~0_108) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$r_buff0_thd1~0_41 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1108~0.base_27|)) (= v_~a~0_57 0) (= v_~y$mem_tmp~0_17 0) (= v_~z~0_41 0) (= 0 v_~y$r_buff1_thd1~0_40) (= v_~__unbuffered_p2_EBX~0_54 0) (= v_~y~0_123 0) (= v_~y$r_buff1_thd0~0_196 0) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff0_thd3~0_130) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_p2_EAX~0_54) (= 0 v_~__unbuffered_p0_EAX~0_39) (= 0 v_~weak$$choice0~0_13) (= |v_ULTIMATE.start_main_~#t1108~0.offset_21| 0) (= 0 |v_#NULL.base_5|) (= 0 v_~y$flush_delayed~0_34) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1108~0.base_27|) (= 0 v_~y$w_buff0~0_162))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_28|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_35|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_29|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_51|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_50|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_57, ~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_89, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$flush_delayed~0=v_~y$flush_delayed~0_34, ULTIMATE.start_main_~#t1109~0.base=|v_ULTIMATE.start_main_~#t1109~0.base_26|, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_54, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_116|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_33|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_25|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~y$w_buff1~0=v_~y$w_buff1~0_136, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_196, ~x~0=v_~x~0_51, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_565, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_34|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_49|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_31|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_27|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_27|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_40, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_28|, ULTIMATE.start_main_~#t1108~0.offset=|v_ULTIMATE.start_main_~#t1108~0.offset_21|, ULTIMATE.start_main_~#t1110~0.base=|v_ULTIMATE.start_main_~#t1110~0.base_21|, ~y$w_buff0~0=v_~y$w_buff0~0_162, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_130, ULTIMATE.start_main_~#t1110~0.offset=|v_ULTIMATE.start_main_~#t1110~0.offset_16|, ~y~0=v_~y~0_123, ULTIMATE.start_main_~#t1108~0.base=|v_ULTIMATE.start_main_~#t1108~0.base_27|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_32|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_17|, ULTIMATE.start_main_~#t1109~0.offset=|v_ULTIMATE.start_main_~#t1109~0.offset_20|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_196|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_28|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_110|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_26|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_292, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_41, ~weak$$choice2~0=v_~weak$$choice2~0_82, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_304} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t1109~0.base, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1108~0.offset, ULTIMATE.start_main_~#t1110~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t1110~0.offset, ~y~0, ULTIMATE.start_main_~#t1108~0.base, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_~#t1109~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 22:35:43,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L812-1-->L814: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1109~0.base_9| 4) |v_#length_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1109~0.base_9|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1109~0.base_9| 1) |v_#valid_27|) (= |v_ULTIMATE.start_main_~#t1109~0.offset_8| 0) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1109~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1109~0.base_9|) |v_ULTIMATE.start_main_~#t1109~0.offset_8| 1))) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1109~0.base_9|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1109~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1109~0.offset=|v_ULTIMATE.start_main_~#t1109~0.offset_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start_main_~#t1109~0.base=|v_ULTIMATE.start_main_~#t1109~0.base_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1109~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1109~0.base, #length] because there is no mapped edge [2019-12-26 22:35:43,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L816: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1110~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1110~0.base_10|) |v_ULTIMATE.start_main_~#t1110~0.offset_10| 2)) |v_#memory_int_11|) (not (= |v_ULTIMATE.start_main_~#t1110~0.base_10| 0)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1110~0.base_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1110~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t1110~0.offset_10|) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t1110~0.base_10|) 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t1110~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1110~0.base=|v_ULTIMATE.start_main_~#t1110~0.base_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1110~0.offset=|v_ULTIMATE.start_main_~#t1110~0.offset_10|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1110~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1110~0.offset, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-26 22:35:43,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L4-->L789: Formula: (and (= ~__unbuffered_p2_EAX~0_Out2016356723 ~z~0_Out2016356723) (= 1 ~z~0_Out2016356723) (= ~y$r_buff1_thd2~0_Out2016356723 ~y$r_buff0_thd2~0_In2016356723) (= ~y$r_buff0_thd3~0_In2016356723 ~y$r_buff1_thd3~0_Out2016356723) (= ~y$r_buff0_thd1~0_In2016356723 ~y$r_buff1_thd1~0_Out2016356723) (not (= P2Thread1of1ForFork1___VERIFIER_assert_~expression_In2016356723 0)) (= 1 ~y$r_buff0_thd3~0_Out2016356723) (= ~__unbuffered_p2_EBX~0_Out2016356723 ~a~0_In2016356723) (= ~y$r_buff1_thd0~0_Out2016356723 ~y$r_buff0_thd0~0_In2016356723)) InVars {~a~0=~a~0_In2016356723, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2016356723, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2016356723, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2016356723, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2016356723, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In2016356723} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out2016356723, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In2016356723, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out2016356723, ~a~0=~a~0_In2016356723, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out2016356723, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out2016356723, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out2016356723, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2016356723, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2016356723, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2016356723, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out2016356723, ~z~0=~z~0_Out2016356723, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out2016356723} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-26 22:35:43,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= v_P0Thread1of1ForFork2_~arg.base_10 |v_P0Thread1of1ForFork2_#in~arg.base_10|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_10| v_P0Thread1of1ForFork2_~arg.offset_10) (= v_~a~0_22 1) (= v_~x~0_29 v_~__unbuffered_p0_EAX~0_17) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, ~x~0=v_~x~0_29} OutVars{~a~0=v_~a~0_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_10, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_29, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_10} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-26 22:35:43,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L754-2-->L754-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork0_#t~ite4_Out-2064994242| |P1Thread1of1ForFork0_#t~ite3_Out-2064994242|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2064994242 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-2064994242 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~y~0_In-2064994242 |P1Thread1of1ForFork0_#t~ite3_Out-2064994242|)) (and .cse0 (= |P1Thread1of1ForFork0_#t~ite3_Out-2064994242| ~y$w_buff1~0_In-2064994242) (not .cse2) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2064994242, ~y$w_buff1~0=~y$w_buff1~0_In-2064994242, ~y~0=~y~0_In-2064994242, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2064994242} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2064994242, ~y$w_buff1~0=~y$w_buff1~0_In-2064994242, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out-2064994242|, ~y~0=~y~0_In-2064994242, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out-2064994242|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2064994242} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-26 22:35:43,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1286551387 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1286551387 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite11_Out1286551387| 0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1286551387 |P2Thread1of1ForFork1_#t~ite11_Out1286551387|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1286551387, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1286551387} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1286551387, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out1286551387|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1286551387} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-26 22:35:43,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L791-->L791-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1770963547 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In1770963547 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1770963547 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1770963547 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite12_Out1770963547|)) (and (= ~y$w_buff1_used~0_In1770963547 |P2Thread1of1ForFork1_#t~ite12_Out1770963547|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1770963547, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1770963547, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1770963547, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1770963547} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1770963547, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1770963547, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1770963547, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out1770963547|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1770963547} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 22:35:43,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L792-->L793: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1173651237 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-1173651237 256) 0))) (or (and (= ~y$r_buff0_thd3~0_In-1173651237 ~y$r_buff0_thd3~0_Out-1173651237) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd3~0_Out-1173651237 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1173651237, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1173651237} OutVars{P2Thread1of1ForFork1_#t~ite13=|P2Thread1of1ForFork1_#t~ite13_Out-1173651237|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1173651237, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1173651237} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite13, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-26 22:35:43,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L793-->L793-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In388891402 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In388891402 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In388891402 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In388891402 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite14_Out388891402| ~y$r_buff1_thd3~0_In388891402)) (and (= |P2Thread1of1ForFork1_#t~ite14_Out388891402| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In388891402, ~y$w_buff0_used~0=~y$w_buff0_used~0_In388891402, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In388891402, ~y$w_buff1_used~0=~y$w_buff1_used~0_In388891402} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out388891402|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In388891402, ~y$w_buff0_used~0=~y$w_buff0_used~0_In388891402, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In388891402, ~y$w_buff1_used~0=~y$w_buff1_used~0_In388891402} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 22:35:43,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L793-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork1_#t~ite14_36| v_~y$r_buff1_thd3~0_55) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_35|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-26 22:35:43,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L755-->L755-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1431105358 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1431105358 256)))) (or (and (= ~y$w_buff0_used~0_In1431105358 |P1Thread1of1ForFork0_#t~ite5_Out1431105358|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite5_Out1431105358|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1431105358, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1431105358} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1431105358, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1431105358, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out1431105358|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 22:35:43,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L756-->L756-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1631075185 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1631075185 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1631075185 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1631075185 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite6_Out1631075185| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite6_Out1631075185| ~y$w_buff1_used~0_In1631075185)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1631075185, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1631075185, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1631075185, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1631075185} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1631075185, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1631075185, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1631075185, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out1631075185|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1631075185} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 22:35:43,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L757-->L757-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In20908552 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In20908552 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite7_Out20908552| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite7_Out20908552| ~y$r_buff0_thd2~0_In20908552)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In20908552, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In20908552} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In20908552, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In20908552, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out20908552|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-26 22:35:43,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L758-->L758-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In119660047 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In119660047 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In119660047 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In119660047 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In119660047 |P1Thread1of1ForFork0_#t~ite8_Out119660047|)) (and (= 0 |P1Thread1of1ForFork0_#t~ite8_Out119660047|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In119660047, ~y$w_buff0_used~0=~y$w_buff0_used~0_In119660047, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In119660047, ~y$w_buff1_used~0=~y$w_buff1_used~0_In119660047} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In119660047, ~y$w_buff0_used~0=~y$w_buff0_used~0_In119660047, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In119660047, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out119660047|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In119660047} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 22:35:43,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L758-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_75 (+ v_~__unbuffered_cnt~0_76 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~y$r_buff1_thd2~0_82 |v_P1Thread1of1ForFork0_#t~ite8_38|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_38|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_82, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_37|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#t~ite8, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-26 22:35:43,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L820-->L822-2: Formula: (and (or (= 0 (mod v_~y$w_buff0_used~0_253 256)) (= (mod v_~y$r_buff0_thd0~0_142 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_142, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_142, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 22:35:43,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L822-2-->L822-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite19_Out-1555542158| |ULTIMATE.start_main_#t~ite18_Out-1555542158|)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1555542158 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1555542158 256)))) (or (and .cse0 (not .cse1) (= |ULTIMATE.start_main_#t~ite18_Out-1555542158| ~y$w_buff1~0_In-1555542158) (not .cse2)) (and .cse0 (= |ULTIMATE.start_main_#t~ite18_Out-1555542158| ~y~0_In-1555542158) (or .cse1 .cse2)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1555542158, ~y~0=~y~0_In-1555542158, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1555542158, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1555542158} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1555542158, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1555542158|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1555542158|, ~y~0=~y~0_In-1555542158, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1555542158, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1555542158} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-26 22:35:43,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1559937953 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1559937953 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite20_Out-1559937953|) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out-1559937953| ~y$w_buff0_used~0_In-1559937953)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1559937953, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1559937953} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1559937953, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1559937953, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1559937953|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-26 22:35:43,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In355960021 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In355960021 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In355960021 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In355960021 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite21_Out355960021|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In355960021 |ULTIMATE.start_main_#t~ite21_Out355960021|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In355960021, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In355960021, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In355960021, ~y$w_buff1_used~0=~y$w_buff1_used~0_In355960021} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In355960021, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In355960021, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out355960021|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In355960021, ~y$w_buff1_used~0=~y$w_buff1_used~0_In355960021} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-26 22:35:43,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L825-->L825-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1802592082 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1802592082 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out1802592082| ~y$r_buff0_thd0~0_In1802592082) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite22_Out1802592082| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1802592082, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1802592082} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1802592082, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1802592082, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1802592082|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-26 22:35:43,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L826-->L826-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1369204416 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1369204416 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1369204416 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1369204416 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite23_Out1369204416| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~y$r_buff1_thd0~0_In1369204416 |ULTIMATE.start_main_#t~ite23_Out1369204416|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1369204416, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1369204416, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1369204416, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1369204416} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1369204416, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1369204416, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1369204416, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1369204416|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1369204416} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-26 22:35:43,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L834-->L834-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In281676947 256)))) (or (and (= |ULTIMATE.start_main_#t~ite29_Out281676947| |ULTIMATE.start_main_#t~ite30_Out281676947|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In281676947 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd0~0_In281676947 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In281676947 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In281676947 256) 0)))) (= ~y$w_buff0~0_In281676947 |ULTIMATE.start_main_#t~ite29_Out281676947|)) (and (not .cse0) (= ~y$w_buff0~0_In281676947 |ULTIMATE.start_main_#t~ite30_Out281676947|) (= |ULTIMATE.start_main_#t~ite29_In281676947| |ULTIMATE.start_main_#t~ite29_Out281676947|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In281676947, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In281676947|, ~y$w_buff0~0=~y$w_buff0~0_In281676947, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In281676947, ~weak$$choice2~0=~weak$$choice2~0_In281676947, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In281676947, ~y$w_buff1_used~0=~y$w_buff1_used~0_In281676947} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out281676947|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In281676947, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out281676947|, ~y$w_buff0~0=~y$w_buff0~0_In281676947, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In281676947, ~weak$$choice2~0=~weak$$choice2~0_In281676947, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In281676947, ~y$w_buff1_used~0=~y$w_buff1_used~0_In281676947} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-26 22:35:43,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L836-->L836-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-595710816 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out-595710816| ~y$w_buff0_used~0_In-595710816) (not .cse0) (= |ULTIMATE.start_main_#t~ite35_In-595710816| |ULTIMATE.start_main_#t~ite35_Out-595710816|)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-595710816 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd0~0_In-595710816 256) 0)) (= (mod ~y$w_buff0_used~0_In-595710816 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In-595710816 256) 0)))) (= |ULTIMATE.start_main_#t~ite36_Out-595710816| |ULTIMATE.start_main_#t~ite35_Out-595710816|) (= ~y$w_buff0_used~0_In-595710816 |ULTIMATE.start_main_#t~ite35_Out-595710816|) .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-595710816, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-595710816, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-595710816|, ~weak$$choice2~0=~weak$$choice2~0_In-595710816, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-595710816, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-595710816} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-595710816, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-595710816, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-595710816|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-595710816|, ~weak$$choice2~0=~weak$$choice2~0_In-595710816, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-595710816, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-595710816} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-26 22:35:43,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L837-->L837-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-737982094 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-737982094| ~y$w_buff1_used~0_In-737982094) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-737982094 256)))) (or (and .cse0 (= (mod ~y$w_buff1_used~0_In-737982094 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-737982094 256)) (and (= 0 (mod ~y$r_buff1_thd0~0_In-737982094 256)) .cse0))) .cse1 (= |ULTIMATE.start_main_#t~ite38_Out-737982094| |ULTIMATE.start_main_#t~ite39_Out-737982094|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite38_In-737982094| |ULTIMATE.start_main_#t~ite38_Out-737982094|) (= |ULTIMATE.start_main_#t~ite39_Out-737982094| ~y$w_buff1_used~0_In-737982094)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-737982094, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-737982094, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-737982094|, ~weak$$choice2~0=~weak$$choice2~0_In-737982094, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-737982094, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-737982094} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-737982094, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-737982094|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-737982094, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-737982094|, ~weak$$choice2~0=~weak$$choice2~0_In-737982094, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-737982094, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-737982094} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-26 22:35:43,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L838-->L839: Formula: (and (not (= (mod v_~weak$$choice2~0_22 256) 0)) (= v_~y$r_buff0_thd0~0_108 v_~y$r_buff0_thd0~0_107)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_107, ~weak$$choice2~0=v_~weak$$choice2~0_22, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 22:35:43,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L839-->L839-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In286733783 256) 0))) (or (and (not .cse0) (= ~y$r_buff1_thd0~0_In286733783 |ULTIMATE.start_main_#t~ite45_Out286733783|) (= |ULTIMATE.start_main_#t~ite44_In286733783| |ULTIMATE.start_main_#t~ite44_Out286733783|)) (and (= |ULTIMATE.start_main_#t~ite45_Out286733783| |ULTIMATE.start_main_#t~ite44_Out286733783|) .cse0 (= ~y$r_buff1_thd0~0_In286733783 |ULTIMATE.start_main_#t~ite44_Out286733783|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In286733783 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In286733783 256))) (and (= (mod ~y$w_buff1_used~0_In286733783 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In286733783 256) 0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In286733783, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In286733783, ~weak$$choice2~0=~weak$$choice2~0_In286733783, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In286733783, ~y$w_buff1_used~0=~y$w_buff1_used~0_In286733783, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In286733783|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In286733783, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In286733783, ~weak$$choice2~0=~weak$$choice2~0_In286733783, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In286733783, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out286733783|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out286733783|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In286733783} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 22:35:43,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L841-->L4: Formula: (and (= 0 v_~y$flush_delayed~0_27) (= v_~y~0_103 v_~y$mem_tmp~0_13) (not (= 0 (mod v_~y$flush_delayed~0_28 256))) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_13, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~y~0=v_~y~0_103, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:35:43,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 22:35:43,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:35:43 BasicIcfg [2019-12-26 22:35:43,540 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:35:43,541 INFO L168 Benchmark]: Toolchain (without parser) took 27123.44 ms. Allocated memory was 138.4 MB in the beginning and 1.1 GB in the end (delta: 911.7 MB). Free memory was 102.0 MB in the beginning and 625.4 MB in the end (delta: -523.5 MB). Peak memory consumption was 388.3 MB. Max. memory is 7.1 GB. [2019-12-26 22:35:43,542 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-26 22:35:43,543 INFO L168 Benchmark]: CACSL2BoogieTranslator took 822.57 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 101.8 MB in the beginning and 155.6 MB in the end (delta: -53.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-26 22:35:43,543 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.92 ms. Allocated memory is still 201.9 MB. Free memory was 155.6 MB in the beginning and 152.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 22:35:43,549 INFO L168 Benchmark]: Boogie Preprocessor took 38.00 ms. Allocated memory is still 201.9 MB. Free memory was 152.9 MB in the beginning and 150.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 22:35:43,550 INFO L168 Benchmark]: RCFGBuilder took 808.19 ms. Allocated memory is still 201.9 MB. Free memory was 150.2 MB in the beginning and 102.9 MB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. [2019-12-26 22:35:43,550 INFO L168 Benchmark]: TraceAbstraction took 25384.04 ms. Allocated memory was 201.9 MB in the beginning and 1.1 GB in the end (delta: 848.3 MB). Free memory was 102.9 MB in the beginning and 625.4 MB in the end (delta: -522.5 MB). Peak memory consumption was 325.8 MB. Max. memory is 7.1 GB. [2019-12-26 22:35:43,556 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 822.57 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 101.8 MB in the beginning and 155.6 MB in the end (delta: -53.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.92 ms. Allocated memory is still 201.9 MB. Free memory was 155.6 MB in the beginning and 152.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.00 ms. Allocated memory is still 201.9 MB. Free memory was 152.9 MB in the beginning and 150.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 808.19 ms. Allocated memory is still 201.9 MB. Free memory was 150.2 MB in the beginning and 102.9 MB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25384.04 ms. Allocated memory was 201.9 MB in the beginning and 1.1 GB in the end (delta: 848.3 MB). Free memory was 102.9 MB in the beginning and 625.4 MB in the end (delta: -522.5 MB). Peak memory consumption was 325.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 165 ProgramPointsBefore, 79 ProgramPointsAfterwards, 196 TransitionsBefore, 86 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 28 ChoiceCompositions, 4263 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 17 SemBasedMoverChecksPositive, 192 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 50142 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L812] FCALL, FORK 0 pthread_create(&t1108, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1109, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t1110, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L768] 3 y$w_buff1 = y$w_buff0 [L769] 3 y$w_buff0 = 2 [L770] 3 y$w_buff1_used = y$w_buff0_used [L771] 3 y$w_buff0_used = (_Bool)1 [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 2 x = 1 [L751] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 25.1s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2012 SDtfs, 2904 SDslu, 5492 SDs, 0 SdLazy, 3971 SolverSat, 284 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 203 GetRequests, 19 SyntacticMatches, 17 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22366occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 22612 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 678 NumberOfCodeBlocks, 678 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 604 ConstructedInterpolants, 0 QuantifiedInterpolants, 134542 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...