/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:45:05,236 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:45:05,239 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:45:05,256 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:45:05,256 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:45:05,257 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:45:05,259 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:45:05,260 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:45:05,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:45:05,263 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:45:05,264 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:45:05,265 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:45:05,265 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:45:05,266 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:45:05,267 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:45:05,268 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:45:05,269 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:45:05,270 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:45:05,272 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:45:05,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:45:05,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:45:05,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:45:05,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:45:05,279 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:45:05,281 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:45:05,281 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:45:05,281 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:45:05,282 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:45:05,283 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:45:05,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:45:05,284 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:45:05,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:45:05,286 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:45:05,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:45:05,287 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:45:05,288 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:45:05,288 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:45:05,288 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:45:05,289 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:45:05,290 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:45:05,290 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:45:05,291 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-VariableLbe.epf [2019-12-27 07:45:05,305 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:45:05,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:45:05,309 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:45:05,309 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:45:05,309 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:45:05,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:45:05,310 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:45:05,310 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:45:05,310 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:45:05,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:45:05,310 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:45:05,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:45:05,311 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:45:05,312 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:45:05,312 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:45:05,312 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:45:05,312 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:45:05,312 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:45:05,313 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:45:05,313 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:45:05,313 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:45:05,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:45:05,313 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:45:05,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:45:05,315 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:45:05,315 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:45:05,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:45:05,315 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:45:05,316 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:45:05,316 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:45:05,586 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:45:05,599 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:45:05,602 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:45:05,604 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:45:05,604 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:45:05,605 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_pso.oepc.i [2019-12-27 07:45:05,683 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d381a71a/ba0b9f784c744be087300ff3b4d4b341/FLAGa9c4f2992 [2019-12-27 07:45:06,197 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:45:06,197 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_pso.oepc.i [2019-12-27 07:45:06,220 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d381a71a/ba0b9f784c744be087300ff3b4d4b341/FLAGa9c4f2992 [2019-12-27 07:45:06,530 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d381a71a/ba0b9f784c744be087300ff3b4d4b341 [2019-12-27 07:45:06,540 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:45:06,542 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:45:06,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:45:06,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:45:06,548 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:45:06,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:45:06" (1/1) ... [2019-12-27 07:45:06,553 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e400b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:06, skipping insertion in model container [2019-12-27 07:45:06,553 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:45:06" (1/1) ... [2019-12-27 07:45:06,562 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:45:06,632 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:45:07,155 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:45:07,169 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:45:07,244 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:45:07,317 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:45:07,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:07 WrapperNode [2019-12-27 07:45:07,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:45:07,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:45:07,319 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:45:07,319 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:45:07,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:07" (1/1) ... [2019-12-27 07:45:07,349 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:07" (1/1) ... [2019-12-27 07:45:07,385 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:45:07,385 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:45:07,385 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:45:07,385 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:45:07,394 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:07" (1/1) ... [2019-12-27 07:45:07,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:07" (1/1) ... [2019-12-27 07:45:07,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:07" (1/1) ... [2019-12-27 07:45:07,400 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:07" (1/1) ... [2019-12-27 07:45:07,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:07" (1/1) ... [2019-12-27 07:45:07,415 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:07" (1/1) ... [2019-12-27 07:45:07,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:07" (1/1) ... [2019-12-27 07:45:07,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:45:07,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:45:07,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:45:07,425 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:45:07,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45: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-27 07:45:07,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:45:07,502 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:45:07,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:45:07,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:45:07,502 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:45:07,502 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:45:07,503 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:45:07,503 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:45:07,503 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 07:45:07,503 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 07:45:07,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:45:07,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:45:07,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:45:07,506 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 07:45:08,327 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:45:08,327 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:45:08,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:45:08 BoogieIcfgContainer [2019-12-27 07:45:08,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:45:08,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:45:08,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:45:08,334 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:45:08,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:45:06" (1/3) ... [2019-12-27 07:45:08,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@425d3c25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:45:08, skipping insertion in model container [2019-12-27 07:45:08,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:07" (2/3) ... [2019-12-27 07:45:08,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@425d3c25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:45:08, skipping insertion in model container [2019-12-27 07:45:08,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:45:08" (3/3) ... [2019-12-27 07:45:08,338 INFO L109 eAbstractionObserver]: Analyzing ICFG safe017_pso.oepc.i [2019-12-27 07:45:08,349 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:45:08,349 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:45:08,358 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:45:08,359 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:45:08,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,400 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,400 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,400 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,401 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,402 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,410 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,410 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,436 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,436 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,447 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,448 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,448 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,451 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,452 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,458 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,458 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:08,474 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 07:45:08,495 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:45:08,495 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:45:08,495 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:45:08,495 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:45:08,496 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:45:08,496 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:45:08,496 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:45:08,496 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:45:08,513 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 210 transitions [2019-12-27 07:45:08,515 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-27 07:45:08,620 INFO L132 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-27 07:45:08,620 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:45:08,636 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/158 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 07:45:08,660 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-27 07:45:08,714 INFO L132 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-27 07:45:08,714 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:45:08,722 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/158 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 07:45:08,741 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-27 07:45:08,742 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:45:12,015 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-12-27 07:45:12,300 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 07:45:12,417 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 07:45:12,446 INFO L206 etLargeBlockEncoding]: Checked pairs total: 81965 [2019-12-27 07:45:12,446 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-27 07:45:12,450 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 107 transitions [2019-12-27 07:45:31,287 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 123932 states. [2019-12-27 07:45:31,289 INFO L276 IsEmpty]: Start isEmpty. Operand 123932 states. [2019-12-27 07:45:31,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 07:45:31,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:45:31,295 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 07:45:31,296 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:45:31,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:45:31,301 INFO L82 PathProgramCache]: Analyzing trace with hash 840548, now seen corresponding path program 1 times [2019-12-27 07:45:31,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:45:31,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815763843] [2019-12-27 07:45:31,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:45:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:45:31,555 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-27 07:45:31,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815763843] [2019-12-27 07:45:31,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:45:31,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:45:31,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285313405] [2019-12-27 07:45:31,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:45:31,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:45:31,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:45:31,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:45:31,591 INFO L87 Difference]: Start difference. First operand 123932 states. Second operand 3 states. [2019-12-27 07:45:33,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:45:33,161 INFO L93 Difference]: Finished difference Result 123232 states and 527355 transitions. [2019-12-27 07:45:33,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:45:33,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 07:45:33,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:45:37,172 INFO L225 Difference]: With dead ends: 123232 [2019-12-27 07:45:37,172 INFO L226 Difference]: Without dead ends: 120684 [2019-12-27 07:45:37,174 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-27 07:45:41,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120684 states. [2019-12-27 07:45:44,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120684 to 120684. [2019-12-27 07:45:44,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120684 states. [2019-12-27 07:45:44,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120684 states to 120684 states and 516967 transitions. [2019-12-27 07:45:44,587 INFO L78 Accepts]: Start accepts. Automaton has 120684 states and 516967 transitions. Word has length 3 [2019-12-27 07:45:44,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:45:44,588 INFO L462 AbstractCegarLoop]: Abstraction has 120684 states and 516967 transitions. [2019-12-27 07:45:44,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:45:44,588 INFO L276 IsEmpty]: Start isEmpty. Operand 120684 states and 516967 transitions. [2019-12-27 07:45:44,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:45:44,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:45:44,593 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:45:44,593 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:45:44,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:45:44,594 INFO L82 PathProgramCache]: Analyzing trace with hash -693264508, now seen corresponding path program 1 times [2019-12-27 07:45:44,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:45:44,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682047492] [2019-12-27 07:45:44,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:45:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:45:44,702 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-27 07:45:44,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682047492] [2019-12-27 07:45:44,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:45:44,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:45:44,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005490556] [2019-12-27 07:45:44,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:45:44,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:45:44,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:45:44,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:45:44,707 INFO L87 Difference]: Start difference. First operand 120684 states and 516967 transitions. Second operand 4 states. [2019-12-27 07:45:49,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:45:49,987 INFO L93 Difference]: Finished difference Result 188314 states and 770960 transitions. [2019-12-27 07:45:49,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:45:49,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:45:49,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:45:50,802 INFO L225 Difference]: With dead ends: 188314 [2019-12-27 07:45:50,802 INFO L226 Difference]: Without dead ends: 188265 [2019-12-27 07:45:50,803 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-27 07:46:00,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188265 states. [2019-12-27 07:46:03,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188265 to 173329. [2019-12-27 07:46:03,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173329 states. [2019-12-27 07:46:10,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173329 states to 173329 states and 717928 transitions. [2019-12-27 07:46:10,389 INFO L78 Accepts]: Start accepts. Automaton has 173329 states and 717928 transitions. Word has length 11 [2019-12-27 07:46:10,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:10,389 INFO L462 AbstractCegarLoop]: Abstraction has 173329 states and 717928 transitions. [2019-12-27 07:46:10,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:46:10,390 INFO L276 IsEmpty]: Start isEmpty. Operand 173329 states and 717928 transitions. [2019-12-27 07:46:10,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:46:10,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:10,397 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:10,400 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:10,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:10,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1884384651, now seen corresponding path program 1 times [2019-12-27 07:46:10,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:10,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91924905] [2019-12-27 07:46:10,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:10,473 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-27 07:46:10,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91924905] [2019-12-27 07:46:10,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:10,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:46:10,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837380072] [2019-12-27 07:46:10,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:46:10,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:10,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:46:10,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:46:10,477 INFO L87 Difference]: Start difference. First operand 173329 states and 717928 transitions. Second operand 3 states. [2019-12-27 07:46:10,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:10,598 INFO L93 Difference]: Finished difference Result 34664 states and 112616 transitions. [2019-12-27 07:46:10,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:46:10,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 07:46:10,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:10,650 INFO L225 Difference]: With dead ends: 34664 [2019-12-27 07:46:10,651 INFO L226 Difference]: Without dead ends: 34664 [2019-12-27 07:46:10,652 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-27 07:46:10,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34664 states. [2019-12-27 07:46:11,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34664 to 34664. [2019-12-27 07:46:11,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34664 states. [2019-12-27 07:46:11,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34664 states to 34664 states and 112616 transitions. [2019-12-27 07:46:11,253 INFO L78 Accepts]: Start accepts. Automaton has 34664 states and 112616 transitions. Word has length 13 [2019-12-27 07:46:11,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:11,253 INFO L462 AbstractCegarLoop]: Abstraction has 34664 states and 112616 transitions. [2019-12-27 07:46:11,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:46:11,253 INFO L276 IsEmpty]: Start isEmpty. Operand 34664 states and 112616 transitions. [2019-12-27 07:46:11,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:46:11,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:11,255 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:11,255 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:11,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:11,255 INFO L82 PathProgramCache]: Analyzing trace with hash -2074529167, now seen corresponding path program 1 times [2019-12-27 07:46:11,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:11,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307317696] [2019-12-27 07:46:11,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:11,323 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-27 07:46:11,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307317696] [2019-12-27 07:46:11,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:11,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:46:11,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061180603] [2019-12-27 07:46:11,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:46:11,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:11,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:46:11,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:46:11,325 INFO L87 Difference]: Start difference. First operand 34664 states and 112616 transitions. Second operand 4 states. [2019-12-27 07:46:11,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:11,770 INFO L93 Difference]: Finished difference Result 46077 states and 146183 transitions. [2019-12-27 07:46:11,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:46:11,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 07:46:11,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:11,836 INFO L225 Difference]: With dead ends: 46077 [2019-12-27 07:46:11,836 INFO L226 Difference]: Without dead ends: 46070 [2019-12-27 07:46:11,837 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-27 07:46:12,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46070 states. [2019-12-27 07:46:13,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46070 to 40619. [2019-12-27 07:46:13,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40619 states. [2019-12-27 07:46:13,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40619 states to 40619 states and 130997 transitions. [2019-12-27 07:46:13,147 INFO L78 Accepts]: Start accepts. Automaton has 40619 states and 130997 transitions. Word has length 13 [2019-12-27 07:46:13,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:13,147 INFO L462 AbstractCegarLoop]: Abstraction has 40619 states and 130997 transitions. [2019-12-27 07:46:13,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:46:13,148 INFO L276 IsEmpty]: Start isEmpty. Operand 40619 states and 130997 transitions. [2019-12-27 07:46:13,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 07:46:13,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:13,152 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:13,152 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:13,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:13,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1372726712, now seen corresponding path program 1 times [2019-12-27 07:46:13,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:13,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764551783] [2019-12-27 07:46:13,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:13,234 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-27 07:46:13,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764551783] [2019-12-27 07:46:13,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:13,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:46:13,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246448964] [2019-12-27 07:46:13,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:46:13,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:13,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:46:13,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:46:13,236 INFO L87 Difference]: Start difference. First operand 40619 states and 130997 transitions. Second operand 5 states. [2019-12-27 07:46:14,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:14,009 INFO L93 Difference]: Finished difference Result 54297 states and 171188 transitions. [2019-12-27 07:46:14,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:46:14,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 07:46:14,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:14,094 INFO L225 Difference]: With dead ends: 54297 [2019-12-27 07:46:14,094 INFO L226 Difference]: Without dead ends: 54284 [2019-12-27 07:46:14,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:46:14,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54284 states. [2019-12-27 07:46:14,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54284 to 40933. [2019-12-27 07:46:14,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40933 states. [2019-12-27 07:46:14,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40933 states to 40933 states and 131862 transitions. [2019-12-27 07:46:14,875 INFO L78 Accepts]: Start accepts. Automaton has 40933 states and 131862 transitions. Word has length 19 [2019-12-27 07:46:14,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:14,876 INFO L462 AbstractCegarLoop]: Abstraction has 40933 states and 131862 transitions. [2019-12-27 07:46:14,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:46:14,876 INFO L276 IsEmpty]: Start isEmpty. Operand 40933 states and 131862 transitions. [2019-12-27 07:46:14,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:46:14,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:14,890 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:14,890 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:14,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:14,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1682135623, now seen corresponding path program 1 times [2019-12-27 07:46:14,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:14,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257916755] [2019-12-27 07:46:14,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:14,987 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-27 07:46:14,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257916755] [2019-12-27 07:46:14,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:14,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:46:14,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465634808] [2019-12-27 07:46:14,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:46:14,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:14,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:46:14,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:46:14,990 INFO L87 Difference]: Start difference. First operand 40933 states and 131862 transitions. Second operand 4 states. [2019-12-27 07:46:15,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:15,039 INFO L93 Difference]: Finished difference Result 7502 states and 20469 transitions. [2019-12-27 07:46:15,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:46:15,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 07:46:15,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:15,063 INFO L225 Difference]: With dead ends: 7502 [2019-12-27 07:46:15,064 INFO L226 Difference]: Without dead ends: 7502 [2019-12-27 07:46:15,064 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-27 07:46:15,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7502 states. [2019-12-27 07:46:15,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7502 to 7390. [2019-12-27 07:46:15,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7390 states. [2019-12-27 07:46:15,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7390 states to 7390 states and 20149 transitions. [2019-12-27 07:46:15,182 INFO L78 Accepts]: Start accepts. Automaton has 7390 states and 20149 transitions. Word has length 25 [2019-12-27 07:46:15,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:15,183 INFO L462 AbstractCegarLoop]: Abstraction has 7390 states and 20149 transitions. [2019-12-27 07:46:15,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:46:15,183 INFO L276 IsEmpty]: Start isEmpty. Operand 7390 states and 20149 transitions. [2019-12-27 07:46:15,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 07:46:15,194 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:15,194 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] [2019-12-27 07:46:15,195 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:15,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:15,195 INFO L82 PathProgramCache]: Analyzing trace with hash -2147477439, now seen corresponding path program 1 times [2019-12-27 07:46:15,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:15,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83374689] [2019-12-27 07:46:15,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:15,276 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-27 07:46:15,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83374689] [2019-12-27 07:46:15,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:15,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:46:15,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062200173] [2019-12-27 07:46:15,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:46:15,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:15,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:46:15,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:46:15,278 INFO L87 Difference]: Start difference. First operand 7390 states and 20149 transitions. Second operand 5 states. [2019-12-27 07:46:15,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:15,317 INFO L93 Difference]: Finished difference Result 5312 states and 15267 transitions. [2019-12-27 07:46:15,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:46:15,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 07:46:15,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:15,325 INFO L225 Difference]: With dead ends: 5312 [2019-12-27 07:46:15,326 INFO L226 Difference]: Without dead ends: 5312 [2019-12-27 07:46:15,326 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-27 07:46:15,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2019-12-27 07:46:15,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 4948. [2019-12-27 07:46:15,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4948 states. [2019-12-27 07:46:15,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4948 states to 4948 states and 14283 transitions. [2019-12-27 07:46:15,428 INFO L78 Accepts]: Start accepts. Automaton has 4948 states and 14283 transitions. Word has length 37 [2019-12-27 07:46:15,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:15,428 INFO L462 AbstractCegarLoop]: Abstraction has 4948 states and 14283 transitions. [2019-12-27 07:46:15,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:46:15,429 INFO L276 IsEmpty]: Start isEmpty. Operand 4948 states and 14283 transitions. [2019-12-27 07:46:15,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:46:15,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:15,437 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:15,437 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:15,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:15,438 INFO L82 PathProgramCache]: Analyzing trace with hash -314622142, now seen corresponding path program 1 times [2019-12-27 07:46:15,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:15,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753385508] [2019-12-27 07:46:15,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:15,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:15,517 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-27 07:46:15,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753385508] [2019-12-27 07:46:15,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:15,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:46:15,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697008305] [2019-12-27 07:46:15,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:46:15,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:15,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:46:15,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:46:15,519 INFO L87 Difference]: Start difference. First operand 4948 states and 14283 transitions. Second operand 3 states. [2019-12-27 07:46:15,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:15,573 INFO L93 Difference]: Finished difference Result 4959 states and 14299 transitions. [2019-12-27 07:46:15,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:46:15,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 07:46:15,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:15,585 INFO L225 Difference]: With dead ends: 4959 [2019-12-27 07:46:15,585 INFO L226 Difference]: Without dead ends: 4959 [2019-12-27 07:46:15,585 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-27 07:46:15,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4959 states. [2019-12-27 07:46:15,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4959 to 4955. [2019-12-27 07:46:15,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4955 states. [2019-12-27 07:46:15,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4955 states to 4955 states and 14295 transitions. [2019-12-27 07:46:15,648 INFO L78 Accepts]: Start accepts. Automaton has 4955 states and 14295 transitions. Word has length 65 [2019-12-27 07:46:15,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:15,649 INFO L462 AbstractCegarLoop]: Abstraction has 4955 states and 14295 transitions. [2019-12-27 07:46:15,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:46:15,649 INFO L276 IsEmpty]: Start isEmpty. Operand 4955 states and 14295 transitions. [2019-12-27 07:46:15,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:46:15,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:15,657 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:15,657 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:15,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:15,658 INFO L82 PathProgramCache]: Analyzing trace with hash 143495123, now seen corresponding path program 1 times [2019-12-27 07:46:15,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:15,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934740028] [2019-12-27 07:46:15,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:15,769 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-27 07:46:15,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934740028] [2019-12-27 07:46:15,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:15,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:46:15,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27251993] [2019-12-27 07:46:15,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:46:15,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:15,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:46:15,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:46:15,771 INFO L87 Difference]: Start difference. First operand 4955 states and 14295 transitions. Second operand 5 states. [2019-12-27 07:46:16,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:16,158 INFO L93 Difference]: Finished difference Result 7546 states and 21560 transitions. [2019-12-27 07:46:16,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:46:16,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 07:46:16,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:16,528 INFO L225 Difference]: With dead ends: 7546 [2019-12-27 07:46:16,529 INFO L226 Difference]: Without dead ends: 7546 [2019-12-27 07:46:16,529 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-27 07:46:16,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7546 states. [2019-12-27 07:46:16,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7546 to 6352. [2019-12-27 07:46:16,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6352 states. [2019-12-27 07:46:16,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6352 states to 6352 states and 18330 transitions. [2019-12-27 07:46:16,632 INFO L78 Accepts]: Start accepts. Automaton has 6352 states and 18330 transitions. Word has length 65 [2019-12-27 07:46:16,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:16,633 INFO L462 AbstractCegarLoop]: Abstraction has 6352 states and 18330 transitions. [2019-12-27 07:46:16,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:46:16,633 INFO L276 IsEmpty]: Start isEmpty. Operand 6352 states and 18330 transitions. [2019-12-27 07:46:16,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:46:16,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:16,642 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:16,642 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:16,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:16,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1279878861, now seen corresponding path program 2 times [2019-12-27 07:46:16,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:16,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036753716] [2019-12-27 07:46:16,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:16,783 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-27 07:46:16,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036753716] [2019-12-27 07:46:16,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:16,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:46:16,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772248580] [2019-12-27 07:46:16,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:46:16,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:16,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:46:16,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:46:16,788 INFO L87 Difference]: Start difference. First operand 6352 states and 18330 transitions. Second operand 6 states. [2019-12-27 07:46:17,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:17,294 INFO L93 Difference]: Finished difference Result 10887 states and 31211 transitions. [2019-12-27 07:46:17,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:46:17,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 07:46:17,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:17,308 INFO L225 Difference]: With dead ends: 10887 [2019-12-27 07:46:17,308 INFO L226 Difference]: Without dead ends: 10887 [2019-12-27 07:46:17,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:46:17,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10887 states. [2019-12-27 07:46:17,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10887 to 7014. [2019-12-27 07:46:17,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7014 states. [2019-12-27 07:46:17,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7014 states to 7014 states and 20308 transitions. [2019-12-27 07:46:17,428 INFO L78 Accepts]: Start accepts. Automaton has 7014 states and 20308 transitions. Word has length 65 [2019-12-27 07:46:17,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:17,428 INFO L462 AbstractCegarLoop]: Abstraction has 7014 states and 20308 transitions. [2019-12-27 07:46:17,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:46:17,429 INFO L276 IsEmpty]: Start isEmpty. Operand 7014 states and 20308 transitions. [2019-12-27 07:46:17,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:46:17,438 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:17,439 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:17,439 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:17,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:17,439 INFO L82 PathProgramCache]: Analyzing trace with hash -817749225, now seen corresponding path program 3 times [2019-12-27 07:46:17,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:17,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709976521] [2019-12-27 07:46:17,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:17,613 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-27 07:46:17,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709976521] [2019-12-27 07:46:17,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:17,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:46:17,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056044623] [2019-12-27 07:46:17,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:46:17,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:17,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:46:17,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:46:17,615 INFO L87 Difference]: Start difference. First operand 7014 states and 20308 transitions. Second operand 7 states. [2019-12-27 07:46:18,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:18,453 INFO L93 Difference]: Finished difference Result 10694 states and 30653 transitions. [2019-12-27 07:46:18,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 07:46:18,453 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 07:46:18,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:18,467 INFO L225 Difference]: With dead ends: 10694 [2019-12-27 07:46:18,468 INFO L226 Difference]: Without dead ends: 10694 [2019-12-27 07:46:18,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-27 07:46:18,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10694 states. [2019-12-27 07:46:18,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10694 to 6618. [2019-12-27 07:46:18,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6618 states. [2019-12-27 07:46:18,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6618 states to 6618 states and 19145 transitions. [2019-12-27 07:46:18,579 INFO L78 Accepts]: Start accepts. Automaton has 6618 states and 19145 transitions. Word has length 65 [2019-12-27 07:46:18,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:18,579 INFO L462 AbstractCegarLoop]: Abstraction has 6618 states and 19145 transitions. [2019-12-27 07:46:18,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:46:18,580 INFO L276 IsEmpty]: Start isEmpty. Operand 6618 states and 19145 transitions. [2019-12-27 07:46:18,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:46:18,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:18,589 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:18,589 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:18,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:18,589 INFO L82 PathProgramCache]: Analyzing trace with hash 976501587, now seen corresponding path program 4 times [2019-12-27 07:46:18,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:18,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787273477] [2019-12-27 07:46:18,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:18,715 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-27 07:46:18,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787273477] [2019-12-27 07:46:18,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:18,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:46:18,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068873593] [2019-12-27 07:46:18,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:46:18,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:18,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:46:18,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:46:18,717 INFO L87 Difference]: Start difference. First operand 6618 states and 19145 transitions. Second operand 6 states. [2019-12-27 07:46:19,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:19,260 INFO L93 Difference]: Finished difference Result 9282 states and 26363 transitions. [2019-12-27 07:46:19,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 07:46:19,260 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 07:46:19,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:19,272 INFO L225 Difference]: With dead ends: 9282 [2019-12-27 07:46:19,272 INFO L226 Difference]: Without dead ends: 9282 [2019-12-27 07:46:19,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:46:19,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9282 states. [2019-12-27 07:46:19,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9282 to 6875. [2019-12-27 07:46:19,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6875 states. [2019-12-27 07:46:19,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6875 states to 6875 states and 19889 transitions. [2019-12-27 07:46:19,374 INFO L78 Accepts]: Start accepts. Automaton has 6875 states and 19889 transitions. Word has length 65 [2019-12-27 07:46:19,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:19,374 INFO L462 AbstractCegarLoop]: Abstraction has 6875 states and 19889 transitions. [2019-12-27 07:46:19,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:46:19,374 INFO L276 IsEmpty]: Start isEmpty. Operand 6875 states and 19889 transitions. [2019-12-27 07:46:19,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:46:19,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:19,384 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:19,384 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:19,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:19,384 INFO L82 PathProgramCache]: Analyzing trace with hash -514720539, now seen corresponding path program 5 times [2019-12-27 07:46:19,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:19,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986546953] [2019-12-27 07:46:19,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:19,504 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-27 07:46:19,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986546953] [2019-12-27 07:46:19,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:19,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:46:19,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698145680] [2019-12-27 07:46:19,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:46:19,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:19,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:46:19,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:46:19,508 INFO L87 Difference]: Start difference. First operand 6875 states and 19889 transitions. Second operand 6 states. [2019-12-27 07:46:20,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:20,003 INFO L93 Difference]: Finished difference Result 11086 states and 31830 transitions. [2019-12-27 07:46:20,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:46:20,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 07:46:20,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:20,018 INFO L225 Difference]: With dead ends: 11086 [2019-12-27 07:46:20,018 INFO L226 Difference]: Without dead ends: 11086 [2019-12-27 07:46:20,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:46:20,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11086 states. [2019-12-27 07:46:20,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11086 to 7343. [2019-12-27 07:46:20,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7343 states. [2019-12-27 07:46:20,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7343 states to 7343 states and 21315 transitions. [2019-12-27 07:46:20,136 INFO L78 Accepts]: Start accepts. Automaton has 7343 states and 21315 transitions. Word has length 65 [2019-12-27 07:46:20,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:20,136 INFO L462 AbstractCegarLoop]: Abstraction has 7343 states and 21315 transitions. [2019-12-27 07:46:20,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:46:20,137 INFO L276 IsEmpty]: Start isEmpty. Operand 7343 states and 21315 transitions. [2019-12-27 07:46:20,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:46:20,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:20,146 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:20,146 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:20,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:20,147 INFO L82 PathProgramCache]: Analyzing trace with hash -508911177, now seen corresponding path program 6 times [2019-12-27 07:46:20,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:20,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329582263] [2019-12-27 07:46:20,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:20,284 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-27 07:46:20,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329582263] [2019-12-27 07:46:20,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:20,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:46:20,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647584655] [2019-12-27 07:46:20,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 07:46:20,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:20,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 07:46:20,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:46:20,286 INFO L87 Difference]: Start difference. First operand 7343 states and 21315 transitions. Second operand 8 states. [2019-12-27 07:46:21,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:21,077 INFO L93 Difference]: Finished difference Result 12666 states and 36293 transitions. [2019-12-27 07:46:21,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 07:46:21,077 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 07:46:21,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:21,094 INFO L225 Difference]: With dead ends: 12666 [2019-12-27 07:46:21,094 INFO L226 Difference]: Without dead ends: 12666 [2019-12-27 07:46:21,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-27 07:46:21,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12666 states. [2019-12-27 07:46:21,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12666 to 7367. [2019-12-27 07:46:21,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7367 states. [2019-12-27 07:46:21,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7367 states to 7367 states and 21373 transitions. [2019-12-27 07:46:21,219 INFO L78 Accepts]: Start accepts. Automaton has 7367 states and 21373 transitions. Word has length 65 [2019-12-27 07:46:21,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:21,219 INFO L462 AbstractCegarLoop]: Abstraction has 7367 states and 21373 transitions. [2019-12-27 07:46:21,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 07:46:21,219 INFO L276 IsEmpty]: Start isEmpty. Operand 7367 states and 21373 transitions. [2019-12-27 07:46:21,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:46:21,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:21,229 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:21,229 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:21,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:21,230 INFO L82 PathProgramCache]: Analyzing trace with hash -90199991, now seen corresponding path program 7 times [2019-12-27 07:46:21,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:21,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555111748] [2019-12-27 07:46:21,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:21,333 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-27 07:46:21,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555111748] [2019-12-27 07:46:21,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:21,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:46:21,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692873964] [2019-12-27 07:46:21,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:46:21,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:21,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:46:21,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:46:21,336 INFO L87 Difference]: Start difference. First operand 7367 states and 21373 transitions. Second operand 6 states. [2019-12-27 07:46:21,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:21,886 INFO L93 Difference]: Finished difference Result 11344 states and 32286 transitions. [2019-12-27 07:46:21,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 07:46:21,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 07:46:21,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:21,902 INFO L225 Difference]: With dead ends: 11344 [2019-12-27 07:46:21,903 INFO L226 Difference]: Without dead ends: 11344 [2019-12-27 07:46:21,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:46:21,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11344 states. [2019-12-27 07:46:22,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11344 to 8251. [2019-12-27 07:46:22,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8251 states. [2019-12-27 07:46:22,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8251 states to 8251 states and 23907 transitions. [2019-12-27 07:46:22,325 INFO L78 Accepts]: Start accepts. Automaton has 8251 states and 23907 transitions. Word has length 65 [2019-12-27 07:46:22,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:22,326 INFO L462 AbstractCegarLoop]: Abstraction has 8251 states and 23907 transitions. [2019-12-27 07:46:22,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:46:22,326 INFO L276 IsEmpty]: Start isEmpty. Operand 8251 states and 23907 transitions. [2019-12-27 07:46:22,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:46:22,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:22,334 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:22,334 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:22,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:22,334 INFO L82 PathProgramCache]: Analyzing trace with hash -853632375, now seen corresponding path program 8 times [2019-12-27 07:46:22,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:22,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709731402] [2019-12-27 07:46:22,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:22,406 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-27 07:46:22,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709731402] [2019-12-27 07:46:22,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:22,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:46:22,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848019656] [2019-12-27 07:46:22,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:46:22,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:22,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:46:22,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:46:22,408 INFO L87 Difference]: Start difference. First operand 8251 states and 23907 transitions. Second operand 3 states. [2019-12-27 07:46:22,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:22,481 INFO L93 Difference]: Finished difference Result 8251 states and 23906 transitions. [2019-12-27 07:46:22,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:46:22,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 07:46:22,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:22,494 INFO L225 Difference]: With dead ends: 8251 [2019-12-27 07:46:22,494 INFO L226 Difference]: Without dead ends: 8251 [2019-12-27 07:46:22,496 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-27 07:46:22,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8251 states. [2019-12-27 07:46:22,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8251 to 4892. [2019-12-27 07:46:22,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4892 states. [2019-12-27 07:46:22,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4892 states to 4892 states and 14487 transitions. [2019-12-27 07:46:22,660 INFO L78 Accepts]: Start accepts. Automaton has 4892 states and 14487 transitions. Word has length 65 [2019-12-27 07:46:22,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:22,661 INFO L462 AbstractCegarLoop]: Abstraction has 4892 states and 14487 transitions. [2019-12-27 07:46:22,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:46:22,661 INFO L276 IsEmpty]: Start isEmpty. Operand 4892 states and 14487 transitions. [2019-12-27 07:46:22,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:46:22,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:22,672 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:22,672 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:22,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:22,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1536074806, now seen corresponding path program 1 times [2019-12-27 07:46:22,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:22,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949453245] [2019-12-27 07:46:22,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:22,798 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-27 07:46:22,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949453245] [2019-12-27 07:46:22,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:22,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:46:22,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875232448] [2019-12-27 07:46:22,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:46:22,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:22,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:46:22,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:46:22,802 INFO L87 Difference]: Start difference. First operand 4892 states and 14487 transitions. Second operand 3 states. [2019-12-27 07:46:22,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:22,841 INFO L93 Difference]: Finished difference Result 4520 states and 13082 transitions. [2019-12-27 07:46:22,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:46:22,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 07:46:22,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:22,852 INFO L225 Difference]: With dead ends: 4520 [2019-12-27 07:46:22,852 INFO L226 Difference]: Without dead ends: 4520 [2019-12-27 07:46:22,853 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-27 07:46:22,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4520 states. [2019-12-27 07:46:22,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4520 to 3628. [2019-12-27 07:46:22,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3628 states. [2019-12-27 07:46:22,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3628 states to 3628 states and 10542 transitions. [2019-12-27 07:46:22,961 INFO L78 Accepts]: Start accepts. Automaton has 3628 states and 10542 transitions. Word has length 66 [2019-12-27 07:46:22,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:22,962 INFO L462 AbstractCegarLoop]: Abstraction has 3628 states and 10542 transitions. [2019-12-27 07:46:22,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:46:22,962 INFO L276 IsEmpty]: Start isEmpty. Operand 3628 states and 10542 transitions. [2019-12-27 07:46:22,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:46:22,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:22,969 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:22,970 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:22,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:22,970 INFO L82 PathProgramCache]: Analyzing trace with hash -197832194, now seen corresponding path program 1 times [2019-12-27 07:46:22,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:22,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600524275] [2019-12-27 07:46:22,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:23,319 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-27 07:46:23,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600524275] [2019-12-27 07:46:23,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:23,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 07:46:23,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826531609] [2019-12-27 07:46:23,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 07:46:23,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:23,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 07:46:23,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:46:23,329 INFO L87 Difference]: Start difference. First operand 3628 states and 10542 transitions. Second operand 13 states. [2019-12-27 07:46:24,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:24,036 INFO L93 Difference]: Finished difference Result 6218 states and 17902 transitions. [2019-12-27 07:46:24,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 07:46:24,036 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-27 07:46:24,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:24,045 INFO L225 Difference]: With dead ends: 6218 [2019-12-27 07:46:24,045 INFO L226 Difference]: Without dead ends: 6185 [2019-12-27 07:46:24,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=601, Unknown=0, NotChecked=0, Total=756 [2019-12-27 07:46:24,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6185 states. [2019-12-27 07:46:24,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6185 to 4861. [2019-12-27 07:46:24,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4861 states. [2019-12-27 07:46:24,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4861 states to 4861 states and 13963 transitions. [2019-12-27 07:46:24,126 INFO L78 Accepts]: Start accepts. Automaton has 4861 states and 13963 transitions. Word has length 67 [2019-12-27 07:46:24,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:24,126 INFO L462 AbstractCegarLoop]: Abstraction has 4861 states and 13963 transitions. [2019-12-27 07:46:24,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 07:46:24,126 INFO L276 IsEmpty]: Start isEmpty. Operand 4861 states and 13963 transitions. [2019-12-27 07:46:24,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:46:24,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:24,132 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:24,133 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:24,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:24,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1714106716, now seen corresponding path program 2 times [2019-12-27 07:46:24,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:24,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130574580] [2019-12-27 07:46:24,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:24,191 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-27 07:46:24,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130574580] [2019-12-27 07:46:24,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:24,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:46:24,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251093661] [2019-12-27 07:46:24,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:46:24,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:24,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:46:24,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:46:24,194 INFO L87 Difference]: Start difference. First operand 4861 states and 13963 transitions. Second operand 3 states. [2019-12-27 07:46:24,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:24,225 INFO L93 Difference]: Finished difference Result 4589 states and 12871 transitions. [2019-12-27 07:46:24,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:46:24,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 07:46:24,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:24,232 INFO L225 Difference]: With dead ends: 4589 [2019-12-27 07:46:24,233 INFO L226 Difference]: Without dead ends: 4589 [2019-12-27 07:46:24,233 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-27 07:46:24,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4589 states. [2019-12-27 07:46:24,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4589 to 4145. [2019-12-27 07:46:24,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4145 states. [2019-12-27 07:46:24,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4145 states to 4145 states and 11627 transitions. [2019-12-27 07:46:24,315 INFO L78 Accepts]: Start accepts. Automaton has 4145 states and 11627 transitions. Word has length 67 [2019-12-27 07:46:24,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:24,315 INFO L462 AbstractCegarLoop]: Abstraction has 4145 states and 11627 transitions. [2019-12-27 07:46:24,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:46:24,316 INFO L276 IsEmpty]: Start isEmpty. Operand 4145 states and 11627 transitions. [2019-12-27 07:46:24,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 07:46:24,321 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:24,321 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:24,322 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:24,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:24,322 INFO L82 PathProgramCache]: Analyzing trace with hash 947098105, now seen corresponding path program 1 times [2019-12-27 07:46:24,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:24,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505949527] [2019-12-27 07:46:24,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:46:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:46:24,471 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:46:24,471 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:46:24,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~y$r_buff0_thd3~0_18 0) (= 0 v_~y$w_buff1~0_28) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$r_buff1_thd3~0_17) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff0_used~0_123 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2183~0.base_27| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2183~0.base_27|) |v_ULTIMATE.start_main_~#t2183~0.offset_20| 0)) |v_#memory_int_21|) (= (store .cse0 |v_ULTIMATE.start_main_~#t2183~0.base_27| 1) |v_#valid_63|) (= 0 v_~y$r_buff1_thd0~0_49) (= 0 v_~__unbuffered_cnt~0_20) (= v_~y$r_buff0_thd2~0_20 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1_used~0_75 0) (= v_~y~0_30 0) (= v_~x~0_13 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff0_thd1~0_26 0) (= v_~main$tmp_guard0~0_6 0) (= v_~y$mem_tmp~0_11 0) (= 0 v_~weak$$choice2~0_33) (= 0 |v_ULTIMATE.start_main_~#t2183~0.offset_20|) (= 0 v_~y$r_buff1_thd1~0_18) (= v_~y$r_buff0_thd0~0_83 0) (= 0 v_~y$w_buff0~0_30) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2183~0.base_27| 4)) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$r_buff1_thd2~0_17) (= |v_#NULL.offset_5| 0) (= v_~__unbuffered_p2_EAX~0_9 0) (= v_~main$tmp_guard1~0_12 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2183~0.base_27|)) (= 0 |v_#NULL.base_5|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2183~0.base_27|) (= 0 v_~y$flush_delayed~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_9|, ULTIMATE.start_main_~#t2185~0.offset=|v_ULTIMATE.start_main_~#t2185~0.offset_16|, ULTIMATE.start_main_~#t2185~0.base=|v_ULTIMATE.start_main_~#t2185~0.base_19|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_11|, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_13|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_14|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_16|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_26, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_~#t2183~0.offset=|v_ULTIMATE.start_main_~#t2183~0.offset_20|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~y$w_buff1~0=v_~y$w_buff1~0_28, ~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_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_49, ~x~0=v_~x~0_13, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_9|, ~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_123, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_13|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_16|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_15|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_18, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_13|, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ULTIMATE.start_main_~#t2183~0.base=|v_ULTIMATE.start_main_~#t2183~0.base_27|, ~y~0=v_~y~0_30, ULTIMATE.start_main_~#t2184~0.offset=|v_ULTIMATE.start_main_~#t2184~0.offset_18|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_17|, ULTIMATE.start_main_~#t2184~0.base=|v_ULTIMATE.start_main_~#t2184~0.base_23|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_83, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_75} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_~#t2185~0.offset, ULTIMATE.start_main_~#t2185~0.base, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t2183~0.offset, 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, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t2183~0.base, ~y~0, ULTIMATE.start_main_~#t2184~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, 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_~#t2184~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 07:46:24,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L800-1-->L802: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2184~0.base_11|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2184~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2184~0.base_11|) |v_ULTIMATE.start_main_~#t2184~0.offset_10| 1)) |v_#memory_int_11|) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t2184~0.base_11| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2184~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t2184~0.offset_10|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2184~0.base_11| 4) |v_#length_15|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t2184~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t2184~0.base=|v_ULTIMATE.start_main_~#t2184~0.base_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2184~0.offset=|v_ULTIMATE.start_main_~#t2184~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t2184~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2184~0.offset] because there is no mapped edge [2019-12-27 07:46:24,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P0ENTRY-->L4-3: Formula: (and (= 1 v_~y$w_buff0_used~0_85) (= 2 v_~y$w_buff0~0_16) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff1_used~0_48 v_~y$w_buff0_used~0_86) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff0~0_17 v_~y$w_buff1~0_13) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= 0 (mod v_~y$w_buff1_used~0_48 256)) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_86, ~y$w_buff0~0=v_~y$w_buff0~0_17, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_85, ~y$w_buff1~0=v_~y$w_buff1~0_13, ~y$w_buff0~0=v_~y$w_buff0~0_16, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_48} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 07:46:24,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L802-1-->L804: Formula: (and (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2185~0.base_13| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2185~0.base_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2185~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2185~0.base_13|) |v_ULTIMATE.start_main_~#t2185~0.offset_11| 2)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t2185~0.offset_11|) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2185~0.base_13|) 0) (not (= |v_ULTIMATE.start_main_~#t2185~0.base_13| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2185~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2185~0.offset=|v_ULTIMATE.start_main_~#t2185~0.offset_11|, ULTIMATE.start_main_~#t2185~0.base=|v_ULTIMATE.start_main_~#t2185~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2185~0.offset, ULTIMATE.start_main_~#t2185~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 07:46:24,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L741-->L741-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1823639501 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1823639501 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1823639501|)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1823639501| ~y$w_buff0_used~0_In1823639501)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1823639501, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1823639501} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1823639501|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1823639501, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1823639501} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 07:46:24,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L757-2-->L757-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-2069646624 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-2069646624 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out-2069646624| ~y~0_In-2069646624) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out-2069646624| ~y$w_buff1~0_In-2069646624) (not .cse0) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2069646624, ~y$w_buff1~0=~y$w_buff1~0_In-2069646624, ~y~0=~y~0_In-2069646624, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2069646624} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2069646624, ~y$w_buff1~0=~y$w_buff1~0_In-2069646624, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-2069646624|, ~y~0=~y~0_In-2069646624, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2069646624} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 07:46:24,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L742-->L742-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In2073432309 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd1~0_In2073432309 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In2073432309 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In2073432309 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out2073432309| 0)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In2073432309 |P0Thread1of1ForFork0_#t~ite6_Out2073432309|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2073432309, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2073432309, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2073432309, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2073432309} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out2073432309|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2073432309, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2073432309, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2073432309, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2073432309} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 07:46:24,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L743-->L744: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-2073775356 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2073775356 256)))) (or (and (not .cse0) (= ~y$r_buff0_thd1~0_Out-2073775356 0) (not .cse1)) (and (= ~y$r_buff0_thd1~0_In-2073775356 ~y$r_buff0_thd1~0_Out-2073775356) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2073775356, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2073775356} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2073775356, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2073775356|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-2073775356} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 07:46:24,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L744-->L744-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In1469231385 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1469231385 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1469231385 256))) (.cse3 (= (mod ~y$r_buff1_thd1~0_In1469231385 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out1469231385| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite8_Out1469231385| ~y$r_buff1_thd1~0_In1469231385) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1469231385, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1469231385, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1469231385, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1469231385} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1469231385, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1469231385, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1469231385|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1469231385, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1469231385} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 07:46:24,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L744-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_14, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 07:46:24,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L777-2-->L777-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-33653718 256))) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-33653718 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite15_Out-33653718| ~y~0_In-33653718) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite15_Out-33653718| ~y$w_buff1~0_In-33653718) (not .cse1) (not .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-33653718, ~y$w_buff1~0=~y$w_buff1~0_In-33653718, ~y~0=~y~0_In-33653718, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-33653718} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-33653718, P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-33653718|, ~y$w_buff1~0=~y$w_buff1~0_In-33653718, ~y~0=~y~0_In-33653718, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-33653718} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 07:46:24,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-4-->L778: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~y~0_20) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~y~0=v_~y~0_20, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~y~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 07:46:24,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L757-4-->L758: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~y~0_21) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-27 07:46:24,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L758-->L758-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In745938849 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In745938849 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In745938849 |P1Thread1of1ForFork1_#t~ite11_Out745938849|)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out745938849| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In745938849, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In745938849} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In745938849, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In745938849, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out745938849|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 07:46:24,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L759-->L759-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1624302913 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1624302913 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1624302913 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1624302913 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-1624302913|)) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-1624302913 |P1Thread1of1ForFork1_#t~ite12_Out-1624302913|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1624302913, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1624302913, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1624302913, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1624302913} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1624302913, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1624302913, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1624302913, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1624302913|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1624302913} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 07:46:24,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L760-->L760-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1770198271 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1770198271 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out1770198271| ~y$r_buff0_thd2~0_In1770198271) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out1770198271| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1770198271, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1770198271} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1770198271, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1770198271, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1770198271|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 07:46:24,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L761-->L761-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In1957808630 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In1957808630 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1957808630 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1957808630 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out1957808630| ~y$r_buff1_thd2~0_In1957808630) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite14_Out1957808630| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1957808630, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1957808630, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1957808630, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1957808630} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1957808630, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1957808630, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1957808630, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1957808630|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1957808630} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 07:46:24,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L761-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 07:46:24,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-603085434 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-603085434 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out-603085434| 0)) (and (= |P2Thread1of1ForFork2_#t~ite17_Out-603085434| ~y$w_buff0_used~0_In-603085434) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-603085434, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-603085434} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-603085434, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-603085434, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-603085434|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 07:46:24,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L779-->L779-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In1910361739 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd3~0_In1910361739 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1910361739 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1910361739 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite18_Out1910361739|)) (and (= ~y$w_buff1_used~0_In1910361739 |P2Thread1of1ForFork2_#t~ite18_Out1910361739|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1910361739, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1910361739, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1910361739, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1910361739} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1910361739, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1910361739, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1910361739, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out1910361739|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1910361739} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 07:46:24,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1091802036 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1091802036 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out-1091802036| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd3~0_In-1091802036 |P2Thread1of1ForFork2_#t~ite19_Out-1091802036|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1091802036, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1091802036} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1091802036, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1091802036, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-1091802036|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 07:46:24,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In386306204 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In386306204 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In386306204 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In386306204 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite20_Out386306204| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$r_buff1_thd3~0_In386306204 |P2Thread1of1ForFork2_#t~ite20_Out386306204|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In386306204, ~y$w_buff0_used~0=~y$w_buff0_used~0_In386306204, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In386306204, ~y$w_buff1_used~0=~y$w_buff1_used~0_In386306204} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In386306204, ~y$w_buff0_used~0=~y$w_buff0_used~0_In386306204, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out386306204|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In386306204, ~y$w_buff1_used~0=~y$w_buff1_used~0_In386306204} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 07:46:24,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L781-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~y$r_buff1_thd3~0_12)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 07:46:24,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L804-1-->L810: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 07:46:24,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L810-2-->L810-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite24_Out1188810119| |ULTIMATE.start_main_#t~ite25_Out1188810119|)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1188810119 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1188810119 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite24_Out1188810119| ~y$w_buff1~0_In1188810119) .cse1 (not .cse2)) (and .cse1 (or .cse2 .cse0) (= |ULTIMATE.start_main_#t~ite24_Out1188810119| ~y~0_In1188810119)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1188810119, ~y~0=~y~0_In1188810119, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1188810119, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1188810119} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1188810119, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1188810119|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1188810119|, ~y~0=~y~0_In1188810119, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1188810119, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1188810119} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 07:46:24,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1838972364 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1838972364 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite26_Out-1838972364|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1838972364 |ULTIMATE.start_main_#t~ite26_Out-1838972364|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1838972364, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1838972364} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1838972364, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1838972364, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1838972364|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 07:46:24,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L812-->L812-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1906125233 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1906125233 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1906125233 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1906125233 256)))) (or (and (= |ULTIMATE.start_main_#t~ite27_Out-1906125233| ~y$w_buff1_used~0_In-1906125233) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite27_Out-1906125233| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1906125233, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1906125233, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1906125233, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1906125233} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1906125233, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1906125233, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1906125233|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1906125233, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1906125233} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 07:46:24,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In410007396 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In410007396 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite28_Out410007396|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In410007396 |ULTIMATE.start_main_#t~ite28_Out410007396|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In410007396, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In410007396} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out410007396|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In410007396, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In410007396} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 07:46:24,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-2078787828 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-2078787828 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-2078787828 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2078787828 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite29_Out-2078787828| ~y$r_buff1_thd0~0_In-2078787828) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite29_Out-2078787828| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2078787828, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2078787828, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2078787828, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2078787828} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2078787828, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-2078787828|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2078787828, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2078787828, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2078787828} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 07:46:24,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L823-->L823-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In799522837 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_In799522837| |ULTIMATE.start_main_#t~ite38_Out799522837|) (= ~y$w_buff1~0_In799522837 |ULTIMATE.start_main_#t~ite39_Out799522837|) (not .cse0)) (and .cse0 (= ~y$w_buff1~0_In799522837 |ULTIMATE.start_main_#t~ite38_Out799522837|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In799522837 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In799522837 256))) (and (= 0 (mod ~y$r_buff1_thd0~0_In799522837 256)) .cse1) (= (mod ~y$w_buff0_used~0_In799522837 256) 0))) (= |ULTIMATE.start_main_#t~ite39_Out799522837| |ULTIMATE.start_main_#t~ite38_Out799522837|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In799522837, ~y$w_buff0_used~0=~y$w_buff0_used~0_In799522837, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In799522837, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In799522837|, ~weak$$choice2~0=~weak$$choice2~0_In799522837, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In799522837, ~y$w_buff1_used~0=~y$w_buff1_used~0_In799522837} OutVars{~y$w_buff1~0=~y$w_buff1~0_In799522837, ~y$w_buff0_used~0=~y$w_buff0_used~0_In799522837, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out799522837|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In799522837, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out799522837|, ~weak$$choice2~0=~weak$$choice2~0_In799522837, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In799522837, ~y$w_buff1_used~0=~y$w_buff1_used~0_In799522837} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 07:46:24,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L824-->L824-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1750082754 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-1750082754| ~y$w_buff0_used~0_In-1750082754) (= |ULTIMATE.start_main_#t~ite41_In-1750082754| |ULTIMATE.start_main_#t~ite41_Out-1750082754|) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite41_Out-1750082754| ~y$w_buff0_used~0_In-1750082754) (= |ULTIMATE.start_main_#t~ite42_Out-1750082754| |ULTIMATE.start_main_#t~ite41_Out-1750082754|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1750082754 256)))) (or (= (mod ~y$w_buff0_used~0_In-1750082754 256) 0) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1750082754 256))) (and (= (mod ~y$w_buff1_used~0_In-1750082754 256) 0) .cse1))) .cse0))) InVars {ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_In-1750082754|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1750082754, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1750082754, ~weak$$choice2~0=~weak$$choice2~0_In-1750082754, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1750082754, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1750082754} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1750082754|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1750082754, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1750082754, ~weak$$choice2~0=~weak$$choice2~0_In-1750082754, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1750082754|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1750082754, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1750082754} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 07:46:24,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L826-->L827: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~y$r_buff0_thd0~0_65 v_~y$r_buff0_thd0~0_64)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_9|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 07:46:24,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L829-->L832-1: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= v_~y~0_25 v_~y$mem_tmp~0_7) (not (= 0 (mod v_~y$flush_delayed~0_11 256))) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:46:24,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L832-1-->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-27 07:46:24,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:46:24 BasicIcfg [2019-12-27 07:46:24,616 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:46:24,618 INFO L168 Benchmark]: Toolchain (without parser) took 78076.76 ms. Allocated memory was 138.9 MB in the beginning and 4.4 GB in the end (delta: 4.3 GB). Free memory was 102.1 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-27 07:46:24,619 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 07:46:24,619 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.96 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.9 MB in the beginning and 157.2 MB in the end (delta: -55.4 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-27 07:46:24,620 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.75 ms. Allocated memory is still 203.4 MB. Free memory was 157.2 MB in the beginning and 153.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 07:46:24,621 INFO L168 Benchmark]: Boogie Preprocessor took 39.76 ms. Allocated memory is still 203.4 MB. Free memory was 153.9 MB in the beginning and 151.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 07:46:24,621 INFO L168 Benchmark]: RCFGBuilder took 903.75 ms. Allocated memory is still 203.4 MB. Free memory was 151.3 MB in the beginning and 101.9 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2019-12-27 07:46:24,622 INFO L168 Benchmark]: TraceAbstraction took 76286.51 ms. Allocated memory was 203.4 MB in the beginning and 4.4 GB in the end (delta: 4.2 GB). Free memory was 101.2 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-27 07:46:24,625 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.20 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 774.96 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.9 MB in the beginning and 157.2 MB in the end (delta: -55.4 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.75 ms. Allocated memory is still 203.4 MB. Free memory was 157.2 MB in the beginning and 153.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.76 ms. Allocated memory is still 203.4 MB. Free memory was 153.9 MB in the beginning and 151.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 903.75 ms. Allocated memory is still 203.4 MB. Free memory was 151.3 MB in the beginning and 101.9 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 76286.51 ms. Allocated memory was 203.4 MB in the beginning and 4.4 GB in the end (delta: 4.2 GB). Free memory was 101.2 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 173 ProgramPointsBefore, 96 ProgramPointsAfterwards, 210 TransitionsBefore, 107 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 30 ChoiceCompositions, 5662 VarBasedMoverChecksPositive, 190 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 81965 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t2183, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L730] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L731] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L732] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L733] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L734] 1 y$r_buff0_thd1 = (_Bool)1 [L737] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] FCALL, FORK 0 pthread_create(&t2184, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L804] FCALL, FORK 0 pthread_create(&t2185, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L771] 3 __unbuffered_p2_EAX = x [L774] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, 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=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L777] 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 [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, 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=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L758] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] 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 [L760] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 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 [L780] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L810] 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_p2_EAX=2, 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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 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) [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 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 [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 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 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] 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_p2_EAX=2, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] 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) [L822] 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_p2_EAX=2, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 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)) [L823] 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)) [L824] 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)) [L825] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L825] 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)) [L827] 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_p2_EAX=2, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L827] 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)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 164 locations, 2 error locations. Result: UNSAFE, OverallTime: 75.9s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 18.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3168 SDtfs, 2726 SDslu, 6076 SDs, 0 SdLazy, 4591 SolverSat, 197 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 192 GetRequests, 53 SyntacticMatches, 21 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173329occurred 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: 31.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 63922 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 974 NumberOfCodeBlocks, 974 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 887 ConstructedInterpolants, 0 QuantifiedInterpolants, 157455 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...