/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/locks/test_locks_12.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 11:36:12,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 11:36:12,568 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 11:36:12,628 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 11:36:12,628 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 11:36:12,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 11:36:12,637 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 11:36:12,643 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 11:36:12,647 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 11:36:12,654 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 11:36:12,659 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 11:36:12,661 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 11:36:12,661 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 11:36:12,662 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 11:36:12,664 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 11:36:12,665 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 11:36:12,680 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 11:36:12,681 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 11:36:12,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 11:36:12,686 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 11:36:12,688 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 11:36:12,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 11:36:12,691 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 11:36:12,691 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 11:36:12,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 11:36:12,695 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 11:36:12,695 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 11:36:12,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 11:36:12,697 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 11:36:12,698 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 11:36:12,699 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 11:36:12,700 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 11:36:12,700 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 11:36:12,701 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 11:36:12,703 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 11:36:12,703 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 11:36:12,704 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 11:36:12,704 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 11:36:12,704 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 11:36:12,705 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 11:36:12,706 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 11:36:12,707 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 11:36:12,745 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 11:36:12,745 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 11:36:12,747 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 11:36:12,747 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 11:36:12,748 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 11:36:12,749 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 11:36:12,749 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 11:36:12,750 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 11:36:12,750 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 11:36:12,750 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 11:36:12,750 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 11:36:12,750 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 11:36:12,751 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 11:36:12,752 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 11:36:12,752 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 11:36:12,752 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 11:36:12,752 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 11:36:12,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:36:12,753 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 11:36:12,753 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 11:36:12,753 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 11:36:12,754 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 11:36:12,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 11:36:12,754 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 11:36:12,754 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 11:36:12,754 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 11:36:13,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 11:36:13,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 11:36:13,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 11:36:13,160 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 11:36:13,160 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 11:36:13,161 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_12.c [2021-01-06 11:36:13,250 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d5328587c/01648bc4aa8547668b61a6699d6ae82d/FLAG3ff20ebc7 [2021-01-06 11:36:13,971 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 11:36:13,971 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/locks/test_locks_12.c [2021-01-06 11:36:13,980 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d5328587c/01648bc4aa8547668b61a6699d6ae82d/FLAG3ff20ebc7 [2021-01-06 11:36:14,348 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d5328587c/01648bc4aa8547668b61a6699d6ae82d [2021-01-06 11:36:14,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 11:36:14,353 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 11:36:14,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 11:36:14,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 11:36:14,359 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 11:36:14,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:36:14" (1/1) ... [2021-01-06 11:36:14,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e257473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:36:14, skipping insertion in model container [2021-01-06 11:36:14,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:36:14" (1/1) ... [2021-01-06 11:36:14,370 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 11:36:14,404 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~cond~0,] left hand side expression in assignment: lhs: VariableLHS[~lk1~0,] left hand side expression in assignment: lhs: VariableLHS[~lk2~0,] left hand side expression in assignment: lhs: VariableLHS[~lk3~0,] left hand side expression in assignment: lhs: VariableLHS[~lk4~0,] left hand side expression in assignment: lhs: VariableLHS[~lk5~0,] left hand side expression in assignment: lhs: VariableLHS[~lk6~0,] left hand side expression in assignment: lhs: VariableLHS[~lk7~0,] left hand side expression in assignment: lhs: VariableLHS[~lk8~0,] left hand side expression in assignment: lhs: VariableLHS[~lk9~0,] left hand side expression in assignment: lhs: VariableLHS[~lk10~0,] left hand side expression in assignment: lhs: VariableLHS[~lk11~0,] left hand side expression in assignment: lhs: VariableLHS[~lk12~0,] left hand side expression in assignment: lhs: VariableLHS[~lk1~0,] left hand side expression in assignment: lhs: VariableLHS[~lk2~0,] left hand side expression in assignment: lhs: VariableLHS[~lk3~0,] left hand side expression in assignment: lhs: VariableLHS[~lk4~0,] left hand side expression in assignment: lhs: VariableLHS[~lk5~0,] left hand side expression in assignment: lhs: VariableLHS[~lk6~0,] left hand side expression in assignment: lhs: VariableLHS[~lk7~0,] left hand side expression in assignment: lhs: VariableLHS[~lk8~0,] left hand side expression in assignment: lhs: VariableLHS[~lk9~0,] left hand side expression in assignment: lhs: VariableLHS[~lk10~0,] left hand side expression in assignment: lhs: VariableLHS[~lk11~0,] left hand side expression in assignment: lhs: VariableLHS[~lk12~0,] left hand side expression in assignment: lhs: VariableLHS[~lk1~0,] left hand side expression in assignment: lhs: VariableLHS[~lk2~0,] left hand side expression in assignment: lhs: VariableLHS[~lk3~0,] left hand side expression in assignment: lhs: VariableLHS[~lk4~0,] left hand side expression in assignment: lhs: VariableLHS[~lk5~0,] left hand side expression in assignment: lhs: VariableLHS[~lk6~0,] left hand side expression in assignment: lhs: VariableLHS[~lk7~0,] left hand side expression in assignment: lhs: VariableLHS[~lk8~0,] left hand side expression in assignment: lhs: VariableLHS[~lk9~0,] left hand side expression in assignment: lhs: VariableLHS[~lk10~0,] left hand side expression in assignment: lhs: VariableLHS[~lk11~0,] left hand side expression in assignment: lhs: VariableLHS[~lk12~0,] [2021-01-06 11:36:14,574 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/locks/test_locks_12.c[4591,4604] [2021-01-06 11:36:14,581 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:36:14,593 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~cond~0,] left hand side expression in assignment: lhs: VariableLHS[~lk1~0,] left hand side expression in assignment: lhs: VariableLHS[~lk2~0,] left hand side expression in assignment: lhs: VariableLHS[~lk3~0,] left hand side expression in assignment: lhs: VariableLHS[~lk4~0,] left hand side expression in assignment: lhs: VariableLHS[~lk5~0,] left hand side expression in assignment: lhs: VariableLHS[~lk6~0,] left hand side expression in assignment: lhs: VariableLHS[~lk7~0,] left hand side expression in assignment: lhs: VariableLHS[~lk8~0,] left hand side expression in assignment: lhs: VariableLHS[~lk9~0,] left hand side expression in assignment: lhs: VariableLHS[~lk10~0,] left hand side expression in assignment: lhs: VariableLHS[~lk11~0,] left hand side expression in assignment: lhs: VariableLHS[~lk12~0,] left hand side expression in assignment: lhs: VariableLHS[~lk1~0,] left hand side expression in assignment: lhs: VariableLHS[~lk2~0,] left hand side expression in assignment: lhs: VariableLHS[~lk3~0,] left hand side expression in assignment: lhs: VariableLHS[~lk4~0,] left hand side expression in assignment: lhs: VariableLHS[~lk5~0,] left hand side expression in assignment: lhs: VariableLHS[~lk6~0,] left hand side expression in assignment: lhs: VariableLHS[~lk7~0,] left hand side expression in assignment: lhs: VariableLHS[~lk8~0,] left hand side expression in assignment: lhs: VariableLHS[~lk9~0,] left hand side expression in assignment: lhs: VariableLHS[~lk10~0,] left hand side expression in assignment: lhs: VariableLHS[~lk11~0,] left hand side expression in assignment: lhs: VariableLHS[~lk12~0,] left hand side expression in assignment: lhs: VariableLHS[~lk1~0,] left hand side expression in assignment: lhs: VariableLHS[~lk2~0,] left hand side expression in assignment: lhs: VariableLHS[~lk3~0,] left hand side expression in assignment: lhs: VariableLHS[~lk4~0,] left hand side expression in assignment: lhs: VariableLHS[~lk5~0,] left hand side expression in assignment: lhs: VariableLHS[~lk6~0,] left hand side expression in assignment: lhs: VariableLHS[~lk7~0,] left hand side expression in assignment: lhs: VariableLHS[~lk8~0,] left hand side expression in assignment: lhs: VariableLHS[~lk9~0,] left hand side expression in assignment: lhs: VariableLHS[~lk10~0,] left hand side expression in assignment: lhs: VariableLHS[~lk11~0,] left hand side expression in assignment: lhs: VariableLHS[~lk12~0,] [2021-01-06 11:36:14,625 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/locks/test_locks_12.c[4591,4604] [2021-01-06 11:36:14,627 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:36:14,642 INFO L208 MainTranslator]: Completed translation [2021-01-06 11:36:14,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:36:14 WrapperNode [2021-01-06 11:36:14,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 11:36:14,644 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 11:36:14,644 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 11:36:14,644 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 11:36:14,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:36:14" (1/1) ... [2021-01-06 11:36:14,680 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:36:14" (1/1) ... [2021-01-06 11:36:14,705 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 11:36:14,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 11:36:14,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 11:36:14,706 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 11:36:14,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:36:14" (1/1) ... [2021-01-06 11:36:14,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:36:14" (1/1) ... [2021-01-06 11:36:14,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:36:14" (1/1) ... [2021-01-06 11:36:14,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:36:14" (1/1) ... [2021-01-06 11:36:14,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:36:14" (1/1) ... [2021-01-06 11:36:14,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:36:14" (1/1) ... [2021-01-06 11:36:14,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:36:14" (1/1) ... [2021-01-06 11:36:14,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 11:36:14,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 11:36:14,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 11:36:14,736 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 11:36:14,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:36:14" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 11:36:14,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 11:36:14,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 11:36:14,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 11:36:14,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 11:36:15,326 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 11:36:15,326 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-01-06 11:36:15,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:36:15 BoogieIcfgContainer [2021-01-06 11:36:15,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 11:36:15,331 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 11:36:15,331 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 11:36:15,335 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 11:36:15,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:36:14" (1/3) ... [2021-01-06 11:36:15,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@143c9628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:36:15, skipping insertion in model container [2021-01-06 11:36:15,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:36:14" (2/3) ... [2021-01-06 11:36:15,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@143c9628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:36:15, skipping insertion in model container [2021-01-06 11:36:15,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:36:15" (3/3) ... [2021-01-06 11:36:15,340 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2021-01-06 11:36:15,348 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 11:36:15,353 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 11:36:15,386 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 11:36:15,458 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 11:36:15,461 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 11:36:15,462 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 11:36:15,462 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 11:36:15,462 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 11:36:15,462 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 11:36:15,462 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 11:36:15,463 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 11:36:15,505 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2021-01-06 11:36:15,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-01-06 11:36:15,512 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:15,513 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:15,515 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:15,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:15,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1341605783, now seen corresponding path program 1 times [2021-01-06 11:36:15,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:15,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867410399] [2021-01-06 11:36:15,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:15,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:36:15,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867410399] [2021-01-06 11:36:15,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:15,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:15,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989853481] [2021-01-06 11:36:15,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:15,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:15,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:15,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:15,830 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2021-01-06 11:36:15,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:15,882 INFO L93 Difference]: Finished difference Result 95 states and 169 transitions. [2021-01-06 11:36:15,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:15,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2021-01-06 11:36:15,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:15,897 INFO L225 Difference]: With dead ends: 95 [2021-01-06 11:36:15,898 INFO L226 Difference]: Without dead ends: 81 [2021-01-06 11:36:15,901 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:15,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-01-06 11:36:15,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 55. [2021-01-06 11:36:15,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2021-01-06 11:36:15,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 102 transitions. [2021-01-06 11:36:15,949 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 102 transitions. Word has length 19 [2021-01-06 11:36:15,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:15,950 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 102 transitions. [2021-01-06 11:36:15,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:15,950 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 102 transitions. [2021-01-06 11:36:15,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-01-06 11:36:15,951 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:15,951 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:15,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 11:36:15,952 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:15,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:15,953 INFO L82 PathProgramCache]: Analyzing trace with hash 61742105, now seen corresponding path program 1 times [2021-01-06 11:36:15,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:15,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845318867] [2021-01-06 11:36:15,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:16,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:36:16,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845318867] [2021-01-06 11:36:16,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:16,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:16,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710571436] [2021-01-06 11:36:16,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:16,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:16,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:16,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:16,029 INFO L87 Difference]: Start difference. First operand 55 states and 102 transitions. Second operand 3 states. [2021-01-06 11:36:16,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:16,059 INFO L93 Difference]: Finished difference Result 134 states and 249 transitions. [2021-01-06 11:36:16,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:16,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2021-01-06 11:36:16,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:16,062 INFO L225 Difference]: With dead ends: 134 [2021-01-06 11:36:16,062 INFO L226 Difference]: Without dead ends: 81 [2021-01-06 11:36:16,064 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:16,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-01-06 11:36:16,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2021-01-06 11:36:16,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2021-01-06 11:36:16,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 146 transitions. [2021-01-06 11:36:16,085 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 146 transitions. Word has length 19 [2021-01-06 11:36:16,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:16,085 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 146 transitions. [2021-01-06 11:36:16,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:16,086 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 146 transitions. [2021-01-06 11:36:16,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-06 11:36:16,087 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:16,087 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:16,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 11:36:16,089 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:16,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:16,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1359680987, now seen corresponding path program 1 times [2021-01-06 11:36:16,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:16,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670131537] [2021-01-06 11:36:16,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:16,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:36:16,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670131537] [2021-01-06 11:36:16,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:16,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:16,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932884652] [2021-01-06 11:36:16,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:16,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:16,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:16,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:16,223 INFO L87 Difference]: Start difference. First operand 79 states and 146 transitions. Second operand 3 states. [2021-01-06 11:36:16,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:16,247 INFO L93 Difference]: Finished difference Result 123 states and 222 transitions. [2021-01-06 11:36:16,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:16,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2021-01-06 11:36:16,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:16,249 INFO L225 Difference]: With dead ends: 123 [2021-01-06 11:36:16,249 INFO L226 Difference]: Without dead ends: 84 [2021-01-06 11:36:16,250 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:16,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-01-06 11:36:16,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2021-01-06 11:36:16,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2021-01-06 11:36:16,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 148 transitions. [2021-01-06 11:36:16,261 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 148 transitions. Word has length 20 [2021-01-06 11:36:16,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:16,261 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 148 transitions. [2021-01-06 11:36:16,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:16,262 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 148 transitions. [2021-01-06 11:36:16,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-06 11:36:16,263 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:16,263 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:16,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 11:36:16,263 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:16,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:16,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1914217955, now seen corresponding path program 1 times [2021-01-06 11:36:16,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:16,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495882282] [2021-01-06 11:36:16,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:16,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:36:16,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495882282] [2021-01-06 11:36:16,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:16,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:16,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131096966] [2021-01-06 11:36:16,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:16,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:16,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:16,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:16,325 INFO L87 Difference]: Start difference. First operand 82 states and 148 transitions. Second operand 3 states. [2021-01-06 11:36:16,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:16,351 INFO L93 Difference]: Finished difference Result 157 states and 285 transitions. [2021-01-06 11:36:16,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:16,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2021-01-06 11:36:16,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:16,354 INFO L225 Difference]: With dead ends: 157 [2021-01-06 11:36:16,354 INFO L226 Difference]: Without dead ends: 155 [2021-01-06 11:36:16,355 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:16,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-01-06 11:36:16,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2021-01-06 11:36:16,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2021-01-06 11:36:16,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 197 transitions. [2021-01-06 11:36:16,371 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 197 transitions. Word has length 20 [2021-01-06 11:36:16,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:16,372 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 197 transitions. [2021-01-06 11:36:16,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:16,372 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 197 transitions. [2021-01-06 11:36:16,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-06 11:36:16,374 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:16,374 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:16,374 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 11:36:16,374 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:16,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:16,375 INFO L82 PathProgramCache]: Analyzing trace with hash 634354277, now seen corresponding path program 1 times [2021-01-06 11:36:16,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:16,376 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026025804] [2021-01-06 11:36:16,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:16,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:36:16,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026025804] [2021-01-06 11:36:16,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:16,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:16,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070209382] [2021-01-06 11:36:16,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:16,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:16,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:16,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:16,472 INFO L87 Difference]: Start difference. First operand 109 states and 197 transitions. Second operand 3 states. [2021-01-06 11:36:16,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:16,495 INFO L93 Difference]: Finished difference Result 261 states and 475 transitions. [2021-01-06 11:36:16,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:16,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2021-01-06 11:36:16,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:16,498 INFO L225 Difference]: With dead ends: 261 [2021-01-06 11:36:16,498 INFO L226 Difference]: Without dead ends: 157 [2021-01-06 11:36:16,499 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:16,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-01-06 11:36:16,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2021-01-06 11:36:16,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2021-01-06 11:36:16,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 279 transitions. [2021-01-06 11:36:16,514 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 279 transitions. Word has length 20 [2021-01-06 11:36:16,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:16,514 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 279 transitions. [2021-01-06 11:36:16,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:16,514 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 279 transitions. [2021-01-06 11:36:16,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-06 11:36:16,516 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:16,516 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:16,516 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 11:36:16,516 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:16,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:16,517 INFO L82 PathProgramCache]: Analyzing trace with hash -788572498, now seen corresponding path program 1 times [2021-01-06 11:36:16,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:16,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810034347] [2021-01-06 11:36:16,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:16,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:36:16,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810034347] [2021-01-06 11:36:16,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:16,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:16,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178441083] [2021-01-06 11:36:16,565 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:16,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:16,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:16,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:16,567 INFO L87 Difference]: Start difference. First operand 155 states and 279 transitions. Second operand 3 states. [2021-01-06 11:36:16,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:16,617 INFO L93 Difference]: Finished difference Result 234 states and 418 transitions. [2021-01-06 11:36:16,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:16,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2021-01-06 11:36:16,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:16,621 INFO L225 Difference]: With dead ends: 234 [2021-01-06 11:36:16,621 INFO L226 Difference]: Without dead ends: 159 [2021-01-06 11:36:16,622 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:16,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-01-06 11:36:16,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2021-01-06 11:36:16,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2021-01-06 11:36:16,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 279 transitions. [2021-01-06 11:36:16,650 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 279 transitions. Word has length 21 [2021-01-06 11:36:16,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:16,652 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 279 transitions. [2021-01-06 11:36:16,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:16,653 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 279 transitions. [2021-01-06 11:36:16,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-06 11:36:16,654 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:16,655 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:16,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 11:36:16,657 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:16,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:16,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1809640852, now seen corresponding path program 1 times [2021-01-06 11:36:16,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:16,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044243806] [2021-01-06 11:36:16,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:16,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:36:16,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044243806] [2021-01-06 11:36:16,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:16,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:16,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750556166] [2021-01-06 11:36:16,743 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:16,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:16,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:16,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:16,747 INFO L87 Difference]: Start difference. First operand 157 states and 279 transitions. Second operand 3 states. [2021-01-06 11:36:16,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:16,774 INFO L93 Difference]: Finished difference Result 453 states and 809 transitions. [2021-01-06 11:36:16,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:16,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2021-01-06 11:36:16,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:16,777 INFO L225 Difference]: With dead ends: 453 [2021-01-06 11:36:16,778 INFO L226 Difference]: Without dead ends: 303 [2021-01-06 11:36:16,779 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:16,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-01-06 11:36:16,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 301. [2021-01-06 11:36:16,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2021-01-06 11:36:16,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 531 transitions. [2021-01-06 11:36:16,799 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 531 transitions. Word has length 21 [2021-01-06 11:36:16,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:16,799 INFO L481 AbstractCegarLoop]: Abstraction has 301 states and 531 transitions. [2021-01-06 11:36:16,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:16,800 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 531 transitions. [2021-01-06 11:36:16,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-06 11:36:16,802 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:16,802 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:16,802 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 11:36:16,802 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:16,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:16,803 INFO L82 PathProgramCache]: Analyzing trace with hash -529777174, now seen corresponding path program 1 times [2021-01-06 11:36:16,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:16,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341700549] [2021-01-06 11:36:16,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:16,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:36:16,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341700549] [2021-01-06 11:36:16,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:16,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:16,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599914505] [2021-01-06 11:36:16,879 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:16,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:16,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:16,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:16,880 INFO L87 Difference]: Start difference. First operand 301 states and 531 transitions. Second operand 3 states. [2021-01-06 11:36:16,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:16,922 INFO L93 Difference]: Finished difference Result 385 states and 685 transitions. [2021-01-06 11:36:16,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:16,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2021-01-06 11:36:16,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:16,927 INFO L225 Difference]: With dead ends: 385 [2021-01-06 11:36:16,928 INFO L226 Difference]: Without dead ends: 383 [2021-01-06 11:36:16,928 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:16,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2021-01-06 11:36:16,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 301. [2021-01-06 11:36:16,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2021-01-06 11:36:16,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 527 transitions. [2021-01-06 11:36:16,956 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 527 transitions. Word has length 21 [2021-01-06 11:36:16,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:16,957 INFO L481 AbstractCegarLoop]: Abstraction has 301 states and 527 transitions. [2021-01-06 11:36:16,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:16,959 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 527 transitions. [2021-01-06 11:36:16,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 11:36:16,963 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:16,963 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:16,963 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 11:36:16,964 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:16,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:16,968 INFO L82 PathProgramCache]: Analyzing trace with hash -264078182, now seen corresponding path program 1 times [2021-01-06 11:36:16,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:16,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86127474] [2021-01-06 11:36:16,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:17,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:36:17,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86127474] [2021-01-06 11:36:17,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:17,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:17,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701419999] [2021-01-06 11:36:17,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:17,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:17,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:17,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:17,005 INFO L87 Difference]: Start difference. First operand 301 states and 527 transitions. Second operand 3 states. [2021-01-06 11:36:17,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:17,027 INFO L93 Difference]: Finished difference Result 565 states and 1001 transitions. [2021-01-06 11:36:17,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:17,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2021-01-06 11:36:17,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:17,031 INFO L225 Difference]: With dead ends: 565 [2021-01-06 11:36:17,031 INFO L226 Difference]: Without dead ends: 563 [2021-01-06 11:36:17,032 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:17,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2021-01-06 11:36:17,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 417. [2021-01-06 11:36:17,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2021-01-06 11:36:17,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 719 transitions. [2021-01-06 11:36:17,048 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 719 transitions. Word has length 22 [2021-01-06 11:36:17,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:17,049 INFO L481 AbstractCegarLoop]: Abstraction has 417 states and 719 transitions. [2021-01-06 11:36:17,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:17,049 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 719 transitions. [2021-01-06 11:36:17,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 11:36:17,051 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:17,051 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:17,052 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 11:36:17,052 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:17,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:17,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1543941860, now seen corresponding path program 1 times [2021-01-06 11:36:17,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:17,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317928416] [2021-01-06 11:36:17,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:17,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:36:17,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317928416] [2021-01-06 11:36:17,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:17,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:17,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164144789] [2021-01-06 11:36:17,083 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:17,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:17,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:17,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:17,084 INFO L87 Difference]: Start difference. First operand 417 states and 719 transitions. Second operand 3 states. [2021-01-06 11:36:17,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:17,111 INFO L93 Difference]: Finished difference Result 997 states and 1729 transitions. [2021-01-06 11:36:17,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:17,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2021-01-06 11:36:17,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:17,115 INFO L225 Difference]: With dead ends: 997 [2021-01-06 11:36:17,115 INFO L226 Difference]: Without dead ends: 587 [2021-01-06 11:36:17,117 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:17,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2021-01-06 11:36:17,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 585. [2021-01-06 11:36:17,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2021-01-06 11:36:17,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 1003 transitions. [2021-01-06 11:36:17,152 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 1003 transitions. Word has length 22 [2021-01-06 11:36:17,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:17,154 INFO L481 AbstractCegarLoop]: Abstraction has 585 states and 1003 transitions. [2021-01-06 11:36:17,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:17,154 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1003 transitions. [2021-01-06 11:36:17,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-06 11:36:17,157 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:17,157 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:17,157 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 11:36:17,158 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:17,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:17,158 INFO L82 PathProgramCache]: Analyzing trace with hash 403724673, now seen corresponding path program 1 times [2021-01-06 11:36:17,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:17,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952481079] [2021-01-06 11:36:17,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:17,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:36:17,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952481079] [2021-01-06 11:36:17,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:17,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:17,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333331658] [2021-01-06 11:36:17,223 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:17,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:17,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:17,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:17,225 INFO L87 Difference]: Start difference. First operand 585 states and 1003 transitions. Second operand 3 states. [2021-01-06 11:36:17,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:17,259 INFO L93 Difference]: Finished difference Result 885 states and 1513 transitions. [2021-01-06 11:36:17,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:17,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2021-01-06 11:36:17,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:17,264 INFO L225 Difference]: With dead ends: 885 [2021-01-06 11:36:17,264 INFO L226 Difference]: Without dead ends: 599 [2021-01-06 11:36:17,265 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:17,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2021-01-06 11:36:17,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 597. [2021-01-06 11:36:17,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2021-01-06 11:36:17,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1011 transitions. [2021-01-06 11:36:17,287 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1011 transitions. Word has length 23 [2021-01-06 11:36:17,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:17,288 INFO L481 AbstractCegarLoop]: Abstraction has 597 states and 1011 transitions. [2021-01-06 11:36:17,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:17,288 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1011 transitions. [2021-01-06 11:36:17,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-06 11:36:17,289 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:17,289 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:17,289 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 11:36:17,290 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:17,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:17,290 INFO L82 PathProgramCache]: Analyzing trace with hash -617343681, now seen corresponding path program 1 times [2021-01-06 11:36:17,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:17,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147487822] [2021-01-06 11:36:17,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:17,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:36:17,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147487822] [2021-01-06 11:36:17,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:17,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:17,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658283973] [2021-01-06 11:36:17,317 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:17,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:17,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:17,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:17,318 INFO L87 Difference]: Start difference. First operand 597 states and 1011 transitions. Second operand 3 states. [2021-01-06 11:36:17,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:17,341 INFO L93 Difference]: Finished difference Result 1097 states and 1885 transitions. [2021-01-06 11:36:17,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:17,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2021-01-06 11:36:17,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:17,347 INFO L225 Difference]: With dead ends: 1097 [2021-01-06 11:36:17,348 INFO L226 Difference]: Without dead ends: 1095 [2021-01-06 11:36:17,348 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:17,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2021-01-06 11:36:17,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 837. [2021-01-06 11:36:17,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2021-01-06 11:36:17,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1387 transitions. [2021-01-06 11:36:17,373 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1387 transitions. Word has length 23 [2021-01-06 11:36:17,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:17,373 INFO L481 AbstractCegarLoop]: Abstraction has 837 states and 1387 transitions. [2021-01-06 11:36:17,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:17,373 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1387 transitions. [2021-01-06 11:36:17,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-06 11:36:17,375 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:17,375 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:17,375 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 11:36:17,375 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:17,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:17,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1897207359, now seen corresponding path program 1 times [2021-01-06 11:36:17,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:17,376 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923485222] [2021-01-06 11:36:17,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:17,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:36:17,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923485222] [2021-01-06 11:36:17,401 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:17,401 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:17,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576362558] [2021-01-06 11:36:17,402 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:17,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:17,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:17,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:17,403 INFO L87 Difference]: Start difference. First operand 837 states and 1387 transitions. Second operand 3 states. [2021-01-06 11:36:17,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:17,433 INFO L93 Difference]: Finished difference Result 1977 states and 3293 transitions. [2021-01-06 11:36:17,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:17,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2021-01-06 11:36:17,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:17,441 INFO L225 Difference]: With dead ends: 1977 [2021-01-06 11:36:17,441 INFO L226 Difference]: Without dead ends: 1159 [2021-01-06 11:36:17,448 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:17,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2021-01-06 11:36:17,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1157. [2021-01-06 11:36:17,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2021-01-06 11:36:17,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1907 transitions. [2021-01-06 11:36:17,499 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1907 transitions. Word has length 23 [2021-01-06 11:36:17,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:17,499 INFO L481 AbstractCegarLoop]: Abstraction has 1157 states and 1907 transitions. [2021-01-06 11:36:17,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:17,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1907 transitions. [2021-01-06 11:36:17,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 11:36:17,501 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:17,502 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:17,502 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 11:36:17,502 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:17,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:17,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1957570863, now seen corresponding path program 1 times [2021-01-06 11:36:17,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:17,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284892926] [2021-01-06 11:36:17,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:17,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:36:17,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284892926] [2021-01-06 11:36:17,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:17,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:17,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306498080] [2021-01-06 11:36:17,530 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:17,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:17,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:17,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:17,531 INFO L87 Difference]: Start difference. First operand 1157 states and 1907 transitions. Second operand 3 states. [2021-01-06 11:36:17,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:17,564 INFO L93 Difference]: Finished difference Result 1737 states and 2853 transitions. [2021-01-06 11:36:17,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:17,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2021-01-06 11:36:17,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:17,571 INFO L225 Difference]: With dead ends: 1737 [2021-01-06 11:36:17,571 INFO L226 Difference]: Without dead ends: 1175 [2021-01-06 11:36:17,574 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:17,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2021-01-06 11:36:17,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1173. [2021-01-06 11:36:17,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1173 states. [2021-01-06 11:36:17,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1907 transitions. [2021-01-06 11:36:17,623 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1907 transitions. Word has length 24 [2021-01-06 11:36:17,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:17,625 INFO L481 AbstractCegarLoop]: Abstraction has 1173 states and 1907 transitions. [2021-01-06 11:36:17,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:17,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1907 transitions. [2021-01-06 11:36:17,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 11:36:17,627 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:17,628 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:17,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 11:36:17,628 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:17,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:17,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1316328079, now seen corresponding path program 1 times [2021-01-06 11:36:17,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:17,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458190133] [2021-01-06 11:36:17,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:17,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:36:17,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458190133] [2021-01-06 11:36:17,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:17,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:17,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259201097] [2021-01-06 11:36:17,666 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:17,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:17,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:17,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:17,667 INFO L87 Difference]: Start difference. First operand 1173 states and 1907 transitions. Second operand 3 states. [2021-01-06 11:36:17,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:17,706 INFO L93 Difference]: Finished difference Result 2121 states and 3509 transitions. [2021-01-06 11:36:17,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:17,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2021-01-06 11:36:17,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:17,718 INFO L225 Difference]: With dead ends: 2121 [2021-01-06 11:36:17,718 INFO L226 Difference]: Without dead ends: 2119 [2021-01-06 11:36:17,721 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:17,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2021-01-06 11:36:17,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 1669. [2021-01-06 11:36:17,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2021-01-06 11:36:17,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2643 transitions. [2021-01-06 11:36:17,786 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2643 transitions. Word has length 24 [2021-01-06 11:36:17,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:17,786 INFO L481 AbstractCegarLoop]: Abstraction has 1669 states and 2643 transitions. [2021-01-06 11:36:17,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:17,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2643 transitions. [2021-01-06 11:36:17,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 11:36:17,790 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:17,790 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:17,791 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 11:36:17,791 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:17,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:17,791 INFO L82 PathProgramCache]: Analyzing trace with hash 36464401, now seen corresponding path program 1 times [2021-01-06 11:36:17,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:17,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434447325] [2021-01-06 11:36:17,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:17,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:36:17,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434447325] [2021-01-06 11:36:17,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:17,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:17,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427372579] [2021-01-06 11:36:17,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:17,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:17,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:17,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:17,834 INFO L87 Difference]: Start difference. First operand 1669 states and 2643 transitions. Second operand 3 states. [2021-01-06 11:36:17,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:17,881 INFO L93 Difference]: Finished difference Result 3913 states and 6229 transitions. [2021-01-06 11:36:17,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:17,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2021-01-06 11:36:17,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:17,894 INFO L225 Difference]: With dead ends: 3913 [2021-01-06 11:36:17,895 INFO L226 Difference]: Without dead ends: 2279 [2021-01-06 11:36:17,898 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:17,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2021-01-06 11:36:17,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 2277. [2021-01-06 11:36:17,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2277 states. [2021-01-06 11:36:17,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 3587 transitions. [2021-01-06 11:36:17,962 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 3587 transitions. Word has length 24 [2021-01-06 11:36:17,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:17,962 INFO L481 AbstractCegarLoop]: Abstraction has 2277 states and 3587 transitions. [2021-01-06 11:36:17,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:17,962 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 3587 transitions. [2021-01-06 11:36:17,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-06 11:36:17,965 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:17,965 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:17,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 11:36:17,966 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:17,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:17,966 INFO L82 PathProgramCache]: Analyzing trace with hash -2143288106, now seen corresponding path program 1 times [2021-01-06 11:36:17,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:17,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106149758] [2021-01-06 11:36:17,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:17,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:36:17,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106149758] [2021-01-06 11:36:17,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:17,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:17,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442293706] [2021-01-06 11:36:17,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:17,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:17,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:17,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:17,991 INFO L87 Difference]: Start difference. First operand 2277 states and 3587 transitions. Second operand 3 states. [2021-01-06 11:36:18,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:18,044 INFO L93 Difference]: Finished difference Result 3417 states and 5365 transitions. [2021-01-06 11:36:18,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:18,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2021-01-06 11:36:18,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:18,056 INFO L225 Difference]: With dead ends: 3417 [2021-01-06 11:36:18,057 INFO L226 Difference]: Without dead ends: 2311 [2021-01-06 11:36:18,059 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:18,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2021-01-06 11:36:18,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2309. [2021-01-06 11:36:18,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2309 states. [2021-01-06 11:36:18,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 3587 transitions. [2021-01-06 11:36:18,127 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 3587 transitions. Word has length 25 [2021-01-06 11:36:18,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:18,127 INFO L481 AbstractCegarLoop]: Abstraction has 2309 states and 3587 transitions. [2021-01-06 11:36:18,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:18,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 3587 transitions. [2021-01-06 11:36:18,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-06 11:36:18,133 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:18,134 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:18,134 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 11:36:18,134 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:18,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:18,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1130610836, now seen corresponding path program 1 times [2021-01-06 11:36:18,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:18,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102095535] [2021-01-06 11:36:18,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:18,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:36:18,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102095535] [2021-01-06 11:36:18,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:18,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:18,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432039828] [2021-01-06 11:36:18,158 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:18,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:18,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:18,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:18,159 INFO L87 Difference]: Start difference. First operand 2309 states and 3587 transitions. Second operand 3 states. [2021-01-06 11:36:18,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:18,215 INFO L93 Difference]: Finished difference Result 4105 states and 6501 transitions. [2021-01-06 11:36:18,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:18,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2021-01-06 11:36:18,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:18,236 INFO L225 Difference]: With dead ends: 4105 [2021-01-06 11:36:18,237 INFO L226 Difference]: Without dead ends: 4103 [2021-01-06 11:36:18,239 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:18,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4103 states. [2021-01-06 11:36:18,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4103 to 3333. [2021-01-06 11:36:18,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3333 states. [2021-01-06 11:36:18,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 5027 transitions. [2021-01-06 11:36:18,362 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 5027 transitions. Word has length 25 [2021-01-06 11:36:18,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:18,362 INFO L481 AbstractCegarLoop]: Abstraction has 3333 states and 5027 transitions. [2021-01-06 11:36:18,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:18,363 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 5027 transitions. [2021-01-06 11:36:18,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-06 11:36:18,368 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:18,368 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:18,368 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 11:36:18,368 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:18,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:18,369 INFO L82 PathProgramCache]: Analyzing trace with hash -149252842, now seen corresponding path program 1 times [2021-01-06 11:36:18,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:18,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167249683] [2021-01-06 11:36:18,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:18,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:36:18,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167249683] [2021-01-06 11:36:18,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:18,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:18,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790045703] [2021-01-06 11:36:18,432 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:18,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:18,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:18,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:18,433 INFO L87 Difference]: Start difference. First operand 3333 states and 5027 transitions. Second operand 3 states. [2021-01-06 11:36:18,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:18,537 INFO L93 Difference]: Finished difference Result 7753 states and 11749 transitions. [2021-01-06 11:36:18,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:18,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2021-01-06 11:36:18,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:18,559 INFO L225 Difference]: With dead ends: 7753 [2021-01-06 11:36:18,560 INFO L226 Difference]: Without dead ends: 4487 [2021-01-06 11:36:18,564 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:18,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4487 states. [2021-01-06 11:36:18,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4487 to 4485. [2021-01-06 11:36:18,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4485 states. [2021-01-06 11:36:18,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4485 states to 4485 states and 6723 transitions. [2021-01-06 11:36:18,692 INFO L78 Accepts]: Start accepts. Automaton has 4485 states and 6723 transitions. Word has length 25 [2021-01-06 11:36:18,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:18,692 INFO L481 AbstractCegarLoop]: Abstraction has 4485 states and 6723 transitions. [2021-01-06 11:36:18,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:18,692 INFO L276 IsEmpty]: Start isEmpty. Operand 4485 states and 6723 transitions. [2021-01-06 11:36:18,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-06 11:36:18,697 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:18,697 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:18,698 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 11:36:18,698 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:18,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:18,698 INFO L82 PathProgramCache]: Analyzing trace with hash 689412294, now seen corresponding path program 1 times [2021-01-06 11:36:18,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:18,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478478472] [2021-01-06 11:36:18,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:18,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:36:18,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478478472] [2021-01-06 11:36:18,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:18,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:18,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133692187] [2021-01-06 11:36:18,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:18,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:18,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:18,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:18,727 INFO L87 Difference]: Start difference. First operand 4485 states and 6723 transitions. Second operand 3 states. [2021-01-06 11:36:18,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:18,796 INFO L93 Difference]: Finished difference Result 6729 states and 10053 transitions. [2021-01-06 11:36:18,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:18,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2021-01-06 11:36:18,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:18,832 INFO L225 Difference]: With dead ends: 6729 [2021-01-06 11:36:18,832 INFO L226 Difference]: Without dead ends: 4551 [2021-01-06 11:36:18,836 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:18,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4551 states. [2021-01-06 11:36:18,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4551 to 4549. [2021-01-06 11:36:18,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4549 states. [2021-01-06 11:36:18,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4549 states to 4549 states and 6723 transitions. [2021-01-06 11:36:18,991 INFO L78 Accepts]: Start accepts. Automaton has 4549 states and 6723 transitions. Word has length 26 [2021-01-06 11:36:18,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:18,991 INFO L481 AbstractCegarLoop]: Abstraction has 4549 states and 6723 transitions. [2021-01-06 11:36:18,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:18,991 INFO L276 IsEmpty]: Start isEmpty. Operand 4549 states and 6723 transitions. [2021-01-06 11:36:18,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-06 11:36:18,996 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:18,997 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:18,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 11:36:18,997 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:18,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:18,998 INFO L82 PathProgramCache]: Analyzing trace with hash -331656060, now seen corresponding path program 1 times [2021-01-06 11:36:18,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:18,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816567614] [2021-01-06 11:36:18,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:19,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:36:19,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816567614] [2021-01-06 11:36:19,019 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:19,019 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:19,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354969505] [2021-01-06 11:36:19,020 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:19,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:19,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:19,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:19,023 INFO L87 Difference]: Start difference. First operand 4549 states and 6723 transitions. Second operand 3 states. [2021-01-06 11:36:19,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:19,115 INFO L93 Difference]: Finished difference Result 7945 states and 11973 transitions. [2021-01-06 11:36:19,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:19,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2021-01-06 11:36:19,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:19,135 INFO L225 Difference]: With dead ends: 7945 [2021-01-06 11:36:19,135 INFO L226 Difference]: Without dead ends: 7943 [2021-01-06 11:36:19,139 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:19,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7943 states. [2021-01-06 11:36:19,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7943 to 6661. [2021-01-06 11:36:19,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6661 states. [2021-01-06 11:36:19,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 9539 transitions. [2021-01-06 11:36:19,351 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 9539 transitions. Word has length 26 [2021-01-06 11:36:19,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:19,351 INFO L481 AbstractCegarLoop]: Abstraction has 6661 states and 9539 transitions. [2021-01-06 11:36:19,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:19,352 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 9539 transitions. [2021-01-06 11:36:19,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-06 11:36:19,363 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:19,363 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:19,363 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 11:36:19,363 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:19,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:19,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1611519738, now seen corresponding path program 1 times [2021-01-06 11:36:19,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:19,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817931090] [2021-01-06 11:36:19,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:19,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:36:19,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817931090] [2021-01-06 11:36:19,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:19,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:19,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708881463] [2021-01-06 11:36:19,412 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:19,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:19,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:19,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:19,413 INFO L87 Difference]: Start difference. First operand 6661 states and 9539 transitions. Second operand 3 states. [2021-01-06 11:36:19,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:19,547 INFO L93 Difference]: Finished difference Result 15369 states and 22085 transitions. [2021-01-06 11:36:19,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:19,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2021-01-06 11:36:19,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:19,568 INFO L225 Difference]: With dead ends: 15369 [2021-01-06 11:36:19,568 INFO L226 Difference]: Without dead ends: 8839 [2021-01-06 11:36:19,581 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:19,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8839 states. [2021-01-06 11:36:19,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8839 to 8837. [2021-01-06 11:36:19,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8837 states. [2021-01-06 11:36:19,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8837 states to 8837 states and 12547 transitions. [2021-01-06 11:36:19,847 INFO L78 Accepts]: Start accepts. Automaton has 8837 states and 12547 transitions. Word has length 26 [2021-01-06 11:36:19,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:19,847 INFO L481 AbstractCegarLoop]: Abstraction has 8837 states and 12547 transitions. [2021-01-06 11:36:19,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:19,848 INFO L276 IsEmpty]: Start isEmpty. Operand 8837 states and 12547 transitions. [2021-01-06 11:36:19,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 11:36:19,857 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:19,858 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:19,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 11:36:19,858 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:19,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:19,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1691188181, now seen corresponding path program 1 times [2021-01-06 11:36:19,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:19,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477770345] [2021-01-06 11:36:19,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:19,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:36:19,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477770345] [2021-01-06 11:36:19,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:19,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:19,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125692136] [2021-01-06 11:36:19,909 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:19,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:19,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:19,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:19,910 INFO L87 Difference]: Start difference. First operand 8837 states and 12547 transitions. Second operand 3 states. [2021-01-06 11:36:20,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:20,025 INFO L93 Difference]: Finished difference Result 13257 states and 18757 transitions. [2021-01-06 11:36:20,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:20,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2021-01-06 11:36:20,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:20,044 INFO L225 Difference]: With dead ends: 13257 [2021-01-06 11:36:20,044 INFO L226 Difference]: Without dead ends: 8967 [2021-01-06 11:36:20,051 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:20,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8967 states. [2021-01-06 11:36:20,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8967 to 8965. [2021-01-06 11:36:20,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8965 states. [2021-01-06 11:36:20,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8965 states to 8965 states and 12547 transitions. [2021-01-06 11:36:20,319 INFO L78 Accepts]: Start accepts. Automaton has 8965 states and 12547 transitions. Word has length 27 [2021-01-06 11:36:20,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:20,319 INFO L481 AbstractCegarLoop]: Abstraction has 8965 states and 12547 transitions. [2021-01-06 11:36:20,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:20,319 INFO L276 IsEmpty]: Start isEmpty. Operand 8965 states and 12547 transitions. [2021-01-06 11:36:20,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 11:36:20,329 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:20,330 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:20,330 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 11:36:20,330 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:20,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:20,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1582710761, now seen corresponding path program 1 times [2021-01-06 11:36:20,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:20,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673065220] [2021-01-06 11:36:20,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:20,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:36:20,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673065220] [2021-01-06 11:36:20,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:20,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:20,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886966923] [2021-01-06 11:36:20,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:20,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:20,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:20,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:20,357 INFO L87 Difference]: Start difference. First operand 8965 states and 12547 transitions. Second operand 3 states. [2021-01-06 11:36:20,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:20,610 INFO L93 Difference]: Finished difference Result 15369 states and 21893 transitions. [2021-01-06 11:36:20,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:20,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2021-01-06 11:36:20,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:20,640 INFO L225 Difference]: With dead ends: 15369 [2021-01-06 11:36:20,640 INFO L226 Difference]: Without dead ends: 15367 [2021-01-06 11:36:20,644 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:20,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15367 states. [2021-01-06 11:36:20,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15367 to 13317. [2021-01-06 11:36:20,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13317 states. [2021-01-06 11:36:21,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13317 states to 13317 states and 18051 transitions. [2021-01-06 11:36:21,016 INFO L78 Accepts]: Start accepts. Automaton has 13317 states and 18051 transitions. Word has length 27 [2021-01-06 11:36:21,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:21,016 INFO L481 AbstractCegarLoop]: Abstraction has 13317 states and 18051 transitions. [2021-01-06 11:36:21,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:21,017 INFO L276 IsEmpty]: Start isEmpty. Operand 13317 states and 18051 transitions. [2021-01-06 11:36:21,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 11:36:21,040 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:21,040 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:21,040 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 11:36:21,040 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:21,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:21,041 INFO L82 PathProgramCache]: Analyzing trace with hash 302847083, now seen corresponding path program 1 times [2021-01-06 11:36:21,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:21,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507154784] [2021-01-06 11:36:21,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:21,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:36:21,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507154784] [2021-01-06 11:36:21,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:21,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:21,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510321796] [2021-01-06 11:36:21,072 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:21,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:21,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:21,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:21,074 INFO L87 Difference]: Start difference. First operand 13317 states and 18051 transitions. Second operand 3 states. [2021-01-06 11:36:21,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:21,446 INFO L93 Difference]: Finished difference Result 30473 states and 41349 transitions. [2021-01-06 11:36:21,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:21,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2021-01-06 11:36:21,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:21,487 INFO L225 Difference]: With dead ends: 30473 [2021-01-06 11:36:21,487 INFO L226 Difference]: Without dead ends: 17415 [2021-01-06 11:36:21,501 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:21,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17415 states. [2021-01-06 11:36:21,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17415 to 17413. [2021-01-06 11:36:21,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17413 states. [2021-01-06 11:36:21,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17413 states to 17413 states and 23299 transitions. [2021-01-06 11:36:21,962 INFO L78 Accepts]: Start accepts. Automaton has 17413 states and 23299 transitions. Word has length 27 [2021-01-06 11:36:21,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:21,963 INFO L481 AbstractCegarLoop]: Abstraction has 17413 states and 23299 transitions. [2021-01-06 11:36:21,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:21,963 INFO L276 IsEmpty]: Start isEmpty. Operand 17413 states and 23299 transitions. [2021-01-06 11:36:21,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-06 11:36:21,982 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:21,982 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:21,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 11:36:21,982 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:21,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:21,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1819608763, now seen corresponding path program 1 times [2021-01-06 11:36:21,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:21,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909444839] [2021-01-06 11:36:21,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:22,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:36:22,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909444839] [2021-01-06 11:36:22,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:22,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:22,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399013420] [2021-01-06 11:36:22,007 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:22,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:22,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:22,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:22,008 INFO L87 Difference]: Start difference. First operand 17413 states and 23299 transitions. Second operand 3 states. [2021-01-06 11:36:22,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:22,296 INFO L93 Difference]: Finished difference Result 26121 states and 34821 transitions. [2021-01-06 11:36:22,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:22,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2021-01-06 11:36:22,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:22,335 INFO L225 Difference]: With dead ends: 26121 [2021-01-06 11:36:22,336 INFO L226 Difference]: Without dead ends: 17671 [2021-01-06 11:36:22,344 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:22,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17671 states. [2021-01-06 11:36:22,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17671 to 17669. [2021-01-06 11:36:22,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17669 states. [2021-01-06 11:36:22,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17669 states to 17669 states and 23299 transitions. [2021-01-06 11:36:22,830 INFO L78 Accepts]: Start accepts. Automaton has 17669 states and 23299 transitions. Word has length 28 [2021-01-06 11:36:22,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:22,831 INFO L481 AbstractCegarLoop]: Abstraction has 17669 states and 23299 transitions. [2021-01-06 11:36:22,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:22,831 INFO L276 IsEmpty]: Start isEmpty. Operand 17669 states and 23299 transitions. [2021-01-06 11:36:22,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-06 11:36:22,854 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:22,854 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:22,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 11:36:22,854 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:22,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:22,855 INFO L82 PathProgramCache]: Analyzing trace with hash 798540409, now seen corresponding path program 1 times [2021-01-06 11:36:22,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:22,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089110306] [2021-01-06 11:36:22,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:22,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:36:22,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089110306] [2021-01-06 11:36:22,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:22,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:22,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791936540] [2021-01-06 11:36:22,878 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:22,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:22,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:22,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:22,879 INFO L87 Difference]: Start difference. First operand 17669 states and 23299 transitions. Second operand 3 states. [2021-01-06 11:36:23,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:23,362 INFO L93 Difference]: Finished difference Result 29705 states and 39685 transitions. [2021-01-06 11:36:23,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:23,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2021-01-06 11:36:23,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:23,451 INFO L225 Difference]: With dead ends: 29705 [2021-01-06 11:36:23,451 INFO L226 Difference]: Without dead ends: 29703 [2021-01-06 11:36:23,456 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:23,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29703 states. [2021-01-06 11:36:24,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29703 to 26629. [2021-01-06 11:36:24,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26629 states. [2021-01-06 11:36:24,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26629 states to 26629 states and 34051 transitions. [2021-01-06 11:36:24,146 INFO L78 Accepts]: Start accepts. Automaton has 26629 states and 34051 transitions. Word has length 28 [2021-01-06 11:36:24,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:24,146 INFO L481 AbstractCegarLoop]: Abstraction has 26629 states and 34051 transitions. [2021-01-06 11:36:24,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:24,146 INFO L276 IsEmpty]: Start isEmpty. Operand 26629 states and 34051 transitions. [2021-01-06 11:36:24,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-06 11:36:24,181 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:24,182 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:24,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 11:36:24,182 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:24,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:24,182 INFO L82 PathProgramCache]: Analyzing trace with hash -481323269, now seen corresponding path program 1 times [2021-01-06 11:36:24,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:24,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035679326] [2021-01-06 11:36:24,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:24,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:36:24,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035679326] [2021-01-06 11:36:24,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:24,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:24,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246899377] [2021-01-06 11:36:24,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:24,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:24,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:24,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:24,209 INFO L87 Difference]: Start difference. First operand 26629 states and 34051 transitions. Second operand 3 states. [2021-01-06 11:36:24,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:24,790 INFO L93 Difference]: Finished difference Result 60425 states and 77061 transitions. [2021-01-06 11:36:24,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:24,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2021-01-06 11:36:24,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:24,871 INFO L225 Difference]: With dead ends: 60425 [2021-01-06 11:36:24,871 INFO L226 Difference]: Without dead ends: 34311 [2021-01-06 11:36:25,041 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:25,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34311 states. [2021-01-06 11:36:26,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34311 to 34309. [2021-01-06 11:36:26,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34309 states. [2021-01-06 11:36:26,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34309 states to 34309 states and 43011 transitions. [2021-01-06 11:36:26,153 INFO L78 Accepts]: Start accepts. Automaton has 34309 states and 43011 transitions. Word has length 28 [2021-01-06 11:36:26,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:26,153 INFO L481 AbstractCegarLoop]: Abstraction has 34309 states and 43011 transitions. [2021-01-06 11:36:26,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:26,154 INFO L276 IsEmpty]: Start isEmpty. Operand 34309 states and 43011 transitions. [2021-01-06 11:36:26,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-01-06 11:36:26,179 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:26,179 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:26,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 11:36:26,179 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:26,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:26,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1014835328, now seen corresponding path program 1 times [2021-01-06 11:36:26,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:26,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038022551] [2021-01-06 11:36:26,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:26,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:26,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:36:26,203 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038022551] [2021-01-06 11:36:26,203 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:26,203 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:26,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923421191] [2021-01-06 11:36:26,204 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:26,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:26,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:26,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:26,205 INFO L87 Difference]: Start difference. First operand 34309 states and 43011 transitions. Second operand 3 states. [2021-01-06 11:36:26,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:26,654 INFO L93 Difference]: Finished difference Result 51465 states and 64261 transitions. [2021-01-06 11:36:26,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:26,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2021-01-06 11:36:26,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:26,726 INFO L225 Difference]: With dead ends: 51465 [2021-01-06 11:36:26,726 INFO L226 Difference]: Without dead ends: 34823 [2021-01-06 11:36:26,746 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:26,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34823 states. [2021-01-06 11:36:27,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34823 to 34821. [2021-01-06 11:36:27,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34821 states. [2021-01-06 11:36:27,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34821 states to 34821 states and 43011 transitions. [2021-01-06 11:36:27,718 INFO L78 Accepts]: Start accepts. Automaton has 34821 states and 43011 transitions. Word has length 29 [2021-01-06 11:36:27,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:27,718 INFO L481 AbstractCegarLoop]: Abstraction has 34821 states and 43011 transitions. [2021-01-06 11:36:27,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:27,718 INFO L276 IsEmpty]: Start isEmpty. Operand 34821 states and 43011 transitions. [2021-01-06 11:36:27,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-01-06 11:36:27,741 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:27,741 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:27,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 11:36:27,742 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:27,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:27,742 INFO L82 PathProgramCache]: Analyzing trace with hash -2035903682, now seen corresponding path program 1 times [2021-01-06 11:36:27,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:27,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757504688] [2021-01-06 11:36:27,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:27,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:36:27,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757504688] [2021-01-06 11:36:27,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:27,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:27,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439022171] [2021-01-06 11:36:27,762 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:27,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:27,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:27,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:27,762 INFO L87 Difference]: Start difference. First operand 34821 states and 43011 transitions. Second operand 3 states. [2021-01-06 11:36:28,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:28,547 INFO L93 Difference]: Finished difference Result 101385 states and 122885 transitions. [2021-01-06 11:36:28,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:28,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2021-01-06 11:36:28,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:28,641 INFO L225 Difference]: With dead ends: 101385 [2021-01-06 11:36:28,641 INFO L226 Difference]: Without dead ends: 67591 [2021-01-06 11:36:28,682 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:28,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67591 states. [2021-01-06 11:36:30,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67591 to 67589. [2021-01-06 11:36:30,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67589 states. [2021-01-06 11:36:30,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67589 states to 67589 states and 79875 transitions. [2021-01-06 11:36:30,137 INFO L78 Accepts]: Start accepts. Automaton has 67589 states and 79875 transitions. Word has length 29 [2021-01-06 11:36:30,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:30,138 INFO L481 AbstractCegarLoop]: Abstraction has 67589 states and 79875 transitions. [2021-01-06 11:36:30,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:30,138 INFO L276 IsEmpty]: Start isEmpty. Operand 67589 states and 79875 transitions. [2021-01-06 11:36:30,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-01-06 11:36:30,188 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:30,188 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:30,188 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 11:36:30,189 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:30,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:30,190 INFO L82 PathProgramCache]: Analyzing trace with hash -756040004, now seen corresponding path program 1 times [2021-01-06 11:36:30,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:30,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427691768] [2021-01-06 11:36:30,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:30,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:36:30,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427691768] [2021-01-06 11:36:30,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:30,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:30,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715774821] [2021-01-06 11:36:30,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:30,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:30,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:30,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:30,219 INFO L87 Difference]: Start difference. First operand 67589 states and 79875 transitions. Second operand 3 states. [2021-01-06 11:36:31,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:31,232 INFO L93 Difference]: Finished difference Result 71689 states and 86021 transitions. [2021-01-06 11:36:31,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:31,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2021-01-06 11:36:31,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:31,309 INFO L225 Difference]: With dead ends: 71689 [2021-01-06 11:36:31,309 INFO L226 Difference]: Without dead ends: 71687 [2021-01-06 11:36:31,325 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:31,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71687 states. [2021-01-06 11:36:32,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71687 to 67589. [2021-01-06 11:36:32,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67589 states. [2021-01-06 11:36:32,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67589 states to 67589 states and 78851 transitions. [2021-01-06 11:36:32,899 INFO L78 Accepts]: Start accepts. Automaton has 67589 states and 78851 transitions. Word has length 29 [2021-01-06 11:36:32,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:32,899 INFO L481 AbstractCegarLoop]: Abstraction has 67589 states and 78851 transitions. [2021-01-06 11:36:32,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:32,900 INFO L276 IsEmpty]: Start isEmpty. Operand 67589 states and 78851 transitions. [2021-01-06 11:36:32,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-06 11:36:32,995 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:32,995 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:32,996 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 11:36:32,996 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:32,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:32,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1311711408, now seen corresponding path program 1 times [2021-01-06 11:36:32,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:32,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909342126] [2021-01-06 11:36:32,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:33,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:36:33,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909342126] [2021-01-06 11:36:33,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:33,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:33,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850736983] [2021-01-06 11:36:33,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:33,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:33,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:33,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:33,016 INFO L87 Difference]: Start difference. First operand 67589 states and 78851 transitions. Second operand 3 states. [2021-01-06 11:36:34,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:34,106 INFO L93 Difference]: Finished difference Result 109575 states and 126980 transitions. [2021-01-06 11:36:34,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:34,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2021-01-06 11:36:34,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:34,233 INFO L225 Difference]: With dead ends: 109575 [2021-01-06 11:36:34,234 INFO L226 Difference]: Without dead ends: 109573 [2021-01-06 11:36:34,257 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:34,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109573 states. [2021-01-06 11:36:35,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109573 to 105477. [2021-01-06 11:36:35,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105477 states. [2021-01-06 11:36:36,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105477 states to 105477 states and 120835 transitions. [2021-01-06 11:36:36,037 INFO L78 Accepts]: Start accepts. Automaton has 105477 states and 120835 transitions. Word has length 30 [2021-01-06 11:36:36,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:36,037 INFO L481 AbstractCegarLoop]: Abstraction has 105477 states and 120835 transitions. [2021-01-06 11:36:36,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:36,037 INFO L276 IsEmpty]: Start isEmpty. Operand 105477 states and 120835 transitions. [2021-01-06 11:36:36,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-06 11:36:36,165 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:36:36,166 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:36:36,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 11:36:36,166 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:36:36,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:36:36,167 INFO L82 PathProgramCache]: Analyzing trace with hash 31847730, now seen corresponding path program 1 times [2021-01-06 11:36:36,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:36:36,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940969420] [2021-01-06 11:36:36,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:36:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:36:36,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:36:36,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940969420] [2021-01-06 11:36:36,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:36:36,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:36:36,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976317436] [2021-01-06 11:36:36,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:36:36,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:36:36,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:36:36,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:36,190 INFO L87 Difference]: Start difference. First operand 105477 states and 120835 transitions. Second operand 3 states. [2021-01-06 11:36:37,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:36:37,904 INFO L93 Difference]: Finished difference Result 236549 states and 268291 transitions. [2021-01-06 11:36:37,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:36:37,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2021-01-06 11:36:37,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:36:37,905 INFO L225 Difference]: With dead ends: 236549 [2021-01-06 11:36:37,905 INFO L226 Difference]: Without dead ends: 0 [2021-01-06 11:36:37,988 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:36:37,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-06 11:36:37,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-06 11:36:37,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-06 11:36:37,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-06 11:36:37,990 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2021-01-06 11:36:37,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:36:37,990 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-06 11:36:37,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:36:37,991 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-06 11:36:37,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-06 11:36:37,991 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 11:36:37,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-01-06 11:36:38,030 INFO L189 CegarLoopUtils]: For program point L184(line 184) no Hoare annotation was computed. [2021-01-06 11:36:38,031 INFO L185 CegarLoopUtils]: At program point L184-1(lines 7 193) the Hoare annotation is: false [2021-01-06 11:36:38,031 INFO L189 CegarLoopUtils]: For program point L118-1(lines 47 188) no Hoare annotation was computed. [2021-01-06 11:36:38,034 INFO L189 CegarLoopUtils]: For program point L168-1(lines 47 188) no Hoare annotation was computed. [2021-01-06 11:36:38,034 INFO L189 CegarLoopUtils]: For program point L102-1(lines 47 188) no Hoare annotation was computed. [2021-01-06 11:36:38,034 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-01-06 11:36:38,034 INFO L189 CegarLoopUtils]: For program point L86-1(lines 47 188) no Hoare annotation was computed. [2021-01-06 11:36:38,034 INFO L189 CegarLoopUtils]: For program point L169(line 169) no Hoare annotation was computed. [2021-01-06 11:36:38,035 INFO L189 CegarLoopUtils]: For program point L153-1(lines 47 188) no Hoare annotation was computed. [2021-01-06 11:36:38,035 INFO L189 CegarLoopUtils]: For program point L154(line 154) no Hoare annotation was computed. [2021-01-06 11:36:38,035 INFO L189 CegarLoopUtils]: For program point L138-1(lines 47 188) no Hoare annotation was computed. [2021-01-06 11:36:38,035 INFO L189 CegarLoopUtils]: For program point L122-1(lines 47 188) no Hoare annotation was computed. [2021-01-06 11:36:38,035 INFO L189 CegarLoopUtils]: For program point L139(line 139) no Hoare annotation was computed. [2021-01-06 11:36:38,035 INFO L189 CegarLoopUtils]: For program point L106-1(lines 47 188) no Hoare annotation was computed. [2021-01-06 11:36:38,035 INFO L192 CegarLoopUtils]: At program point L189(lines 7 193) the Hoare annotation is: true [2021-01-06 11:36:38,035 INFO L189 CegarLoopUtils]: For program point L90-1(lines 47 188) no Hoare annotation was computed. [2021-01-06 11:36:38,035 INFO L189 CegarLoopUtils]: For program point L173-1(lines 47 188) no Hoare annotation was computed. [2021-01-06 11:36:38,035 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-01-06 11:36:38,036 INFO L189 CegarLoopUtils]: For program point L174(line 174) no Hoare annotation was computed. [2021-01-06 11:36:38,036 INFO L189 CegarLoopUtils]: For program point L158-1(lines 47 188) no Hoare annotation was computed. [2021-01-06 11:36:38,036 INFO L192 CegarLoopUtils]: At program point L192(lines 6 193) the Hoare annotation is: true [2021-01-06 11:36:38,036 INFO L189 CegarLoopUtils]: For program point L159(line 159) no Hoare annotation was computed. [2021-01-06 11:36:38,036 INFO L189 CegarLoopUtils]: For program point L143-1(lines 47 188) no Hoare annotation was computed. [2021-01-06 11:36:38,036 INFO L189 CegarLoopUtils]: For program point L110-1(lines 47 188) no Hoare annotation was computed. [2021-01-06 11:36:38,036 INFO L189 CegarLoopUtils]: For program point L94-1(lines 47 188) no Hoare annotation was computed. [2021-01-06 11:36:38,036 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-01-06 11:36:38,036 INFO L189 CegarLoopUtils]: For program point L144(line 144) no Hoare annotation was computed. [2021-01-06 11:36:38,036 INFO L189 CegarLoopUtils]: For program point L78(lines 78 80) no Hoare annotation was computed. [2021-01-06 11:36:38,037 INFO L189 CegarLoopUtils]: For program point L78-2(lines 47 188) no Hoare annotation was computed. [2021-01-06 11:36:38,039 INFO L189 CegarLoopUtils]: For program point L128-1(lines 47 188) no Hoare annotation was computed. [2021-01-06 11:36:38,039 INFO L189 CegarLoopUtils]: For program point L178-1(lines 47 188) no Hoare annotation was computed. [2021-01-06 11:36:38,039 INFO L189 CegarLoopUtils]: For program point L129(line 129) no Hoare annotation was computed. [2021-01-06 11:36:38,039 INFO L189 CegarLoopUtils]: For program point L179(line 179) no Hoare annotation was computed. [2021-01-06 11:36:38,039 INFO L189 CegarLoopUtils]: For program point L163-1(lines 47 188) no Hoare annotation was computed. [2021-01-06 11:36:38,039 INFO L189 CegarLoopUtils]: For program point L114-1(lines 47 188) no Hoare annotation was computed. [2021-01-06 11:36:38,040 INFO L189 CegarLoopUtils]: For program point L164(line 164) no Hoare annotation was computed. [2021-01-06 11:36:38,040 INFO L189 CegarLoopUtils]: For program point L98-1(lines 47 188) no Hoare annotation was computed. [2021-01-06 11:36:38,040 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2021-01-06 11:36:38,040 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 191) no Hoare annotation was computed. [2021-01-06 11:36:38,040 INFO L189 CegarLoopUtils]: For program point L148-1(lines 47 188) no Hoare annotation was computed. [2021-01-06 11:36:38,040 INFO L189 CegarLoopUtils]: For program point L49(lines 49 51) no Hoare annotation was computed. [2021-01-06 11:36:38,040 INFO L189 CegarLoopUtils]: For program point L82-1(lines 47 188) no Hoare annotation was computed. [2021-01-06 11:36:38,040 INFO L189 CegarLoopUtils]: For program point L149(line 149) no Hoare annotation was computed. [2021-01-06 11:36:38,040 INFO L189 CegarLoopUtils]: For program point L133-1(lines 47 188) no Hoare annotation was computed. [2021-01-06 11:36:38,041 INFO L192 CegarLoopUtils]: At program point L183-1(lines 47 188) the Hoare annotation is: true [2021-01-06 11:36:38,041 INFO L189 CegarLoopUtils]: For program point L134(line 134) no Hoare annotation was computed. [2021-01-06 11:36:38,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:36:38 BoogieIcfgContainer [2021-01-06 11:36:38,070 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 11:36:38,070 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 11:36:38,070 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 11:36:38,071 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 11:36:38,074 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:36:15" (3/4) ... [2021-01-06 11:36:38,078 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-06 11:36:38,111 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-01-06 11:36:38,114 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-01-06 11:36:38,115 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 11:36:38,115 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 11:36:38,223 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/locks/test_locks_12.c-witness.graphml [2021-01-06 11:36:38,224 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 11:36:38,229 INFO L168 Benchmark]: Toolchain (without parser) took 23872.36 ms. Allocated memory was 154.1 MB in the beginning and 6.9 GB in the end (delta: 6.8 GB). Free memory was 130.6 MB in the beginning and 5.4 GB in the end (delta: -5.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 8.0 GB. [2021-01-06 11:36:38,229 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 154.1 MB. Free memory is still 126.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:36:38,230 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.93 ms. Allocated memory is still 154.1 MB. Free memory was 130.4 MB in the beginning and 119.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2021-01-06 11:36:38,230 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.43 ms. Allocated memory is still 154.1 MB. Free memory was 119.6 MB in the beginning and 117.9 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:36:38,230 INFO L168 Benchmark]: Boogie Preprocessor took 29.17 ms. Allocated memory is still 154.1 MB. Free memory was 117.9 MB in the beginning and 116.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 11:36:38,231 INFO L168 Benchmark]: RCFGBuilder took 592.87 ms. Allocated memory is still 154.1 MB. Free memory was 116.4 MB in the beginning and 127.6 MB in the end (delta: -11.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 8.0 GB. [2021-01-06 11:36:38,234 INFO L168 Benchmark]: TraceAbstraction took 22738.61 ms. Allocated memory was 154.1 MB in the beginning and 6.9 GB in the end (delta: 6.8 GB). Free memory was 127.0 MB in the beginning and 5.4 GB in the end (delta: -5.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 8.0 GB. [2021-01-06 11:36:38,234 INFO L168 Benchmark]: Witness Printer took 153.47 ms. Allocated memory is still 6.9 GB. Free memory was 5.4 GB in the beginning and 5.4 GB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2021-01-06 11:36:38,240 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 154.1 MB. Free memory is still 126.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 287.93 ms. Allocated memory is still 154.1 MB. Free memory was 130.4 MB in the beginning and 119.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 61.43 ms. Allocated memory is still 154.1 MB. Free memory was 119.6 MB in the beginning and 117.9 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 8.0 GB. * Boogie Preprocessor took 29.17 ms. Allocated memory is still 154.1 MB. Free memory was 117.9 MB in the beginning and 116.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 592.87 ms. Allocated memory is still 154.1 MB. Free memory was 116.4 MB in the beginning and 127.6 MB in the end (delta: -11.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 22738.61 ms. Allocated memory was 154.1 MB in the beginning and 6.9 GB in the end (delta: 6.8 GB). Free memory was 127.0 MB in the beginning and 5.4 GB in the end (delta: -5.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 8.0 GB. * Witness Printer took 153.47 ms. Allocated memory is still 6.9 GB. Free memory was 5.4 GB in the beginning and 5.4 GB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 191]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 22.5s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3231 SDtfs, 1629 SDslu, 2174 SDs, 0 SdLazy, 175 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105477occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.6s AutomataMinimizationTime, 33 MinimizatonAttempts, 16418 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 4105 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 811 NumberOfCodeBlocks, 811 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 778 ConstructedInterpolants, 0 QuantifiedInterpolants, 40508 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...