/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 19:05:05,172 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 19:05:05,175 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 19:05:05,194 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 19:05:05,194 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 19:05:05,196 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 19:05:05,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 19:05:05,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 19:05:05,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 19:05:05,215 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 19:05:05,217 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 19:05:05,219 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 19:05:05,219 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 19:05:05,221 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 19:05:05,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 19:05:05,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 19:05:05,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 19:05:05,227 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 19:05:05,228 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 19:05:05,233 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 19:05:05,237 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 19:05:05,241 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 19:05:05,242 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 19:05:05,242 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 19:05:05,244 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 19:05:05,244 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 19:05:05,245 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 19:05:05,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 19:05:05,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 19:05:05,247 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 19:05:05,247 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 19:05:05,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 19:05:05,248 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 19:05:05,249 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 19:05:05,250 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 19:05:05,250 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 19:05:05,250 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 19:05:05,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 19:05:05,251 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 19:05:05,252 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 19:05:05,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 19:05:05,253 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 19:05:05,267 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 19:05:05,267 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 19:05:05,268 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 19:05:05,268 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 19:05:05,268 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 19:05:05,269 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 19:05:05,269 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 19:05:05,269 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 19:05:05,269 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 19:05:05,269 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 19:05:05,269 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 19:05:05,270 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 19:05:05,270 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 19:05:05,270 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 19:05:05,270 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 19:05:05,270 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 19:05:05,271 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 19:05:05,271 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 19:05:05,271 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 19:05:05,271 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 19:05:05,271 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 19:05:05,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:05:05,272 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 19:05:05,272 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 19:05:05,272 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 19:05:05,272 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 19:05:05,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 19:05:05,273 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 19:05:05,273 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 19:05:05,546 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 19:05:05,568 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 19:05:05,571 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 19:05:05,573 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 19:05:05,573 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 19:05:05,574 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt.i [2019-12-18 19:05:05,648 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c27d21f6/e0306431721a4092bb47fc253b3b7d17/FLAG9c346cc9c [2019-12-18 19:05:06,242 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 19:05:06,243 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.opt.i [2019-12-18 19:05:06,264 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c27d21f6/e0306431721a4092bb47fc253b3b7d17/FLAG9c346cc9c [2019-12-18 19:05:06,502 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c27d21f6/e0306431721a4092bb47fc253b3b7d17 [2019-12-18 19:05:06,511 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 19:05:06,513 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 19:05:06,516 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 19:05:06,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 19:05:06,520 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 19:05:06,521 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:05:06" (1/1) ... [2019-12-18 19:05:06,524 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36df0124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:06, skipping insertion in model container [2019-12-18 19:05:06,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:05:06" (1/1) ... [2019-12-18 19:05:06,534 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 19:05:06,590 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 19:05:07,109 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:05:07,123 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 19:05:07,207 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:05:07,292 INFO L208 MainTranslator]: Completed translation [2019-12-18 19:05:07,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:07 WrapperNode [2019-12-18 19:05:07,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 19:05:07,294 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 19:05:07,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 19:05:07,294 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 19:05:07,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:07" (1/1) ... [2019-12-18 19:05:07,321 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:07" (1/1) ... [2019-12-18 19:05:07,361 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 19:05:07,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 19:05:07,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 19:05:07,362 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 19:05:07,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:07" (1/1) ... [2019-12-18 19:05:07,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:07" (1/1) ... [2019-12-18 19:05:07,378 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:07" (1/1) ... [2019-12-18 19:05:07,379 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:07" (1/1) ... [2019-12-18 19:05:07,389 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:07" (1/1) ... [2019-12-18 19:05:07,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:07" (1/1) ... [2019-12-18 19:05:07,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:07" (1/1) ... [2019-12-18 19:05:07,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 19:05:07,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 19:05:07,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 19:05:07,404 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 19:05:07,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:05:07,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 19:05:07,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 19:05:07,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 19:05:07,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 19:05:07,469 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 19:05:07,470 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 19:05:07,471 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 19:05:07,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 19:05:07,472 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 19:05:07,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 19:05:07,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 19:05:07,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 19:05:07,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 19:05:07,480 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 19:05:08,202 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 19:05:08,202 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 19:05:08,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:05:08 BoogieIcfgContainer [2019-12-18 19:05:08,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 19:05:08,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 19:05:08,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 19:05:08,208 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 19:05:08,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 07:05:06" (1/3) ... [2019-12-18 19:05:08,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@583beadb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:05:08, skipping insertion in model container [2019-12-18 19:05:08,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:05:07" (2/3) ... [2019-12-18 19:05:08,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@583beadb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:05:08, skipping insertion in model container [2019-12-18 19:05:08,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:05:08" (3/3) ... [2019-12-18 19:05:08,212 INFO L109 eAbstractionObserver]: Analyzing ICFG safe031_power.opt.i [2019-12-18 19:05:08,222 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 19:05:08,222 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 19:05:08,231 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 19:05:08,232 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 19:05:08,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,277 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,277 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,279 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,279 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,288 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,288 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,289 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,289 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,289 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,300 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,301 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,302 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,306 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,306 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,310 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,310 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:05:08,343 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 19:05:08,359 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:05:08,359 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:05:08,359 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:05:08,359 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:05:08,359 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:05:08,360 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:05:08,360 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:05:08,360 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:05:08,375 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-18 19:05:08,377 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 19:05:08,459 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 19:05:08,460 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:05:08,479 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 19:05:08,498 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 19:05:08,573 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 19:05:08,574 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:05:08,582 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 19:05:08,599 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 19:05:08,600 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 19:05:13,101 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 19:05:13,218 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 19:05:13,241 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48124 [2019-12-18 19:05:13,241 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 19:05:13,244 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 94 transitions [2019-12-18 19:05:14,091 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 15710 states. [2019-12-18 19:05:14,093 INFO L276 IsEmpty]: Start isEmpty. Operand 15710 states. [2019-12-18 19:05:14,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 19:05:14,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:14,100 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:05:14,101 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-18 19:05:14,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:14,107 INFO L82 PathProgramCache]: Analyzing trace with hash 2126234855, now seen corresponding path program 1 times [2019-12-18 19:05:14,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:14,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122694855] [2019-12-18 19:05:14,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:14,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:05:14,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122694855] [2019-12-18 19:05:14,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:14,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:05:14,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308645710] [2019-12-18 19:05:14,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:05:14,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:14,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:05:14,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:05:14,454 INFO L87 Difference]: Start difference. First operand 15710 states. Second operand 3 states. [2019-12-18 19:05:14,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:14,889 INFO L93 Difference]: Finished difference Result 15638 states and 59348 transitions. [2019-12-18 19:05:14,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:05:14,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 19:05:14,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:15,144 INFO L225 Difference]: With dead ends: 15638 [2019-12-18 19:05:15,144 INFO L226 Difference]: Without dead ends: 15326 [2019-12-18 19:05:15,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:05:15,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15326 states. [2019-12-18 19:05:15,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15326 to 15326. [2019-12-18 19:05:15,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15326 states. [2019-12-18 19:05:15,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15326 states to 15326 states and 58230 transitions. [2019-12-18 19:05:15,939 INFO L78 Accepts]: Start accepts. Automaton has 15326 states and 58230 transitions. Word has length 7 [2019-12-18 19:05:15,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:15,940 INFO L462 AbstractCegarLoop]: Abstraction has 15326 states and 58230 transitions. [2019-12-18 19:05:15,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:05:15,940 INFO L276 IsEmpty]: Start isEmpty. Operand 15326 states and 58230 transitions. [2019-12-18 19:05:15,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 19:05:15,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:15,944 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:05:15,945 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-18 19:05:15,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:15,945 INFO L82 PathProgramCache]: Analyzing trace with hash -380072381, now seen corresponding path program 1 times [2019-12-18 19:05:15,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:15,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60733036] [2019-12-18 19:05:15,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:16,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:05:16,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60733036] [2019-12-18 19:05:16,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:16,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:05:16,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45589005] [2019-12-18 19:05:16,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:05:16,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:16,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:05:16,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:05:16,074 INFO L87 Difference]: Start difference. First operand 15326 states and 58230 transitions. Second operand 4 states. [2019-12-18 19:05:17,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:17,867 INFO L93 Difference]: Finished difference Result 24490 states and 89350 transitions. [2019-12-18 19:05:17,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:05:17,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 19:05:17,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:17,991 INFO L225 Difference]: With dead ends: 24490 [2019-12-18 19:05:17,992 INFO L226 Difference]: Without dead ends: 24476 [2019-12-18 19:05:17,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:05:18,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24476 states. [2019-12-18 19:05:18,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24476 to 22206. [2019-12-18 19:05:18,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22206 states. [2019-12-18 19:05:18,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22206 states to 22206 states and 82052 transitions. [2019-12-18 19:05:18,885 INFO L78 Accepts]: Start accepts. Automaton has 22206 states and 82052 transitions. Word has length 13 [2019-12-18 19:05:18,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:18,885 INFO L462 AbstractCegarLoop]: Abstraction has 22206 states and 82052 transitions. [2019-12-18 19:05:18,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:05:18,885 INFO L276 IsEmpty]: Start isEmpty. Operand 22206 states and 82052 transitions. [2019-12-18 19:05:18,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 19:05:18,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:18,888 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:05:18,889 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-18 19:05:18,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:18,889 INFO L82 PathProgramCache]: Analyzing trace with hash 691839138, now seen corresponding path program 1 times [2019-12-18 19:05:18,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:18,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010509185] [2019-12-18 19:05:18,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:18,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:05:18,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010509185] [2019-12-18 19:05:18,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:18,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:05:18,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932466323] [2019-12-18 19:05:18,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:05:18,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:18,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:05:18,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:05:18,959 INFO L87 Difference]: Start difference. First operand 22206 states and 82052 transitions. Second operand 3 states. [2019-12-18 19:05:19,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:19,036 INFO L93 Difference]: Finished difference Result 12702 states and 40687 transitions. [2019-12-18 19:05:19,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:05:19,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 19:05:19,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:19,082 INFO L225 Difference]: With dead ends: 12702 [2019-12-18 19:05:19,082 INFO L226 Difference]: Without dead ends: 12702 [2019-12-18 19:05:19,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:05:19,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12702 states. [2019-12-18 19:05:19,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12702 to 12702. [2019-12-18 19:05:19,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12702 states. [2019-12-18 19:05:19,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12702 states to 12702 states and 40687 transitions. [2019-12-18 19:05:19,447 INFO L78 Accepts]: Start accepts. Automaton has 12702 states and 40687 transitions. Word has length 13 [2019-12-18 19:05:19,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:19,448 INFO L462 AbstractCegarLoop]: Abstraction has 12702 states and 40687 transitions. [2019-12-18 19:05:19,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:05:19,448 INFO L276 IsEmpty]: Start isEmpty. Operand 12702 states and 40687 transitions. [2019-12-18 19:05:19,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 19:05:19,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:19,450 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:05:19,450 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-18 19:05:19,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:19,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1718037058, now seen corresponding path program 1 times [2019-12-18 19:05:19,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:19,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912752511] [2019-12-18 19:05:19,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:19,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:05:19,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912752511] [2019-12-18 19:05:19,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:19,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:05:19,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584459181] [2019-12-18 19:05:19,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:05:19,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:19,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:05:19,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:05:19,497 INFO L87 Difference]: Start difference. First operand 12702 states and 40687 transitions. Second operand 4 states. [2019-12-18 19:05:19,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:19,521 INFO L93 Difference]: Finished difference Result 1935 states and 4569 transitions. [2019-12-18 19:05:19,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 19:05:19,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 19:05:19,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:19,528 INFO L225 Difference]: With dead ends: 1935 [2019-12-18 19:05:19,528 INFO L226 Difference]: Without dead ends: 1935 [2019-12-18 19:05:19,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:05:19,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-12-18 19:05:19,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1935. [2019-12-18 19:05:19,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-12-18 19:05:19,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 4569 transitions. [2019-12-18 19:05:19,648 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 4569 transitions. Word has length 14 [2019-12-18 19:05:19,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:19,649 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 4569 transitions. [2019-12-18 19:05:19,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:05:19,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 4569 transitions. [2019-12-18 19:05:19,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 19:05:19,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:19,652 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:05:19,652 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-18 19:05:19,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:19,652 INFO L82 PathProgramCache]: Analyzing trace with hash 968226525, now seen corresponding path program 1 times [2019-12-18 19:05:19,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:19,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929538092] [2019-12-18 19:05:19,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:19,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:05:19,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929538092] [2019-12-18 19:05:19,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:19,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:05:19,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335307738] [2019-12-18 19:05:19,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:05:19,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:19,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:05:19,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:05:19,720 INFO L87 Difference]: Start difference. First operand 1935 states and 4569 transitions. Second operand 5 states. [2019-12-18 19:05:19,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:19,748 INFO L93 Difference]: Finished difference Result 630 states and 1476 transitions. [2019-12-18 19:05:19,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:05:19,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 19:05:19,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:19,751 INFO L225 Difference]: With dead ends: 630 [2019-12-18 19:05:19,751 INFO L226 Difference]: Without dead ends: 630 [2019-12-18 19:05:19,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:05:19,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-12-18 19:05:19,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 574. [2019-12-18 19:05:19,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-12-18 19:05:19,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 1344 transitions. [2019-12-18 19:05:19,765 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 1344 transitions. Word has length 26 [2019-12-18 19:05:19,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:19,765 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 1344 transitions. [2019-12-18 19:05:19,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:05:19,765 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 1344 transitions. [2019-12-18 19:05:19,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 19:05:19,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:19,768 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:05:19,768 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-18 19:05:19,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:19,769 INFO L82 PathProgramCache]: Analyzing trace with hash 196092715, now seen corresponding path program 1 times [2019-12-18 19:05:19,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:19,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624277874] [2019-12-18 19:05:19,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:19,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:05:19,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624277874] [2019-12-18 19:05:19,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:19,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:05:19,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404873464] [2019-12-18 19:05:19,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:05:19,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:19,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:05:19,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:05:19,852 INFO L87 Difference]: Start difference. First operand 574 states and 1344 transitions. Second operand 3 states. [2019-12-18 19:05:19,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:19,902 INFO L93 Difference]: Finished difference Result 584 states and 1354 transitions. [2019-12-18 19:05:19,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:05:19,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 19:05:19,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:19,905 INFO L225 Difference]: With dead ends: 584 [2019-12-18 19:05:19,905 INFO L226 Difference]: Without dead ends: 584 [2019-12-18 19:05:19,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:05:19,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-12-18 19:05:19,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 580. [2019-12-18 19:05:19,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-12-18 19:05:19,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 1350 transitions. [2019-12-18 19:05:19,915 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 1350 transitions. Word has length 55 [2019-12-18 19:05:19,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:19,916 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 1350 transitions. [2019-12-18 19:05:19,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:05:19,916 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 1350 transitions. [2019-12-18 19:05:19,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 19:05:19,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:19,918 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:05:19,918 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-18 19:05:19,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:19,919 INFO L82 PathProgramCache]: Analyzing trace with hash -922835002, now seen corresponding path program 1 times [2019-12-18 19:05:19,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:19,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800398929] [2019-12-18 19:05:19,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:20,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:05:20,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800398929] [2019-12-18 19:05:20,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:20,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:05:20,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764034415] [2019-12-18 19:05:20,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:05:20,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:20,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:05:20,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:05:20,054 INFO L87 Difference]: Start difference. First operand 580 states and 1350 transitions. Second operand 3 states. [2019-12-18 19:05:20,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:20,068 INFO L93 Difference]: Finished difference Result 580 states and 1326 transitions. [2019-12-18 19:05:20,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:05:20,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 19:05:20,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:20,070 INFO L225 Difference]: With dead ends: 580 [2019-12-18 19:05:20,071 INFO L226 Difference]: Without dead ends: 580 [2019-12-18 19:05:20,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:05:20,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-12-18 19:05:20,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-12-18 19:05:20,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-12-18 19:05:20,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 1326 transitions. [2019-12-18 19:05:20,081 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 1326 transitions. Word has length 55 [2019-12-18 19:05:20,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:20,081 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 1326 transitions. [2019-12-18 19:05:20,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:05:20,081 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 1326 transitions. [2019-12-18 19:05:20,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 19:05:20,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:20,083 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:05:20,084 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-18 19:05:20,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:20,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1916501781, now seen corresponding path program 1 times [2019-12-18 19:05:20,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:20,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073556977] [2019-12-18 19:05:20,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:20,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:05:20,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073556977] [2019-12-18 19:05:20,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:20,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:05:20,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015561976] [2019-12-18 19:05:20,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:05:20,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:20,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:05:20,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:05:20,195 INFO L87 Difference]: Start difference. First operand 580 states and 1326 transitions. Second operand 5 states. [2019-12-18 19:05:20,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:20,419 INFO L93 Difference]: Finished difference Result 851 states and 1949 transitions. [2019-12-18 19:05:20,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:05:20,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-18 19:05:20,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:20,422 INFO L225 Difference]: With dead ends: 851 [2019-12-18 19:05:20,422 INFO L226 Difference]: Without dead ends: 851 [2019-12-18 19:05:20,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:05:20,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2019-12-18 19:05:20,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 664. [2019-12-18 19:05:20,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-12-18 19:05:20,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1530 transitions. [2019-12-18 19:05:20,443 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1530 transitions. Word has length 56 [2019-12-18 19:05:20,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:20,444 INFO L462 AbstractCegarLoop]: Abstraction has 664 states and 1530 transitions. [2019-12-18 19:05:20,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:05:20,444 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1530 transitions. [2019-12-18 19:05:20,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 19:05:20,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:20,450 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:05:20,450 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-18 19:05:20,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:20,450 INFO L82 PathProgramCache]: Analyzing trace with hash 510672277, now seen corresponding path program 2 times [2019-12-18 19:05:20,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:20,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206019030] [2019-12-18 19:05:20,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:20,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:05:20,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206019030] [2019-12-18 19:05:20,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:20,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:05:20,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152446415] [2019-12-18 19:05:20,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:05:20,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:20,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:05:20,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:05:20,604 INFO L87 Difference]: Start difference. First operand 664 states and 1530 transitions. Second operand 5 states. [2019-12-18 19:05:20,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:20,745 INFO L93 Difference]: Finished difference Result 922 states and 2104 transitions. [2019-12-18 19:05:20,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:05:20,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-18 19:05:20,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:20,748 INFO L225 Difference]: With dead ends: 922 [2019-12-18 19:05:20,748 INFO L226 Difference]: Without dead ends: 922 [2019-12-18 19:05:20,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:05:20,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2019-12-18 19:05:20,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 678. [2019-12-18 19:05:20,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2019-12-18 19:05:20,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1563 transitions. [2019-12-18 19:05:20,761 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1563 transitions. Word has length 56 [2019-12-18 19:05:20,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:20,762 INFO L462 AbstractCegarLoop]: Abstraction has 678 states and 1563 transitions. [2019-12-18 19:05:20,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:05:20,762 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1563 transitions. [2019-12-18 19:05:20,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 19:05:20,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:20,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:05:20,765 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-18 19:05:20,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:20,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1314270907, now seen corresponding path program 3 times [2019-12-18 19:05:20,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:20,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007846824] [2019-12-18 19:05:20,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:20,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:05:20,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007846824] [2019-12-18 19:05:20,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:20,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:05:20,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988418867] [2019-12-18 19:05:20,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:05:20,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:20,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:05:20,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:05:20,837 INFO L87 Difference]: Start difference. First operand 678 states and 1563 transitions. Second operand 3 states. [2019-12-18 19:05:20,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:20,891 INFO L93 Difference]: Finished difference Result 678 states and 1562 transitions. [2019-12-18 19:05:20,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:05:20,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 19:05:20,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:20,893 INFO L225 Difference]: With dead ends: 678 [2019-12-18 19:05:20,893 INFO L226 Difference]: Without dead ends: 678 [2019-12-18 19:05:20,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:05:20,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2019-12-18 19:05:20,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 475. [2019-12-18 19:05:20,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2019-12-18 19:05:20,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1091 transitions. [2019-12-18 19:05:20,903 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 1091 transitions. Word has length 56 [2019-12-18 19:05:20,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:20,904 INFO L462 AbstractCegarLoop]: Abstraction has 475 states and 1091 transitions. [2019-12-18 19:05:20,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:05:20,904 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1091 transitions. [2019-12-18 19:05:20,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 19:05:20,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:20,907 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-18 19:05:20,907 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-18 19:05:20,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:20,908 INFO L82 PathProgramCache]: Analyzing trace with hash 700007354, now seen corresponding path program 1 times [2019-12-18 19:05:20,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:20,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75963263] [2019-12-18 19:05:20,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:21,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:05:21,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75963263] [2019-12-18 19:05:21,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:21,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:05:21,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594337221] [2019-12-18 19:05:21,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:05:21,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:21,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:05:21,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:05:21,043 INFO L87 Difference]: Start difference. First operand 475 states and 1091 transitions. Second operand 6 states. [2019-12-18 19:05:21,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:21,127 INFO L93 Difference]: Finished difference Result 717 states and 1531 transitions. [2019-12-18 19:05:21,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:05:21,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-18 19:05:21,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:21,129 INFO L225 Difference]: With dead ends: 717 [2019-12-18 19:05:21,129 INFO L226 Difference]: Without dead ends: 446 [2019-12-18 19:05:21,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 19:05:21,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-12-18 19:05:21,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 413. [2019-12-18 19:05:21,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-12-18 19:05:21,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 912 transitions. [2019-12-18 19:05:21,137 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 912 transitions. Word has length 57 [2019-12-18 19:05:21,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:21,137 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 912 transitions. [2019-12-18 19:05:21,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:05:21,137 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 912 transitions. [2019-12-18 19:05:21,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 19:05:21,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:21,139 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-18 19:05:21,139 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-18 19:05:21,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:21,139 INFO L82 PathProgramCache]: Analyzing trace with hash 574299964, now seen corresponding path program 2 times [2019-12-18 19:05:21,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:21,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094448910] [2019-12-18 19:05:21,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:21,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:05:21,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094448910] [2019-12-18 19:05:21,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:21,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:05:21,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162323856] [2019-12-18 19:05:21,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 19:05:21,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:21,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 19:05:21,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:05:21,438 INFO L87 Difference]: Start difference. First operand 413 states and 912 transitions. Second operand 13 states. [2019-12-18 19:05:22,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:22,297 INFO L93 Difference]: Finished difference Result 1066 states and 2249 transitions. [2019-12-18 19:05:22,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 19:05:22,298 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-18 19:05:22,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:22,298 INFO L225 Difference]: With dead ends: 1066 [2019-12-18 19:05:22,298 INFO L226 Difference]: Without dead ends: 233 [2019-12-18 19:05:22,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=502, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:05:22,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-12-18 19:05:22,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 209. [2019-12-18 19:05:22,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-12-18 19:05:22,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 365 transitions. [2019-12-18 19:05:22,305 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 365 transitions. Word has length 57 [2019-12-18 19:05:22,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:22,305 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 365 transitions. [2019-12-18 19:05:22,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 19:05:22,305 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 365 transitions. [2019-12-18 19:05:22,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 19:05:22,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:22,306 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-18 19:05:22,308 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-18 19:05:22,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:22,308 INFO L82 PathProgramCache]: Analyzing trace with hash -431408076, now seen corresponding path program 3 times [2019-12-18 19:05:22,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:22,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917801166] [2019-12-18 19:05:22,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:22,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-18 19:05:22,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917801166] [2019-12-18 19:05:22,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:22,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 19:05:22,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834083628] [2019-12-18 19:05:22,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 19:05:22,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:22,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 19:05:22,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:05:22,592 INFO L87 Difference]: Start difference. First operand 209 states and 365 transitions. Second operand 13 states. [2019-12-18 19:05:23,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:23,215 INFO L93 Difference]: Finished difference Result 378 states and 643 transitions. [2019-12-18 19:05:23,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 19:05:23,216 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-18 19:05:23,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:23,217 INFO L225 Difference]: With dead ends: 378 [2019-12-18 19:05:23,217 INFO L226 Difference]: Without dead ends: 343 [2019-12-18 19:05:23,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2019-12-18 19:05:23,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-12-18 19:05:23,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 309. [2019-12-18 19:05:23,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-12-18 19:05:23,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 536 transitions. [2019-12-18 19:05:23,224 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 536 transitions. Word has length 57 [2019-12-18 19:05:23,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:23,224 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 536 transitions. [2019-12-18 19:05:23,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 19:05:23,225 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 536 transitions. [2019-12-18 19:05:23,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 19:05:23,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:23,226 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-18 19:05:23,226 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-18 19:05:23,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:23,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1239613688, now seen corresponding path program 4 times [2019-12-18 19:05:23,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:23,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529436574] [2019-12-18 19:05:23,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:23,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:05:23,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529436574] [2019-12-18 19:05:23,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:23,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 19:05:23,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707996844] [2019-12-18 19:05:23,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 19:05:23,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:23,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 19:05:23,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-18 19:05:23,415 INFO L87 Difference]: Start difference. First operand 309 states and 536 transitions. Second operand 12 states. [2019-12-18 19:05:23,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:23,709 INFO L93 Difference]: Finished difference Result 412 states and 691 transitions. [2019-12-18 19:05:23,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:05:23,710 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-18 19:05:23,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:23,711 INFO L225 Difference]: With dead ends: 412 [2019-12-18 19:05:23,711 INFO L226 Difference]: Without dead ends: 379 [2019-12-18 19:05:23,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-12-18 19:05:23,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-12-18 19:05:23,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 317. [2019-12-18 19:05:23,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-12-18 19:05:23,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 550 transitions. [2019-12-18 19:05:23,718 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 550 transitions. Word has length 57 [2019-12-18 19:05:23,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:23,718 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 550 transitions. [2019-12-18 19:05:23,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 19:05:23,718 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 550 transitions. [2019-12-18 19:05:23,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 19:05:23,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:23,719 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-18 19:05:23,719 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-18 19:05:23,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:23,720 INFO L82 PathProgramCache]: Analyzing trace with hash -97225810, now seen corresponding path program 5 times [2019-12-18 19:05:23,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:23,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381857107] [2019-12-18 19:05:23,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:05:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:05:23,819 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 19:05:23,819 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 19:05:23,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= v_~y$w_buff1~0_198 0) (= v_~x~0_55 0) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t2516~0.base_22| 1)) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~weak$$choice2~0_120 0) (= v_~main$tmp_guard1~0_31 0) (= v_~y$r_buff1_thd0~0_279 0) (= 0 v_~y$r_buff1_thd2~0_191) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$w_buff0~0_215) (= (select .cse0 |v_ULTIMATE.start_main_~#t2516~0.base_22|) 0) (= 0 v_~y$r_buff0_thd3~0_201) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff0_thd0~0_331 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2516~0.base_22|) (= v_~y$r_buff0_thd1~0_37 0) (= v_~y$w_buff0_used~0_623 0) (= 0 |v_#NULL.base_4|) (= v_~y~0_147 0) (= 0 v_~__unbuffered_p0_EAX~0_42) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$mem_tmp~0_20 0) (= 0 v_~weak$$choice0~0_16) (= 0 v_~y$flush_delayed~0_42) (= 0 v_~y$r_buff0_thd2~0_116) (= v_~y$w_buff1_used~0_397 0) (= |v_#NULL.offset_4| 0) (= 0 |v_ULTIMATE.start_main_~#t2516~0.offset_17|) (= v_~main$tmp_guard0~0_26 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2516~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2516~0.base_22|) |v_ULTIMATE.start_main_~#t2516~0.offset_17| 0)) |v_#memory_int_19|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t2516~0.base_22| 4) |v_#length_21|) (= 0 v_~y$r_buff1_thd3~0_162) (= v_~z~0_148 0) (= 0 v_~__unbuffered_cnt~0_97) (= v_~y$r_buff1_thd1~0_116 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_40|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_23|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_23|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_46|, ULTIMATE.start_main_~#t2516~0.base=|v_ULTIMATE.start_main_~#t2516~0.base_22|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_25|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_~#t2517~0.offset=|v_ULTIMATE.start_main_~#t2517~0.offset_15|, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_162, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_37, ~y$flush_delayed~0=v_~y$flush_delayed~0_42, #length=|v_#length_21|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_27|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_23|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_28|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_35|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_60|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_65|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_27|, ~y$w_buff1~0=v_~y$w_buff1~0_198, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_116, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_7|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_279, ~x~0=v_~x~0_55, ULTIMATE.start_main_~#t2516~0.offset=|v_ULTIMATE.start_main_~#t2516~0.offset_17|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_623, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_44|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_31|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_129|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_28|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_37|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_50|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_116, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_25|, ~y$w_buff0~0=v_~y$w_buff0~0_215, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_201, ~y~0=v_~y~0_147, ULTIMATE.start_main_~#t2518~0.base=|v_ULTIMATE.start_main_~#t2518~0.base_18|, ULTIMATE.start_main_~#t2517~0.base=|v_ULTIMATE.start_main_~#t2517~0.base_19|, ULTIMATE.start_main_~#t2518~0.offset=|v_ULTIMATE.start_main_~#t2518~0.offset_15|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_31|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_19|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_34|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_64|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_24|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_191, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_33|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_331, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_148, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_397} 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_~#t2516~0.base, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ULTIMATE.start_main_~#t2517~0.offset, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, 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, ULTIMATE.start_main_~#t2516~0.offset, ~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, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t2518~0.base, ULTIMATE.start_main_~#t2517~0.base, ULTIMATE.start_main_~#t2518~0.offset, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, 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-18 19:05:23,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L802-1-->L804: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2517~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2517~0.base_11|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2517~0.base_11|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2517~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2517~0.base_11|) |v_ULTIMATE.start_main_~#t2517~0.offset_10| 1)) |v_#memory_int_15|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2517~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t2517~0.base_11| 0)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2517~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2517~0.offset=|v_ULTIMATE.start_main_~#t2517~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t2517~0.base=|v_ULTIMATE.start_main_~#t2517~0.base_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2517~0.offset, ULTIMATE.start_main_~#t2517~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-18 19:05:23,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L804-1-->L806: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2518~0.base_10| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2518~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2518~0.base_10|) |v_ULTIMATE.start_main_~#t2518~0.offset_10| 2)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t2518~0.base_10|)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2518~0.base_10|) 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2518~0.base_10| 1)) (= 0 |v_ULTIMATE.start_main_~#t2518~0.offset_10|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2518~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2518~0.offset=|v_ULTIMATE.start_main_~#t2518~0.offset_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2518~0.base=|v_ULTIMATE.start_main_~#t2518~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2518~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t2518~0.base] because there is no mapped edge [2019-12-18 19:05:23,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [616] [616] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0~0_29 v_~y$w_buff1~0_24) (= 2 v_~y$w_buff0~0_28) (= |v_P2Thread1of1ForFork0_#in~arg.base_11| v_P2Thread1of1ForFork0_~arg.base_11) (= v_~y$w_buff0_used~0_103 1) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_11| v_P2Thread1of1ForFork0_~arg.offset_11) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_13 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|) (= v_~y$w_buff1_used~0_54 v_~y$w_buff0_used~0_104) (= 0 (mod v_~y$w_buff1_used~0_54 256))) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_11|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff0~0=v_~y$w_buff0~0_29, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_11|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_11, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_11|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_28, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_11, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_11|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_13, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_54} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 19:05:23,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_15| 0) (= 0 |v_P0Thread1of1ForFork1_#res.offset_15|) (= v_~x~0_47 v_~__unbuffered_p0_EAX~0_32) (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80) (= v_~z~0_109 2)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x~0=v_~x~0_47} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_15|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_15|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, ~z~0=v_~z~0_109, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x~0=v_~x~0_47, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 19:05:23,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In2137066978 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In2137066978 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite11_Out2137066978|) (not .cse1)) (and (= ~y$w_buff0_used~0_In2137066978 |P2Thread1of1ForFork0_#t~ite11_Out2137066978|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2137066978, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2137066978} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2137066978, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out2137066978|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2137066978} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 19:05:23,832 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L750-2-->L750-5: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-2046545991 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-2046545991 256))) (.cse1 (= |P1Thread1of1ForFork2_#t~ite4_Out-2046545991| |P1Thread1of1ForFork2_#t~ite3_Out-2046545991|))) (or (and (= |P1Thread1of1ForFork2_#t~ite3_Out-2046545991| ~y$w_buff1~0_In-2046545991) (not .cse0) .cse1 (not .cse2)) (and (or .cse2 .cse0) .cse1 (= |P1Thread1of1ForFork2_#t~ite3_Out-2046545991| ~y~0_In-2046545991)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2046545991, ~y$w_buff1~0=~y$w_buff1~0_In-2046545991, ~y~0=~y~0_In-2046545991, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2046545991} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2046545991, ~y$w_buff1~0=~y$w_buff1~0_In-2046545991, P1Thread1of1ForFork2_#t~ite4=|P1Thread1of1ForFork2_#t~ite4_Out-2046545991|, ~y~0=~y~0_In-2046545991, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-2046545991|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2046545991} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 19:05:23,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L751-->L751-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In660457417 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In660457417 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite5_Out660457417| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite5_Out660457417| ~y$w_buff0_used~0_In660457417)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In660457417, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In660457417} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In660457417, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In660457417, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out660457417|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 19:05:23,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L781-->L781-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1590256812 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-1590256812 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1590256812 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1590256812 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite12_Out-1590256812| ~y$w_buff1_used~0_In-1590256812) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork0_#t~ite12_Out-1590256812|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1590256812, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1590256812, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1590256812, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1590256812} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1590256812, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1590256812, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-1590256812|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1590256812, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1590256812} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 19:05:23,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In1887141393 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1887141393 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1887141393 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In1887141393 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite6_Out1887141393| 0)) (and (= |P1Thread1of1ForFork2_#t~ite6_Out1887141393| ~y$w_buff1_used~0_In1887141393) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1887141393, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1887141393, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1887141393, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1887141393} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1887141393, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1887141393, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1887141393, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out1887141393|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1887141393} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 19:05:23,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L753-->L753-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In989241948 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In989241948 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite7_Out989241948| ~y$r_buff0_thd2~0_In989241948)) (and (= |P1Thread1of1ForFork2_#t~ite7_Out989241948| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In989241948, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In989241948} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In989241948, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In989241948, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out989241948|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 19:05:23,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L754-->L754-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In325006125 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In325006125 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In325006125 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In325006125 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite8_Out325006125| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~y$r_buff1_thd2~0_In325006125 |P1Thread1of1ForFork2_#t~ite8_Out325006125|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In325006125, ~y$w_buff0_used~0=~y$w_buff0_used~0_In325006125, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In325006125, ~y$w_buff1_used~0=~y$w_buff1_used~0_In325006125} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In325006125, ~y$w_buff0_used~0=~y$w_buff0_used~0_In325006125, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out325006125|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In325006125, ~y$w_buff1_used~0=~y$w_buff1_used~0_In325006125} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 19:05:23,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L754-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= |v_P1Thread1of1ForFork2_#t~ite8_26| v_~y$r_buff1_thd2~0_103) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_103, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 19:05:23,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L782-->L783: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1932097905 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1932097905 256) 0))) (or (and (= ~y$r_buff0_thd3~0_In-1932097905 ~y$r_buff0_thd3~0_Out-1932097905) (or .cse0 .cse1)) (and (= ~y$r_buff0_thd3~0_Out-1932097905 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1932097905, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1932097905} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1932097905, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1932097905, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-1932097905|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 19:05:23,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In24101531 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In24101531 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In24101531 256))) (.cse2 (= (mod ~y$r_buff1_thd3~0_In24101531 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite14_Out24101531| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite14_Out24101531| ~y$r_buff1_thd3~0_In24101531) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In24101531, ~y$w_buff0_used~0=~y$w_buff0_used~0_In24101531, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In24101531, ~y$w_buff1_used~0=~y$w_buff1_used~0_In24101531} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out24101531|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In24101531, ~y$w_buff0_used~0=~y$w_buff0_used~0_In24101531, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In24101531, ~y$w_buff1_used~0=~y$w_buff1_used~0_In24101531} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 19:05:23,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L783-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_26| v_~y$r_buff1_thd3~0_99) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66)) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_25|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_99, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 19:05:23,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [614] [614] L806-1-->L812: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 19:05:23,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L812-2-->L812-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-545043233 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-545043233 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite18_Out-545043233| |ULTIMATE.start_main_#t~ite19_Out-545043233|))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite18_Out-545043233| ~y~0_In-545043233) .cse2) (and (= |ULTIMATE.start_main_#t~ite18_Out-545043233| ~y$w_buff1~0_In-545043233) (not .cse1) (not .cse0) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-545043233, ~y~0=~y~0_In-545043233, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-545043233, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-545043233} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-545043233, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-545043233|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-545043233|, ~y~0=~y~0_In-545043233, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-545043233, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-545043233} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 19:05:23,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1253275630 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1253275630 256)))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out1253275630| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite20_Out1253275630| ~y$w_buff0_used~0_In1253275630) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1253275630, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1253275630} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1253275630, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1253275630, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1253275630|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 19:05:23,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L814-->L814-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In443002373 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In443002373 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In443002373 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In443002373 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite21_Out443002373| ~y$w_buff1_used~0_In443002373)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite21_Out443002373| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In443002373, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In443002373, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In443002373, ~y$w_buff1_used~0=~y$w_buff1_used~0_In443002373} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In443002373, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In443002373, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out443002373|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In443002373, ~y$w_buff1_used~0=~y$w_buff1_used~0_In443002373} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 19:05:23,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L815-->L815-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In569196550 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In569196550 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In569196550 |ULTIMATE.start_main_#t~ite22_Out569196550|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite22_Out569196550|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In569196550, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In569196550} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In569196550, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In569196550, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out569196550|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 19:05:23,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L816-->L816-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-1187833910 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1187833910 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-1187833910 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1187833910 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite23_Out-1187833910|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd0~0_In-1187833910 |ULTIMATE.start_main_#t~ite23_Out-1187833910|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1187833910, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1187833910, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1187833910, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1187833910} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1187833910, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1187833910, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1187833910, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1187833910|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1187833910} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 19:05:23,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L827-->L827-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1585872093 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-1585872093| ~y$w_buff1_used~0_In-1585872093) (= |ULTIMATE.start_main_#t~ite38_In-1585872093| |ULTIMATE.start_main_#t~ite38_Out-1585872093|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1585872093 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1585872093 256))) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1585872093 256) 0)) (= (mod ~y$w_buff0_used~0_In-1585872093 256) 0))) .cse0 (= |ULTIMATE.start_main_#t~ite39_Out-1585872093| |ULTIMATE.start_main_#t~ite38_Out-1585872093|) (= |ULTIMATE.start_main_#t~ite38_Out-1585872093| ~y$w_buff1_used~0_In-1585872093)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1585872093, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1585872093, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-1585872093|, ~weak$$choice2~0=~weak$$choice2~0_In-1585872093, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1585872093, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1585872093} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1585872093, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1585872093|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1585872093, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1585872093|, ~weak$$choice2~0=~weak$$choice2~0_In-1585872093, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1585872093, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1585872093} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 19:05:23,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L828-->L829: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~y$r_buff0_thd0~0_98 v_~y$r_buff0_thd0~0_97)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_98, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_97, ~weak$$choice2~0=v_~weak$$choice2~0_25, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} 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-18 19:05:23,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L831-->L4: Formula: (and (= v_~y~0_99 v_~y$mem_tmp~0_10) (not (= (mod v_~y$flush_delayed~0_27 256) 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4| (mod v_~main$tmp_guard1~0_12 256)) (= 0 v_~y$flush_delayed~0_26)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ~y$flush_delayed~0=v_~y$flush_delayed~0_26, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_99, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} 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-18 19:05:23,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 19:05:23,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 07:05:23 BasicIcfg [2019-12-18 19:05:23,944 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 19:05:23,950 INFO L168 Benchmark]: Toolchain (without parser) took 17434.98 ms. Allocated memory was 138.9 MB in the beginning and 772.8 MB in the end (delta: 633.9 MB). Free memory was 100.7 MB in the beginning and 280.2 MB in the end (delta: -179.5 MB). Peak memory consumption was 454.4 MB. Max. memory is 7.1 GB. [2019-12-18 19:05:23,951 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 19:05:23,951 INFO L168 Benchmark]: CACSL2BoogieTranslator took 777.66 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.3 MB in the beginning and 156.9 MB in the end (delta: -56.7 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-18 19:05:23,952 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.61 ms. Allocated memory is still 203.4 MB. Free memory was 156.9 MB in the beginning and 153.7 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-18 19:05:23,956 INFO L168 Benchmark]: Boogie Preprocessor took 41.60 ms. Allocated memory is still 203.4 MB. Free memory was 153.7 MB in the beginning and 151.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 19:05:23,957 INFO L168 Benchmark]: RCFGBuilder took 799.75 ms. Allocated memory is still 203.4 MB. Free memory was 151.8 MB in the beginning and 105.3 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. [2019-12-18 19:05:23,957 INFO L168 Benchmark]: TraceAbstraction took 15739.18 ms. Allocated memory was 203.4 MB in the beginning and 772.8 MB in the end (delta: 569.4 MB). Free memory was 104.6 MB in the beginning and 280.2 MB in the end (delta: -175.5 MB). Peak memory consumption was 393.8 MB. Max. memory is 7.1 GB. [2019-12-18 19:05:23,966 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 777.66 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.3 MB in the beginning and 156.9 MB in the end (delta: -56.7 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.61 ms. Allocated memory is still 203.4 MB. Free memory was 156.9 MB in the beginning and 153.7 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.60 ms. Allocated memory is still 203.4 MB. Free memory was 153.7 MB in the beginning and 151.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 799.75 ms. Allocated memory is still 203.4 MB. Free memory was 151.8 MB in the beginning and 105.3 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15739.18 ms. Allocated memory was 203.4 MB in the beginning and 772.8 MB in the end (delta: 569.4 MB). Free memory was 104.6 MB in the beginning and 280.2 MB in the end (delta: -175.5 MB). Peak memory consumption was 393.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.8s, 162 ProgramPointsBefore, 83 ProgramPointsAfterwards, 193 TransitionsBefore, 94 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 24 ChoiceCompositions, 4225 VarBasedMoverChecksPositive, 199 VarBasedMoverChecksNegative, 61 SemBasedMoverChecksPositive, 194 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 48124 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t2516, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L804] FCALL, FORK 0 pthread_create(&t2517, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L806] FCALL, FORK 0 pthread_create(&t2518, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L769] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L770] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L771] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L772] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L773] 3 y$r_buff0_thd3 = (_Bool)1 [L776] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L779] 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, 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=2] [L744] 2 x = 1 [L747] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, 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=2] [L779] 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) [L750] 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, 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=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=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L780] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L750] 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) [L751] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L752] 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 [L753] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L781] 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 [L812] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=2] [L812] 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) [L813] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L814] 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 [L815] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L816] 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 [L819] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L820] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L821] 0 y$flush_delayed = weak$$choice2 [L822] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=2] [L823] 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, 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=2] [L823] 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) [L824] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=2] [L824] 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)) [L825] 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, 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=2] [L825] 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)) [L826] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=2] [L826] 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)) [L827] 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)) [L829] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=2] [L829] 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)) [L830] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.4s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1386 SDtfs, 1587 SDslu, 3482 SDs, 0 SdLazy, 1702 SolverSat, 122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 18 SyntacticMatches, 9 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22206occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 3117 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 636 NumberOfCodeBlocks, 636 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 565 ConstructedInterpolants, 0 QuantifiedInterpolants, 106001 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...