/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-McrStrategy.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe016_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b981219 [2020-04-18 10:57:52,548 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-04-18 10:57:52,551 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-04-18 10:57:52,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-04-18 10:57:52,563 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-04-18 10:57:52,564 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-04-18 10:57:52,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-04-18 10:57:52,567 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-04-18 10:57:52,568 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-04-18 10:57:52,569 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-04-18 10:57:52,570 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-04-18 10:57:52,571 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-04-18 10:57:52,571 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-04-18 10:57:52,572 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-04-18 10:57:52,573 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-04-18 10:57:52,574 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-04-18 10:57:52,575 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-04-18 10:57:52,576 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-04-18 10:57:52,578 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-04-18 10:57:52,579 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-04-18 10:57:52,581 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-04-18 10:57:52,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-04-18 10:57:52,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-04-18 10:57:52,583 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-04-18 10:57:52,586 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-04-18 10:57:52,586 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-04-18 10:57:52,586 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-04-18 10:57:52,587 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-04-18 10:57:52,587 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-04-18 10:57:52,588 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-04-18 10:57:52,589 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-04-18 10:57:52,589 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-04-18 10:57:52,590 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-04-18 10:57:52,591 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-04-18 10:57:52,592 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-04-18 10:57:52,592 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-04-18 10:57:52,593 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-04-18 10:57:52,593 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-04-18 10:57:52,593 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-04-18 10:57:52,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-04-18 10:57:52,594 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-04-18 10:57:52,595 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-McrStrategy.epf [2020-04-18 10:57:52,609 INFO L113 SettingsManager]: Loading preferences was successful [2020-04-18 10:57:52,610 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-04-18 10:57:52,611 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-04-18 10:57:52,611 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-04-18 10:57:52,611 INFO L138 SettingsManager]: * Use SBE=true [2020-04-18 10:57:52,611 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-04-18 10:57:52,612 INFO L138 SettingsManager]: * sizeof long=4 [2020-04-18 10:57:52,612 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-04-18 10:57:52,612 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-04-18 10:57:52,612 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-04-18 10:57:52,612 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-04-18 10:57:52,612 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-04-18 10:57:52,613 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-04-18 10:57:52,613 INFO L138 SettingsManager]: * sizeof long double=12 [2020-04-18 10:57:52,613 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-04-18 10:57:52,613 INFO L138 SettingsManager]: * Use constant arrays=true [2020-04-18 10:57:52,613 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-04-18 10:57:52,614 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-04-18 10:57:52,614 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-04-18 10:57:52,614 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-04-18 10:57:52,614 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-04-18 10:57:52,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-04-18 10:57:52,615 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-04-18 10:57:52,615 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-04-18 10:57:52,615 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-04-18 10:57:52,615 INFO L138 SettingsManager]: * Trace refinement strategy=MCR [2020-04-18 10:57:52,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-04-18 10:57:52,616 INFO L138 SettingsManager]: * Trace refinement strategy used in MCR=CAMEL [2020-04-18 10:57:52,616 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-04-18 10:57:52,616 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-04-18 10:57:52,900 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-04-18 10:57:52,913 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-04-18 10:57:52,916 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-04-18 10:57:52,919 INFO L271 PluginConnector]: Initializing CDTParser... [2020-04-18 10:57:52,919 INFO L275 PluginConnector]: CDTParser initialized [2020-04-18 10:57:52,920 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe016_pso.opt.i [2020-04-18 10:57:52,992 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d540f6599/bff1baeaf4fa4b6fa7a0fd0e2c5fb477/FLAG6565668d9 [2020-04-18 10:57:53,520 INFO L306 CDTParser]: Found 1 translation units. [2020-04-18 10:57:53,521 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_pso.opt.i [2020-04-18 10:57:53,539 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d540f6599/bff1baeaf4fa4b6fa7a0fd0e2c5fb477/FLAG6565668d9 [2020-04-18 10:57:53,807 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d540f6599/bff1baeaf4fa4b6fa7a0fd0e2c5fb477 [2020-04-18 10:57:53,817 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-04-18 10:57:53,840 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-04-18 10:57:53,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-04-18 10:57:53,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-04-18 10:57:53,845 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-04-18 10:57:53,846 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 10:57:53" (1/1) ... [2020-04-18 10:57:53,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66ad39a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 10:57:53, skipping insertion in model container [2020-04-18 10:57:53,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 10:57:53" (1/1) ... [2020-04-18 10:57:53,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-04-18 10:57:53,896 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-04-18 10:57:54,377 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-18 10:57:54,393 INFO L203 MainTranslator]: Completed pre-run [2020-04-18 10:57:54,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-18 10:57:54,527 INFO L208 MainTranslator]: Completed translation [2020-04-18 10:57:54,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 10:57:54 WrapperNode [2020-04-18 10:57:54,528 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-04-18 10:57:54,528 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-04-18 10:57:54,529 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-04-18 10:57:54,529 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-04-18 10:57:54,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 10:57:54" (1/1) ... [2020-04-18 10:57:54,554 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 10:57:54" (1/1) ... [2020-04-18 10:57:54,576 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-04-18 10:57:54,577 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-04-18 10:57:54,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-04-18 10:57:54,578 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-04-18 10:57:54,585 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 10:57:54" (1/1) ... [2020-04-18 10:57:54,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 10:57:54" (1/1) ... [2020-04-18 10:57:54,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 10:57:54" (1/1) ... [2020-04-18 10:57:54,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 10:57:54" (1/1) ... [2020-04-18 10:57:54,596 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 10:57:54" (1/1) ... [2020-04-18 10:57:54,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 10:57:54" (1/1) ... [2020-04-18 10:57:54,600 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 10:57:54" (1/1) ... [2020-04-18 10:57:54,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-04-18 10:57:54,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-04-18 10:57:54,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-04-18 10:57:54,604 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-04-18 10:57:54,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 10:57:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-04-18 10:57:54,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-04-18 10:57:54,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-04-18 10:57:54,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-04-18 10:57:54,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-04-18 10:57:54,678 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-04-18 10:57:54,679 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-04-18 10:57:54,679 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-04-18 10:57:54,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-04-18 10:57:54,680 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-04-18 10:57:54,681 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-04-18 10:57:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-04-18 10:57:54,681 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-04-18 10:57:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-04-18 10:57:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-04-18 10:57:54,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-04-18 10:57:54,683 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-04-18 10:57:55,113 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-04-18 10:57:55,113 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-04-18 10:57:55,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 10:57:55 BoogieIcfgContainer [2020-04-18 10:57:55,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-04-18 10:57:55,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-04-18 10:57:55,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-04-18 10:57:55,132 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-04-18 10:57:55,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 10:57:53" (1/3) ... [2020-04-18 10:57:55,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c7dd5d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 10:57:55, skipping insertion in model container [2020-04-18 10:57:55,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 10:57:54" (2/3) ... [2020-04-18 10:57:55,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c7dd5d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 10:57:55, skipping insertion in model container [2020-04-18 10:57:55,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 10:57:55" (3/3) ... [2020-04-18 10:57:55,138 INFO L109 eAbstractionObserver]: Analyzing ICFG safe016_pso.opt.i [2020-04-18 10:57:55,148 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-04-18 10:57:55,149 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-04-18 10:57:55,156 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-04-18 10:57:55,157 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-04-18 10:57:55,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,184 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,184 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,186 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,186 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,187 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,188 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,189 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,189 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,189 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,190 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,190 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,190 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,195 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,195 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,195 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,195 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,201 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,202 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,204 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,205 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,208 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,208 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 10:57:55,225 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-04-18 10:57:55,246 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 10:57:55,246 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 10:57:55,246 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 10:57:55,247 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 10:57:55,247 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 10:57:55,247 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 10:57:55,247 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 10:57:55,247 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 10:57:55,263 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 80 transitions, 180 flow [2020-04-18 10:57:55,265 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 91 places, 80 transitions, 180 flow [2020-04-18 10:57:55,312 INFO L129 PetriNetUnfolder]: 2/76 cut-off events. [2020-04-18 10:57:55,312 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-04-18 10:57:55,320 INFO L80 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 76 events. 2/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 59 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2020-04-18 10:57:55,327 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 91 places, 80 transitions, 180 flow [2020-04-18 10:57:55,370 INFO L129 PetriNetUnfolder]: 2/76 cut-off events. [2020-04-18 10:57:55,370 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-04-18 10:57:55,371 INFO L80 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 76 events. 2/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 59 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2020-04-18 10:57:55,375 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1822 [2020-04-18 10:57:55,377 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-04-18 10:57:57,327 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2895 [2020-04-18 10:57:57,328 INFO L214 etLargeBlockEncoding]: Total number of compositions: 62 [2020-04-18 10:57:57,333 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 27 transitions, 74 flow [2020-04-18 10:57:57,407 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 850 states. [2020-04-18 10:57:57,410 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states. [2020-04-18 10:57:57,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 10:57:57,423 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 10:57:57,425 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 10:57:57,425 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 10:57:57,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:57:57,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1118879254, now seen corresponding path program 1 times [2020-04-18 10:57:57,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 10:57:57,442 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1002136384] [2020-04-18 10:57:57,465 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:57:57,484 INFO L259 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-04-18 10:57:57,486 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2020-04-18 10:57:57,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 10:57:57,487 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 10:57:57,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:57:57,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1118879254, now seen corresponding path program 2 times [2020-04-18 10:57:57,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 10:57:57,492 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356887686] [2020-04-18 10:57:57,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 10:57:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 10:57:57,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 10:57:57,723 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356887686] [2020-04-18 10:57:57,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 10:57:57,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 10:57:57,728 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 10:57:57,729 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:57:57,734 INFO L259 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-04-18 10:57:57,734 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 10:57:57,740 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 10:57:57,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-04-18 10:57:57,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-04-18 10:57:57,747 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 2 states. [2020-04-18 10:57:57,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:57:57,751 INFO L93 Difference]: Finished difference Result 11 states and 10 transitions. [2020-04-18 10:57:57,752 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 10 transitions. [2020-04-18 10:57:57,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 10:57:57,756 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1002136384] [2020-04-18 10:57:57,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 10:57:57,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 10:57:57,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1002136384] [2020-04-18 10:57:57,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-04-18 10:57:57,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 10:57:57,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-04-18 10:57:57,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-04-18 10:57:57,774 INFO L87 Difference]: Start difference. First operand 850 states. Second operand 2 states. [2020-04-18 10:57:57,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:57:57,835 INFO L93 Difference]: Finished difference Result 850 states and 2994 transitions. [2020-04-18 10:57:57,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-04-18 10:57:57,839 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-04-18 10:57:57,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 10:57:57,871 INFO L225 Difference]: With dead ends: 850 [2020-04-18 10:57:57,871 INFO L226 Difference]: Without dead ends: 706 [2020-04-18 10:57:57,873 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-04-18 10:57:57,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2020-04-18 10:57:57,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 706. [2020-04-18 10:57:57,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2020-04-18 10:57:58,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 2442 transitions. [2020-04-18 10:57:58,008 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 2442 transitions. Word has length 10 [2020-04-18 10:57:58,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 10:57:58,009 INFO L479 AbstractCegarLoop]: Abstraction has 706 states and 2442 transitions. [2020-04-18 10:57:58,009 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-04-18 10:57:58,010 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 2442 transitions. [2020-04-18 10:57:58,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-04-18 10:57:58,018 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 10:57:58,018 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 10:57:58,019 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 10:57:58,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:57:58,020 INFO L82 PathProgramCache]: Analyzing trace with hash -325524913, now seen corresponding path program 1 times [2020-04-18 10:57:58,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 10:57:58,021 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [851512986] [2020-04-18 10:57:58,021 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:57:58,022 INFO L259 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-04-18 10:57:58,022 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-04-18 10:57:58,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-04-18 10:57:58,023 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 10:57:58,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:57:58,024 INFO L82 PathProgramCache]: Analyzing trace with hash -325524913, now seen corresponding path program 2 times [2020-04-18 10:57:58,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 10:57:58,024 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860661146] [2020-04-18 10:57:58,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 10:57:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 10:57:58,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 10:57:58,176 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860661146] [2020-04-18 10:57:58,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 10:57:58,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 10:57:58,176 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 10:57:58,177 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:57:58,179 INFO L259 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-04-18 10:57:58,179 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 10:57:58,201 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 10:57:58,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 10:57:58,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 10:57:58,203 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 4 states. [2020-04-18 10:57:58,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:57:58,229 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2020-04-18 10:57:58,229 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2020-04-18 10:57:58,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 10:57:58,230 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [851512986] [2020-04-18 10:57:58,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 10:57:58,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 10:57:58,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [851512986] [2020-04-18 10:57:58,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-04-18 10:57:58,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 10:57:58,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 10:57:58,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 10:57:58,233 INFO L87 Difference]: Start difference. First operand 706 states and 2442 transitions. Second operand 4 states. [2020-04-18 10:57:58,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:57:58,266 INFO L93 Difference]: Finished difference Result 778 states and 2592 transitions. [2020-04-18 10:57:58,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-04-18 10:57:58,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-04-18 10:57:58,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 10:57:58,273 INFO L225 Difference]: With dead ends: 778 [2020-04-18 10:57:58,273 INFO L226 Difference]: Without dead ends: 634 [2020-04-18 10:57:58,275 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 10:57:58,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-04-18 10:57:58,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2020-04-18 10:57:58,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2020-04-18 10:57:58,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 2148 transitions. [2020-04-18 10:57:58,302 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 2148 transitions. Word has length 11 [2020-04-18 10:57:58,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 10:57:58,303 INFO L479 AbstractCegarLoop]: Abstraction has 634 states and 2148 transitions. [2020-04-18 10:57:58,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-04-18 10:57:58,303 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 2148 transitions. [2020-04-18 10:57:58,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 10:57:58,304 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 10:57:58,305 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 10:57:58,305 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 10:57:58,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:57:58,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1068447712, now seen corresponding path program 1 times [2020-04-18 10:57:58,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 10:57:58,306 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [2038399458] [2020-04-18 10:57:58,306 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:57:58,307 INFO L259 McrAutomatonBuilder]: Finished intersection with 22 states and 30 transitions. [2020-04-18 10:57:58,307 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2020-04-18 10:57:58,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 10:57:58,308 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 10:57:58,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:57:58,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1068447712, now seen corresponding path program 2 times [2020-04-18 10:57:58,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 10:57:58,309 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658911838] [2020-04-18 10:57:58,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 10:57:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 10:57:58,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 10:57:58,375 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658911838] [2020-04-18 10:57:58,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 10:57:58,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 10:57:58,376 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 10:57:58,378 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:57:58,381 INFO L259 McrAutomatonBuilder]: Finished intersection with 20 states and 26 transitions. [2020-04-18 10:57:58,381 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 10:57:58,393 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 10:57:58,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 10:57:58,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 10:57:58,394 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 4 states. [2020-04-18 10:57:58,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:57:58,441 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2020-04-18 10:57:58,441 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2020-04-18 10:57:58,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 10:57:58,441 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [2038399458] [2020-04-18 10:57:58,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 10:57:58,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 10:57:58,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [2038399458] [2020-04-18 10:57:58,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-04-18 10:57:58,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 10:57:58,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 10:57:58,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 10:57:58,443 INFO L87 Difference]: Start difference. First operand 634 states and 2148 transitions. Second operand 4 states. [2020-04-18 10:57:58,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:57:58,478 INFO L93 Difference]: Finished difference Result 718 states and 2351 transitions. [2020-04-18 10:57:58,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-04-18 10:57:58,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-04-18 10:57:58,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 10:57:58,483 INFO L225 Difference]: With dead ends: 718 [2020-04-18 10:57:58,484 INFO L226 Difference]: Without dead ends: 610 [2020-04-18 10:57:58,484 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 10:57:58,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-04-18 10:57:58,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2020-04-18 10:57:58,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2020-04-18 10:57:58,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 2042 transitions. [2020-04-18 10:57:58,509 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 2042 transitions. Word has length 12 [2020-04-18 10:57:58,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 10:57:58,509 INFO L479 AbstractCegarLoop]: Abstraction has 610 states and 2042 transitions. [2020-04-18 10:57:58,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-04-18 10:57:58,510 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 2042 transitions. [2020-04-18 10:57:58,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-04-18 10:57:58,511 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 10:57:58,511 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 10:57:58,511 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 10:57:58,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:57:58,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1923922428, now seen corresponding path program 1 times [2020-04-18 10:57:58,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 10:57:58,512 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1899805858] [2020-04-18 10:57:58,513 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:57:58,514 INFO L259 McrAutomatonBuilder]: Finished intersection with 32 states and 49 transitions. [2020-04-18 10:57:58,514 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2020-04-18 10:57:58,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-04-18 10:57:58,515 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 10:57:58,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:57:58,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1923922428, now seen corresponding path program 2 times [2020-04-18 10:57:58,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 10:57:58,516 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253075703] [2020-04-18 10:57:58,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 10:57:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 10:57:58,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 10:57:58,600 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253075703] [2020-04-18 10:57:58,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 10:57:58,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 10:57:58,600 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 10:57:58,603 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:57:58,607 INFO L259 McrAutomatonBuilder]: Finished intersection with 28 states and 41 transitions. [2020-04-18 10:57:58,607 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 10:57:58,619 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 10:57:58,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 10:57:58,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 10:57:58,619 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 4 states. [2020-04-18 10:57:58,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:57:58,634 INFO L93 Difference]: Finished difference Result 32 states and 49 transitions. [2020-04-18 10:57:58,634 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 49 transitions. [2020-04-18 10:57:58,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 10:57:58,635 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1899805858] [2020-04-18 10:57:58,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 10:57:58,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 10:57:58,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1899805858] [2020-04-18 10:57:58,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-04-18 10:57:58,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 10:57:58,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 10:57:58,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 10:57:58,638 INFO L87 Difference]: Start difference. First operand 610 states and 2042 transitions. Second operand 4 states. [2020-04-18 10:57:58,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:57:58,671 INFO L93 Difference]: Finished difference Result 674 states and 2178 transitions. [2020-04-18 10:57:58,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-04-18 10:57:58,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-04-18 10:57:58,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 10:57:58,676 INFO L225 Difference]: With dead ends: 674 [2020-04-18 10:57:58,676 INFO L226 Difference]: Without dead ends: 578 [2020-04-18 10:57:58,677 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 10:57:58,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-04-18 10:57:58,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2020-04-18 10:57:58,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2020-04-18 10:57:58,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 1906 transitions. [2020-04-18 10:57:58,700 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 1906 transitions. Word has length 13 [2020-04-18 10:57:58,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 10:57:58,700 INFO L479 AbstractCegarLoop]: Abstraction has 578 states and 1906 transitions. [2020-04-18 10:57:58,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-04-18 10:57:58,700 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 1906 transitions. [2020-04-18 10:57:58,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 10:57:58,702 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 10:57:58,702 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 10:57:58,702 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 10:57:58,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:57:58,703 INFO L82 PathProgramCache]: Analyzing trace with hash -488944074, now seen corresponding path program 1 times [2020-04-18 10:57:58,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 10:57:58,704 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [870075241] [2020-04-18 10:57:58,705 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:57:58,706 INFO L259 McrAutomatonBuilder]: Finished intersection with 44 states and 78 transitions. [2020-04-18 10:57:58,707 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-04-18 10:57:58,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 10:57:58,707 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 10:57:58,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:57:58,708 INFO L82 PathProgramCache]: Analyzing trace with hash -488944074, now seen corresponding path program 2 times [2020-04-18 10:57:58,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 10:57:58,709 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322465462] [2020-04-18 10:57:58,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 10:57:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 10:57:58,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 10:57:58,819 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322465462] [2020-04-18 10:57:58,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 10:57:58,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 10:57:58,820 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 10:57:58,821 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:57:58,825 INFO L259 McrAutomatonBuilder]: Finished intersection with 32 states and 49 transitions. [2020-04-18 10:57:58,826 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 10:57:58,837 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 10:57:58,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 10:57:58,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 10:57:58,838 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 4 states. [2020-04-18 10:57:58,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:57:58,858 INFO L93 Difference]: Finished difference Result 48 states and 82 transitions. [2020-04-18 10:57:58,858 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 82 transitions. [2020-04-18 10:57:58,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 10:57:58,858 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 10:57:58,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:57:58,859 INFO L82 PathProgramCache]: Analyzing trace with hash -311980460, now seen corresponding path program 3 times [2020-04-18 10:57:58,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 10:57:58,860 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24802461] [2020-04-18 10:57:58,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 10:57:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 10:57:58,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 10:57:58,929 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24802461] [2020-04-18 10:57:58,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 10:57:58,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 10:57:58,929 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 10:57:58,932 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:57:58,935 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 32 transitions. [2020-04-18 10:57:58,935 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 10:57:58,946 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 10:57:58,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 10:57:58,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-04-18 10:57:58,949 INFO L87 Difference]: Start difference. First operand 48 states and 82 transitions. Second operand 4 states. [2020-04-18 10:57:58,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:57:58,969 INFO L93 Difference]: Finished difference Result 48 states and 82 transitions. [2020-04-18 10:57:58,969 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 82 transitions. [2020-04-18 10:57:58,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 10:57:58,970 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [870075241] [2020-04-18 10:57:58,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 10:57:58,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 10:57:58,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [870075241] [2020-04-18 10:57:58,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 10:57:58,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 10:57:58,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 10:57:58,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-04-18 10:57:58,972 INFO L87 Difference]: Start difference. First operand 578 states and 1906 transitions. Second operand 5 states. [2020-04-18 10:57:59,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:57:59,024 INFO L93 Difference]: Finished difference Result 854 states and 2662 transitions. [2020-04-18 10:57:59,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 10:57:59,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-04-18 10:57:59,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 10:57:59,029 INFO L225 Difference]: With dead ends: 854 [2020-04-18 10:57:59,030 INFO L226 Difference]: Without dead ends: 618 [2020-04-18 10:57:59,031 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-04-18 10:57:59,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-04-18 10:57:59,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 538. [2020-04-18 10:57:59,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2020-04-18 10:57:59,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 1686 transitions. [2020-04-18 10:57:59,051 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 1686 transitions. Word has length 14 [2020-04-18 10:57:59,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 10:57:59,052 INFO L479 AbstractCegarLoop]: Abstraction has 538 states and 1686 transitions. [2020-04-18 10:57:59,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 10:57:59,052 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1686 transitions. [2020-04-18 10:57:59,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 10:57:59,054 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 10:57:59,054 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 10:57:59,054 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 10:57:59,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:57:59,055 INFO L82 PathProgramCache]: Analyzing trace with hash -311989916, now seen corresponding path program 1 times [2020-04-18 10:57:59,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 10:57:59,055 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1969353383] [2020-04-18 10:57:59,056 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:57:59,057 INFO L259 McrAutomatonBuilder]: Finished intersection with 54 states and 112 transitions. [2020-04-18 10:57:59,059 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2020-04-18 10:57:59,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 10:57:59,060 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 10:57:59,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:57:59,060 INFO L82 PathProgramCache]: Analyzing trace with hash -311980406, now seen corresponding path program 2 times [2020-04-18 10:57:59,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 10:57:59,061 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779933430] [2020-04-18 10:57:59,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 10:57:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 10:57:59,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 10:57:59,143 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779933430] [2020-04-18 10:57:59,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 10:57:59,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 10:57:59,144 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 10:57:59,145 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:57:59,149 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 32 transitions. [2020-04-18 10:57:59,149 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 10:57:59,162 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 10:57:59,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 10:57:59,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 10:57:59,162 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 4 states. [2020-04-18 10:57:59,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:57:59,189 INFO L93 Difference]: Finished difference Result 62 states and 124 transitions. [2020-04-18 10:57:59,189 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 124 transitions. [2020-04-18 10:57:59,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 10:57:59,190 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 10:57:59,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:57:59,190 INFO L82 PathProgramCache]: Analyzing trace with hash -311989916, now seen corresponding path program 3 times [2020-04-18 10:57:59,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 10:57:59,191 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482955255] [2020-04-18 10:57:59,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 10:57:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 10:57:59,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 10:57:59,244 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482955255] [2020-04-18 10:57:59,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 10:57:59,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 10:57:59,245 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 10:57:59,246 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:57:59,249 INFO L259 McrAutomatonBuilder]: Finished intersection with 36 states and 62 transitions. [2020-04-18 10:57:59,249 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 10:57:59,256 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 10:57:59,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 10:57:59,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-04-18 10:57:59,257 INFO L87 Difference]: Start difference. First operand 62 states and 124 transitions. Second operand 4 states. [2020-04-18 10:57:59,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:57:59,270 INFO L93 Difference]: Finished difference Result 62 states and 124 transitions. [2020-04-18 10:57:59,270 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 124 transitions. [2020-04-18 10:57:59,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 10:57:59,271 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1969353383] [2020-04-18 10:57:59,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 10:57:59,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 10:57:59,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1969353383] [2020-04-18 10:57:59,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 10:57:59,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 10:57:59,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 10:57:59,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-04-18 10:57:59,273 INFO L87 Difference]: Start difference. First operand 538 states and 1686 transitions. Second operand 5 states. [2020-04-18 10:57:59,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:57:59,305 INFO L93 Difference]: Finished difference Result 562 states and 1726 transitions. [2020-04-18 10:57:59,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-04-18 10:57:59,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-04-18 10:57:59,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 10:57:59,310 INFO L225 Difference]: With dead ends: 562 [2020-04-18 10:57:59,310 INFO L226 Difference]: Without dead ends: 514 [2020-04-18 10:57:59,311 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-04-18 10:57:59,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2020-04-18 10:57:59,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2020-04-18 10:57:59,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2020-04-18 10:57:59,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 1598 transitions. [2020-04-18 10:57:59,328 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 1598 transitions. Word has length 14 [2020-04-18 10:57:59,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 10:57:59,328 INFO L479 AbstractCegarLoop]: Abstraction has 514 states and 1598 transitions. [2020-04-18 10:57:59,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 10:57:59,328 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 1598 transitions. [2020-04-18 10:57:59,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 10:57:59,330 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 10:57:59,330 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 10:57:59,330 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 10:57:59,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:57:59,331 INFO L82 PathProgramCache]: Analyzing trace with hash 350267355, now seen corresponding path program 1 times [2020-04-18 10:57:59,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 10:57:59,331 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1950240347] [2020-04-18 10:57:59,332 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:57:59,333 INFO L259 McrAutomatonBuilder]: Finished intersection with 86 states and 204 transitions. [2020-04-18 10:57:59,334 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2020-04-18 10:57:59,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 10:57:59,335 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 10:57:59,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:57:59,335 INFO L82 PathProgramCache]: Analyzing trace with hash 350276865, now seen corresponding path program 2 times [2020-04-18 10:57:59,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 10:57:59,336 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705725273] [2020-04-18 10:57:59,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 10:57:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 10:57:59,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 10:57:59,380 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705725273] [2020-04-18 10:57:59,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 10:57:59,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 10:57:59,381 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 10:57:59,407 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:57:59,412 INFO L259 McrAutomatonBuilder]: Finished intersection with 34 states and 54 transitions. [2020-04-18 10:57:59,413 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 10:57:59,422 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 10:57:59,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 10:57:59,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 10:57:59,423 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 4 states. [2020-04-18 10:57:59,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:57:59,443 INFO L93 Difference]: Finished difference Result 98 states and 224 transitions. [2020-04-18 10:57:59,443 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 224 transitions. [2020-04-18 10:57:59,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 10:57:59,444 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 10:57:59,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:57:59,444 INFO L82 PathProgramCache]: Analyzing trace with hash 350267355, now seen corresponding path program 3 times [2020-04-18 10:57:59,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 10:57:59,445 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596682663] [2020-04-18 10:57:59,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 10:57:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 10:57:59,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 10:57:59,491 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596682663] [2020-04-18 10:57:59,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 10:57:59,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 10:57:59,492 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 10:57:59,494 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:57:59,499 INFO L259 McrAutomatonBuilder]: Finished intersection with 44 states and 80 transitions. [2020-04-18 10:57:59,499 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 10:57:59,519 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 10:57:59,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 10:57:59,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 10:57:59,520 INFO L87 Difference]: Start difference. First operand 98 states and 224 transitions. Second operand 5 states. [2020-04-18 10:57:59,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:57:59,567 INFO L93 Difference]: Finished difference Result 115 states and 245 transitions. [2020-04-18 10:57:59,567 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 245 transitions. [2020-04-18 10:57:59,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 10:57:59,568 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 10:57:59,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:57:59,569 INFO L82 PathProgramCache]: Analyzing trace with hash -432648259, now seen corresponding path program 4 times [2020-04-18 10:57:59,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 10:57:59,569 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279302458] [2020-04-18 10:57:59,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 10:57:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 10:57:59,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 10:57:59,623 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279302458] [2020-04-18 10:57:59,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 10:57:59,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 10:57:59,624 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 10:57:59,625 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:57:59,630 INFO L259 McrAutomatonBuilder]: Finished intersection with 36 states and 61 transitions. [2020-04-18 10:57:59,630 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 10:57:59,740 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 10:57:59,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 10:57:59,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-04-18 10:57:59,742 INFO L87 Difference]: Start difference. First operand 115 states and 245 transitions. Second operand 7 states. [2020-04-18 10:57:59,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:57:59,812 INFO L93 Difference]: Finished difference Result 133 states and 266 transitions. [2020-04-18 10:57:59,812 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 266 transitions. [2020-04-18 10:57:59,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 10:57:59,813 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1950240347] [2020-04-18 10:57:59,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 10:57:59,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-04-18 10:57:59,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1950240347] [2020-04-18 10:57:59,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-04-18 10:57:59,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 10:57:59,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-04-18 10:57:59,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2020-04-18 10:57:59,815 INFO L87 Difference]: Start difference. First operand 514 states and 1598 transitions. Second operand 10 states. [2020-04-18 10:58:00,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:58:00,026 INFO L93 Difference]: Finished difference Result 1222 states and 3596 transitions. [2020-04-18 10:58:00,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-04-18 10:58:00,027 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2020-04-18 10:58:00,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 10:58:00,030 INFO L225 Difference]: With dead ends: 1222 [2020-04-18 10:58:00,030 INFO L226 Difference]: Without dead ends: 370 [2020-04-18 10:58:00,030 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2020-04-18 10:58:00,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2020-04-18 10:58:00,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 322. [2020-04-18 10:58:00,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2020-04-18 10:58:00,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 910 transitions. [2020-04-18 10:58:00,041 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 910 transitions. Word has length 15 [2020-04-18 10:58:00,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 10:58:00,042 INFO L479 AbstractCegarLoop]: Abstraction has 322 states and 910 transitions. [2020-04-18 10:58:00,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-04-18 10:58:00,042 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 910 transitions. [2020-04-18 10:58:00,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 10:58:00,043 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 10:58:00,043 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 10:58:00,043 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 10:58:00,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:58:00,044 INFO L82 PathProgramCache]: Analyzing trace with hash -96752386, now seen corresponding path program 1 times [2020-04-18 10:58:00,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 10:58:00,044 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [2024756031] [2020-04-18 10:58:00,045 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:58:00,046 INFO L259 McrAutomatonBuilder]: Finished intersection with 94 states and 240 transitions. [2020-04-18 10:58:00,047 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states. [2020-04-18 10:58:00,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 10:58:00,050 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 10:58:00,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:58:00,050 INFO L82 PathProgramCache]: Analyzing trace with hash 659656400, now seen corresponding path program 2 times [2020-04-18 10:58:00,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 10:58:00,051 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432282461] [2020-04-18 10:58:00,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 10:58:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 10:58:00,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 10:58:00,100 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432282461] [2020-04-18 10:58:00,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 10:58:00,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 10:58:00,101 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 10:58:00,103 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:58:00,108 INFO L259 McrAutomatonBuilder]: Finished intersection with 34 states and 55 transitions. [2020-04-18 10:58:00,108 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 10:58:00,119 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 10:58:00,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 10:58:00,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 10:58:00,119 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 4 states. [2020-04-18 10:58:00,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:58:00,137 INFO L93 Difference]: Finished difference Result 110 states and 272 transitions. [2020-04-18 10:58:00,137 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 272 transitions. [2020-04-18 10:58:00,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 10:58:00,138 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 10:58:00,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:58:00,139 INFO L82 PathProgramCache]: Analyzing trace with hash 659646890, now seen corresponding path program 3 times [2020-04-18 10:58:00,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 10:58:00,139 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387662278] [2020-04-18 10:58:00,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 10:58:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 10:58:00,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 10:58:00,203 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387662278] [2020-04-18 10:58:00,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 10:58:00,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 10:58:00,204 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 10:58:00,205 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:58:00,210 INFO L259 McrAutomatonBuilder]: Finished intersection with 42 states and 75 transitions. [2020-04-18 10:58:00,210 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 10:58:00,227 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 10:58:00,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 10:58:00,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 10:58:00,228 INFO L87 Difference]: Start difference. First operand 110 states and 272 transitions. Second operand 5 states. [2020-04-18 10:58:00,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:58:00,283 INFO L93 Difference]: Finished difference Result 136 states and 315 transitions. [2020-04-18 10:58:00,283 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 315 transitions. [2020-04-18 10:58:00,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 10:58:00,284 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 10:58:00,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:58:00,285 INFO L82 PathProgramCache]: Analyzing trace with hash -96752386, now seen corresponding path program 4 times [2020-04-18 10:58:00,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 10:58:00,285 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860677503] [2020-04-18 10:58:00,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 10:58:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 10:58:00,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 10:58:00,349 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860677503] [2020-04-18 10:58:00,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 10:58:00,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 10:58:00,350 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 10:58:00,351 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:58:00,356 INFO L259 McrAutomatonBuilder]: Finished intersection with 32 states and 51 transitions. [2020-04-18 10:58:00,356 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 10:58:00,388 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 10:58:00,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 10:58:00,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-04-18 10:58:00,389 INFO L87 Difference]: Start difference. First operand 136 states and 315 transitions. Second operand 6 states. [2020-04-18 10:58:00,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:58:00,448 INFO L93 Difference]: Finished difference Result 173 states and 373 transitions. [2020-04-18 10:58:00,449 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 373 transitions. [2020-04-18 10:58:00,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 10:58:00,449 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 10:58:00,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:58:00,450 INFO L82 PathProgramCache]: Analyzing trace with hash 807678122, now seen corresponding path program 5 times [2020-04-18 10:58:00,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 10:58:00,450 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376420041] [2020-04-18 10:58:00,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 10:58:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 10:58:00,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 10:58:00,489 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376420041] [2020-04-18 10:58:00,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 10:58:00,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 10:58:00,490 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 10:58:00,492 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:58:00,498 INFO L259 McrAutomatonBuilder]: Finished intersection with 34 states and 55 transitions. [2020-04-18 10:58:00,499 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 10:58:00,530 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 10:58:00,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 10:58:00,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2020-04-18 10:58:00,534 INFO L87 Difference]: Start difference. First operand 173 states and 373 transitions. Second operand 4 states. [2020-04-18 10:58:00,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:58:00,547 INFO L93 Difference]: Finished difference Result 173 states and 373 transitions. [2020-04-18 10:58:00,547 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 373 transitions. [2020-04-18 10:58:00,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 10:58:00,548 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [2024756031] [2020-04-18 10:58:00,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 10:58:00,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 10:58:00,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [2024756031] [2020-04-18 10:58:00,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-04-18 10:58:00,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 10:58:00,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-04-18 10:58:00,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-04-18 10:58:00,551 INFO L87 Difference]: Start difference. First operand 322 states and 910 transitions. Second operand 10 states. [2020-04-18 10:58:01,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:58:01,082 INFO L93 Difference]: Finished difference Result 560 states and 1394 transitions. [2020-04-18 10:58:01,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-04-18 10:58:01,082 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2020-04-18 10:58:01,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 10:58:01,084 INFO L225 Difference]: With dead ends: 560 [2020-04-18 10:58:01,084 INFO L226 Difference]: Without dead ends: 214 [2020-04-18 10:58:01,085 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=373, Invalid=1519, Unknown=0, NotChecked=0, Total=1892 [2020-04-18 10:58:01,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-04-18 10:58:01,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2020-04-18 10:58:01,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-04-18 10:58:01,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 534 transitions. [2020-04-18 10:58:01,092 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 534 transitions. Word has length 15 [2020-04-18 10:58:01,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 10:58:01,092 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 534 transitions. [2020-04-18 10:58:01,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-04-18 10:58:01,092 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 534 transitions. [2020-04-18 10:58:01,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-04-18 10:58:01,093 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 10:58:01,093 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 10:58:01,093 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 10:58:01,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:58:01,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1481069530, now seen corresponding path program 1 times [2020-04-18 10:58:01,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 10:58:01,094 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [491610651] [2020-04-18 10:58:01,095 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:58:01,097 INFO L259 McrAutomatonBuilder]: Finished intersection with 138 states and 378 transitions. [2020-04-18 10:58:01,098 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states. [2020-04-18 10:58:01,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-04-18 10:58:01,099 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 10:58:01,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:58:01,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1025487846, now seen corresponding path program 2 times [2020-04-18 10:58:01,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 10:58:01,100 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375543203] [2020-04-18 10:58:01,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 10:58:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 10:58:01,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 10:58:01,136 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375543203] [2020-04-18 10:58:01,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 10:58:01,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 10:58:01,136 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 10:58:01,138 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:58:01,142 INFO L259 McrAutomatonBuilder]: Finished intersection with 36 states and 58 transitions. [2020-04-18 10:58:01,142 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 10:58:01,153 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 10:58:01,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 10:58:01,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 10:58:01,154 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 4 states. [2020-04-18 10:58:01,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:58:01,171 INFO L93 Difference]: Finished difference Result 170 states and 458 transitions. [2020-04-18 10:58:01,171 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 458 transitions. [2020-04-18 10:58:01,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-04-18 10:58:01,172 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 10:58:01,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:58:01,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1025782656, now seen corresponding path program 3 times [2020-04-18 10:58:01,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 10:58:01,173 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206554500] [2020-04-18 10:58:01,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 10:58:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 10:58:01,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 10:58:01,217 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206554500] [2020-04-18 10:58:01,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 10:58:01,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 10:58:01,218 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 10:58:01,219 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:58:01,225 INFO L259 McrAutomatonBuilder]: Finished intersection with 47 states and 84 transitions. [2020-04-18 10:58:01,225 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 10:58:01,244 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 10:58:01,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 10:58:01,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 10:58:01,246 INFO L87 Difference]: Start difference. First operand 170 states and 458 transitions. Second operand 5 states. [2020-04-18 10:58:01,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:58:01,290 INFO L93 Difference]: Finished difference Result 212 states and 537 transitions. [2020-04-18 10:58:01,290 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 537 transitions. [2020-04-18 10:58:01,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-04-18 10:58:01,291 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 10:58:01,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:58:01,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1295643564, now seen corresponding path program 4 times [2020-04-18 10:58:01,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 10:58:01,292 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406464680] [2020-04-18 10:58:01,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 10:58:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 10:58:01,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 10:58:01,350 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406464680] [2020-04-18 10:58:01,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 10:58:01,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 10:58:01,351 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 10:58:01,353 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:58:01,358 INFO L259 McrAutomatonBuilder]: Finished intersection with 37 states and 60 transitions. [2020-04-18 10:58:01,358 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 10:58:01,390 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 10:58:01,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 10:58:01,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-04-18 10:58:01,391 INFO L87 Difference]: Start difference. First operand 212 states and 537 transitions. Second operand 6 states. [2020-04-18 10:58:01,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:58:01,462 INFO L93 Difference]: Finished difference Result 286 states and 690 transitions. [2020-04-18 10:58:01,462 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 690 transitions. [2020-04-18 10:58:01,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-04-18 10:58:01,464 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 10:58:01,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:58:01,464 INFO L82 PathProgramCache]: Analyzing trace with hash -731781760, now seen corresponding path program 5 times [2020-04-18 10:58:01,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 10:58:01,465 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684187205] [2020-04-18 10:58:01,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 10:58:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 10:58:01,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 10:58:01,532 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684187205] [2020-04-18 10:58:01,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 10:58:01,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 10:58:01,533 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 10:58:01,535 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:58:01,541 INFO L259 McrAutomatonBuilder]: Finished intersection with 42 states and 72 transitions. [2020-04-18 10:58:01,541 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 10:58:01,578 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 10:58:01,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 10:58:01,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2020-04-18 10:58:01,580 INFO L87 Difference]: Start difference. First operand 286 states and 690 transitions. Second operand 4 states. [2020-04-18 10:58:01,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:58:01,604 INFO L93 Difference]: Finished difference Result 340 states and 785 transitions. [2020-04-18 10:58:01,604 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 785 transitions. [2020-04-18 10:58:01,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-04-18 10:58:01,606 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 10:58:01,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:58:01,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1481069530, now seen corresponding path program 6 times [2020-04-18 10:58:01,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 10:58:01,608 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518969837] [2020-04-18 10:58:01,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 10:58:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 10:58:01,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 10:58:01,666 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518969837] [2020-04-18 10:58:01,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 10:58:01,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 10:58:01,667 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 10:58:01,668 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:58:01,677 INFO L259 McrAutomatonBuilder]: Finished intersection with 43 states and 74 transitions. [2020-04-18 10:58:01,677 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 10:58:01,803 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 10 times. [2020-04-18 10:58:01,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 10:58:01,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-04-18 10:58:01,805 INFO L87 Difference]: Start difference. First operand 340 states and 785 transitions. Second operand 7 states. [2020-04-18 10:58:01,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:58:01,836 INFO L93 Difference]: Finished difference Result 340 states and 785 transitions. [2020-04-18 10:58:01,836 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 785 transitions. [2020-04-18 10:58:01,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 10:58:01,837 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [491610651] [2020-04-18 10:58:01,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 10:58:01,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-04-18 10:58:01,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [491610651] [2020-04-18 10:58:01,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 10:58:01,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 10:58:01,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 10:58:01,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2020-04-18 10:58:01,839 INFO L87 Difference]: Start difference. First operand 214 states and 534 transitions. Second operand 13 states. [2020-04-18 10:58:02,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:58:02,391 INFO L93 Difference]: Finished difference Result 211 states and 465 transitions. [2020-04-18 10:58:02,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-04-18 10:58:02,392 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2020-04-18 10:58:02,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 10:58:02,393 INFO L225 Difference]: With dead ends: 211 [2020-04-18 10:58:02,393 INFO L226 Difference]: Without dead ends: 158 [2020-04-18 10:58:02,394 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=424, Invalid=1832, Unknown=0, NotChecked=0, Total=2256 [2020-04-18 10:58:02,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-04-18 10:58:02,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2020-04-18 10:58:02,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-04-18 10:58:02,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 339 transitions. [2020-04-18 10:58:02,399 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 339 transitions. Word has length 16 [2020-04-18 10:58:02,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 10:58:02,400 INFO L479 AbstractCegarLoop]: Abstraction has 158 states and 339 transitions. [2020-04-18 10:58:02,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 10:58:02,400 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 339 transitions. [2020-04-18 10:58:02,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 10:58:02,400 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 10:58:02,401 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 10:58:02,401 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 10:58:02,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:58:02,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1331262194, now seen corresponding path program 1 times [2020-04-18 10:58:02,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 10:58:02,402 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1408588327] [2020-04-18 10:58:02,402 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:58:02,405 INFO L259 McrAutomatonBuilder]: Finished intersection with 186 states and 542 transitions. [2020-04-18 10:58:02,406 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states. [2020-04-18 10:58:02,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 10:58:02,407 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 10:58:02,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:58:02,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1725351916, now seen corresponding path program 2 times [2020-04-18 10:58:02,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 10:58:02,409 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275202706] [2020-04-18 10:58:02,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 10:58:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 10:58:02,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 10:58:02,443 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275202706] [2020-04-18 10:58:02,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 10:58:02,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 10:58:02,444 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 10:58:02,445 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:58:02,450 INFO L259 McrAutomatonBuilder]: Finished intersection with 38 states and 61 transitions. [2020-04-18 10:58:02,450 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 10:58:02,460 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 10:58:02,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 10:58:02,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 10:58:02,460 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 4 states. [2020-04-18 10:58:02,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:58:02,479 INFO L93 Difference]: Finished difference Result 234 states and 670 transitions. [2020-04-18 10:58:02,479 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 670 transitions. [2020-04-18 10:58:02,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 10:58:02,480 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 10:58:02,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:58:02,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1734491026, now seen corresponding path program 3 times [2020-04-18 10:58:02,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 10:58:02,481 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321749792] [2020-04-18 10:58:02,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 10:58:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 10:58:02,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 10:58:02,520 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321749792] [2020-04-18 10:58:02,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 10:58:02,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 10:58:02,521 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 10:58:02,522 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:58:02,528 INFO L259 McrAutomatonBuilder]: Finished intersection with 50 states and 89 transitions. [2020-04-18 10:58:02,528 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 10:58:02,541 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 10:58:02,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 10:58:02,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 10:58:02,542 INFO L87 Difference]: Start difference. First operand 234 states and 670 transitions. Second operand 5 states. [2020-04-18 10:58:02,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:58:02,581 INFO L93 Difference]: Finished difference Result 318 states and 870 transitions. [2020-04-18 10:58:02,581 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 870 transitions. [2020-04-18 10:58:02,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 10:58:02,582 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 10:58:02,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:58:02,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1510245058, now seen corresponding path program 4 times [2020-04-18 10:58:02,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 10:58:02,583 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121727791] [2020-04-18 10:58:02,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 10:58:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 10:58:02,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 10:58:02,621 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121727791] [2020-04-18 10:58:02,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 10:58:02,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 10:58:02,621 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 10:58:02,622 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:58:02,628 INFO L259 McrAutomatonBuilder]: Finished intersection with 41 states and 67 transitions. [2020-04-18 10:58:02,628 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 10:58:02,657 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 10:58:02,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 10:58:02,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-04-18 10:58:02,658 INFO L87 Difference]: Start difference. First operand 318 states and 870 transitions. Second operand 6 states. [2020-04-18 10:58:02,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:58:02,707 INFO L93 Difference]: Finished difference Result 434 states and 1134 transitions. [2020-04-18 10:58:02,707 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1134 transitions. [2020-04-18 10:58:02,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 10:58:02,708 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 10:58:02,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:58:02,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1210397842, now seen corresponding path program 5 times [2020-04-18 10:58:02,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 10:58:02,709 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054603620] [2020-04-18 10:58:02,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 10:58:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 10:58:02,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 10:58:02,741 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054603620] [2020-04-18 10:58:02,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 10:58:02,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 10:58:02,741 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 10:58:02,743 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:58:02,749 INFO L259 McrAutomatonBuilder]: Finished intersection with 48 states and 84 transitions. [2020-04-18 10:58:02,749 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 10:58:02,774 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 10:58:02,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 10:58:02,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2020-04-18 10:58:02,775 INFO L87 Difference]: Start difference. First operand 434 states and 1134 transitions. Second operand 4 states. [2020-04-18 10:58:02,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:58:02,801 INFO L93 Difference]: Finished difference Result 612 states and 1503 transitions. [2020-04-18 10:58:02,801 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1503 transitions. [2020-04-18 10:58:02,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 10:58:02,803 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 10:58:02,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:58:02,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1331485064, now seen corresponding path program 6 times [2020-04-18 10:58:02,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 10:58:02,804 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469948168] [2020-04-18 10:58:02,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 10:58:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 10:58:02,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 10:58:02,835 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469948168] [2020-04-18 10:58:02,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 10:58:02,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 10:58:02,836 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 10:58:02,837 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:58:02,844 INFO L259 McrAutomatonBuilder]: Finished intersection with 49 states and 86 transitions. [2020-04-18 10:58:02,844 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 10:58:02,949 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 10 times. [2020-04-18 10:58:02,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 10:58:02,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2020-04-18 10:58:02,950 INFO L87 Difference]: Start difference. First operand 612 states and 1503 transitions. Second operand 7 states. [2020-04-18 10:58:03,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:58:03,017 INFO L93 Difference]: Finished difference Result 646 states and 1548 transitions. [2020-04-18 10:58:03,017 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1548 transitions. [2020-04-18 10:58:03,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 10:58:03,019 INFO L105 Mcr]: ---- MCR iteration 5 ---- [2020-04-18 10:58:03,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:58:03,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1331262194, now seen corresponding path program 7 times [2020-04-18 10:58:03,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 10:58:03,020 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083529651] [2020-04-18 10:58:03,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 10:58:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 10:58:03,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 10:58:03,071 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083529651] [2020-04-18 10:58:03,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 10:58:03,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 10:58:03,071 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 10:58:03,073 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:58:03,081 INFO L259 McrAutomatonBuilder]: Finished intersection with 45 states and 77 transitions. [2020-04-18 10:58:03,082 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 10:58:03,179 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 11 times. [2020-04-18 10:58:03,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-04-18 10:58:03,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2020-04-18 10:58:03,180 INFO L87 Difference]: Start difference. First operand 646 states and 1548 transitions. Second operand 8 states. [2020-04-18 10:58:03,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:58:03,255 INFO L93 Difference]: Finished difference Result 646 states and 1548 transitions. [2020-04-18 10:58:03,255 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1548 transitions. [2020-04-18 10:58:03,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 10:58:03,257 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1408588327] [2020-04-18 10:58:03,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 10:58:03,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 10:58:03,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1408588327] [2020-04-18 10:58:03,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-18 10:58:03,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 10:58:03,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-18 10:58:03,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2020-04-18 10:58:03,259 INFO L87 Difference]: Start difference. First operand 158 states and 339 transitions. Second operand 14 states. [2020-04-18 10:58:03,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:58:03,796 INFO L93 Difference]: Finished difference Result 134 states and 268 transitions. [2020-04-18 10:58:03,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-04-18 10:58:03,796 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2020-04-18 10:58:03,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 10:58:03,797 INFO L225 Difference]: With dead ends: 134 [2020-04-18 10:58:03,798 INFO L226 Difference]: Without dead ends: 95 [2020-04-18 10:58:03,799 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=389, Invalid=1773, Unknown=0, NotChecked=0, Total=2162 [2020-04-18 10:58:03,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-04-18 10:58:03,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-04-18 10:58:03,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-04-18 10:58:03,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 181 transitions. [2020-04-18 10:58:03,802 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 181 transitions. Word has length 17 [2020-04-18 10:58:03,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 10:58:03,803 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 181 transitions. [2020-04-18 10:58:03,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-18 10:58:03,803 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 181 transitions. [2020-04-18 10:58:03,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-04-18 10:58:03,803 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 10:58:03,804 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 10:58:03,804 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 10:58:03,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:58:03,804 INFO L82 PathProgramCache]: Analyzing trace with hash 461519417, now seen corresponding path program 1 times [2020-04-18 10:58:03,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 10:58:03,804 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [247705650] [2020-04-18 10:58:03,805 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:58:03,812 INFO L259 McrAutomatonBuilder]: Finished intersection with 370 states and 1174 transitions. [2020-04-18 10:58:03,815 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states. [2020-04-18 10:58:03,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-04-18 10:58:03,817 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 10:58:03,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:58:03,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1539514913, now seen corresponding path program 2 times [2020-04-18 10:58:03,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 10:58:03,818 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269037168] [2020-04-18 10:58:03,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 10:58:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 10:58:03,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 10:58:03,852 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269037168] [2020-04-18 10:58:03,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 10:58:03,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 10:58:03,852 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 10:58:03,854 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:58:03,865 INFO L259 McrAutomatonBuilder]: Finished intersection with 94 states and 176 transitions. [2020-04-18 10:58:03,865 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 10:58:03,878 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 10:58:03,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 10:58:03,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-04-18 10:58:03,879 INFO L87 Difference]: Start difference. First operand 370 states. Second operand 5 states. [2020-04-18 10:58:03,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:58:03,929 INFO L93 Difference]: Finished difference Result 550 states and 1738 transitions. [2020-04-18 10:58:03,929 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1738 transitions. [2020-04-18 10:58:03,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-04-18 10:58:03,931 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 10:58:03,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:58:03,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1354015477, now seen corresponding path program 3 times [2020-04-18 10:58:03,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 10:58:03,933 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326388438] [2020-04-18 10:58:03,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 10:58:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 10:58:03,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 10:58:03,967 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326388438] [2020-04-18 10:58:03,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 10:58:03,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 10:58:03,968 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 10:58:03,969 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:58:03,974 INFO L259 McrAutomatonBuilder]: Finished intersection with 37 states and 50 transitions. [2020-04-18 10:58:03,975 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 10:58:03,982 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 10:58:03,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 10:58:03,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-04-18 10:58:03,983 INFO L87 Difference]: Start difference. First operand 550 states and 1738 transitions. Second operand 4 states. [2020-04-18 10:58:04,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:58:04,010 INFO L93 Difference]: Finished difference Result 910 states and 2754 transitions. [2020-04-18 10:58:04,010 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 2754 transitions. [2020-04-18 10:58:04,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-04-18 10:58:04,013 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 10:58:04,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:58:04,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1344876367, now seen corresponding path program 4 times [2020-04-18 10:58:04,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 10:58:04,013 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085579379] [2020-04-18 10:58:04,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 10:58:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 10:58:04,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 10:58:04,056 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085579379] [2020-04-18 10:58:04,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 10:58:04,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 10:58:04,056 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 10:58:04,058 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:58:04,064 INFO L259 McrAutomatonBuilder]: Finished intersection with 35 states and 48 transitions. [2020-04-18 10:58:04,064 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 10:58:04,103 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 10:58:04,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 10:58:04,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-04-18 10:58:04,104 INFO L87 Difference]: Start difference. First operand 910 states and 2754 transitions. Second operand 6 states. [2020-04-18 10:58:04,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:58:04,171 INFO L93 Difference]: Finished difference Result 1414 states and 4042 transitions. [2020-04-18 10:58:04,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 4042 transitions. [2020-04-18 10:58:04,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-04-18 10:58:04,174 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 10:58:04,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:58:04,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1192691597, now seen corresponding path program 5 times [2020-04-18 10:58:04,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 10:58:04,175 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522449398] [2020-04-18 10:58:04,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 10:58:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 10:58:04,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 10:58:04,213 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522449398] [2020-04-18 10:58:04,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 10:58:04,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 10:58:04,213 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 10:58:04,215 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:58:04,219 INFO L259 McrAutomatonBuilder]: Finished intersection with 35 states and 48 transitions. [2020-04-18 10:58:04,220 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 10:58:04,234 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 10:58:04,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 10:58:04,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-04-18 10:58:04,235 INFO L87 Difference]: Start difference. First operand 1414 states and 4042 transitions. Second operand 5 states. [2020-04-18 10:58:04,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:58:04,297 INFO L93 Difference]: Finished difference Result 1696 states and 4699 transitions. [2020-04-18 10:58:04,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 4699 transitions. [2020-04-18 10:58:04,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-04-18 10:58:04,301 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 10:58:04,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:58:04,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1221860735, now seen corresponding path program 6 times [2020-04-18 10:58:04,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 10:58:04,302 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201618156] [2020-04-18 10:58:04,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 10:58:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 10:58:04,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 10:58:04,334 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201618156] [2020-04-18 10:58:04,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 10:58:04,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 10:58:04,335 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 10:58:04,336 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:58:04,342 INFO L259 McrAutomatonBuilder]: Finished intersection with 42 states and 61 transitions. [2020-04-18 10:58:04,342 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 10:58:04,393 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 10:58:04,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 10:58:04,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2020-04-18 10:58:04,394 INFO L87 Difference]: Start difference. First operand 1696 states and 4699 transitions. Second operand 5 states. [2020-04-18 10:58:04,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:58:04,475 INFO L93 Difference]: Finished difference Result 2041 states and 5296 transitions. [2020-04-18 10:58:04,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 5296 transitions. [2020-04-18 10:58:04,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-04-18 10:58:04,479 INFO L105 Mcr]: ---- MCR iteration 5 ---- [2020-04-18 10:58:04,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:58:04,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1320022171, now seen corresponding path program 7 times [2020-04-18 10:58:04,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 10:58:04,479 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531075601] [2020-04-18 10:58:04,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 10:58:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 10:58:04,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 10:58:04,512 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531075601] [2020-04-18 10:58:04,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 10:58:04,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 10:58:04,513 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 10:58:04,514 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:58:04,551 INFO L259 McrAutomatonBuilder]: Finished intersection with 39 states and 55 transitions. [2020-04-18 10:58:04,551 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 10:58:04,578 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 10:58:04,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 10:58:04,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2020-04-18 10:58:04,579 INFO L87 Difference]: Start difference. First operand 2041 states and 5296 transitions. Second operand 6 states. [2020-04-18 10:58:04,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:58:04,680 INFO L93 Difference]: Finished difference Result 2091 states and 5344 transitions. [2020-04-18 10:58:04,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 5344 transitions. [2020-04-18 10:58:04,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-04-18 10:58:04,684 INFO L105 Mcr]: ---- MCR iteration 6 ---- [2020-04-18 10:58:04,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 10:58:04,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1319799301, now seen corresponding path program 8 times [2020-04-18 10:58:04,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 10:58:04,685 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711528747] [2020-04-18 10:58:04,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 10:58:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 10:58:04,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 10:58:04,752 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711528747] [2020-04-18 10:58:04,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 10:58:04,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 10:58:04,753 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 10:58:04,756 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 10:58:04,762 INFO L259 McrAutomatonBuilder]: Finished intersection with 37 states and 51 transitions. [2020-04-18 10:58:04,762 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 10:58:04,784 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 10:58:04,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 10:58:04,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=648, Unknown=0, NotChecked=0, Total=756 [2020-04-18 10:58:04,785 INFO L87 Difference]: Start difference. First operand 2091 states and 5344 transitions. Second operand 7 states. [2020-04-18 10:58:04,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:58:04,876 INFO L93 Difference]: Finished difference Result 2091 states and 5344 transitions. [2020-04-18 10:58:04,876 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 5344 transitions. [2020-04-18 10:58:04,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 10:58:04,879 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [247705650] [2020-04-18 10:58:04,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 10:58:04,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-04-18 10:58:04,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [247705650] [2020-04-18 10:58:04,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-04-18 10:58:04,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 10:58:04,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-04-18 10:58:04,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=697, Unknown=0, NotChecked=0, Total=812 [2020-04-18 10:58:04,880 INFO L87 Difference]: Start difference. First operand 95 states and 181 transitions. Second operand 15 states. [2020-04-18 10:58:05,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 10:58:05,460 INFO L93 Difference]: Finished difference Result 94 states and 179 transitions. [2020-04-18 10:58:05,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-04-18 10:58:05,460 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 19 [2020-04-18 10:58:05,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 10:58:05,461 INFO L225 Difference]: With dead ends: 94 [2020-04-18 10:58:05,461 INFO L226 Difference]: Without dead ends: 0 [2020-04-18 10:58:05,463 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=456, Invalid=2966, Unknown=0, NotChecked=0, Total=3422 [2020-04-18 10:58:05,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-04-18 10:58:05,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-04-18 10:58:05,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-04-18 10:58:05,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-04-18 10:58:05,464 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2020-04-18 10:58:05,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 10:58:05,464 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-04-18 10:58:05,464 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-04-18 10:58:05,464 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-04-18 10:58:05,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 10:58:05,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.04 10:58:05 BasicIcfg [2020-04-18 10:58:05,469 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-04-18 10:58:05,470 INFO L168 Benchmark]: Toolchain (without parser) took 11652.06 ms. Allocated memory was 135.3 MB in the beginning and 392.7 MB in the end (delta: 257.4 MB). Free memory was 98.4 MB in the beginning and 192.4 MB in the end (delta: -94.0 MB). Peak memory consumption was 163.5 MB. Max. memory is 7.1 GB. [2020-04-18 10:58:05,471 INFO L168 Benchmark]: CDTParser took 1.04 ms. Allocated memory is still 135.3 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-04-18 10:58:05,471 INFO L168 Benchmark]: CACSL2BoogieTranslator took 686.59 ms. Allocated memory was 135.3 MB in the beginning and 199.8 MB in the end (delta: 64.5 MB). Free memory was 96.6 MB in the beginning and 155.8 MB in the end (delta: -59.2 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2020-04-18 10:58:05,472 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.29 ms. Allocated memory is still 199.8 MB. Free memory was 155.8 MB in the beginning and 153.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2020-04-18 10:58:05,472 INFO L168 Benchmark]: Boogie Preprocessor took 26.45 ms. Allocated memory is still 199.8 MB. Free memory was 153.7 MB in the beginning and 152.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2020-04-18 10:58:05,472 INFO L168 Benchmark]: RCFGBuilder took 520.87 ms. Allocated memory is still 199.8 MB. Free memory was 152.2 MB in the beginning and 128.2 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. [2020-04-18 10:58:05,473 INFO L168 Benchmark]: TraceAbstraction took 10341.96 ms. Allocated memory was 199.8 MB in the beginning and 392.7 MB in the end (delta: 192.9 MB). Free memory was 128.2 MB in the beginning and 192.4 MB in the end (delta: -64.3 MB). Peak memory consumption was 128.7 MB. Max. memory is 7.1 GB. [2020-04-18 10:58:05,475 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.04 ms. Allocated memory is still 135.3 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 686.59 ms. Allocated memory was 135.3 MB in the beginning and 199.8 MB in the end (delta: 64.5 MB). Free memory was 96.6 MB in the beginning and 155.8 MB in the end (delta: -59.2 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.29 ms. Allocated memory is still 199.8 MB. Free memory was 155.8 MB in the beginning and 153.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.45 ms. Allocated memory is still 199.8 MB. Free memory was 153.7 MB in the beginning and 152.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 520.87 ms. Allocated memory is still 199.8 MB. Free memory was 152.2 MB in the beginning and 128.2 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10341.96 ms. Allocated memory was 199.8 MB in the beginning and 392.7 MB in the end (delta: 192.9 MB). Free memory was 128.2 MB in the beginning and 192.4 MB in the end (delta: -64.3 MB). Peak memory consumption was 128.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.0s, 91 ProgramPointsBefore, 39 ProgramPointsAfterwards, 80 TransitionsBefore, 27 TransitionsAfterwards, 1822 CoEnabledTransitionPairs, 6 FixpointIterations, 13 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 953 VarBasedMoverChecksPositive, 43 VarBasedMoverChecksNegative, 32 SemBasedMoverChecksPositive, 35 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.4s, 0 MoverChecksTotal, 2895 CheckedPairsTotal, 62 TotalNumberOfCompositions - PositiveResult [Line: 7]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 10.2s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.1s, HoareTripleCheckerStatistics: 313 SDtfs, 761 SDslu, 1030 SDs, 0 SdLazy, 713 SolverSat, 259 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 767 GetRequests, 531 SyntacticMatches, 2 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2991 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=850occurred 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, 11 MinimizatonAttempts, 128 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 correct! Received shutdown request...