/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_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-06 01:02:30,360 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-06 01:02:30,363 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-06 01:02:30,387 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-06 01:02:30,387 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-06 01:02:30,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-06 01:02:30,390 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-06 01:02:30,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-06 01:02:30,393 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-06 01:02:30,394 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-06 01:02:30,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-06 01:02:30,396 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-06 01:02:30,396 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-06 01:02:30,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-06 01:02:30,398 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-06 01:02:30,399 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-06 01:02:30,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-06 01:02:30,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-06 01:02:30,402 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-06 01:02:30,404 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-06 01:02:30,405 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-06 01:02:30,406 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-06 01:02:30,408 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-06 01:02:30,408 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-06 01:02:30,411 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-06 01:02:30,411 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-06 01:02:30,411 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-06 01:02:30,412 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-06 01:02:30,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-06 01:02:30,413 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-06 01:02:30,414 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-06 01:02:30,414 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-06 01:02:30,415 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-06 01:02:30,416 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-06 01:02:30,417 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-06 01:02:30,417 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-06 01:02:30,418 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-06 01:02:30,418 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-06 01:02:30,418 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-06 01:02:30,419 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-06 01:02:30,419 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-06 01:02:30,420 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-06 01:02:30,443 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-06 01:02:30,444 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-06 01:02:30,445 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-06 01:02:30,445 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-06 01:02:30,445 INFO L138 SettingsManager]: * Use SBE=true [2020-10-06 01:02:30,446 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-06 01:02:30,446 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-06 01:02:30,446 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-06 01:02:30,446 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-06 01:02:30,446 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-06 01:02:30,447 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-06 01:02:30,447 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-06 01:02:30,447 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-06 01:02:30,447 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-06 01:02:30,447 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-06 01:02:30,448 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-06 01:02:30,448 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-06 01:02:30,448 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-06 01:02:30,448 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-06 01:02:30,448 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-06 01:02:30,449 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-06 01:02:30,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-06 01:02:30,449 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-06 01:02:30,449 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-06 01:02:30,449 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-06 01:02:30,450 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-06 01:02:30,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-06 01:02:30,450 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-06 01:02:30,450 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-06 01:02:30,450 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-06 01:02:30,451 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-06 01:02:30,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-06 01:02:30,754 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-06 01:02:30,758 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-06 01:02:30,760 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-06 01:02:30,761 INFO L275 PluginConnector]: CDTParser initialized [2020-10-06 01:02:30,763 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_rmo.oepc.i [2020-10-06 01:02:30,832 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6db3a4097/bab999d2fe754a81a19c04a0854f596e/FLAGedefe02db [2020-10-06 01:02:31,364 INFO L306 CDTParser]: Found 1 translation units. [2020-10-06 01:02:31,365 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_rmo.oepc.i [2020-10-06 01:02:31,396 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6db3a4097/bab999d2fe754a81a19c04a0854f596e/FLAGedefe02db [2020-10-06 01:02:31,670 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6db3a4097/bab999d2fe754a81a19c04a0854f596e [2020-10-06 01:02:31,681 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-06 01:02:31,683 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-06 01:02:31,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-06 01:02:31,686 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-06 01:02:31,690 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-06 01:02:31,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 01:02:31" (1/1) ... [2020-10-06 01:02:31,694 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61e54f08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:31, skipping insertion in model container [2020-10-06 01:02:31,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 01:02:31" (1/1) ... [2020-10-06 01:02:31,703 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-06 01:02:31,775 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-06 01:02:32,290 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 01:02:32,306 INFO L203 MainTranslator]: Completed pre-run [2020-10-06 01:02:32,360 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 01:02:32,445 INFO L208 MainTranslator]: Completed translation [2020-10-06 01:02:32,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:32 WrapperNode [2020-10-06 01:02:32,446 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-06 01:02:32,447 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-06 01:02:32,447 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-06 01:02:32,447 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-06 01:02:32,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:32" (1/1) ... [2020-10-06 01:02:32,476 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:32" (1/1) ... [2020-10-06 01:02:32,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-06 01:02:32,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-06 01:02:32,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-06 01:02:32,515 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-06 01:02:32,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:32" (1/1) ... [2020-10-06 01:02:32,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:32" (1/1) ... [2020-10-06 01:02:32,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:32" (1/1) ... [2020-10-06 01:02:32,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:32" (1/1) ... [2020-10-06 01:02:32,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:32" (1/1) ... [2020-10-06 01:02:32,544 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:32" (1/1) ... [2020-10-06 01:02:32,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:32" (1/1) ... [2020-10-06 01:02:32,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-06 01:02:32,553 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-06 01:02:32,553 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-06 01:02:32,553 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-06 01:02:32,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-06 01:02:32,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-06 01:02:32,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-06 01:02:32,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-06 01:02:32,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-06 01:02:32,639 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-06 01:02:32,639 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-06 01:02:32,640 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-06 01:02:32,640 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-06 01:02:32,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-06 01:02:32,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-06 01:02:32,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-06 01:02:32,644 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-06 01:02:34,522 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-06 01:02:34,522 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-06 01:02:34,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 01:02:34 BoogieIcfgContainer [2020-10-06 01:02:34,524 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-06 01:02:34,525 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-06 01:02:34,526 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-06 01:02:34,529 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-06 01:02:34,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 01:02:31" (1/3) ... [2020-10-06 01:02:34,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1718c434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 01:02:34, skipping insertion in model container [2020-10-06 01:02:34,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:32" (2/3) ... [2020-10-06 01:02:34,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1718c434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 01:02:34, skipping insertion in model container [2020-10-06 01:02:34,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 01:02:34" (3/3) ... [2020-10-06 01:02:34,533 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_rmo.oepc.i [2020-10-06 01:02:34,543 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-06 01:02:34,543 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-06 01:02:34,551 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-06 01:02:34,552 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-06 01:02:34,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,581 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,581 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,581 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,582 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,585 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,586 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,594 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,594 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,595 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,597 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,598 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:34,615 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-06 01:02:34,636 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-06 01:02:34,636 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-06 01:02:34,636 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-06 01:02:34,637 INFO L378 AbstractCegarLoop]: Backedges is MCR [2020-10-06 01:02:34,637 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-06 01:02:34,637 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-06 01:02:34,637 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-06 01:02:34,637 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-06 01:02:34,652 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 75 transitions, 160 flow [2020-10-06 01:02:34,654 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 80 places, 75 transitions, 160 flow [2020-10-06 01:02:34,692 INFO L129 PetriNetUnfolder]: 2/73 cut-off events. [2020-10-06 01:02:34,693 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 01:02:34,697 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-06 01:02:34,700 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 80 places, 75 transitions, 160 flow [2020-10-06 01:02:34,718 INFO L129 PetriNetUnfolder]: 2/73 cut-off events. [2020-10-06 01:02:34,719 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 01:02:34,719 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-06 01:02:34,721 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 896 [2020-10-06 01:02:34,722 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-06 01:02:35,969 WARN L193 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2020-10-06 01:02:36,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-06 01:02:36,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 01:02:36,025 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-06 01:02:36,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 01:02:37,117 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 139 DAG size of output: 119 [2020-10-06 01:02:37,543 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2020-10-06 01:02:37,989 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-06 01:02:39,008 WARN L193 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 105 [2020-10-06 01:02:39,263 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-10-06 01:02:40,229 WARN L193 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 125 [2020-10-06 01:02:40,545 WARN L193 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-06 01:02:40,751 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2020-10-06 01:02:40,846 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2325 [2020-10-06 01:02:40,846 INFO L214 etLargeBlockEncoding]: Total number of compositions: 64 [2020-10-06 01:02:40,850 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 19 transitions, 48 flow [2020-10-06 01:02:40,866 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 164 states. [2020-10-06 01:02:40,868 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states. [2020-10-06 01:02:40,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-06 01:02:40,875 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:02:40,875 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-06 01:02:40,876 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:02:40,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:02:40,881 INFO L82 PathProgramCache]: Analyzing trace with hash 897514, now seen corresponding path program 1 times [2020-10-06 01:02:40,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:02:40,899 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139194759] [2020-10-06 01:02:40,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:02:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:02:41,106 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-06 01:02:41,107 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139194759] [2020-10-06 01:02:41,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:02:41,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 01:02:41,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [94583241] [2020-10-06 01:02:41,110 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:02:41,113 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:02:41,125 INFO L258 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-10-06 01:02:41,126 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:02:41,130 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:02:41,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:02:41,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:02:41,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:02:41,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:02:41,145 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 3 states. [2020-10-06 01:02:41,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:02:41,212 INFO L93 Difference]: Finished difference Result 137 states and 320 transitions. [2020-10-06 01:02:41,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:02:41,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-06 01:02:41,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:02:41,226 INFO L225 Difference]: With dead ends: 137 [2020-10-06 01:02:41,227 INFO L226 Difference]: Without dead ends: 112 [2020-10-06 01:02:41,228 INFO L675 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-06 01:02:41,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-06 01:02:41,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-06 01:02:41,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-06 01:02:41,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2020-10-06 01:02:41,278 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 3 [2020-10-06 01:02:41,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:02:41,279 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 255 transitions. [2020-10-06 01:02:41,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:02:41,279 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions. [2020-10-06 01:02:41,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-06 01:02:41,280 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:02:41,280 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:02:41,281 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-06 01:02:41,281 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:02:41,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:02:41,281 INFO L82 PathProgramCache]: Analyzing trace with hash -13139348, now seen corresponding path program 1 times [2020-10-06 01:02:41,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:02:41,287 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518960227] [2020-10-06 01:02:41,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:02:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:02:41,378 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-06 01:02:41,378 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518960227] [2020-10-06 01:02:41,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:02:41,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 01:02:41,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [784531688] [2020-10-06 01:02:41,379 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:02:41,382 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:02:41,384 INFO L258 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-06 01:02:41,384 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:02:41,384 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:02:41,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:02:41,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:02:41,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:02:41,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:02:41,388 INFO L87 Difference]: Start difference. First operand 112 states and 255 transitions. Second operand 3 states. [2020-10-06 01:02:41,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:02:41,421 INFO L93 Difference]: Finished difference Result 111 states and 252 transitions. [2020-10-06 01:02:41,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:02:41,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-06 01:02:41,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:02:41,424 INFO L225 Difference]: With dead ends: 111 [2020-10-06 01:02:41,424 INFO L226 Difference]: Without dead ends: 111 [2020-10-06 01:02:41,425 INFO L675 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-06 01:02:41,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-10-06 01:02:41,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2020-10-06 01:02:41,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-10-06 01:02:41,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 252 transitions. [2020-10-06 01:02:41,436 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 252 transitions. Word has length 7 [2020-10-06 01:02:41,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:02:41,437 INFO L479 AbstractCegarLoop]: Abstraction has 111 states and 252 transitions. [2020-10-06 01:02:41,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:02:41,437 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 252 transitions. [2020-10-06 01:02:41,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-06 01:02:41,438 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:02:41,438 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:02:41,438 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-06 01:02:41,439 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:02:41,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:02:41,439 INFO L82 PathProgramCache]: Analyzing trace with hash -936774400, now seen corresponding path program 1 times [2020-10-06 01:02:41,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:02:41,441 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808409728] [2020-10-06 01:02:41,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:02:41,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:02:41,559 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-06 01:02:41,560 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808409728] [2020-10-06 01:02:41,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:02:41,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 01:02:41,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1937586407] [2020-10-06 01:02:41,561 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:02:41,562 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:02:41,565 INFO L258 McrAutomatonBuilder]: Finished intersection with 12 states and 14 transitions. [2020-10-06 01:02:41,565 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:02:41,608 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:02:41,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:02:41,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:02:41,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:02:41,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:02:41,610 INFO L87 Difference]: Start difference. First operand 111 states and 252 transitions. Second operand 3 states. [2020-10-06 01:02:41,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:02:41,618 INFO L93 Difference]: Finished difference Result 107 states and 241 transitions. [2020-10-06 01:02:41,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:02:41,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-10-06 01:02:41,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:02:41,620 INFO L225 Difference]: With dead ends: 107 [2020-10-06 01:02:41,621 INFO L226 Difference]: Without dead ends: 107 [2020-10-06 01:02:41,621 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-06 01:02:41,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-06 01:02:41,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-10-06 01:02:41,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-06 01:02:41,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 241 transitions. [2020-10-06 01:02:41,631 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 241 transitions. Word has length 8 [2020-10-06 01:02:41,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:02:41,632 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 241 transitions. [2020-10-06 01:02:41,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:02:41,632 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 241 transitions. [2020-10-06 01:02:41,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-06 01:02:41,633 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:02:41,633 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:02:41,634 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-06 01:02:41,634 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:02:41,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:02:41,634 INFO L82 PathProgramCache]: Analyzing trace with hash -407351812, now seen corresponding path program 1 times [2020-10-06 01:02:41,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:02:41,636 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021994048] [2020-10-06 01:02:41,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:02:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:02:41,726 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-06 01:02:41,727 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021994048] [2020-10-06 01:02:41,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:02:41,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:02:41,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1460320248] [2020-10-06 01:02:41,728 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:02:41,732 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:02:41,734 INFO L258 McrAutomatonBuilder]: Finished intersection with 11 states and 12 transitions. [2020-10-06 01:02:41,735 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:02:41,744 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:02:41,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:02:41,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:02:41,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:02:41,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:02:41,745 INFO L87 Difference]: Start difference. First operand 107 states and 241 transitions. Second operand 5 states. [2020-10-06 01:02:41,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:02:41,855 INFO L93 Difference]: Finished difference Result 103 states and 230 transitions. [2020-10-06 01:02:41,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 01:02:41,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-10-06 01:02:41,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:02:41,857 INFO L225 Difference]: With dead ends: 103 [2020-10-06 01:02:41,857 INFO L226 Difference]: Without dead ends: 103 [2020-10-06 01:02:41,857 INFO L675 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-06 01:02:41,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-10-06 01:02:41,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-10-06 01:02:41,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-06 01:02:41,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 230 transitions. [2020-10-06 01:02:41,865 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 230 transitions. Word has length 8 [2020-10-06 01:02:41,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:02:41,866 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 230 transitions. [2020-10-06 01:02:41,866 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:02:41,866 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 230 transitions. [2020-10-06 01:02:41,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-06 01:02:41,867 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:02:41,867 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:02:41,867 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-06 01:02:41,868 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:02:41,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:02:41,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1024732648, now seen corresponding path program 1 times [2020-10-06 01:02:41,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:02:41,870 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908514851] [2020-10-06 01:02:41,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:02:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:02:42,039 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-06 01:02:42,040 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908514851] [2020-10-06 01:02:42,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:02:42,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 01:02:42,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [799622903] [2020-10-06 01:02:42,041 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:02:42,043 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:02:42,045 INFO L258 McrAutomatonBuilder]: Finished intersection with 17 states and 24 transitions. [2020-10-06 01:02:42,045 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:02:42,167 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [1760#(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))), 1761#(and (not (= ~x~0 1)) (not (= ~y$w_buff0_used~0 0))), 1759#(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)))] [2020-10-06 01:02:42,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 01:02:42,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:02:42,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 01:02:42,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-06 01:02:42,168 INFO L87 Difference]: Start difference. First operand 103 states and 230 transitions. Second operand 9 states. [2020-10-06 01:02:42,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:02:42,521 INFO L93 Difference]: Finished difference Result 147 states and 333 transitions. [2020-10-06 01:02:42,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-06 01:02:42,521 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2020-10-06 01:02:42,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:02:42,525 INFO L225 Difference]: With dead ends: 147 [2020-10-06 01:02:42,525 INFO L226 Difference]: Without dead ends: 147 [2020-10-06 01:02:42,526 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2020-10-06 01:02:42,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-10-06 01:02:42,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 107. [2020-10-06 01:02:42,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-06 01:02:42,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 240 transitions. [2020-10-06 01:02:42,536 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 240 transitions. Word has length 9 [2020-10-06 01:02:42,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:02:42,536 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 240 transitions. [2020-10-06 01:02:42,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 01:02:42,537 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 240 transitions. [2020-10-06 01:02:42,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-06 01:02:42,538 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:02:42,538 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:02:42,538 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-06 01:02:42,538 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:02:42,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:02:42,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1700985471, now seen corresponding path program 1 times [2020-10-06 01:02:42,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:02:42,540 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088190415] [2020-10-06 01:02:42,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:02:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:02:42,812 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-06 01:02:42,813 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088190415] [2020-10-06 01:02:42,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:02:42,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:02:42,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [340679521] [2020-10-06 01:02:42,814 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:02:42,820 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:02:42,823 INFO L258 McrAutomatonBuilder]: Finished intersection with 20 states and 28 transitions. [2020-10-06 01:02:42,824 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:02:42,907 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [2136#(or (not (= (mod ~y$w_buff0_used~0 256) 0)) (and (<= ~y~0 0) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd0~0)))] [2020-10-06 01:02:42,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-06 01:02:42,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:02:42,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-06 01:02:42,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-06 01:02:42,909 INFO L87 Difference]: Start difference. First operand 107 states and 240 transitions. Second operand 6 states. [2020-10-06 01:02:43,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:02:43,045 INFO L93 Difference]: Finished difference Result 124 states and 283 transitions. [2020-10-06 01:02:43,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 01:02:43,046 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-10-06 01:02:43,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:02:43,048 INFO L225 Difference]: With dead ends: 124 [2020-10-06 01:02:43,048 INFO L226 Difference]: Without dead ends: 124 [2020-10-06 01:02:43,049 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-06 01:02:43,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-10-06 01:02:43,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 106. [2020-10-06 01:02:43,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-06 01:02:43,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 237 transitions. [2020-10-06 01:02:43,063 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 237 transitions. Word has length 10 [2020-10-06 01:02:43,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:02:43,063 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 237 transitions. [2020-10-06 01:02:43,063 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-06 01:02:43,064 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 237 transitions. [2020-10-06 01:02:43,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-06 01:02:43,070 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:02:43,070 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:02:43,070 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-06 01:02:43,070 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:02:43,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:02:43,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1218802089, now seen corresponding path program 1 times [2020-10-06 01:02:43,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:02:43,076 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736471866] [2020-10-06 01:02:43,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:02:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:02:43,160 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-06 01:02:43,163 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736471866] [2020-10-06 01:02:43,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:02:43,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-06 01:02:43,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1971670202] [2020-10-06 01:02:43,165 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:02:43,167 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:02:43,171 INFO L258 McrAutomatonBuilder]: Finished intersection with 22 states and 33 transitions. [2020-10-06 01:02:43,171 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:02:43,248 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:02:43,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-06 01:02:43,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:02:43,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-06 01:02:43,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-06 01:02:43,250 INFO L87 Difference]: Start difference. First operand 106 states and 237 transitions. Second operand 4 states. [2020-10-06 01:02:43,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:02:43,267 INFO L93 Difference]: Finished difference Result 134 states and 291 transitions. [2020-10-06 01:02:43,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 01:02:43,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-06 01:02:43,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:02:43,269 INFO L225 Difference]: With dead ends: 134 [2020-10-06 01:02:43,269 INFO L226 Difference]: Without dead ends: 74 [2020-10-06 01:02:43,269 INFO L675 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-06 01:02:43,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-06 01:02:43,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-10-06 01:02:43,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-06 01:02:43,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 152 transitions. [2020-10-06 01:02:43,273 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 152 transitions. Word has length 11 [2020-10-06 01:02:43,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:02:43,273 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 152 transitions. [2020-10-06 01:02:43,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-06 01:02:43,274 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 152 transitions. [2020-10-06 01:02:43,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-06 01:02:43,275 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:02:43,275 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:02:43,275 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-06 01:02:43,275 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:02:43,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:02:43,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1190886961, now seen corresponding path program 1 times [2020-10-06 01:02:43,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:02:43,277 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626795421] [2020-10-06 01:02:43,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:02:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:02:43,424 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-06 01:02:43,424 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626795421] [2020-10-06 01:02:43,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:02:43,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 01:02:43,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [377910501] [2020-10-06 01:02:43,425 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:02:43,427 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:02:43,430 INFO L258 McrAutomatonBuilder]: Finished intersection with 20 states and 27 transitions. [2020-10-06 01:02:43,430 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:02:43,482 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [2771#(or (and (= ~y$w_buff0_used~0 0) (<= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd0~0)) (not (= (mod ~y$w_buff0_used~0 256) 0)))] [2020-10-06 01:02:43,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 01:02:43,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:02:43,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 01:02:43,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:02:43,483 INFO L87 Difference]: Start difference. First operand 74 states and 152 transitions. Second operand 7 states. [2020-10-06 01:02:43,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:02:43,644 INFO L93 Difference]: Finished difference Result 81 states and 165 transitions. [2020-10-06 01:02:43,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 01:02:43,645 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-10-06 01:02:43,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:02:43,646 INFO L225 Difference]: With dead ends: 81 [2020-10-06 01:02:43,646 INFO L226 Difference]: Without dead ends: 81 [2020-10-06 01:02:43,646 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-10-06 01:02:43,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-10-06 01:02:43,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2020-10-06 01:02:43,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-06 01:02:43,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 162 transitions. [2020-10-06 01:02:43,650 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 162 transitions. Word has length 11 [2020-10-06 01:02:43,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:02:43,651 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 162 transitions. [2020-10-06 01:02:43,651 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 01:02:43,651 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 162 transitions. [2020-10-06 01:02:43,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-06 01:02:43,652 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:02:43,652 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:02:43,652 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-06 01:02:43,652 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:02:43,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:02:43,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1190881195, now seen corresponding path program 1 times [2020-10-06 01:02:43,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:02:43,655 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709456308] [2020-10-06 01:02:43,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:02:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:02:43,721 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-06 01:02:43,721 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709456308] [2020-10-06 01:02:43,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:02:43,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:02:43,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1330886842] [2020-10-06 01:02:43,722 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:02:43,724 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:02:43,728 INFO L258 McrAutomatonBuilder]: Finished intersection with 25 states and 38 transitions. [2020-10-06 01:02:43,728 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:02:43,739 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:43,775 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:43,802 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:43,818 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:43,834 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:43,860 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [3021#(not (= 2 ~__unbuffered_cnt~0))] [2020-10-06 01:02:43,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:02:43,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:02:43,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:02:43,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:02:43,861 INFO L87 Difference]: Start difference. First operand 79 states and 162 transitions. Second operand 5 states. [2020-10-06 01:02:43,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:02:43,904 INFO L93 Difference]: Finished difference Result 53 states and 95 transitions. [2020-10-06 01:02:43,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-06 01:02:43,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-06 01:02:43,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:02:43,905 INFO L225 Difference]: With dead ends: 53 [2020-10-06 01:02:43,905 INFO L226 Difference]: Without dead ends: 34 [2020-10-06 01:02:43,905 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:02:43,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-10-06 01:02:43,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-10-06 01:02:43,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-06 01:02:43,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2020-10-06 01:02:43,907 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 47 transitions. Word has length 11 [2020-10-06 01:02:43,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:02:43,908 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 47 transitions. [2020-10-06 01:02:43,908 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:02:43,908 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 47 transitions. [2020-10-06 01:02:43,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-06 01:02:43,909 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:02:43,909 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:02:43,909 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-06 01:02:43,909 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:02:43,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:02:43,910 INFO L82 PathProgramCache]: Analyzing trace with hash -944183904, now seen corresponding path program 1 times [2020-10-06 01:02:43,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:02:43,911 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099761911] [2020-10-06 01:02:43,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:02:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 01:02:43,954 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 01:02:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 01:02:44,069 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 01:02:44,109 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-06 01:02:44,110 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-06 01:02:44,110 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-06 01:02:44,111 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-06 01:02:44,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L2-->L795: Formula: (let ((.cse7 (= (mod ~y$r_buff1_thd0~0_In-1810255531 256) 0)) (.cse6 (= (mod ~y$w_buff1_used~0_In-1810255531 256) 0)) (.cse8 (= (mod ~y$r_buff0_thd0~0_In-1810255531 256) 0)) (.cse9 (= 0 (mod ~y$w_buff0_used~0_In-1810255531 256)))) (let ((.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse2 (or .cse8 .cse9)) (.cse4 (not .cse6)) (.cse5 (not .cse7)) (.cse3 (or .cse6 .cse7))) (and (or (and (= ~y$w_buff0~0_In-1810255531 ~y~0_Out-1810255531) .cse0 .cse1) (and .cse2 (or (and (= ~y~0_Out-1810255531 ~y~0_In-1810255531) .cse3) (and .cse4 .cse5 (= ~y$w_buff1~0_In-1810255531 ~y~0_Out-1810255531))))) (= ~y$r_buff1_thd0~0_Out-1810255531 ~y$r_buff1_thd0~0_In-1810255531) (or (and (= ~y$w_buff0_used~0_Out-1810255531 0) .cse0 .cse1) (and .cse2 (= ~y$w_buff0_used~0_Out-1810255531 ~y$w_buff0_used~0_In-1810255531))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1810255531 0)) (= ~y$r_buff0_thd0~0_Out-1810255531 ~y$r_buff0_thd0~0_In-1810255531) (or (and (= ~y$w_buff1_used~0_Out-1810255531 0) .cse4 .cse5) (and (= ~y$w_buff1_used~0_In-1810255531 ~y$w_buff1_used~0_Out-1810255531) .cse3)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1810255531 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1810255531|)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1810255531|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1810255531, ~y$w_buff1~0=~y$w_buff1~0_In-1810255531, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1810255531, ~y$w_buff0~0=~y$w_buff0~0_In-1810255531, ~y~0=~y~0_In-1810255531, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1810255531, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1810255531} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1810255531, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1810255531|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1810255531|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1810255531|, ULTIMATE.start_main_#t~ite16=|ULTIMATE.start_main_#t~ite16_Out-1810255531|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1810255531|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1810255531|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1810255531|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1810255531, ~y$w_buff1~0=~y$w_buff1~0_In-1810255531, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-1810255531, ~y$w_buff0~0=~y$w_buff0~0_In-1810255531, ~y~0=~y~0_Out-1810255531, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1810255531, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1810255531} 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-06 01:02:44,124 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-06 01:02:44,124 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:44,126 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-06 01:02:44,126 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:44,126 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-06 01:02:44,127 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:44,127 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-06 01:02:44,127 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:44,127 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-06 01:02:44,127 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:44,127 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-06 01:02:44,128 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:44,128 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-06 01:02:44,128 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:44,128 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-06 01:02:44,128 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:44,129 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-06 01:02:44,129 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:44,129 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-06 01:02:44,129 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:44,129 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-06 01:02:44,129 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:44,130 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-06 01:02:44,130 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:44,131 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-06 01:02:44,131 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:44,131 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-06 01:02:44,131 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:44,131 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-06 01:02:44,132 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:44,132 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-06 01:02:44,132 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:44,132 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-06 01:02:44,132 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:44,132 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-06 01:02:44,133 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:44,133 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-06 01:02:44,133 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:44,133 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-06 01:02:44,133 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:44,133 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-06 01:02:44,134 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:44,134 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-06 01:02:44,134 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:44,134 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-06 01:02:44,134 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:44,135 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-06 01:02:44,135 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:44,135 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-06 01:02:44,135 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:44,135 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-06 01:02:44,135 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:44,136 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-06 01:02:44,136 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:44,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.10 01:02:44 BasicIcfg [2020-10-06 01:02:44,192 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-06 01:02:44,193 INFO L168 Benchmark]: Toolchain (without parser) took 12510.75 ms. Allocated memory was 137.9 MB in the beginning and 366.5 MB in the end (delta: 228.6 MB). Free memory was 99.8 MB in the beginning and 308.5 MB in the end (delta: -208.6 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. [2020-10-06 01:02:44,194 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-06 01:02:44,195 INFO L168 Benchmark]: CACSL2BoogieTranslator took 760.81 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 99.6 MB in the beginning and 156.6 MB in the end (delta: -57.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2020-10-06 01:02:44,196 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.71 ms. Allocated memory is still 201.3 MB. Free memory was 156.6 MB in the beginning and 153.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-06 01:02:44,198 INFO L168 Benchmark]: Boogie Preprocessor took 37.43 ms. Allocated memory is still 201.3 MB. Free memory was 153.7 MB in the beginning and 151.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-06 01:02:44,200 INFO L168 Benchmark]: RCFGBuilder took 1971.52 ms. Allocated memory was 201.3 MB in the beginning and 252.2 MB in the end (delta: 50.9 MB). Free memory was 151.0 MB in the beginning and 212.1 MB in the end (delta: -61.1 MB). Peak memory consumption was 105.6 MB. Max. memory is 7.1 GB. [2020-10-06 01:02:44,201 INFO L168 Benchmark]: TraceAbstraction took 9666.23 ms. Allocated memory was 252.2 MB in the beginning and 366.5 MB in the end (delta: 114.3 MB). Free memory was 210.1 MB in the beginning and 308.5 MB in the end (delta: -98.4 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2020-10-06 01:02:44,212 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.22 ms. Allocated memory is still 137.9 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 760.81 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 99.6 MB in the beginning and 156.6 MB in the end (delta: -57.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.71 ms. Allocated memory is still 201.3 MB. Free memory was 156.6 MB in the beginning and 153.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.43 ms. Allocated memory is still 201.3 MB. Free memory was 153.7 MB in the beginning and 151.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1971.52 ms. Allocated memory was 201.3 MB in the beginning and 252.2 MB in the end (delta: 50.9 MB). Free memory was 151.0 MB in the beginning and 212.1 MB in the end (delta: -61.1 MB). Peak memory consumption was 105.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9666.23 ms. Allocated memory was 252.2 MB in the beginning and 366.5 MB in the end (delta: 114.3 MB). Free memory was 210.1 MB in the beginning and 308.5 MB in the end (delta: -98.4 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 80 ProgramPointsBefore, 26 ProgramPointsAfterwards, 75 TransitionsBefore, 19 TransitionsAfterwards, 896 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 451 VarBasedMoverChecksPositive, 23 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2325 CheckedPairsTotal, 64 TotalNumberOfCompositions - 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 t2017; [L782] FCALL, FORK 0 pthread_create(&t2017, ((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 t2018; [L784] FCALL, FORK 0 pthread_create(&t2018, ((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.4s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 121 SDtfs, 129 SDslu, 193 SDs, 0 SdLazy, 207 SolverSat, 81 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.8s 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.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 62 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 69 ConstructedInterpolants, 0 QuantifiedInterpolants, 4875 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...