/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:39:26,321 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:39:26,323 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:39:26,335 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:39:26,335 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:39:26,337 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:39:26,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:39:26,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:39:26,344 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:39:26,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:39:26,346 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:39:26,347 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:39:26,348 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:39:26,349 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:39:26,350 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:39:26,351 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:39:26,352 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:39:26,352 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:39:26,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:39:26,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:39:26,358 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:39:26,359 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:39:26,361 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:39:26,361 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:39:26,364 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:39:26,364 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:39:26,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:39:26,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:39:26,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:39:26,367 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:39:26,368 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:39:26,369 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:39:26,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:39:26,370 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:39:26,371 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:39:26,372 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:39:26,373 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:39:26,374 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:39:26,374 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:39:26,378 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:39:26,379 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:39:26,381 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-MCR.epf [2019-12-27 21:39:26,406 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:39:26,406 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:39:26,408 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:39:26,408 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:39:26,408 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:39:26,408 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:39:26,409 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:39:26,409 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:39:26,409 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:39:26,410 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:39:26,411 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:39:26,411 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:39:26,411 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:39:26,412 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:39:26,412 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:39:26,412 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:39:26,412 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:39:26,413 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:39:26,413 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:39:26,413 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:39:26,414 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:39:26,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:39:26,414 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:39:26,414 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:39:26,414 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:39:26,415 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:39:26,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:39:26,415 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:39:26,415 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:39:26,415 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:39:26,417 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:39:26,417 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:39:26,742 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:39:26,765 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:39:26,769 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:39:26,770 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:39:26,771 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:39:26,772 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_rmo.opt.i [2019-12-27 21:39:26,838 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19989bd4f/c2e92da9d83c48f49328aa0e960962c2/FLAG93c63ac04 [2019-12-27 21:39:27,355 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:39:27,357 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_rmo.opt.i [2019-12-27 21:39:27,379 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19989bd4f/c2e92da9d83c48f49328aa0e960962c2/FLAG93c63ac04 [2019-12-27 21:39:27,632 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19989bd4f/c2e92da9d83c48f49328aa0e960962c2 [2019-12-27 21:39:27,644 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:39:27,646 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:39:27,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:39:27,649 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:39:27,653 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:39:27,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:39:27" (1/1) ... [2019-12-27 21:39:27,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62e11d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:27, skipping insertion in model container [2019-12-27 21:39:27,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:39:27" (1/1) ... [2019-12-27 21:39:27,666 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:39:27,708 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:39:28,253 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:39:28,272 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:39:28,381 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:39:28,456 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:39:28,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:28 WrapperNode [2019-12-27 21:39:28,457 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:39:28,458 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:39:28,458 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:39:28,458 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:39:28,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:28" (1/1) ... [2019-12-27 21:39:28,486 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:28" (1/1) ... [2019-12-27 21:39:28,534 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:39:28,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:39:28,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:39:28,535 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:39:28,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:28" (1/1) ... [2019-12-27 21:39:28,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:28" (1/1) ... [2019-12-27 21:39:28,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:28" (1/1) ... [2019-12-27 21:39:28,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:28" (1/1) ... [2019-12-27 21:39:28,558 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:28" (1/1) ... [2019-12-27 21:39:28,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:28" (1/1) ... [2019-12-27 21:39:28,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:28" (1/1) ... [2019-12-27 21:39:28,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:39:28,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:39:28,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:39:28,579 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:39:28,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:28" (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 21:39:28,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:39:28,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:39:28,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:39:28,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:39:28,640 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:39:28,640 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:39:28,640 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:39:28,641 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:39:28,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:39:28,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:39:28,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:39:28,643 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 21:39:29,308 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:39:29,309 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:39:29,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:39:29 BoogieIcfgContainer [2019-12-27 21:39:29,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:39:29,312 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:39:29,312 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:39:29,315 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:39:29,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:39:27" (1/3) ... [2019-12-27 21:39:29,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57042738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:39:29, skipping insertion in model container [2019-12-27 21:39:29,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:39:28" (2/3) ... [2019-12-27 21:39:29,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57042738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:39:29, skipping insertion in model container [2019-12-27 21:39:29,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:39:29" (3/3) ... [2019-12-27 21:39:29,320 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_rmo.opt.i [2019-12-27 21:39:29,332 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:39:29,332 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:39:29,341 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:39:29,342 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:39:29,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,396 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,396 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,407 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,407 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,408 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,410 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,410 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,427 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,428 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,431 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,432 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,432 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:39:29,468 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 21:39:29,485 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:39:29,485 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:39:29,485 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:39:29,485 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:39:29,485 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:39:29,485 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:39:29,485 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:39:29,486 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:39:29,503 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-27 21:39:29,505 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 21:39:29,591 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 21:39:29,592 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:39:29,607 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 266 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:39:29,624 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 21:39:29,670 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 21:39:29,670 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:39:29,675 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 266 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:39:29,688 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-27 21:39:29,689 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:39:32,660 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 21:39:32,774 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 21:39:32,798 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48801 [2019-12-27 21:39:32,798 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-27 21:39:32,802 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 93 transitions [2019-12-27 21:39:33,324 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9180 states. [2019-12-27 21:39:33,327 INFO L276 IsEmpty]: Start isEmpty. Operand 9180 states. [2019-12-27 21:39:33,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 21:39:33,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:33,339 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 21:39:33,340 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:33,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:33,346 INFO L82 PathProgramCache]: Analyzing trace with hash 690083796, now seen corresponding path program 1 times [2019-12-27 21:39:33,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:33,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085199172] [2019-12-27 21:39:33,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:33,591 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 21:39:33,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085199172] [2019-12-27 21:39:33,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:33,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:39:33,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [731978897] [2019-12-27 21:39:33,594 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:33,600 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:33,612 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 21:39:33,613 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:33,617 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:39:33,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:39:33,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:33,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:39:33,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:39:33,632 INFO L87 Difference]: Start difference. First operand 9180 states. Second operand 3 states. [2019-12-27 21:39:33,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:33,899 INFO L93 Difference]: Finished difference Result 9108 states and 29960 transitions. [2019-12-27 21:39:33,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:39:33,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 21:39:33,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:33,988 INFO L225 Difference]: With dead ends: 9108 [2019-12-27 21:39:33,988 INFO L226 Difference]: Without dead ends: 8926 [2019-12-27 21:39:33,989 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 21:39:34,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8926 states. [2019-12-27 21:39:34,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8926 to 8926. [2019-12-27 21:39:34,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8926 states. [2019-12-27 21:39:34,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8926 states to 8926 states and 29401 transitions. [2019-12-27 21:39:34,495 INFO L78 Accepts]: Start accepts. Automaton has 8926 states and 29401 transitions. Word has length 5 [2019-12-27 21:39:34,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:34,496 INFO L462 AbstractCegarLoop]: Abstraction has 8926 states and 29401 transitions. [2019-12-27 21:39:34,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:39:34,496 INFO L276 IsEmpty]: Start isEmpty. Operand 8926 states and 29401 transitions. [2019-12-27 21:39:34,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:39:34,500 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:34,500 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:34,500 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:34,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:34,501 INFO L82 PathProgramCache]: Analyzing trace with hash 741678959, now seen corresponding path program 1 times [2019-12-27 21:39:34,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:34,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063420173] [2019-12-27 21:39:34,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:34,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:39:34,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063420173] [2019-12-27 21:39:34,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:34,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:39:34,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1387871369] [2019-12-27 21:39:34,592 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:34,593 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:34,595 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:39:34,595 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:34,595 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:39:34,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:39:34,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:34,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:39:34,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:39:34,598 INFO L87 Difference]: Start difference. First operand 8926 states and 29401 transitions. Second operand 3 states. [2019-12-27 21:39:34,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:34,620 INFO L93 Difference]: Finished difference Result 1402 states and 3230 transitions. [2019-12-27 21:39:34,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:39:34,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 21:39:34,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:34,628 INFO L225 Difference]: With dead ends: 1402 [2019-12-27 21:39:34,629 INFO L226 Difference]: Without dead ends: 1402 [2019-12-27 21:39:34,630 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 21:39:34,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2019-12-27 21:39:34,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1402. [2019-12-27 21:39:34,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2019-12-27 21:39:34,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 3230 transitions. [2019-12-27 21:39:34,666 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 3230 transitions. Word has length 11 [2019-12-27 21:39:34,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:34,667 INFO L462 AbstractCegarLoop]: Abstraction has 1402 states and 3230 transitions. [2019-12-27 21:39:34,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:39:34,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 3230 transitions. [2019-12-27 21:39:34,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:39:34,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:34,668 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:34,668 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:34,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:34,669 INFO L82 PathProgramCache]: Analyzing trace with hash 520956806, now seen corresponding path program 1 times [2019-12-27 21:39:34,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:34,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539060600] [2019-12-27 21:39:34,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:34,771 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 21:39:34,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539060600] [2019-12-27 21:39:34,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:34,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:39:34,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [953786475] [2019-12-27 21:39:34,772 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:34,774 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:34,777 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 21:39:34,777 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:34,816 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:39:34,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:39:34,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:34,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:39:34,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:39:34,817 INFO L87 Difference]: Start difference. First operand 1402 states and 3230 transitions. Second operand 5 states. [2019-12-27 21:39:35,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:35,149 INFO L93 Difference]: Finished difference Result 1878 states and 4185 transitions. [2019-12-27 21:39:35,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:39:35,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-27 21:39:35,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:35,164 INFO L225 Difference]: With dead ends: 1878 [2019-12-27 21:39:35,164 INFO L226 Difference]: Without dead ends: 1878 [2019-12-27 21:39:35,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:39:35,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2019-12-27 21:39:35,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1726. [2019-12-27 21:39:35,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-12-27 21:39:35,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 3896 transitions. [2019-12-27 21:39:35,232 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 3896 transitions. Word has length 11 [2019-12-27 21:39:35,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:35,232 INFO L462 AbstractCegarLoop]: Abstraction has 1726 states and 3896 transitions. [2019-12-27 21:39:35,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:39:35,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 3896 transitions. [2019-12-27 21:39:35,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 21:39:35,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:35,242 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] [2019-12-27 21:39:35,242 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:35,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:35,242 INFO L82 PathProgramCache]: Analyzing trace with hash -707662606, now seen corresponding path program 1 times [2019-12-27 21:39:35,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:35,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831339878] [2019-12-27 21:39:35,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:35,353 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 21:39:35,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831339878] [2019-12-27 21:39:35,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:35,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:39:35,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1729536716] [2019-12-27 21:39:35,357 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:35,365 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:35,372 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 71 transitions. [2019-12-27 21:39:35,372 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:35,411 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:39:35,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:39:35,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:35,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:39:35,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:39:35,412 INFO L87 Difference]: Start difference. First operand 1726 states and 3896 transitions. Second operand 5 states. [2019-12-27 21:39:35,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:35,435 INFO L93 Difference]: Finished difference Result 357 states and 661 transitions. [2019-12-27 21:39:35,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:39:35,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 21:39:35,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:35,439 INFO L225 Difference]: With dead ends: 357 [2019-12-27 21:39:35,440 INFO L226 Difference]: Without dead ends: 357 [2019-12-27 21:39:35,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 21:39:35,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-12-27 21:39:35,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 322. [2019-12-27 21:39:35,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-12-27 21:39:35,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 596 transitions. [2019-12-27 21:39:35,448 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 596 transitions. Word has length 23 [2019-12-27 21:39:35,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:35,448 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 596 transitions. [2019-12-27 21:39:35,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:39:35,448 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 596 transitions. [2019-12-27 21:39:35,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:39:35,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:35,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:35,451 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:35,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:35,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1936914374, now seen corresponding path program 1 times [2019-12-27 21:39:35,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:35,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480639114] [2019-12-27 21:39:35,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:35,556 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 21:39:35,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480639114] [2019-12-27 21:39:35,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:35,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:39:35,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [807889035] [2019-12-27 21:39:35,558 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:35,653 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:35,689 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 77 states and 100 transitions. [2019-12-27 21:39:35,690 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:35,691 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:39:35,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:39:35,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:35,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:39:35,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:39:35,692 INFO L87 Difference]: Start difference. First operand 322 states and 596 transitions. Second operand 3 states. [2019-12-27 21:39:35,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:35,745 INFO L93 Difference]: Finished difference Result 332 states and 611 transitions. [2019-12-27 21:39:35,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:39:35,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 21:39:35,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:35,748 INFO L225 Difference]: With dead ends: 332 [2019-12-27 21:39:35,748 INFO L226 Difference]: Without dead ends: 332 [2019-12-27 21:39:35,748 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 21:39:35,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-12-27 21:39:35,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 328. [2019-12-27 21:39:35,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-27 21:39:35,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 607 transitions. [2019-12-27 21:39:35,756 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 607 transitions. Word has length 52 [2019-12-27 21:39:35,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:35,757 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 607 transitions. [2019-12-27 21:39:35,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:39:35,757 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 607 transitions. [2019-12-27 21:39:35,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:39:35,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:35,759 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:35,759 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:35,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:35,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1506335965, now seen corresponding path program 1 times [2019-12-27 21:39:35,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:35,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283708547] [2019-12-27 21:39:35,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:35,865 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 21:39:35,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283708547] [2019-12-27 21:39:35,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:35,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:39:35,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1048751696] [2019-12-27 21:39:35,867 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:35,880 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:35,915 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 77 states and 100 transitions. [2019-12-27 21:39:35,915 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:35,924 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:39:35,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:39:35,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:35,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:39:35,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:39:35,925 INFO L87 Difference]: Start difference. First operand 328 states and 607 transitions. Second operand 5 states. [2019-12-27 21:39:36,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:36,151 INFO L93 Difference]: Finished difference Result 459 states and 843 transitions. [2019-12-27 21:39:36,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:39:36,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-27 21:39:36,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:36,155 INFO L225 Difference]: With dead ends: 459 [2019-12-27 21:39:36,156 INFO L226 Difference]: Without dead ends: 459 [2019-12-27 21:39:36,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 5 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 21:39:36,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-12-27 21:39:36,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 375. [2019-12-27 21:39:36,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-12-27 21:39:36,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 698 transitions. [2019-12-27 21:39:36,164 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 698 transitions. Word has length 52 [2019-12-27 21:39:36,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:36,164 INFO L462 AbstractCegarLoop]: Abstraction has 375 states and 698 transitions. [2019-12-27 21:39:36,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:39:36,165 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 698 transitions. [2019-12-27 21:39:36,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:39:36,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:36,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:36,166 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:36,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:36,167 INFO L82 PathProgramCache]: Analyzing trace with hash -788706827, now seen corresponding path program 2 times [2019-12-27 21:39:36,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:36,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592285635] [2019-12-27 21:39:36,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:36,312 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 21:39:36,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592285635] [2019-12-27 21:39:36,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:36,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:39:36,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [610507863] [2019-12-27 21:39:36,314 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:36,327 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:36,357 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 90 transitions. [2019-12-27 21:39:36,357 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:36,384 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:39:36,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:39:36,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:36,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:39:36,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:39:36,385 INFO L87 Difference]: Start difference. First operand 375 states and 698 transitions. Second operand 5 states. [2019-12-27 21:39:36,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:36,527 INFO L93 Difference]: Finished difference Result 451 states and 808 transitions. [2019-12-27 21:39:36,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:39:36,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-27 21:39:36,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:36,530 INFO L225 Difference]: With dead ends: 451 [2019-12-27 21:39:36,530 INFO L226 Difference]: Without dead ends: 451 [2019-12-27 21:39:36,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:39:36,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-12-27 21:39:36,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 363. [2019-12-27 21:39:36,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-12-27 21:39:36,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 661 transitions. [2019-12-27 21:39:36,539 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 661 transitions. Word has length 52 [2019-12-27 21:39:36,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:36,539 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 661 transitions. [2019-12-27 21:39:36,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:39:36,539 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 661 transitions. [2019-12-27 21:39:36,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 21:39:36,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:36,540 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] [2019-12-27 21:39:36,541 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:36,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:36,541 INFO L82 PathProgramCache]: Analyzing trace with hash -817414714, now seen corresponding path program 1 times [2019-12-27 21:39:36,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:36,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708521932] [2019-12-27 21:39:36,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:36,612 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 21:39:36,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708521932] [2019-12-27 21:39:36,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:36,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:39:36,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1319192760] [2019-12-27 21:39:36,613 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:36,626 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:36,658 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 77 states and 99 transitions. [2019-12-27 21:39:36,658 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:36,659 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:39:36,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:39:36,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:36,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:39:36,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:39:36,660 INFO L87 Difference]: Start difference. First operand 363 states and 661 transitions. Second operand 3 states. [2019-12-27 21:39:36,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:36,712 INFO L93 Difference]: Finished difference Result 363 states and 660 transitions. [2019-12-27 21:39:36,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:39:36,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 21:39:36,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:36,714 INFO L225 Difference]: With dead ends: 363 [2019-12-27 21:39:36,714 INFO L226 Difference]: Without dead ends: 363 [2019-12-27 21:39:36,715 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 21:39:36,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-12-27 21:39:36,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 274. [2019-12-27 21:39:36,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-12-27 21:39:36,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 499 transitions. [2019-12-27 21:39:36,721 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 499 transitions. Word has length 53 [2019-12-27 21:39:36,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:36,721 INFO L462 AbstractCegarLoop]: Abstraction has 274 states and 499 transitions. [2019-12-27 21:39:36,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:39:36,721 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 499 transitions. [2019-12-27 21:39:36,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 21:39:36,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:36,723 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:36,723 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:36,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:36,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1599315070, now seen corresponding path program 1 times [2019-12-27 21:39:36,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:36,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170985760] [2019-12-27 21:39:36,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:36,867 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 21:39:36,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170985760] [2019-12-27 21:39:36,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:36,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:39:36,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [386425405] [2019-12-27 21:39:36,871 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:36,885 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:36,987 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 122 transitions. [2019-12-27 21:39:36,987 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:37,008 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:39:37,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:39:37,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:37,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:39:37,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:39:37,010 INFO L87 Difference]: Start difference. First operand 274 states and 499 transitions. Second operand 8 states. [2019-12-27 21:39:37,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:37,183 INFO L93 Difference]: Finished difference Result 489 states and 885 transitions. [2019-12-27 21:39:37,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 21:39:37,183 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-27 21:39:37,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:37,185 INFO L225 Difference]: With dead ends: 489 [2019-12-27 21:39:37,185 INFO L226 Difference]: Without dead ends: 234 [2019-12-27 21:39:37,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:39:37,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-12-27 21:39:37,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 210. [2019-12-27 21:39:37,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-12-27 21:39:37,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 372 transitions. [2019-12-27 21:39:37,190 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 372 transitions. Word has length 54 [2019-12-27 21:39:37,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:37,190 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 372 transitions. [2019-12-27 21:39:37,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:39:37,191 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 372 transitions. [2019-12-27 21:39:37,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 21:39:37,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:37,191 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:37,192 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:37,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:37,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1986508478, now seen corresponding path program 2 times [2019-12-27 21:39:37,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:37,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780089483] [2019-12-27 21:39:37,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:37,492 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 21:39:37,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780089483] [2019-12-27 21:39:37,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:37,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 21:39:37,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1133689994] [2019-12-27 21:39:37,494 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:37,508 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:37,532 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 75 transitions. [2019-12-27 21:39:37,532 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:37,544 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:39:37,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 21:39:37,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:37,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 21:39:37,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:39:37,545 INFO L87 Difference]: Start difference. First operand 210 states and 372 transitions. Second operand 14 states. [2019-12-27 21:39:38,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:38,137 INFO L93 Difference]: Finished difference Result 378 states and 653 transitions. [2019-12-27 21:39:38,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 21:39:38,137 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-27 21:39:38,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:38,140 INFO L225 Difference]: With dead ends: 378 [2019-12-27 21:39:38,141 INFO L226 Difference]: Without dead ends: 344 [2019-12-27 21:39:38,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2019-12-27 21:39:38,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-12-27 21:39:38,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 310. [2019-12-27 21:39:38,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-12-27 21:39:38,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 543 transitions. [2019-12-27 21:39:38,213 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 543 transitions. Word has length 54 [2019-12-27 21:39:38,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:38,213 INFO L462 AbstractCegarLoop]: Abstraction has 310 states and 543 transitions. [2019-12-27 21:39:38,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 21:39:38,213 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 543 transitions. [2019-12-27 21:39:38,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 21:39:38,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:38,215 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:38,215 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:38,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:38,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1943073384, now seen corresponding path program 3 times [2019-12-27 21:39:38,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:38,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489969999] [2019-12-27 21:39:38,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:39:38,477 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 21:39:38,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489969999] [2019-12-27 21:39:38,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:39:38,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 21:39:38,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [682891807] [2019-12-27 21:39:38,478 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:39:38,512 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:39:38,563 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 111 transitions. [2019-12-27 21:39:38,563 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:39:38,631 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:39:38,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 21:39:38,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:39:38,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 21:39:38,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:39:38,632 INFO L87 Difference]: Start difference. First operand 310 states and 543 transitions. Second operand 13 states. [2019-12-27 21:39:39,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:39:39,108 INFO L93 Difference]: Finished difference Result 414 states and 704 transitions. [2019-12-27 21:39:39,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 21:39:39,108 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 21:39:39,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:39:39,111 INFO L225 Difference]: With dead ends: 414 [2019-12-27 21:39:39,111 INFO L226 Difference]: Without dead ends: 380 [2019-12-27 21:39:39,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2019-12-27 21:39:39,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-12-27 21:39:39,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 318. [2019-12-27 21:39:39,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-12-27 21:39:39,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 557 transitions. [2019-12-27 21:39:39,119 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 557 transitions. Word has length 54 [2019-12-27 21:39:39,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:39:39,119 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 557 transitions. [2019-12-27 21:39:39,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 21:39:39,119 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 557 transitions. [2019-12-27 21:39:39,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 21:39:39,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:39:39,120 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:39:39,120 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:39:39,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:39:39,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1497243502, now seen corresponding path program 4 times [2019-12-27 21:39:39,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:39:39,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876127730] [2019-12-27 21:39:39,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:39:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:39:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:39:39,256 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:39:39,256 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:39:39,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1451~0.base_22| 4)) (= |v_ULTIMATE.start_main_~#t1451~0.offset_17| 0) (= 0 v_~x$read_delayed_var~0.base_6) (= v_~main$tmp_guard0~0_10 0) (= v_~x$r_buff1_thd1~0_19 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1451~0.base_22| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1451~0.base_22|) |v_ULTIMATE.start_main_~#t1451~0.offset_17| 0)) |v_#memory_int_13|) (= 0 v_~__unbuffered_p1_EAX~0_11) (= 0 v_~x$w_buff1~0_25) (= v_~main$tmp_guard1~0_11 0) (= v_~x~0_27 0) (= v_~x$flush_delayed~0_16 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1451~0.base_22|) (= 0 v_~x$w_buff0_used~0_104) (= 0 v_~x$read_delayed~0_6) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= v_~x$w_buff1_used~0_65 0) (= v_~x$r_buff1_thd0~0_48 0) (= 0 v_~x$r_buff0_thd0~0_76) (= v_~x$r_buff1_thd2~0_16 0) (= 0 v_~y~0_8) (= |v_#NULL.offset_4| 0) (= 0 v_~x$r_buff0_thd2~0_25) (= v_~x$mem_tmp~0_11 0) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t1451~0.base_22| 1)) (= 0 v_~weak$$choice0~0_6) (= (select .cse0 |v_ULTIMATE.start_main_~#t1451~0.base_22|) 0) (= 0 v_~x$w_buff0~0_28) (= 0 v_~__unbuffered_cnt~0_16) (= 0 v_~x$r_buff0_thd1~0_19))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_28, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_14|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_9|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_9|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_14|, ULTIMATE.start_main_~#t1452~0.base=|v_ULTIMATE.start_main_~#t1452~0.base_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, #length=|v_#length_15|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_76, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_11|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_7|, ~x$w_buff1~0=v_~x$w_buff1~0_25, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~x~0=v_~x~0_27, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_19, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_12|, ~y~0=v_~y~0_8, ULTIMATE.start_main_~#t1451~0.base=|v_ULTIMATE.start_main_~#t1451~0.base_22|, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_11|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_12|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_11|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_48, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, ULTIMATE.start_main_~#t1452~0.offset=|v_ULTIMATE.start_main_~#t1452~0.offset_14|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_15|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104, ULTIMATE.start_main_~#t1451~0.offset=|v_ULTIMATE.start_main_~#t1451~0.offset_17|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t1452~0.base, ~__unbuffered_p1_EAX~0, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~y~0, ULTIMATE.start_main_~#t1451~0.base, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_~#t1452~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t1451~0.offset, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 21:39:39,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L779-1-->L781: Formula: (and (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1452~0.base_10|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1452~0.base_10| 4)) (not (= |v_ULTIMATE.start_main_~#t1452~0.base_10| 0)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1452~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1452~0.base_10|) |v_ULTIMATE.start_main_~#t1452~0.offset_9| 1))) (= |v_ULTIMATE.start_main_~#t1452~0.offset_9| 0) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1452~0.base_10| 1)) (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1452~0.base_10|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1452~0.offset=|v_ULTIMATE.start_main_~#t1452~0.offset_9|, ULTIMATE.start_main_~#t1452~0.base=|v_ULTIMATE.start_main_~#t1452~0.base_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1452~0.offset, ULTIMATE.start_main_~#t1452~0.base] because there is no mapped edge [2019-12-27 21:39:39,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [623] [623] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_18) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= 0 (mod v_~x$w_buff1_used~0_57 256)) (= 1 v_~x$w_buff0_used~0_88) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= v_~x$w_buff1_used~0_57 v_~x$w_buff0_used~0_89) (= 2 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_89} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_18, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_57, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 21:39:39,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L728-2-->L728-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out565734485| |P0Thread1of1ForFork0_#t~ite3_Out565734485|)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In565734485 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In565734485 256)))) (or (and .cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out565734485| ~x$w_buff1~0_In565734485) (not .cse1) (not .cse2)) (and .cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out565734485| ~x~0_In565734485) (or .cse2 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In565734485, ~x$w_buff1_used~0=~x$w_buff1_used~0_In565734485, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In565734485, ~x~0=~x~0_In565734485} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out565734485|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out565734485|, ~x$w_buff1~0=~x$w_buff1~0_In565734485, ~x$w_buff1_used~0=~x$w_buff1_used~0_In565734485, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In565734485, ~x~0=~x~0_In565734485} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 21:39:39,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L729-->L729-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-831298511 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-831298511 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-831298511|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-831298511 |P0Thread1of1ForFork0_#t~ite5_Out-831298511|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-831298511, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-831298511} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-831298511|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-831298511, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-831298511} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 21:39:39,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L730-->L730-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd1~0_In-1456456221 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1456456221 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-1456456221 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1456456221 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1456456221|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-1456456221 |P0Thread1of1ForFork0_#t~ite6_Out-1456456221|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1456456221, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1456456221, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1456456221, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1456456221} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1456456221|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1456456221, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1456456221, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1456456221, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1456456221} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 21:39:39,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L757-->L757-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-286021796 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-286021796 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-286021796| 0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-286021796 |P1Thread1of1ForFork1_#t~ite11_Out-286021796|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-286021796, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-286021796} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-286021796|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-286021796, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-286021796} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 21:39:39,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L731-->L731-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-830315897 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-830315897 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite7_Out-830315897| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite7_Out-830315897| ~x$r_buff0_thd1~0_In-830315897)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-830315897, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-830315897} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-830315897, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-830315897|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-830315897} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 21:39:39,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L732-->L732-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1274355768 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In1274355768 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1274355768 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In1274355768 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out1274355768| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out1274355768| ~x$r_buff1_thd1~0_In1274355768)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1274355768, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1274355768, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1274355768, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1274355768} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1274355768, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1274355768|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1274355768, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1274355768, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1274355768} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 21:39:39,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L732-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{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_9, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 21:39:39,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L758-->L758-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-1025051734 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-1025051734 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1025051734 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1025051734 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-1025051734|)) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1025051734 |P1Thread1of1ForFork1_#t~ite12_Out-1025051734|) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1025051734, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1025051734, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1025051734, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1025051734} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1025051734, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1025051734, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1025051734|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1025051734, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1025051734} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 21:39:39,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L759-->L760: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1702211929 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1702211929 256)))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out-1702211929) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In-1702211929 ~x$r_buff0_thd2~0_Out-1702211929)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1702211929, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1702211929} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1702211929|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1702211929, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1702211929} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 21:39:39,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L760-->L760-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-111763616 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-111763616 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-111763616 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-111763616 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-111763616| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite14_Out-111763616| ~x$r_buff1_thd2~0_In-111763616)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-111763616, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-111763616, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-111763616, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-111763616} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-111763616, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-111763616, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-111763616, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-111763616|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-111763616} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 21:39:39,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L760-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_12 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 21:39:39,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [586] [586] L781-1-->L787: Formula: (and (= v_~main$tmp_guard0~0_4 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 21:39:39,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L787-2-->L787-5: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1823770630 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In1823770630 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite17_Out1823770630| |ULTIMATE.start_main_#t~ite18_Out1823770630|))) (or (and (= |ULTIMATE.start_main_#t~ite17_Out1823770630| ~x$w_buff1~0_In1823770630) (not .cse0) (not .cse1) .cse2) (and (or .cse1 .cse0) .cse2 (= |ULTIMATE.start_main_#t~ite17_Out1823770630| ~x~0_In1823770630)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1823770630, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1823770630, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1823770630, ~x~0=~x~0_In1823770630} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out1823770630|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1823770630|, ~x$w_buff1~0=~x$w_buff1~0_In1823770630, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1823770630, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1823770630, ~x~0=~x~0_In1823770630} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-27 21:39:39,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In752450834 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In752450834 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite19_Out752450834|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In752450834 |ULTIMATE.start_main_#t~ite19_Out752450834|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In752450834, ~x$w_buff0_used~0=~x$w_buff0_used~0_In752450834} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In752450834, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out752450834|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In752450834} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 21:39:39,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L789-->L789-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In890552277 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In890552277 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In890552277 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In890552277 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite20_Out890552277| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite20_Out890552277| ~x$w_buff1_used~0_In890552277)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In890552277, ~x$w_buff1_used~0=~x$w_buff1_used~0_In890552277, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In890552277, ~x$w_buff0_used~0=~x$w_buff0_used~0_In890552277} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In890552277, ~x$w_buff1_used~0=~x$w_buff1_used~0_In890552277, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out890552277|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In890552277, ~x$w_buff0_used~0=~x$w_buff0_used~0_In890552277} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 21:39:39,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L790-->L790-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-111710863 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-111710863 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-111710863| ~x$r_buff0_thd0~0_In-111710863)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-111710863| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-111710863, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-111710863} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-111710863, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-111710863|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-111710863} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 21:39:39,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L791-->L791-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In-384982587 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-384982587 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-384982587 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-384982587 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out-384982587| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~x$r_buff1_thd0~0_In-384982587 |ULTIMATE.start_main_#t~ite22_Out-384982587|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-384982587, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-384982587, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-384982587, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-384982587} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-384982587, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-384982587, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-384982587, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-384982587|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-384982587} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 21:39:39,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L800-->L800-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1198464963 256)))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1198464963 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In-1198464963 256) 0) .cse0) (= (mod ~x$w_buff0_used~0_In-1198464963 256) 0) (and .cse0 (= (mod ~x$r_buff1_thd0~0_In-1198464963 256) 0)))) (= |ULTIMATE.start_main_#t~ite31_Out-1198464963| ~x$w_buff1~0_In-1198464963) .cse1 (= |ULTIMATE.start_main_#t~ite32_Out-1198464963| |ULTIMATE.start_main_#t~ite31_Out-1198464963|)) (and (= |ULTIMATE.start_main_#t~ite32_Out-1198464963| ~x$w_buff1~0_In-1198464963) (= |ULTIMATE.start_main_#t~ite31_In-1198464963| |ULTIMATE.start_main_#t~ite31_Out-1198464963|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1198464963, ~x$w_buff1~0=~x$w_buff1~0_In-1198464963, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1198464963, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1198464963, ~weak$$choice2~0=~weak$$choice2~0_In-1198464963, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In-1198464963|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1198464963} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1198464963, ~x$w_buff1~0=~x$w_buff1~0_In-1198464963, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1198464963, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-1198464963|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1198464963, ~weak$$choice2~0=~weak$$choice2~0_In-1198464963, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-1198464963|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1198464963} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-27 21:39:39,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L803-->L804: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~x$r_buff0_thd0~0_65 v_~x$r_buff0_thd0~0_64)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_9|, ~weak$$choice2~0=v_~weak$$choice2~0_25} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 21:39:39,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L806-->L809-1: Formula: (and (not (= 0 (mod v_~x$flush_delayed~0_11 256))) (= (mod v_~main$tmp_guard1~0_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_~x$mem_tmp~0_7 v_~x~0_22) (= v_~x$flush_delayed~0_10 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~x$mem_tmp~0=v_~x$mem_tmp~0_7} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~x$mem_tmp~0=v_~x$mem_tmp~0_7, ~x~0=v_~x~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:39:39,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 21:39:39,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:39:39 BasicIcfg [2019-12-27 21:39:39,382 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:39:39,384 INFO L168 Benchmark]: Toolchain (without parser) took 11738.12 ms. Allocated memory was 140.5 MB in the beginning and 457.2 MB in the end (delta: 316.7 MB). Free memory was 102.1 MB in the beginning and 121.5 MB in the end (delta: -19.4 MB). Peak memory consumption was 297.2 MB. Max. memory is 7.1 GB. [2019-12-27 21:39:39,384 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 140.5 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 21:39:39,385 INFO L168 Benchmark]: CACSL2BoogieTranslator took 808.68 ms. Allocated memory was 140.5 MB in the beginning and 202.9 MB in the end (delta: 62.4 MB). Free memory was 101.6 MB in the beginning and 156.8 MB in the end (delta: -55.1 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:39:39,386 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.29 ms. Allocated memory is still 202.9 MB. Free memory was 156.8 MB in the beginning and 153.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:39:39,386 INFO L168 Benchmark]: Boogie Preprocessor took 38.00 ms. Allocated memory is still 202.9 MB. Free memory was 153.6 MB in the beginning and 151.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:39:39,387 INFO L168 Benchmark]: RCFGBuilder took 731.71 ms. Allocated memory is still 202.9 MB. Free memory was 151.1 MB in the beginning and 107.0 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:39:39,388 INFO L168 Benchmark]: TraceAbstraction took 10070.08 ms. Allocated memory was 202.9 MB in the beginning and 457.2 MB in the end (delta: 254.3 MB). Free memory was 107.0 MB in the beginning and 121.5 MB in the end (delta: -14.5 MB). Peak memory consumption was 239.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:39:39,392 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.21 ms. Allocated memory is still 140.5 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 808.68 ms. Allocated memory was 140.5 MB in the beginning and 202.9 MB in the end (delta: 62.4 MB). Free memory was 101.6 MB in the beginning and 156.8 MB in the end (delta: -55.1 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.29 ms. Allocated memory is still 202.9 MB. Free memory was 156.8 MB in the beginning and 153.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.00 ms. Allocated memory is still 202.9 MB. Free memory was 153.6 MB in the beginning and 151.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 731.71 ms. Allocated memory is still 202.9 MB. Free memory was 151.1 MB in the beginning and 107.0 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10070.08 ms. Allocated memory was 202.9 MB in the beginning and 457.2 MB in the end (delta: 254.3 MB). Free memory was 107.0 MB in the beginning and 121.5 MB in the end (delta: -14.5 MB). Peak memory consumption was 239.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 146 ProgramPointsBefore, 80 ProgramPointsAfterwards, 180 TransitionsBefore, 93 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 24 ChoiceCompositions, 3674 VarBasedMoverChecksPositive, 148 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48801 CheckedPairsTotal, 97 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L779] FCALL, FORK 0 pthread_create(&t1451, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] FCALL, FORK 0 pthread_create(&t1452, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L748] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L749] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L750] 2 x$r_buff0_thd2 = (_Bool)1 [L753] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 1 y = 1 [L725] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L729] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L730] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L731] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L787] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L788] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L789] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L790] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L791] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 x$flush_delayed = weak$$choice2 [L797] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L799] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L800] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L801] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L802] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L804] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 9.7s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1073 SDtfs, 1299 SDslu, 2492 SDs, 0 SdLazy, 1326 SolverSat, 104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 24 SyntacticMatches, 16 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9180occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 572 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 475 NumberOfCodeBlocks, 475 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 410 ConstructedInterpolants, 0 QuantifiedInterpolants, 79142 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...