/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/safe030_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 13:46:52,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 13:46:52,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 13:46:52,417 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 13:46:52,417 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 13:46:52,426 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 13:46:52,427 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 13:46:52,430 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 13:46:52,432 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 13:46:52,435 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 13:46:52,436 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 13:46:52,438 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 13:46:52,438 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 13:46:52,441 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 13:46:52,443 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 13:46:52,445 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 13:46:52,447 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 13:46:52,448 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 13:46:52,449 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 13:46:52,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 13:46:52,459 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 13:46:52,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 13:46:52,461 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 13:46:52,461 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 13:46:52,473 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 13:46:52,474 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 13:46:52,474 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 13:46:52,475 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 13:46:52,478 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 13:46:52,479 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 13:46:52,479 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 13:46:52,480 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 13:46:52,480 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 13:46:52,485 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 13:46:52,486 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 13:46:52,486 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 13:46:52,487 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 13:46:52,487 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 13:46:52,487 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 13:46:52,488 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 13:46:52,489 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 13:46:52,490 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-16 13:46:52,528 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 13:46:52,528 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 13:46:52,530 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 13:46:52,530 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 13:46:52,530 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 13:46:52,531 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 13:46:52,531 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 13:46:52,531 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 13:46:52,531 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 13:46:52,531 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 13:46:52,532 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 13:46:52,533 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 13:46:52,533 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 13:46:52,533 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 13:46:52,533 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 13:46:52,534 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 13:46:52,534 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 13:46:52,534 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 13:46:52,534 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 13:46:52,534 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 13:46:52,535 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 13:46:52,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 13:46:52,535 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 13:46:52,535 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 13:46:52,535 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 13:46:52,536 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 13:46:52,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 13:46:52,536 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-16 13:46:52,536 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 13:46:52,536 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 13:46:52,537 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-16 13:46:52,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 13:46:52,831 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 13:46:52,835 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 13:46:52,836 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 13:46:52,837 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 13:46:52,837 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt.i [2020-10-16 13:46:52,895 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f9a9f8ae3/b5ac0fce2df149ffa4957ff4fcc6cb83/FLAG01e1e472b [2020-10-16 13:46:53,406 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 13:46:53,407 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe030_power.opt.i [2020-10-16 13:46:53,426 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f9a9f8ae3/b5ac0fce2df149ffa4957ff4fcc6cb83/FLAG01e1e472b [2020-10-16 13:46:53,726 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f9a9f8ae3/b5ac0fce2df149ffa4957ff4fcc6cb83 [2020-10-16 13:46:53,734 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 13:46:53,736 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 13:46:53,737 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 13:46:53,737 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 13:46:53,740 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 13:46:53,741 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:46:53" (1/1) ... [2020-10-16 13:46:53,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14615d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:53, skipping insertion in model container [2020-10-16 13:46:53,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:46:53" (1/1) ... [2020-10-16 13:46:53,752 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 13:46:53,799 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 13:46:54,356 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 13:46:54,377 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 13:46:54,474 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 13:46:54,563 INFO L208 MainTranslator]: Completed translation [2020-10-16 13:46:54,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:54 WrapperNode [2020-10-16 13:46:54,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 13:46:54,565 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 13:46:54,565 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 13:46:54,565 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 13:46:54,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:54" (1/1) ... [2020-10-16 13:46:54,594 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:54" (1/1) ... [2020-10-16 13:46:54,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 13:46:54,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 13:46:54,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 13:46:54,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 13:46:54,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:54" (1/1) ... [2020-10-16 13:46:54,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:54" (1/1) ... [2020-10-16 13:46:54,655 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:54" (1/1) ... [2020-10-16 13:46:54,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:54" (1/1) ... [2020-10-16 13:46:54,668 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:54" (1/1) ... [2020-10-16 13:46:54,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:54" (1/1) ... [2020-10-16 13:46:54,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:54" (1/1) ... [2020-10-16 13:46:54,683 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 13:46:54,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 13:46:54,684 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 13:46:54,684 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 13:46:54,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:54" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 13:46:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 13:46:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 13:46:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 13:46:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 13:46:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 13:46:54,745 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 13:46:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 13:46:54,746 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 13:46:54,746 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 13:46:54,746 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 13:46:54,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 13:46:54,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 13:46:54,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 13:46:54,748 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 13:46:56,599 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 13:46:56,600 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 13:46:56,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:46:56 BoogieIcfgContainer [2020-10-16 13:46:56,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 13:46:56,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 13:46:56,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 13:46:56,607 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 13:46:56,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:46:53" (1/3) ... [2020-10-16 13:46:56,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1e9a78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:46:56, skipping insertion in model container [2020-10-16 13:46:56,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:54" (2/3) ... [2020-10-16 13:46:56,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1e9a78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:46:56, skipping insertion in model container [2020-10-16 13:46:56,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:46:56" (3/3) ... [2020-10-16 13:46:56,611 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_power.opt.i [2020-10-16 13:46:56,623 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 13:46:56,623 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 13:46:56,631 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 13:46:56,632 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 13:46:56,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,662 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,662 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,662 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,663 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,663 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,663 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,663 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,664 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,664 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,667 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,667 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,668 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,668 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,670 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,670 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,674 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,675 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,679 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,679 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,680 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,682 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,682 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,683 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,683 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:56,688 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 13:46:56,703 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 13:46:56,724 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 13:46:56,724 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 13:46:56,725 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 13:46:56,725 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-16 13:46:56,725 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 13:46:56,725 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 13:46:56,725 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 13:46:56,725 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 13:46:56,739 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 13:46:56,740 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 90 transitions, 195 flow [2020-10-16 13:46:56,743 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 90 transitions, 195 flow [2020-10-16 13:46:56,744 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 98 places, 90 transitions, 195 flow [2020-10-16 13:46:56,788 INFO L129 PetriNetUnfolder]: 2/87 cut-off events. [2020-10-16 13:46:56,788 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 13:46:56,793 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-16 13:46:56,796 INFO L117 LiptonReduction]: Number of co-enabled transitions 1536 [2020-10-16 13:46:58,430 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-16 13:46:58,476 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 13:46:58,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:46:58,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 13:46:58,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:46:59,632 WARN L193 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-10-16 13:47:00,159 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 13:47:01,039 WARN L193 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 108 [2020-10-16 13:47:01,284 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-16 13:47:02,258 WARN L193 SmtUtils]: Spent 914.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 124 [2020-10-16 13:47:02,544 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-16 13:47:03,104 WARN L193 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-16 13:47:03,443 WARN L193 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-16 13:47:03,764 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-10-16 13:47:03,873 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-16 13:47:03,880 INFO L132 LiptonReduction]: Checked pairs total: 4063 [2020-10-16 13:47:03,880 INFO L134 LiptonReduction]: Total number of compositions: 77 [2020-10-16 13:47:03,886 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2020-10-16 13:47:03,942 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 650 states. [2020-10-16 13:47:03,945 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states. [2020-10-16 13:47:03,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-16 13:47:03,952 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:47:03,953 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:47:03,953 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:47:03,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:47:03,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1708036412, now seen corresponding path program 1 times [2020-10-16 13:47:03,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:47:03,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309754283] [2020-10-16 13:47:03,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:47:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:47:04,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:47:04,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309754283] [2020-10-16 13:47:04,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:47:04,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:47:04,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [413279435] [2020-10-16 13:47:04,219 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:47:04,222 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:47:04,237 INFO L258 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-16 13:47:04,237 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:47:04,241 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:47:04,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:47:04,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:47:04,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:47:04,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:47:04,259 INFO L87 Difference]: Start difference. First operand 650 states. Second operand 3 states. [2020-10-16 13:47:04,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:47:04,337 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions. [2020-10-16 13:47:04,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:47:04,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-16 13:47:04,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:47:04,359 INFO L225 Difference]: With dead ends: 550 [2020-10-16 13:47:04,359 INFO L226 Difference]: Without dead ends: 450 [2020-10-16 13:47:04,361 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:47:04,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-10-16 13:47:04,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2020-10-16 13:47:04,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-10-16 13:47:04,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2020-10-16 13:47:04,443 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 7 [2020-10-16 13:47:04,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:47:04,444 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2020-10-16 13:47:04,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:47:04,444 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2020-10-16 13:47:04,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 13:47:04,446 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:47:04,446 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:47:04,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 13:47:04,447 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:47:04,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:47:04,447 INFO L82 PathProgramCache]: Analyzing trace with hash 745532085, now seen corresponding path program 1 times [2020-10-16 13:47:04,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:47:04,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58315110] [2020-10-16 13:47:04,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:47:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:47:04,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:47:04,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58315110] [2020-10-16 13:47:04,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:47:04,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:47:04,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2111424502] [2020-10-16 13:47:04,575 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:47:04,576 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:47:04,578 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-16 13:47:04,578 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:47:04,578 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:47:04,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:47:04,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:47:04,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:47:04,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:47:04,590 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states. [2020-10-16 13:47:04,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:47:04,612 INFO L93 Difference]: Finished difference Result 440 states and 1320 transitions. [2020-10-16 13:47:04,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:47:04,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-16 13:47:04,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:47:04,619 INFO L225 Difference]: With dead ends: 440 [2020-10-16 13:47:04,619 INFO L226 Difference]: Without dead ends: 440 [2020-10-16 13:47:04,620 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:47:04,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-10-16 13:47:04,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2020-10-16 13:47:04,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-10-16 13:47:04,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1320 transitions. [2020-10-16 13:47:04,647 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1320 transitions. Word has length 9 [2020-10-16 13:47:04,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:47:04,647 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 1320 transitions. [2020-10-16 13:47:04,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:47:04,648 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1320 transitions. [2020-10-16 13:47:04,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 13:47:04,650 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:47:04,650 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:47:04,650 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 13:47:04,650 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:47:04,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:47:04,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1113659616, now seen corresponding path program 1 times [2020-10-16 13:47:04,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:47:04,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603126689] [2020-10-16 13:47:04,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:47:04,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:47:04,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:47:04,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603126689] [2020-10-16 13:47:04,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:47:04,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:47:04,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1738097645] [2020-10-16 13:47:04,752 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:47:04,754 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:47:04,755 INFO L258 McrAutomatonBuilder]: Finished intersection with 15 states and 18 transitions. [2020-10-16 13:47:04,756 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:47:04,792 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:47:04,792 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:47:04,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:47:04,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:47:04,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:47:04,794 INFO L87 Difference]: Start difference. First operand 440 states and 1320 transitions. Second operand 3 states. [2020-10-16 13:47:04,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:47:04,806 INFO L93 Difference]: Finished difference Result 432 states and 1290 transitions. [2020-10-16 13:47:04,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:47:04,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-16 13:47:04,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:47:04,811 INFO L225 Difference]: With dead ends: 432 [2020-10-16 13:47:04,811 INFO L226 Difference]: Without dead ends: 432 [2020-10-16 13:47:04,812 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:47:04,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2020-10-16 13:47:04,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2020-10-16 13:47:04,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2020-10-16 13:47:04,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1290 transitions. [2020-10-16 13:47:04,835 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 1290 transitions. Word has length 10 [2020-10-16 13:47:04,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:47:04,835 INFO L481 AbstractCegarLoop]: Abstraction has 432 states and 1290 transitions. [2020-10-16 13:47:04,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:47:04,835 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 1290 transitions. [2020-10-16 13:47:04,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 13:47:04,837 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:47:04,838 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:47:04,838 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 13:47:04,838 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:47:04,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:47:04,838 INFO L82 PathProgramCache]: Analyzing trace with hash 163709616, now seen corresponding path program 1 times [2020-10-16 13:47:04,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:47:04,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595017237] [2020-10-16 13:47:04,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:47:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:47:04,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:47:04,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595017237] [2020-10-16 13:47:04,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:47:04,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:47:04,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [371162511] [2020-10-16 13:47:04,943 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:47:04,945 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:47:04,948 INFO L258 McrAutomatonBuilder]: Finished intersection with 27 states and 45 transitions. [2020-10-16 13:47:04,948 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:47:04,980 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 13:47:04,981 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:04,982 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:47:04,982 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:04,985 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:04,995 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:47:05,012 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:05,015 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:05,027 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:05,035 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:05,051 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 13:47:05,052 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:05,053 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:47:05,053 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:05,055 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:47:05,067 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:05,069 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:05,073 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:05,080 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:05,083 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:05,090 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:47:05,108 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 13:47:05,108 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:05,109 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:47:05,110 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:05,111 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:05,120 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:05,125 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:05,186 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:47:05,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:47:05,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:47:05,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:47:05,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:47:05,188 INFO L87 Difference]: Start difference. First operand 432 states and 1290 transitions. Second operand 3 states. [2020-10-16 13:47:05,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:47:05,222 INFO L93 Difference]: Finished difference Result 427 states and 1272 transitions. [2020-10-16 13:47:05,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:47:05,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-16 13:47:05,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:47:05,231 INFO L225 Difference]: With dead ends: 427 [2020-10-16 13:47:05,232 INFO L226 Difference]: Without dead ends: 427 [2020-10-16 13:47:05,232 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:47:05,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2020-10-16 13:47:05,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2020-10-16 13:47:05,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-10-16 13:47:05,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1272 transitions. [2020-10-16 13:47:05,250 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1272 transitions. Word has length 11 [2020-10-16 13:47:05,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:47:05,250 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 1272 transitions. [2020-10-16 13:47:05,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:47:05,251 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1272 transitions. [2020-10-16 13:47:05,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 13:47:05,259 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:47:05,259 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:47:05,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 13:47:05,261 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:47:05,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:47:05,261 INFO L82 PathProgramCache]: Analyzing trace with hash 760956636, now seen corresponding path program 1 times [2020-10-16 13:47:05,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:47:05,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061685403] [2020-10-16 13:47:05,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:47:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:47:05,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:47:05,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061685403] [2020-10-16 13:47:05,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:47:05,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 13:47:05,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1182700978] [2020-10-16 13:47:05,411 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:47:05,413 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:47:05,417 INFO L258 McrAutomatonBuilder]: Finished intersection with 25 states and 39 transitions. [2020-10-16 13:47:05,417 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:47:05,446 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 13:47:05,446 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:05,447 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:47:05,447 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:05,448 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:05,449 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:05,452 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:47:05,458 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:47:05,461 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:05,473 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:05,476 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:47:05,482 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:05,504 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 13:47:05,505 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:05,505 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 13:47:05,506 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:05,507 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:47:05,510 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:05,512 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:05,513 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:05,567 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 13:47:05,568 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:05,568 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:05,575 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:47:05,584 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:47:05,594 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:05,601 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:47:05,607 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:05,608 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:05,713 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [6766#(and (= ~y~0 ~y$w_buff1~0) (= ~y~0 0))] [2020-10-16 13:47:05,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 13:47:05,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:47:05,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 13:47:05,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:47:05,714 INFO L87 Difference]: Start difference. First operand 427 states and 1272 transitions. Second operand 7 states. [2020-10-16 13:47:05,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:47:05,833 INFO L93 Difference]: Finished difference Result 434 states and 1292 transitions. [2020-10-16 13:47:05,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 13:47:05,834 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-10-16 13:47:05,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:47:05,838 INFO L225 Difference]: With dead ends: 434 [2020-10-16 13:47:05,839 INFO L226 Difference]: Without dead ends: 434 [2020-10-16 13:47:05,839 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-16 13:47:05,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-10-16 13:47:05,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 416. [2020-10-16 13:47:05,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2020-10-16 13:47:05,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1232 transitions. [2020-10-16 13:47:05,853 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1232 transitions. Word has length 12 [2020-10-16 13:47:05,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:47:05,854 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 1232 transitions. [2020-10-16 13:47:05,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 13:47:05,854 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1232 transitions. [2020-10-16 13:47:05,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 13:47:05,855 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:47:05,855 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:47:05,855 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 13:47:05,856 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:47:05,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:47:05,856 INFO L82 PathProgramCache]: Analyzing trace with hash 779984560, now seen corresponding path program 1 times [2020-10-16 13:47:05,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:47:05,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195980862] [2020-10-16 13:47:05,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:47:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:47:05,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:47:05,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195980862] [2020-10-16 13:47:05,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:47:05,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:47:05,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1915295281] [2020-10-16 13:47:05,930 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:47:05,932 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:47:05,936 INFO L258 McrAutomatonBuilder]: Finished intersection with 29 states and 48 transitions. [2020-10-16 13:47:05,937 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:47:05,950 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:47:05,961 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:05,966 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:05,970 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:05,996 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:47:06,001 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:06,002 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:06,008 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:06,034 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:47:06,039 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:06,040 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:06,045 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:06,090 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:47:06,090 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 13:47:06,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:47:06,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 13:47:06,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:47:06,091 INFO L87 Difference]: Start difference. First operand 416 states and 1232 transitions. Second operand 4 states. [2020-10-16 13:47:06,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:47:06,137 INFO L93 Difference]: Finished difference Result 420 states and 1243 transitions. [2020-10-16 13:47:06,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:47:06,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-16 13:47:06,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:47:06,141 INFO L225 Difference]: With dead ends: 420 [2020-10-16 13:47:06,141 INFO L226 Difference]: Without dead ends: 420 [2020-10-16 13:47:06,142 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:47:06,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2020-10-16 13:47:06,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2020-10-16 13:47:06,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2020-10-16 13:47:06,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1243 transitions. [2020-10-16 13:47:06,155 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1243 transitions. Word has length 12 [2020-10-16 13:47:06,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:47:06,155 INFO L481 AbstractCegarLoop]: Abstraction has 420 states and 1243 transitions. [2020-10-16 13:47:06,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 13:47:06,156 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1243 transitions. [2020-10-16 13:47:06,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 13:47:06,157 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:47:06,157 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:47:06,157 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 13:47:06,157 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:47:06,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:47:06,158 INFO L82 PathProgramCache]: Analyzing trace with hash 777822310, now seen corresponding path program 2 times [2020-10-16 13:47:06,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:47:06,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462318304] [2020-10-16 13:47:06,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:47:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:47:06,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:47:06,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462318304] [2020-10-16 13:47:06,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:47:06,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:47:06,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [157907985] [2020-10-16 13:47:06,259 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:47:06,260 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:47:06,265 INFO L258 McrAutomatonBuilder]: Finished intersection with 33 states and 58 transitions. [2020-10-16 13:47:06,266 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:47:06,275 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:47:06,277 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:47:06,278 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 13:47:06,278 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:47:06,280 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 13:47:06,286 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:06,301 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 13:47:06,303 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:47:06,312 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:06,393 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:47:06,393 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:47:06,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:47:06,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:47:06,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:47:06,394 INFO L87 Difference]: Start difference. First operand 420 states and 1243 transitions. Second operand 5 states. [2020-10-16 13:47:06,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:47:06,452 INFO L93 Difference]: Finished difference Result 417 states and 1232 transitions. [2020-10-16 13:47:06,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 13:47:06,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-16 13:47:06,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:47:06,457 INFO L225 Difference]: With dead ends: 417 [2020-10-16 13:47:06,458 INFO L226 Difference]: Without dead ends: 417 [2020-10-16 13:47:06,458 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:47:06,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2020-10-16 13:47:06,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 413. [2020-10-16 13:47:06,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2020-10-16 13:47:06,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 1221 transitions. [2020-10-16 13:47:06,471 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 1221 transitions. Word has length 12 [2020-10-16 13:47:06,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:47:06,472 INFO L481 AbstractCegarLoop]: Abstraction has 413 states and 1221 transitions. [2020-10-16 13:47:06,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:47:06,472 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 1221 transitions. [2020-10-16 13:47:06,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 13:47:06,473 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:47:06,473 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:47:06,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 13:47:06,474 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:47:06,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:47:06,474 INFO L82 PathProgramCache]: Analyzing trace with hash 2114756535, now seen corresponding path program 1 times [2020-10-16 13:47:06,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:47:06,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137626086] [2020-10-16 13:47:06,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:47:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:47:06,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:47:06,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137626086] [2020-10-16 13:47:06,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:47:06,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:47:06,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [956718095] [2020-10-16 13:47:06,515 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:47:06,517 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:47:06,524 INFO L258 McrAutomatonBuilder]: Finished intersection with 27 states and 42 transitions. [2020-10-16 13:47:06,524 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:47:06,565 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:47:06,566 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:47:06,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:47:06,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:47:06,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:47:06,567 INFO L87 Difference]: Start difference. First operand 413 states and 1221 transitions. Second operand 3 states. [2020-10-16 13:47:06,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:47:06,581 INFO L93 Difference]: Finished difference Result 564 states and 1616 transitions. [2020-10-16 13:47:06,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:47:06,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-16 13:47:06,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:47:06,586 INFO L225 Difference]: With dead ends: 564 [2020-10-16 13:47:06,586 INFO L226 Difference]: Without dead ends: 429 [2020-10-16 13:47:06,586 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:47:06,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2020-10-16 13:47:06,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 402. [2020-10-16 13:47:06,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-10-16 13:47:06,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1139 transitions. [2020-10-16 13:47:06,600 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1139 transitions. Word has length 13 [2020-10-16 13:47:06,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:47:06,601 INFO L481 AbstractCegarLoop]: Abstraction has 402 states and 1139 transitions. [2020-10-16 13:47:06,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:47:06,601 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1139 transitions. [2020-10-16 13:47:06,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 13:47:06,602 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:47:06,602 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:47:06,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 13:47:06,603 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:47:06,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:47:06,603 INFO L82 PathProgramCache]: Analyzing trace with hash 2116743046, now seen corresponding path program 1 times [2020-10-16 13:47:06,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:47:06,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747410211] [2020-10-16 13:47:06,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:47:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:47:06,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:47:06,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747410211] [2020-10-16 13:47:06,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:47:06,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:47:06,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1003782100] [2020-10-16 13:47:06,680 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:47:06,682 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:47:06,688 INFO L258 McrAutomatonBuilder]: Finished intersection with 37 states and 68 transitions. [2020-10-16 13:47:06,688 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:47:06,702 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:47:06,708 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:06,709 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:06,715 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-16 13:47:06,719 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:06,726 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 13:47:06,754 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:47:06,756 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:06,758 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:06,765 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:47:06,770 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-16 13:47:06,773 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:47:06,781 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:06,782 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:47:06,819 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:06,821 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:47:06,826 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:06,831 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 13:47:06,918 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:47:06,919 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:47:06,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:47:06,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:47:06,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:47:06,920 INFO L87 Difference]: Start difference. First operand 402 states and 1139 transitions. Second operand 5 states. [2020-10-16 13:47:07,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:47:07,037 INFO L93 Difference]: Finished difference Result 444 states and 1252 transitions. [2020-10-16 13:47:07,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 13:47:07,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-16 13:47:07,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:47:07,041 INFO L225 Difference]: With dead ends: 444 [2020-10-16 13:47:07,042 INFO L226 Difference]: Without dead ends: 444 [2020-10-16 13:47:07,042 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:47:07,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2020-10-16 13:47:07,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 422. [2020-10-16 13:47:07,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2020-10-16 13:47:07,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1187 transitions. [2020-10-16 13:47:07,056 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1187 transitions. Word has length 13 [2020-10-16 13:47:07,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:47:07,056 INFO L481 AbstractCegarLoop]: Abstraction has 422 states and 1187 transitions. [2020-10-16 13:47:07,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:47:07,056 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1187 transitions. [2020-10-16 13:47:07,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 13:47:07,057 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:47:07,057 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:47:07,057 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 13:47:07,058 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:47:07,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:47:07,058 INFO L82 PathProgramCache]: Analyzing trace with hash 2114580796, now seen corresponding path program 2 times [2020-10-16 13:47:07,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:47:07,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786389141] [2020-10-16 13:47:07,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:47:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:47:07,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:47:07,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786389141] [2020-10-16 13:47:07,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:47:07,155 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 13:47:07,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [308755979] [2020-10-16 13:47:07,156 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:47:07,157 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:47:07,170 INFO L258 McrAutomatonBuilder]: Finished intersection with 45 states and 90 transitions. [2020-10-16 13:47:07,170 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:47:07,180 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 13:47:07,180 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:07,181 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:47:07,181 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:07,182 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:47:07,188 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:07,189 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:07,190 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:07,197 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 13:47:07,198 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:07,199 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:07,205 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:47:07,214 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:47:07,216 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:07,217 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:07,232 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:47:07,237 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:07,418 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [13221#(and (= ~y~0 1) (= ~y$w_buff0~0 0) (= ~y$r_buff0_thd0~0 0))] [2020-10-16 13:47:07,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 13:47:07,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:47:07,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 13:47:07,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:47:07,419 INFO L87 Difference]: Start difference. First operand 422 states and 1187 transitions. Second operand 7 states. [2020-10-16 13:47:07,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:47:07,540 INFO L93 Difference]: Finished difference Result 446 states and 1248 transitions. [2020-10-16 13:47:07,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 13:47:07,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-10-16 13:47:07,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:47:07,544 INFO L225 Difference]: With dead ends: 446 [2020-10-16 13:47:07,544 INFO L226 Difference]: Without dead ends: 446 [2020-10-16 13:47:07,545 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-16 13:47:07,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2020-10-16 13:47:07,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 420. [2020-10-16 13:47:07,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2020-10-16 13:47:07,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1187 transitions. [2020-10-16 13:47:07,558 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1187 transitions. Word has length 13 [2020-10-16 13:47:07,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:47:07,558 INFO L481 AbstractCegarLoop]: Abstraction has 420 states and 1187 transitions. [2020-10-16 13:47:07,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 13:47:07,558 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1187 transitions. [2020-10-16 13:47:07,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 13:47:07,559 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:47:07,560 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:47:07,560 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 13:47:07,560 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:47:07,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:47:07,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1590283985, now seen corresponding path program 1 times [2020-10-16 13:47:07,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:47:07,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014936298] [2020-10-16 13:47:07,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:47:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:47:07,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:47:07,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014936298] [2020-10-16 13:47:07,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:47:07,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:47:07,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1808037203] [2020-10-16 13:47:07,640 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:47:07,641 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:47:07,649 INFO L258 McrAutomatonBuilder]: Finished intersection with 31 states and 51 transitions. [2020-10-16 13:47:07,650 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:47:07,662 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:07,678 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:47:07,682 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:07,683 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:07,688 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:07,708 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:47:07,712 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:07,713 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:07,718 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:07,760 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:47:07,761 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:47:07,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:47:07,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:47:07,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:47:07,762 INFO L87 Difference]: Start difference. First operand 420 states and 1187 transitions. Second operand 5 states. [2020-10-16 13:47:07,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:47:07,820 INFO L93 Difference]: Finished difference Result 432 states and 1216 transitions. [2020-10-16 13:47:07,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:47:07,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-16 13:47:07,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:47:07,825 INFO L225 Difference]: With dead ends: 432 [2020-10-16 13:47:07,825 INFO L226 Difference]: Without dead ends: 432 [2020-10-16 13:47:07,825 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:47:07,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2020-10-16 13:47:07,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2020-10-16 13:47:07,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2020-10-16 13:47:07,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1216 transitions. [2020-10-16 13:47:07,838 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 1216 transitions. Word has length 13 [2020-10-16 13:47:07,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:47:07,839 INFO L481 AbstractCegarLoop]: Abstraction has 432 states and 1216 transitions. [2020-10-16 13:47:07,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:47:07,839 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 1216 transitions. [2020-10-16 13:47:07,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 13:47:07,840 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:47:07,840 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:47:07,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 13:47:07,840 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:47:07,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:47:07,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1657313735, now seen corresponding path program 2 times [2020-10-16 13:47:07,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:47:07,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591764606] [2020-10-16 13:47:07,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:47:07,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:47:07,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:47:07,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591764606] [2020-10-16 13:47:07,969 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:47:07,969 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 13:47:07,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1459786565] [2020-10-16 13:47:07,969 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:47:07,971 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:47:07,977 INFO L258 McrAutomatonBuilder]: Finished intersection with 35 states and 61 transitions. [2020-10-16 13:47:07,977 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:47:07,991 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-10-16 13:47:07,992 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:07,992 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-10-16 13:47:07,993 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:07,995 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:07,995 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:47:08,000 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:47:08,103 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [15819#(and (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0))] [2020-10-16 13:47:08,104 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 13:47:08,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:47:08,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 13:47:08,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:47:08,104 INFO L87 Difference]: Start difference. First operand 432 states and 1216 transitions. Second operand 7 states. [2020-10-16 13:47:08,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:47:08,196 INFO L93 Difference]: Finished difference Result 480 states and 1308 transitions. [2020-10-16 13:47:08,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 13:47:08,201 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-10-16 13:47:08,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:47:08,208 INFO L225 Difference]: With dead ends: 480 [2020-10-16 13:47:08,208 INFO L226 Difference]: Without dead ends: 273 [2020-10-16 13:47:08,209 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-10-16 13:47:08,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-10-16 13:47:08,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2020-10-16 13:47:08,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2020-10-16 13:47:08,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 673 transitions. [2020-10-16 13:47:08,217 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 673 transitions. Word has length 13 [2020-10-16 13:47:08,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:47:08,218 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 673 transitions. [2020-10-16 13:47:08,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 13:47:08,218 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 673 transitions. [2020-10-16 13:47:08,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 13:47:08,219 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:47:08,219 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:47:08,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 13:47:08,219 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:47:08,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:47:08,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1132943033, now seen corresponding path program 1 times [2020-10-16 13:47:08,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:47:08,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326975057] [2020-10-16 13:47:08,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:47:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:47:08,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:47:08,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326975057] [2020-10-16 13:47:08,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:47:08,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:47:08,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1607965972] [2020-10-16 13:47:08,345 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:47:08,347 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:47:08,356 INFO L258 McrAutomatonBuilder]: Finished intersection with 51 states and 101 transitions. [2020-10-16 13:47:08,356 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:47:08,461 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:08,477 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:08,484 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:08,497 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:08,512 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:08,524 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:08,531 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:08,545 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:08,551 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:08,570 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:08,585 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [16810#(not (= 3 ~__unbuffered_cnt~0))] [2020-10-16 13:47:08,586 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:47:08,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:47:08,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:47:08,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:47:08,587 INFO L87 Difference]: Start difference. First operand 252 states and 673 transitions. Second operand 5 states. [2020-10-16 13:47:08,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:47:08,647 INFO L93 Difference]: Finished difference Result 182 states and 419 transitions. [2020-10-16 13:47:08,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 13:47:08,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-16 13:47:08,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:47:08,649 INFO L225 Difference]: With dead ends: 182 [2020-10-16 13:47:08,649 INFO L226 Difference]: Without dead ends: 112 [2020-10-16 13:47:08,649 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:47:08,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-16 13:47:08,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-16 13:47:08,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-16 13:47:08,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 216 transitions. [2020-10-16 13:47:08,653 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 216 transitions. Word has length 14 [2020-10-16 13:47:08,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:47:08,654 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 216 transitions. [2020-10-16 13:47:08,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:47:08,654 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 216 transitions. [2020-10-16 13:47:08,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 13:47:08,654 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:47:08,654 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:47:08,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 13:47:08,655 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:47:08,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:47:08,655 INFO L82 PathProgramCache]: Analyzing trace with hash -174703217, now seen corresponding path program 1 times [2020-10-16 13:47:08,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:47:08,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505699832] [2020-10-16 13:47:08,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:47:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:47:08,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:47:08,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505699832] [2020-10-16 13:47:08,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:47:08,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:47:08,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [240990838] [2020-10-16 13:47:08,704 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:47:08,707 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:47:08,712 INFO L258 McrAutomatonBuilder]: Finished intersection with 33 states and 46 transitions. [2020-10-16 13:47:08,713 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:47:08,720 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:47:08,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:47:08,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:47:08,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:47:08,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:47:08,722 INFO L87 Difference]: Start difference. First operand 112 states and 216 transitions. Second operand 3 states. [2020-10-16 13:47:08,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:47:08,731 INFO L93 Difference]: Finished difference Result 151 states and 281 transitions. [2020-10-16 13:47:08,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:47:08,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-10-16 13:47:08,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:47:08,733 INFO L225 Difference]: With dead ends: 151 [2020-10-16 13:47:08,733 INFO L226 Difference]: Without dead ends: 109 [2020-10-16 13:47:08,733 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:47:08,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-10-16 13:47:08,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2020-10-16 13:47:08,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-16 13:47:08,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 190 transitions. [2020-10-16 13:47:08,738 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 190 transitions. Word has length 16 [2020-10-16 13:47:08,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:47:08,738 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 190 transitions. [2020-10-16 13:47:08,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:47:08,739 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 190 transitions. [2020-10-16 13:47:08,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 13:47:08,740 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:47:08,740 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:47:08,740 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 13:47:08,740 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:47:08,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:47:08,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1133511140, now seen corresponding path program 1 times [2020-10-16 13:47:08,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:47:08,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171756625] [2020-10-16 13:47:08,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:47:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:47:08,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:47:08,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171756625] [2020-10-16 13:47:08,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:47:08,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 13:47:08,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [719480635] [2020-10-16 13:47:08,897 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:47:08,899 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:47:08,911 INFO L258 McrAutomatonBuilder]: Finished intersection with 57 states and 96 transitions. [2020-10-16 13:47:08,912 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:47:08,932 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:47:08,975 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:47:08,975 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 13:47:08,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:47:08,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 13:47:08,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 13:47:08,977 INFO L87 Difference]: Start difference. First operand 107 states and 190 transitions. Second operand 6 states. [2020-10-16 13:47:09,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:47:09,045 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2020-10-16 13:47:09,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 13:47:09,047 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-16 13:47:09,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:47:09,047 INFO L225 Difference]: With dead ends: 93 [2020-10-16 13:47:09,048 INFO L226 Difference]: Without dead ends: 35 [2020-10-16 13:47:09,048 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:47:09,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-10-16 13:47:09,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-10-16 13:47:09,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-16 13:47:09,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2020-10-16 13:47:09,051 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 17 [2020-10-16 13:47:09,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:47:09,054 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2020-10-16 13:47:09,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 13:47:09,054 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2020-10-16 13:47:09,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 13:47:09,055 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:47:09,055 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:47:09,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 13:47:09,055 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:47:09,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:47:09,056 INFO L82 PathProgramCache]: Analyzing trace with hash 70677524, now seen corresponding path program 1 times [2020-10-16 13:47:09,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:47:09,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124776859] [2020-10-16 13:47:09,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:47:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 13:47:09,118 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 13:47:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 13:47:09,168 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 13:47:09,220 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 13:47:09,222 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 13:47:09,222 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 13:47:09,224 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 13:47:09,239 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L2-->L816: Formula: (let ((.cse7 (= (mod ~y$r_buff0_thd0~0_In-1030912718 256) 0)) (.cse6 (= (mod ~y$w_buff0_used~0_In-1030912718 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In-1030912718 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In-1030912718 256) 0))) (let ((.cse1 (not .cse8)) (.cse2 (not .cse9)) (.cse0 (or .cse8 .cse9)) (.cse3 (not .cse6)) (.cse4 (not .cse7)) (.cse5 (or .cse6 .cse7))) (and (= ~y$r_buff0_thd0~0_Out-1030912718 ~y$r_buff0_thd0~0_In-1030912718) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1030912718| ULTIMATE.start_assume_abort_if_not_~cond_Out-1030912718) (or (and (= ~y$w_buff1_used~0_Out-1030912718 ~y$w_buff1_used~0_In-1030912718) .cse0) (and .cse1 .cse2 (= ~y$w_buff1_used~0_Out-1030912718 0))) (or (and .cse3 .cse4 (= ~y$w_buff0~0_In-1030912718 ~y~0_Out-1030912718)) (and .cse5 (or (and (= ~y$w_buff1~0_In-1030912718 ~y~0_Out-1030912718) .cse1 .cse2) (and .cse0 (= ~y~0_In-1030912718 ~y~0_Out-1030912718))))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1030912718 0)) (= ~y$r_buff1_thd0~0_In-1030912718 ~y$r_buff1_thd0~0_Out-1030912718) (or (and .cse3 .cse4 (= ~y$w_buff0_used~0_Out-1030912718 0)) (and .cse5 (= ~y$w_buff0_used~0_In-1030912718 ~y$w_buff0_used~0_Out-1030912718)))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1030912718|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1030912718, ~y$w_buff1~0=~y$w_buff1~0_In-1030912718, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1030912718, ~y$w_buff0~0=~y$w_buff0~0_In-1030912718, ~y~0=~y~0_In-1030912718, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1030912718, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1030912718} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1030912718, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1030912718|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1030912718|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1030912718|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1030912718|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1030912718|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1030912718|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1030912718|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1030912718, ~y$w_buff1~0=~y$w_buff1~0_In-1030912718, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-1030912718, ~y$w_buff0~0=~y$w_buff0~0_In-1030912718, ~y~0=~y~0_Out-1030912718, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1030912718, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1030912718} 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~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite22, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-16 13:47:09,252 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:47:09,252 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:09,254 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:47:09,254 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:09,254 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:47:09,254 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:09,255 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:47:09,255 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:09,255 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:47:09,256 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:09,256 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:47:09,256 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:09,257 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:47:09,257 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:09,257 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:47:09,258 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:09,258 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:47:09,258 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:09,258 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:47:09,258 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:09,259 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:47:09,259 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:09,259 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:47:09,259 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:09,260 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:47:09,260 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:09,260 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:47:09,260 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:09,260 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:47:09,260 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:09,261 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:47:09,261 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:09,261 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:47:09,261 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:09,261 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:47:09,261 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:09,266 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:47:09,266 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:09,266 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:47:09,266 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:09,266 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:47:09,266 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:09,267 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:47:09,267 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:09,267 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:47:09,267 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:09,267 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:47:09,267 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:09,267 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:47:09,268 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:47:09,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:47:09 BasicIcfg [2020-10-16 13:47:09,359 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 13:47:09,361 INFO L168 Benchmark]: Toolchain (without parser) took 15625.45 ms. Allocated memory was 138.9 MB in the beginning and 400.6 MB in the end (delta: 261.6 MB). Free memory was 100.7 MB in the beginning and 212.2 MB in the end (delta: -111.4 MB). Peak memory consumption was 150.2 MB. Max. memory is 7.1 GB. [2020-10-16 13:47:09,365 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 138.9 MB. Free memory was 120.4 MB in the beginning and 120.0 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. [2020-10-16 13:47:09,371 INFO L168 Benchmark]: CACSL2BoogieTranslator took 827.94 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 100.3 MB in the beginning and 156.3 MB in the end (delta: -56.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2020-10-16 13:47:09,371 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.79 ms. Allocated memory is still 202.4 MB. Free memory was 156.3 MB in the beginning and 152.3 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2020-10-16 13:47:09,372 INFO L168 Benchmark]: Boogie Preprocessor took 45.14 ms. Allocated memory is still 202.4 MB. Free memory was 152.3 MB in the beginning and 150.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-16 13:47:09,372 INFO L168 Benchmark]: RCFGBuilder took 1918.93 ms. Allocated memory was 202.4 MB in the beginning and 249.6 MB in the end (delta: 47.2 MB). Free memory was 150.3 MB in the beginning and 198.2 MB in the end (delta: -47.9 MB). Peak memory consumption was 104.3 MB. Max. memory is 7.1 GB. [2020-10-16 13:47:09,376 INFO L168 Benchmark]: TraceAbstraction took 12755.40 ms. Allocated memory was 249.6 MB in the beginning and 400.6 MB in the end (delta: 151.0 MB). Free memory was 196.2 MB in the beginning and 212.2 MB in the end (delta: -16.0 MB). Peak memory consumption was 135.0 MB. Max. memory is 7.1 GB. [2020-10-16 13:47:09,382 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.17 ms. Allocated memory is still 138.9 MB. Free memory was 120.4 MB in the beginning and 120.0 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 827.94 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 100.3 MB in the beginning and 156.3 MB in the end (delta: -56.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.79 ms. Allocated memory is still 202.4 MB. Free memory was 156.3 MB in the beginning and 152.3 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.14 ms. Allocated memory is still 202.4 MB. Free memory was 152.3 MB in the beginning and 150.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1918.93 ms. Allocated memory was 202.4 MB in the beginning and 249.6 MB in the end (delta: 47.2 MB). Free memory was 150.3 MB in the beginning and 198.2 MB in the end (delta: -47.9 MB). Peak memory consumption was 104.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12755.40 ms. Allocated memory was 249.6 MB in the beginning and 400.6 MB in the end (delta: 151.0 MB). Free memory was 196.2 MB in the beginning and 212.2 MB in the end (delta: -16.0 MB). Peak memory consumption was 135.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 801 VarBasedMoverChecksPositive, 36 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 66 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.1s, 98 PlacesBefore, 35 PlacesAfterwards, 90 TransitionsBefore, 25 TransitionsAfterwards, 1536 CoEnabledTransitionPairs, 6 FixpointIterations, 30 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 77 TotalNumberOfCompositions, 4063 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L699] 0 _Bool main$tmp_guard0; [L700] 0 _Bool main$tmp_guard1; [L702] 0 int x = 0; [L704] 0 int y = 0; [L705] 0 _Bool y$flush_delayed; [L706] 0 int y$mem_tmp; [L707] 0 _Bool y$r_buff0_thd0; [L708] 0 _Bool y$r_buff0_thd1; [L709] 0 _Bool y$r_buff0_thd2; [L710] 0 _Bool y$r_buff0_thd3; [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$r_buff1_thd3; [L715] 0 _Bool y$read_delayed; [L716] 0 int *y$read_delayed_var; [L717] 0 int y$w_buff0; [L718] 0 _Bool y$w_buff0_used; [L719] 0 int y$w_buff1; [L720] 0 _Bool y$w_buff1_used; [L722] 0 int z = 0; [L723] 0 _Bool weak$$choice0; [L724] 0 _Bool weak$$choice2; [L800] 0 pthread_t t2492; [L801] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 0 pthread_t t2493; [L803] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 0 pthread_t t2494; [L805] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L763] 3 y$w_buff1 = y$w_buff0 [L764] 3 y$w_buff0 = 2 [L765] 3 y$w_buff1_used = y$w_buff0_used [L766] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L768] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L769] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L770] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L771] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L772] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L775] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L728] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L731] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L743] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L746] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L778] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L778] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L779] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L780] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L780] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L781] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L781] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L782] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L785] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 3 return 0; [L736] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L738] 1 return 0; [L749] 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) [L749] 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) [L750] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L751] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] 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 [L752] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L752] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L753] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L753] 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 [L756] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 2 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 y$flush_delayed = weak$$choice2 [L821] 0 y$mem_tmp = y [L822] 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) [L822] 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) [L823] 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)) [L823] 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) [L823] 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)) [L823] 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)) [L824] 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)) [L824] 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)) [L825] 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)) [L825] 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) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 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) [L825] 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)) [L825] 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)) [L826] 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)) [L826] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_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)) [L827] EXPR 0 !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) [L827] 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)) [L827] 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)) [L828] 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)) [L828] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L828] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L828] 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)) [L828] 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)) [L829] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L830] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L830] 0 y = y$flush_delayed ? y$mem_tmp : y [L831] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 89 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.5s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.2s, HoareTripleCheckerStatistics: 331 SDtfs, 240 SDslu, 425 SDs, 0 SdLazy, 281 SolverSat, 86 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 190 SyntacticMatches, 19 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=650occurred 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.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 120 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 170 ConstructedInterpolants, 0 QuantifiedInterpolants, 14028 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...