/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 13:37:13,279 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 13:37:13,282 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 13:37:13,305 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 13:37:13,305 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 13:37:13,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 13:37:13,308 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 13:37:13,310 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 13:37:13,311 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 13:37:13,312 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 13:37:13,313 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 13:37:13,314 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 13:37:13,314 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 13:37:13,315 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 13:37:13,316 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 13:37:13,317 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 13:37:13,318 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 13:37:13,319 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 13:37:13,320 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 13:37:13,322 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 13:37:13,323 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 13:37:13,324 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 13:37:13,325 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 13:37:13,326 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 13:37:13,331 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 13:37:13,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 13:37:13,334 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 13:37:13,335 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 13:37:13,335 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 13:37:13,336 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 13:37:13,337 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 13:37:13,338 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 13:37:13,339 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 13:37:13,339 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 13:37:13,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 13:37:13,340 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 13:37:13,342 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 13:37:13,342 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 13:37:13,342 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 13:37:13,350 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 13:37:13,351 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 13:37:13,355 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-16 13:37:13,392 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 13:37:13,393 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 13:37:13,395 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 13:37:13,395 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 13:37:13,395 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 13:37:13,395 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 13:37:13,395 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 13:37:13,396 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 13:37:13,396 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 13:37:13,396 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 13:37:13,397 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 13:37:13,397 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 13:37:13,397 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 13:37:13,398 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 13:37:13,398 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 13:37:13,398 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 13:37:13,398 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 13:37:13,398 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 13:37:13,399 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 13:37:13,399 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 13:37:13,399 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 13:37:13,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 13:37:13,400 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 13:37:13,400 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 13:37:13,400 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 13:37:13,400 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 13:37:13,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 13:37:13,401 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-16 13:37:13,401 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 13:37:13,401 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 13:37:13,401 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-16 13:37:13,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 13:37:13,688 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 13:37:13,691 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 13:37:13,693 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 13:37:13,693 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 13:37:13,694 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i [2020-10-16 13:37:13,751 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/fc8bc0a99/c6ec9b665d2a4246ba746daab82a202f/FLAG26606b8ad [2020-10-16 13:37:14,269 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 13:37:14,270 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i [2020-10-16 13:37:14,291 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/fc8bc0a99/c6ec9b665d2a4246ba746daab82a202f/FLAG26606b8ad [2020-10-16 13:37:14,617 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/fc8bc0a99/c6ec9b665d2a4246ba746daab82a202f [2020-10-16 13:37:14,627 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 13:37:14,629 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 13:37:14,630 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 13:37:14,630 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 13:37:14,633 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 13:37:14,634 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:37:14" (1/1) ... [2020-10-16 13:37:14,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25971070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:37:14, skipping insertion in model container [2020-10-16 13:37:14,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:37:14" (1/1) ... [2020-10-16 13:37:14,644 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 13:37:14,683 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 13:37:15,175 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 13:37:15,187 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 13:37:15,248 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 13:37:15,326 INFO L208 MainTranslator]: Completed translation [2020-10-16 13:37:15,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:37:15 WrapperNode [2020-10-16 13:37:15,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 13:37:15,327 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 13:37:15,327 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 13:37:15,328 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 13:37:15,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:37:15" (1/1) ... [2020-10-16 13:37:15,355 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:37:15" (1/1) ... [2020-10-16 13:37:15,394 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 13:37:15,394 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 13:37:15,394 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 13:37:15,395 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 13:37:15,404 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:37:15" (1/1) ... [2020-10-16 13:37:15,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:37:15" (1/1) ... [2020-10-16 13:37:15,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:37:15" (1/1) ... [2020-10-16 13:37:15,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:37:15" (1/1) ... [2020-10-16 13:37:15,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:37:15" (1/1) ... [2020-10-16 13:37:15,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:37:15" (1/1) ... [2020-10-16 13:37:15,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:37:15" (1/1) ... [2020-10-16 13:37:15,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 13:37:15,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 13:37:15,431 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 13:37:15,431 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 13:37:15,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:37:15" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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 [2020-10-16 13:37:15,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 13:37:15,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 13:37:15,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 13:37:15,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 13:37:15,496 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 13:37:15,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 13:37:15,496 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 13:37:15,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 13:37:15,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 13:37:15,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 13:37:15,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 13:37:15,499 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 13:37:17,216 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 13:37:17,216 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 13:37:17,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:37:17 BoogieIcfgContainer [2020-10-16 13:37:17,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 13:37:17,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 13:37:17,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 13:37:17,223 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 13:37:17,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:37:14" (1/3) ... [2020-10-16 13:37:17,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a2d3e53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:37:17, skipping insertion in model container [2020-10-16 13:37:17,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:37:15" (2/3) ... [2020-10-16 13:37:17,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a2d3e53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:37:17, skipping insertion in model container [2020-10-16 13:37:17,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:37:17" (3/3) ... [2020-10-16 13:37:17,227 INFO L111 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc.i [2020-10-16 13:37:17,238 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 13:37:17,239 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 13:37:17,246 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 13:37:17,247 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 13:37:17,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,274 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,274 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,274 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,274 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,275 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,275 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,275 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,275 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,278 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,278 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,278 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,278 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,278 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,279 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,279 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,279 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,279 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,279 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,286 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,286 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,287 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,291 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,291 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:37:17,294 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 13:37:17,307 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-16 13:37:17,327 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 13:37:17,327 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 13:37:17,327 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 13:37:17,327 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-16 13:37:17,327 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 13:37:17,328 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 13:37:17,328 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 13:37:17,328 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 13:37:17,340 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 13:37:17,341 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 75 transitions, 160 flow [2020-10-16 13:37:17,344 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 75 transitions, 160 flow [2020-10-16 13:37:17,346 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 80 places, 75 transitions, 160 flow [2020-10-16 13:37:17,383 INFO L129 PetriNetUnfolder]: 2/73 cut-off events. [2020-10-16 13:37:17,383 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 13:37:17,388 INFO L80 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 73 events. 2/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-16 13:37:17,390 INFO L117 LiptonReduction]: Number of co-enabled transitions 896 [2020-10-16 13:37:18,591 WARN L193 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2020-10-16 13:37:18,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 13:37:18,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:37:18,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 13:37:18,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:37:19,698 WARN L193 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 139 DAG size of output: 119 [2020-10-16 13:37:20,082 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2020-10-16 13:37:20,494 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 13:37:21,553 WARN L193 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 105 [2020-10-16 13:37:21,808 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-10-16 13:37:22,785 WARN L193 SmtUtils]: Spent 675.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 125 [2020-10-16 13:37:23,101 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-16 13:37:23,298 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2020-10-16 13:37:23,399 INFO L132 LiptonReduction]: Checked pairs total: 2403 [2020-10-16 13:37:23,399 INFO L134 LiptonReduction]: Total number of compositions: 66 [2020-10-16 13:37:23,405 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 19 transitions, 48 flow [2020-10-16 13:37:23,424 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 164 states. [2020-10-16 13:37:23,426 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states. [2020-10-16 13:37:23,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-16 13:37:23,432 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:37:23,433 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-16 13:37:23,433 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:37:23,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:37:23,439 INFO L82 PathProgramCache]: Analyzing trace with hash 897514, now seen corresponding path program 1 times [2020-10-16 13:37:23,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:37:23,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541289013] [2020-10-16 13:37:23,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:37:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:37:23,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:37:23,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541289013] [2020-10-16 13:37:23,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:37:23,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:37:23,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [901170571] [2020-10-16 13:37:23,721 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:37:23,723 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:37:23,735 INFO L258 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-10-16 13:37:23,735 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:37:23,739 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:37:23,740 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:37:23,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:37:23,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:37:23,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:37:23,755 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 3 states. [2020-10-16 13:37:23,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:37:23,816 INFO L93 Difference]: Finished difference Result 137 states and 320 transitions. [2020-10-16 13:37:23,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:37:23,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-16 13:37:23,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:37:23,829 INFO L225 Difference]: With dead ends: 137 [2020-10-16 13:37:23,830 INFO L226 Difference]: Without dead ends: 112 [2020-10-16 13:37:23,831 INFO L677 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 [2020-10-16 13:37:23,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-16 13:37:23,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-16 13:37:23,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-16 13:37:23,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2020-10-16 13:37:23,881 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 3 [2020-10-16 13:37:23,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:37:23,881 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 255 transitions. [2020-10-16 13:37:23,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:37:23,882 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions. [2020-10-16 13:37:23,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-16 13:37:23,883 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:37:23,883 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:37:23,883 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 13:37:23,883 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:37:23,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:37:23,884 INFO L82 PathProgramCache]: Analyzing trace with hash -13139348, now seen corresponding path program 1 times [2020-10-16 13:37:23,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:37:23,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925014010] [2020-10-16 13:37:23,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:37:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:37:24,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:37:24,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925014010] [2020-10-16 13:37:24,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:37:24,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:37:24,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [589823389] [2020-10-16 13:37:24,034 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:37:24,036 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:37:24,038 INFO L258 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-16 13:37:24,038 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:37:24,038 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:37:24,040 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:37:24,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:37:24,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:37:24,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:37:24,041 INFO L87 Difference]: Start difference. First operand 112 states and 255 transitions. Second operand 3 states. [2020-10-16 13:37:24,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:37:24,067 INFO L93 Difference]: Finished difference Result 111 states and 252 transitions. [2020-10-16 13:37:24,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:37:24,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-16 13:37:24,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:37:24,070 INFO L225 Difference]: With dead ends: 111 [2020-10-16 13:37:24,070 INFO L226 Difference]: Without dead ends: 111 [2020-10-16 13:37:24,071 INFO L677 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 [2020-10-16 13:37:24,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-10-16 13:37:24,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2020-10-16 13:37:24,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-10-16 13:37:24,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 252 transitions. [2020-10-16 13:37:24,084 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 252 transitions. Word has length 7 [2020-10-16 13:37:24,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:37:24,084 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 252 transitions. [2020-10-16 13:37:24,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:37:24,084 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 252 transitions. [2020-10-16 13:37:24,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-16 13:37:24,085 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:37:24,085 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:37:24,086 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 13:37:24,086 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:37:24,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:37:24,086 INFO L82 PathProgramCache]: Analyzing trace with hash -936774400, now seen corresponding path program 1 times [2020-10-16 13:37:24,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:37:24,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542369822] [2020-10-16 13:37:24,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:37:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:37:24,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:37:24,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542369822] [2020-10-16 13:37:24,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:37:24,167 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:37:24,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [386341153] [2020-10-16 13:37:24,168 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:37:24,169 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:37:24,172 INFO L258 McrAutomatonBuilder]: Finished intersection with 12 states and 14 transitions. [2020-10-16 13:37:24,172 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:37:24,215 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:37:24,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 13:37:24,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:37:24,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 13:37:24,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:37:24,217 INFO L87 Difference]: Start difference. First operand 111 states and 252 transitions. Second operand 4 states. [2020-10-16 13:37:24,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:37:24,268 INFO L93 Difference]: Finished difference Result 107 states and 241 transitions. [2020-10-16 13:37:24,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:37:24,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-16 13:37:24,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:37:24,270 INFO L225 Difference]: With dead ends: 107 [2020-10-16 13:37:24,270 INFO L226 Difference]: Without dead ends: 107 [2020-10-16 13:37:24,271 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:37:24,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-16 13:37:24,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-10-16 13:37:24,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-16 13:37:24,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 241 transitions. [2020-10-16 13:37:24,281 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 241 transitions. Word has length 8 [2020-10-16 13:37:24,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:37:24,281 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 241 transitions. [2020-10-16 13:37:24,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 13:37:24,282 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 241 transitions. [2020-10-16 13:37:24,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-16 13:37:24,283 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:37:24,283 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:37:24,283 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 13:37:24,283 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:37:24,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:37:24,284 INFO L82 PathProgramCache]: Analyzing trace with hash -407351812, now seen corresponding path program 1 times [2020-10-16 13:37:24,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:37:24,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013748088] [2020-10-16 13:37:24,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:37:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:37:24,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:37:24,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013748088] [2020-10-16 13:37:24,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:37:24,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:37:24,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1267276798] [2020-10-16 13:37:24,362 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:37:24,363 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:37:24,364 INFO L258 McrAutomatonBuilder]: Finished intersection with 11 states and 12 transitions. [2020-10-16 13:37:24,365 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:37:24,370 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:37:24,370 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:37:24,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:37:24,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:37:24,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:37:24,371 INFO L87 Difference]: Start difference. First operand 107 states and 241 transitions. Second operand 5 states. [2020-10-16 13:37:24,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:37:24,476 INFO L93 Difference]: Finished difference Result 103 states and 230 transitions. [2020-10-16 13:37:24,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:37:24,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-10-16 13:37:24,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:37:24,479 INFO L225 Difference]: With dead ends: 103 [2020-10-16 13:37:24,480 INFO L226 Difference]: Without dead ends: 103 [2020-10-16 13:37:24,480 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:37:24,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-10-16 13:37:24,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-10-16 13:37:24,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-16 13:37:24,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 230 transitions. [2020-10-16 13:37:24,495 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 230 transitions. Word has length 8 [2020-10-16 13:37:24,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:37:24,495 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 230 transitions. [2020-10-16 13:37:24,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:37:24,496 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 230 transitions. [2020-10-16 13:37:24,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 13:37:24,498 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:37:24,499 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:37:24,499 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 13:37:24,499 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:37:24,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:37:24,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1024732648, now seen corresponding path program 1 times [2020-10-16 13:37:24,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:37:24,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677263279] [2020-10-16 13:37:24,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:37:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:37:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:37:24,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677263279] [2020-10-16 13:37:24,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:37:24,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 13:37:24,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [643304615] [2020-10-16 13:37:24,665 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:37:24,666 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:37:24,669 INFO L258 McrAutomatonBuilder]: Finished intersection with 17 states and 24 transitions. [2020-10-16 13:37:24,669 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:37:24,779 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [1762#(or (not (= (mod ~y$w_buff0_used~0 256) 0)) (and (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff0_thd0~0))), 1763#(or (and (= ~x~0 0) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (<= 0 ~y$r_buff0_thd0~0)) (not (= (mod ~y$w_buff0_used~0 256) 0))), 1764#(and (not (= ~x~0 1)) (not (= ~y$w_buff0_used~0 0)))] [2020-10-16 13:37:24,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 13:37:24,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:37:24,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 13:37:24,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-16 13:37:24,781 INFO L87 Difference]: Start difference. First operand 103 states and 230 transitions. Second operand 9 states. [2020-10-16 13:37:25,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:37:25,084 INFO L93 Difference]: Finished difference Result 147 states and 333 transitions. [2020-10-16 13:37:25,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 13:37:25,088 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2020-10-16 13:37:25,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:37:25,091 INFO L225 Difference]: With dead ends: 147 [2020-10-16 13:37:25,092 INFO L226 Difference]: Without dead ends: 147 [2020-10-16 13:37:25,092 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2020-10-16 13:37:25,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-10-16 13:37:25,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 107. [2020-10-16 13:37:25,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-16 13:37:25,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 240 transitions. [2020-10-16 13:37:25,107 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 240 transitions. Word has length 9 [2020-10-16 13:37:25,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:37:25,108 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 240 transitions. [2020-10-16 13:37:25,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 13:37:25,109 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 240 transitions. [2020-10-16 13:37:25,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 13:37:25,110 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:37:25,110 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:37:25,111 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 13:37:25,111 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:37:25,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:37:25,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1700985471, now seen corresponding path program 1 times [2020-10-16 13:37:25,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:37:25,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329100396] [2020-10-16 13:37:25,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:37:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:37:25,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:37:25,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329100396] [2020-10-16 13:37:25,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:37:25,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:37:25,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [397205303] [2020-10-16 13:37:25,357 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:37:25,358 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:37:25,361 INFO L258 McrAutomatonBuilder]: Finished intersection with 20 states and 28 transitions. [2020-10-16 13:37:25,362 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:37:25,444 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:37:25,445 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:37:25,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:37:25,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:37:25,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:37:25,446 INFO L87 Difference]: Start difference. First operand 107 states and 240 transitions. Second operand 5 states. [2020-10-16 13:37:25,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:37:25,481 INFO L93 Difference]: Finished difference Result 106 states and 237 transitions. [2020-10-16 13:37:25,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:37:25,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-10-16 13:37:25,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:37:25,483 INFO L225 Difference]: With dead ends: 106 [2020-10-16 13:37:25,483 INFO L226 Difference]: Without dead ends: 106 [2020-10-16 13:37:25,483 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:37:25,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-16 13:37:25,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2020-10-16 13:37:25,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-16 13:37:25,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 237 transitions. [2020-10-16 13:37:25,489 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 237 transitions. Word has length 10 [2020-10-16 13:37:25,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:37:25,490 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 237 transitions. [2020-10-16 13:37:25,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:37:25,490 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 237 transitions. [2020-10-16 13:37:25,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 13:37:25,491 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:37:25,491 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:37:25,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 13:37:25,492 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:37:25,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:37:25,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1218802089, now seen corresponding path program 1 times [2020-10-16 13:37:25,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:37:25,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463723948] [2020-10-16 13:37:25,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:37:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:37:25,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:37:25,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463723948] [2020-10-16 13:37:25,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:37:25,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:37:25,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1734041549] [2020-10-16 13:37:25,536 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:37:25,538 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:37:25,542 INFO L258 McrAutomatonBuilder]: Finished intersection with 22 states and 33 transitions. [2020-10-16 13:37:25,542 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:37:25,620 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:37:25,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 13:37:25,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:37:25,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 13:37:25,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:37:25,622 INFO L87 Difference]: Start difference. First operand 106 states and 237 transitions. Second operand 4 states. [2020-10-16 13:37:25,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:37:25,639 INFO L93 Difference]: Finished difference Result 134 states and 291 transitions. [2020-10-16 13:37:25,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:37:25,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-16 13:37:25,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:37:25,640 INFO L225 Difference]: With dead ends: 134 [2020-10-16 13:37:25,640 INFO L226 Difference]: Without dead ends: 74 [2020-10-16 13:37:25,641 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:37:25,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-16 13:37:25,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-10-16 13:37:25,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-16 13:37:25,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 152 transitions. [2020-10-16 13:37:25,645 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 152 transitions. Word has length 11 [2020-10-16 13:37:25,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:37:25,645 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 152 transitions. [2020-10-16 13:37:25,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 13:37:25,645 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 152 transitions. [2020-10-16 13:37:25,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 13:37:25,646 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:37:25,646 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:37:25,646 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 13:37:25,647 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:37:25,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:37:25,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1190886961, now seen corresponding path program 1 times [2020-10-16 13:37:25,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:37:25,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324645257] [2020-10-16 13:37:25,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:37:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:37:25,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:37:25,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324645257] [2020-10-16 13:37:25,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:37:25,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 13:37:25,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [601232423] [2020-10-16 13:37:25,827 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:37:25,830 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:37:25,833 INFO L258 McrAutomatonBuilder]: Finished intersection with 20 states and 27 transitions. [2020-10-16 13:37:25,833 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:37:25,875 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:37:25,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 13:37:25,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:37:25,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 13:37:25,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 13:37:25,876 INFO L87 Difference]: Start difference. First operand 74 states and 152 transitions. Second operand 6 states. [2020-10-16 13:37:25,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:37:25,966 INFO L93 Difference]: Finished difference Result 81 states and 165 transitions. [2020-10-16 13:37:25,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 13:37:25,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-10-16 13:37:25,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:37:25,968 INFO L225 Difference]: With dead ends: 81 [2020-10-16 13:37:25,968 INFO L226 Difference]: Without dead ends: 81 [2020-10-16 13:37:25,968 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:37:25,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-10-16 13:37:25,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2020-10-16 13:37:25,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-16 13:37:25,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 162 transitions. [2020-10-16 13:37:25,973 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 162 transitions. Word has length 11 [2020-10-16 13:37:25,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:37:25,973 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 162 transitions. [2020-10-16 13:37:25,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 13:37:25,973 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 162 transitions. [2020-10-16 13:37:25,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 13:37:25,974 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:37:25,974 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:37:25,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 13:37:25,975 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:37:25,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:37:25,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1190881195, now seen corresponding path program 1 times [2020-10-16 13:37:25,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:37:25,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756892584] [2020-10-16 13:37:25,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:37:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:37:26,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:37:26,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756892584] [2020-10-16 13:37:26,049 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:37:26,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:37:26,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [470381617] [2020-10-16 13:37:26,049 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:37:26,051 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:37:26,055 INFO L258 McrAutomatonBuilder]: Finished intersection with 25 states and 38 transitions. [2020-10-16 13:37:26,055 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:37:26,062 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:37:26,100 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:37:26,120 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:37:26,133 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:37:26,152 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:37:26,173 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [2996#(not (= 2 ~__unbuffered_cnt~0))] [2020-10-16 13:37:26,173 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:37:26,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:37:26,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:37:26,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:37:26,174 INFO L87 Difference]: Start difference. First operand 79 states and 162 transitions. Second operand 5 states. [2020-10-16 13:37:26,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:37:26,215 INFO L93 Difference]: Finished difference Result 53 states and 95 transitions. [2020-10-16 13:37:26,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 13:37:26,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-16 13:37:26,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:37:26,217 INFO L225 Difference]: With dead ends: 53 [2020-10-16 13:37:26,217 INFO L226 Difference]: Without dead ends: 34 [2020-10-16 13:37:26,217 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:37:26,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-10-16 13:37:26,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-10-16 13:37:26,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-16 13:37:26,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2020-10-16 13:37:26,219 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 47 transitions. Word has length 11 [2020-10-16 13:37:26,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:37:26,219 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 47 transitions. [2020-10-16 13:37:26,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:37:26,220 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 47 transitions. [2020-10-16 13:37:26,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 13:37:26,220 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:37:26,220 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:37:26,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 13:37:26,221 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:37:26,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:37:26,221 INFO L82 PathProgramCache]: Analyzing trace with hash -944183904, now seen corresponding path program 1 times [2020-10-16 13:37:26,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:37:26,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720048371] [2020-10-16 13:37:26,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:37:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 13:37:26,275 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 13:37:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 13:37:26,321 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 13:37:26,352 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 13:37:26,352 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 13:37:26,352 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 13:37:26,353 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 13:37:26,363 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L2-->L795: Formula: (let ((.cse6 (= (mod ~y$r_buff1_thd0~0_In128292355 256) 0)) (.cse7 (= (mod ~y$w_buff1_used~0_In128292355 256) 0)) (.cse8 (= (mod ~y$r_buff0_thd0~0_In128292355 256) 0)) (.cse9 (= (mod ~y$w_buff0_used~0_In128292355 256) 0))) (let ((.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse0 (or .cse8 .cse9)) (.cse1 (not .cse7)) (.cse2 (not .cse6)) (.cse3 (or .cse6 .cse7))) (and (= ~y$r_buff1_thd0~0_Out128292355 ~y$r_buff1_thd0~0_In128292355) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In128292355| ULTIMATE.start_assume_abort_if_not_~cond_Out128292355) (or (and .cse0 (or (and (= ~y~0_Out128292355 ~y$w_buff1~0_In128292355) .cse1 .cse2) (and (= ~y~0_Out128292355 ~y~0_In128292355) .cse3))) (and (= ~y$w_buff0~0_In128292355 ~y~0_Out128292355) .cse4 .cse5)) (or (and .cse4 (= ~y$w_buff0_used~0_Out128292355 0) .cse5) (and (= ~y$w_buff0_used~0_In128292355 ~y$w_buff0_used~0_Out128292355) .cse0)) (or (and (= ~y$w_buff1_used~0_Out128292355 0) .cse1 .cse2) (and .cse3 (= ~y$w_buff1_used~0_In128292355 ~y$w_buff1_used~0_Out128292355))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out128292355 0)) (= ~y$r_buff0_thd0~0_Out128292355 ~y$r_buff0_thd0~0_In128292355)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In128292355|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In128292355, ~y$w_buff1~0=~y$w_buff1~0_In128292355, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In128292355, ~y$w_buff0~0=~y$w_buff0~0_In128292355, ~y~0=~y~0_In128292355, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In128292355, ~y$w_buff1_used~0=~y$w_buff1_used~0_In128292355} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out128292355, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out128292355|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out128292355|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out128292355|, ULTIMATE.start_main_#t~ite16=|ULTIMATE.start_main_#t~ite16_Out128292355|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out128292355|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out128292355|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In128292355|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out128292355, ~y$w_buff1~0=~y$w_buff1~0_In128292355, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out128292355, ~y$w_buff0~0=~y$w_buff0~0_In128292355, ~y~0=~y~0_Out128292355, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out128292355, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out128292355} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite16, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-16 13:37:26,367 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:37:26,367 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:37:26,369 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:37:26,369 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:37:26,369 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:37:26,369 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:37:26,370 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:37:26,370 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:37:26,370 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:37:26,370 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:37:26,370 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:37:26,370 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:37:26,371 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:37:26,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:37:26,371 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:37:26,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:37:26,371 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:37:26,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:37:26,372 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:37:26,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:37:26,372 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:37:26,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:37:26,372 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:37:26,373 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:37:26,373 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:37:26,374 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:37:26,374 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:37:26,374 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:37:26,374 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:37:26,374 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:37:26,374 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:37:26,375 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:37:26,375 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:37:26,375 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:37:26,375 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:37:26,375 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:37:26,376 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:37:26,376 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:37:26,376 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:37:26,376 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:37:26,376 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:37:26,376 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:37:26,377 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:37:26,377 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:37:26,377 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:37:26,377 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:37:26,377 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:37:26,377 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:37:26,378 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:37:26,378 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:37:26,378 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:37:26,378 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:37:26,378 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:37:26,379 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:37:26,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:37:26 BasicIcfg [2020-10-16 13:37:26,426 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 13:37:26,428 INFO L168 Benchmark]: Toolchain (without parser) took 11799.46 ms. Allocated memory was 147.8 MB in the beginning and 336.1 MB in the end (delta: 188.2 MB). Free memory was 101.6 MB in the beginning and 141.0 MB in the end (delta: -39.4 MB). Peak memory consumption was 148.8 MB. Max. memory is 7.1 GB. [2020-10-16 13:37:26,429 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 147.8 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 13:37:26,430 INFO L168 Benchmark]: CACSL2BoogieTranslator took 696.87 ms. Allocated memory was 147.8 MB in the beginning and 204.5 MB in the end (delta: 56.6 MB). Free memory was 101.4 MB in the beginning and 158.7 MB in the end (delta: -57.3 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2020-10-16 13:37:26,430 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.75 ms. Allocated memory is still 204.5 MB. Free memory was 158.7 MB in the beginning and 156.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-16 13:37:26,431 INFO L168 Benchmark]: Boogie Preprocessor took 35.94 ms. Allocated memory is still 204.5 MB. Free memory was 156.1 MB in the beginning and 153.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-16 13:37:26,432 INFO L168 Benchmark]: RCFGBuilder took 1788.32 ms. Allocated memory was 204.5 MB in the beginning and 245.9 MB in the end (delta: 41.4 MB). Free memory was 153.6 MB in the beginning and 194.6 MB in the end (delta: -41.0 MB). Peak memory consumption was 100.8 MB. Max. memory is 7.1 GB. [2020-10-16 13:37:26,433 INFO L168 Benchmark]: TraceAbstraction took 9206.62 ms. Allocated memory was 245.9 MB in the beginning and 336.1 MB in the end (delta: 90.2 MB). Free memory was 192.9 MB in the beginning and 141.0 MB in the end (delta: 51.9 MB). Peak memory consumption was 142.0 MB. Max. memory is 7.1 GB. [2020-10-16 13:37:26,437 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 147.8 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 696.87 ms. Allocated memory was 147.8 MB in the beginning and 204.5 MB in the end (delta: 56.6 MB). Free memory was 101.4 MB in the beginning and 158.7 MB in the end (delta: -57.3 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.75 ms. Allocated memory is still 204.5 MB. Free memory was 158.7 MB in the beginning and 156.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.94 ms. Allocated memory is still 204.5 MB. Free memory was 156.1 MB in the beginning and 153.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1788.32 ms. Allocated memory was 204.5 MB in the beginning and 245.9 MB in the end (delta: 41.4 MB). Free memory was 153.6 MB in the beginning and 194.6 MB in the end (delta: -41.0 MB). Peak memory consumption was 100.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9206.62 ms. Allocated memory was 245.9 MB in the beginning and 336.1 MB in the end (delta: 90.2 MB). Free memory was 192.9 MB in the beginning and 141.0 MB in the end (delta: 51.9 MB). Peak memory consumption was 142.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 457 VarBasedMoverChecksPositive, 23 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 39 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.0s, 80 PlacesBefore, 26 PlacesAfterwards, 75 TransitionsBefore, 19 TransitionsAfterwards, 896 CoEnabledTransitionPairs, 6 FixpointIterations, 28 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 66 TotalNumberOfCompositions, 2403 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L697] 0 int __unbuffered_cnt = 0; [L699] 0 int __unbuffered_p1_EAX = 0; [L700] 0 _Bool main$tmp_guard0; [L701] 0 _Bool main$tmp_guard1; [L703] 0 int x = 0; [L705] 0 int y = 0; [L706] 0 _Bool y$flush_delayed; [L707] 0 int y$mem_tmp; [L708] 0 _Bool y$r_buff0_thd0; [L709] 0 _Bool y$r_buff0_thd1; [L710] 0 _Bool y$r_buff0_thd2; [L711] 0 _Bool y$r_buff1_thd0; [L712] 0 _Bool y$r_buff1_thd1; [L713] 0 _Bool y$r_buff1_thd2; [L714] 0 _Bool y$read_delayed; [L715] 0 int *y$read_delayed_var; [L716] 0 int y$w_buff0; [L717] 0 _Bool y$w_buff0_used; [L718] 0 int y$w_buff1; [L719] 0 _Bool y$w_buff1_used; [L720] 0 _Bool weak$$choice0; [L721] 0 _Bool weak$$choice2; [L781] 0 pthread_t t2009; [L782] FCALL, FORK 0 pthread_create(&t2009, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L725] 1 y$w_buff1 = y$w_buff0 [L726] 1 y$w_buff0 = 2 [L727] 1 y$w_buff1_used = y$w_buff0_used [L728] 1 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L730] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L731] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L732] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L733] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] 0 pthread_t t2010; [L784] FCALL, FORK 0 pthread_create(&t2010, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 x = 1 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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L759] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L759] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L760] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L761] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L762] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L763] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L739] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L741] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L741] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L742] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L746] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L748] 1 return 0; [L766] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 2 return 0; [L786] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L797] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L798] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L799] 0 y$flush_delayed = weak$$choice2 [L800] 0 y$mem_tmp = y [L801] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L801] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L801] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L802] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L802] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0 [L802] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L802] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L802] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L803] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L803] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L803] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L803] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L804] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L804] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L804] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L804] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L805] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L805] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L805] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L806] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L807] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L807] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L808] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L809] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L809] 0 y = y$flush_delayed ? y$mem_tmp : y [L810] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 74 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.0s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 117 SDtfs, 108 SDslu, 177 SDs, 0 SdLazy, 199 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred 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.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 44 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 69 ConstructedInterpolants, 0 QuantifiedInterpolants, 6059 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...