/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/loop-invgen/heapsort.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-4f750a8 [2020-12-22 04:30:15,926 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-22 04:30:15,929 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-22 04:30:15,962 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-22 04:30:15,963 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-22 04:30:15,976 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-22 04:30:15,978 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-22 04:30:15,984 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-22 04:30:15,990 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-22 04:30:15,991 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-22 04:30:15,993 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-22 04:30:15,994 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-22 04:30:15,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-22 04:30:15,997 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-22 04:30:16,000 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-22 04:30:16,002 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-22 04:30:16,003 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-22 04:30:16,003 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-22 04:30:16,010 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-22 04:30:16,017 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-22 04:30:16,020 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-22 04:30:16,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-22 04:30:16,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-22 04:30:16,024 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-22 04:30:16,034 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-22 04:30:16,035 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-22 04:30:16,037 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-22 04:30:16,038 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-22 04:30:16,039 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-22 04:30:16,041 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-22 04:30:16,042 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-22 04:30:16,043 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-22 04:30:16,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-22 04:30:16,045 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-22 04:30:16,046 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-22 04:30:16,046 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-22 04:30:16,047 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-22 04:30:16,047 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-22 04:30:16,048 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-22 04:30:16,049 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-22 04:30:16,050 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-22 04:30:16,053 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-22 04:30:16,094 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-22 04:30:16,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-22 04:30:16,099 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-22 04:30:16,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-22 04:30:16,100 INFO L138 SettingsManager]: * Use SBE=true [2020-12-22 04:30:16,101 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-22 04:30:16,101 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-22 04:30:16,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-22 04:30:16,101 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-22 04:30:16,101 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-22 04:30:16,102 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-22 04:30:16,103 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-22 04:30:16,103 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-22 04:30:16,103 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-22 04:30:16,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-22 04:30:16,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-22 04:30:16,104 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-22 04:30:16,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 04:30:16,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-22 04:30:16,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-22 04:30:16,104 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-22 04:30:16,105 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-22 04:30:16,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-22 04:30:16,105 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-22 04:30:16,105 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-22 04:30:16,105 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/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 [2020-12-22 04:30:16,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-22 04:30:16,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-22 04:30:16,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-22 04:30:16,491 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-22 04:30:16,492 INFO L275 PluginConnector]: CDTParser initialized [2020-12-22 04:30:16,493 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/heapsort.i [2020-12-22 04:30:16,582 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67f4afc64/56fd9eed884645529ca0cd5edf6ea855/FLAG162dd1a21 [2020-12-22 04:30:17,276 INFO L306 CDTParser]: Found 1 translation units. [2020-12-22 04:30:17,278 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i [2020-12-22 04:30:17,286 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67f4afc64/56fd9eed884645529ca0cd5edf6ea855/FLAG162dd1a21 [2020-12-22 04:30:17,638 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67f4afc64/56fd9eed884645529ca0cd5edf6ea855 [2020-12-22 04:30:17,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-22 04:30:17,645 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-22 04:30:17,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-22 04:30:17,649 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-22 04:30:17,653 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-22 04:30:17,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:30:17" (1/1) ... [2020-12-22 04:30:17,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62ad2d70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:30:17, skipping insertion in model container [2020-12-22 04:30:17,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:30:17" (1/1) ... [2020-12-22 04:30:17,669 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-22 04:30:17,692 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-22 04:30:17,857 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2020-12-22 04:30:17,878 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 04:30:17,889 INFO L203 MainTranslator]: Completed pre-run [2020-12-22 04:30:17,905 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2020-12-22 04:30:17,915 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 04:30:17,931 INFO L208 MainTranslator]: Completed translation [2020-12-22 04:30:17,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:30:17 WrapperNode [2020-12-22 04:30:17,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-22 04:30:17,933 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-22 04:30:17,934 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-22 04:30:17,934 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-22 04:30:17,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:30:17" (1/1) ... [2020-12-22 04:30:17,951 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:30:17" (1/1) ... [2020-12-22 04:30:17,978 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-22 04:30:17,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-22 04:30:17,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-22 04:30:17,980 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-22 04:30:17,990 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:30:17" (1/1) ... [2020-12-22 04:30:17,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:30:17" (1/1) ... [2020-12-22 04:30:17,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:30:17" (1/1) ... [2020-12-22 04:30:17,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:30:17" (1/1) ... [2020-12-22 04:30:17,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:30:17" (1/1) ... [2020-12-22 04:30:18,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:30:17" (1/1) ... [2020-12-22 04:30:18,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:30:17" (1/1) ... [2020-12-22 04:30:18,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-22 04:30:18,009 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-22 04:30:18,009 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-22 04:30:18,009 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-22 04:30:18,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:30:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 04:30:18,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-22 04:30:18,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-22 04:30:18,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-22 04:30:18,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-22 04:30:18,846 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-22 04:30:18,846 INFO L299 CfgBuilder]: Removed 34 assume(true) statements. [2020-12-22 04:30:18,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:30:18 BoogieIcfgContainer [2020-12-22 04:30:18,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-22 04:30:18,851 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-22 04:30:18,851 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-22 04:30:18,854 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-22 04:30:18,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 04:30:17" (1/3) ... [2020-12-22 04:30:18,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46cc5989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:30:18, skipping insertion in model container [2020-12-22 04:30:18,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:30:17" (2/3) ... [2020-12-22 04:30:18,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46cc5989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:30:18, skipping insertion in model container [2020-12-22 04:30:18,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:30:18" (3/3) ... [2020-12-22 04:30:18,858 INFO L111 eAbstractionObserver]: Analyzing ICFG heapsort.i [2020-12-22 04:30:18,865 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-22 04:30:18,870 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2020-12-22 04:30:18,892 INFO L253 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2020-12-22 04:30:18,937 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-22 04:30:18,937 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-22 04:30:18,937 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-22 04:30:18,937 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-22 04:30:18,938 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-22 04:30:18,938 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-22 04:30:18,938 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-22 04:30:18,938 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-22 04:30:18,964 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2020-12-22 04:30:18,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-22 04:30:18,970 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:30:18,970 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:30:18,973 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:30:18,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:30:18,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1222313301, now seen corresponding path program 1 times [2020-12-22 04:30:18,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:30:18,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912846910] [2020-12-22 04:30:18,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:30:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:30:19,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:30:19,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912846910] [2020-12-22 04:30:19,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:30:19,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 04:30:19,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963853218] [2020-12-22 04:30:19,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-22 04:30:19,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:30:19,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-22 04:30:19,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-22 04:30:19,243 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 2 states. [2020-12-22 04:30:19,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:30:19,281 INFO L93 Difference]: Finished difference Result 138 states and 182 transitions. [2020-12-22 04:30:19,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-22 04:30:19,282 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2020-12-22 04:30:19,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:30:19,312 INFO L225 Difference]: With dead ends: 138 [2020-12-22 04:30:19,312 INFO L226 Difference]: Without dead ends: 67 [2020-12-22 04:30:19,321 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-22 04:30:19,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-12-22 04:30:19,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-12-22 04:30:19,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-12-22 04:30:19,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2020-12-22 04:30:19,362 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 9 [2020-12-22 04:30:19,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:30:19,363 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2020-12-22 04:30:19,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-22 04:30:19,363 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2020-12-22 04:30:19,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-22 04:30:19,364 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:30:19,364 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:30:19,364 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-22 04:30:19,365 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:30:19,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:30:19,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1218380889, now seen corresponding path program 1 times [2020-12-22 04:30:19,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:30:19,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707454840] [2020-12-22 04:30:19,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:30:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:30:19,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:30:19,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707454840] [2020-12-22 04:30:19,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:30:19,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 04:30:19,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472300567] [2020-12-22 04:30:19,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 04:30:19,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:30:19,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 04:30:19,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 04:30:19,473 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 3 states. [2020-12-22 04:30:19,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:30:19,564 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2020-12-22 04:30:19,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 04:30:19,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-12-22 04:30:19,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:30:19,566 INFO L225 Difference]: With dead ends: 72 [2020-12-22 04:30:19,566 INFO L226 Difference]: Without dead ends: 70 [2020-12-22 04:30:19,567 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 04:30:19,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-12-22 04:30:19,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2020-12-22 04:30:19,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-12-22 04:30:19,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2020-12-22 04:30:19,578 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 9 [2020-12-22 04:30:19,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:30:19,578 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2020-12-22 04:30:19,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 04:30:19,578 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2020-12-22 04:30:19,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-22 04:30:19,579 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:30:19,579 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:30:19,580 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-22 04:30:19,580 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:30:19,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:30:19,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1218404721, now seen corresponding path program 1 times [2020-12-22 04:30:19,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:30:19,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300955865] [2020-12-22 04:30:19,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:30:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:30:19,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:30:19,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300955865] [2020-12-22 04:30:19,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:30:19,690 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 04:30:19,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106960223] [2020-12-22 04:30:19,690 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 04:30:19,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:30:19,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 04:30:19,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 04:30:19,692 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 4 states. [2020-12-22 04:30:19,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:30:19,875 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2020-12-22 04:30:19,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 04:30:19,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-12-22 04:30:19,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:30:19,878 INFO L225 Difference]: With dead ends: 72 [2020-12-22 04:30:19,878 INFO L226 Difference]: Without dead ends: 70 [2020-12-22 04:30:19,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 04:30:19,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-12-22 04:30:19,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2020-12-22 04:30:19,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-12-22 04:30:19,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2020-12-22 04:30:19,889 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 9 [2020-12-22 04:30:19,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:30:19,889 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2020-12-22 04:30:19,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 04:30:19,890 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2020-12-22 04:30:19,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-22 04:30:19,890 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:30:19,890 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:30:19,891 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-22 04:30:19,891 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:30:19,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:30:19,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1218310388, now seen corresponding path program 1 times [2020-12-22 04:30:19,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:30:19,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750526755] [2020-12-22 04:30:19,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:30:19,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:30:19,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:30:19,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750526755] [2020-12-22 04:30:19,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:30:19,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 04:30:19,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561469880] [2020-12-22 04:30:19,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 04:30:19,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:30:19,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 04:30:19,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 04:30:19,989 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 5 states. [2020-12-22 04:30:20,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:30:20,322 INFO L93 Difference]: Finished difference Result 128 states and 142 transitions. [2020-12-22 04:30:20,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 04:30:20,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-12-22 04:30:20,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:30:20,324 INFO L225 Difference]: With dead ends: 128 [2020-12-22 04:30:20,324 INFO L226 Difference]: Without dead ends: 120 [2020-12-22 04:30:20,325 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-22 04:30:20,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-12-22 04:30:20,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 94. [2020-12-22 04:30:20,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-12-22 04:30:20,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2020-12-22 04:30:20,356 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 9 [2020-12-22 04:30:20,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:30:20,356 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2020-12-22 04:30:20,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 04:30:20,357 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2020-12-22 04:30:20,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-22 04:30:20,362 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:30:20,362 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:30:20,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-22 04:30:20,362 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:30:20,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:30:20,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1661877060, now seen corresponding path program 1 times [2020-12-22 04:30:20,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:30:20,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799650909] [2020-12-22 04:30:20,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:30:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:30:20,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:30:20,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799650909] [2020-12-22 04:30:20,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:30:20,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 04:30:20,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050565064] [2020-12-22 04:30:20,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 04:30:20,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:30:20,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 04:30:20,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-22 04:30:20,476 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand 6 states. [2020-12-22 04:30:20,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:30:20,704 INFO L93 Difference]: Finished difference Result 156 states and 185 transitions. [2020-12-22 04:30:20,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 04:30:20,705 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-12-22 04:30:20,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:30:20,706 INFO L225 Difference]: With dead ends: 156 [2020-12-22 04:30:20,707 INFO L226 Difference]: Without dead ends: 154 [2020-12-22 04:30:20,707 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-12-22 04:30:20,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-12-22 04:30:20,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 128. [2020-12-22 04:30:20,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-12-22 04:30:20,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2020-12-22 04:30:20,728 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 158 transitions. Word has length 11 [2020-12-22 04:30:20,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:30:20,729 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 158 transitions. [2020-12-22 04:30:20,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 04:30:20,729 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2020-12-22 04:30:20,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-22 04:30:20,730 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:30:20,730 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:30:20,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-22 04:30:20,731 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:30:20,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:30:20,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1638973740, now seen corresponding path program 1 times [2020-12-22 04:30:20,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:30:20,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483719907] [2020-12-22 04:30:20,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:30:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:30:20,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:30:20,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483719907] [2020-12-22 04:30:20,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:30:20,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 04:30:20,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569108045] [2020-12-22 04:30:20,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 04:30:20,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:30:20,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 04:30:20,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 04:30:20,778 INFO L87 Difference]: Start difference. First operand 128 states and 158 transitions. Second operand 4 states. [2020-12-22 04:30:20,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:30:20,874 INFO L93 Difference]: Finished difference Result 138 states and 174 transitions. [2020-12-22 04:30:20,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 04:30:20,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-12-22 04:30:20,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:30:20,877 INFO L225 Difference]: With dead ends: 138 [2020-12-22 04:30:20,878 INFO L226 Difference]: Without dead ends: 136 [2020-12-22 04:30:20,879 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 04:30:20,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-12-22 04:30:20,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 126. [2020-12-22 04:30:20,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-12-22 04:30:20,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 154 transitions. [2020-12-22 04:30:20,918 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 154 transitions. Word has length 11 [2020-12-22 04:30:20,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:30:20,922 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 154 transitions. [2020-12-22 04:30:20,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 04:30:20,922 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 154 transitions. [2020-12-22 04:30:20,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-22 04:30:20,923 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:30:20,924 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:30:20,924 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-22 04:30:20,924 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:30:20,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:30:20,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1729632713, now seen corresponding path program 1 times [2020-12-22 04:30:20,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:30:20,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839995500] [2020-12-22 04:30:20,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:30:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:30:21,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:30:21,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839995500] [2020-12-22 04:30:21,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:30:21,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 04:30:21,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351680539] [2020-12-22 04:30:21,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 04:30:21,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:30:21,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 04:30:21,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-22 04:30:21,027 INFO L87 Difference]: Start difference. First operand 126 states and 154 transitions. Second operand 6 states. [2020-12-22 04:30:21,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:30:21,312 INFO L93 Difference]: Finished difference Result 235 states and 279 transitions. [2020-12-22 04:30:21,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 04:30:21,313 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-12-22 04:30:21,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:30:21,315 INFO L225 Difference]: With dead ends: 235 [2020-12-22 04:30:21,315 INFO L226 Difference]: Without dead ends: 229 [2020-12-22 04:30:21,317 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-12-22 04:30:21,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-12-22 04:30:21,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 174. [2020-12-22 04:30:21,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-12-22 04:30:21,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 220 transitions. [2020-12-22 04:30:21,342 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 220 transitions. Word has length 11 [2020-12-22 04:30:21,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:30:21,342 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 220 transitions. [2020-12-22 04:30:21,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 04:30:21,342 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 220 transitions. [2020-12-22 04:30:21,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-22 04:30:21,345 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:30:21,345 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:30:21,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-22 04:30:21,346 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:30:21,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:30:21,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1823743610, now seen corresponding path program 1 times [2020-12-22 04:30:21,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:30:21,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668524844] [2020-12-22 04:30:21,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:30:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:30:21,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:30:21,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668524844] [2020-12-22 04:30:21,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:30:21,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 04:30:21,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179548504] [2020-12-22 04:30:21,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 04:30:21,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:30:21,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 04:30:21,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 04:30:21,408 INFO L87 Difference]: Start difference. First operand 174 states and 220 transitions. Second operand 3 states. [2020-12-22 04:30:21,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:30:21,442 INFO L93 Difference]: Finished difference Result 375 states and 471 transitions. [2020-12-22 04:30:21,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 04:30:21,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-12-22 04:30:21,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:30:21,445 INFO L225 Difference]: With dead ends: 375 [2020-12-22 04:30:21,445 INFO L226 Difference]: Without dead ends: 291 [2020-12-22 04:30:21,447 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 [2020-12-22 04:30:21,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-12-22 04:30:21,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 271. [2020-12-22 04:30:21,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2020-12-22 04:30:21,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 358 transitions. [2020-12-22 04:30:21,476 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 358 transitions. Word has length 11 [2020-12-22 04:30:21,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:30:21,477 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 358 transitions. [2020-12-22 04:30:21,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 04:30:21,477 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 358 transitions. [2020-12-22 04:30:21,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-22 04:30:21,481 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:30:21,481 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:30:21,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-22 04:30:21,481 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:30:21,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:30:21,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1755987957, now seen corresponding path program 1 times [2020-12-22 04:30:21,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:30:21,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630705135] [2020-12-22 04:30:21,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:30:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:30:21,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:30:21,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630705135] [2020-12-22 04:30:21,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:30:21,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 04:30:21,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469382674] [2020-12-22 04:30:21,544 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 04:30:21,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:30:21,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 04:30:21,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 04:30:21,546 INFO L87 Difference]: Start difference. First operand 271 states and 358 transitions. Second operand 4 states. [2020-12-22 04:30:21,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:30:21,607 INFO L93 Difference]: Finished difference Result 284 states and 365 transitions. [2020-12-22 04:30:21,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 04:30:21,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-12-22 04:30:21,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:30:21,611 INFO L225 Difference]: With dead ends: 284 [2020-12-22 04:30:21,611 INFO L226 Difference]: Without dead ends: 240 [2020-12-22 04:30:21,612 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 04:30:21,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2020-12-22 04:30:21,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2020-12-22 04:30:21,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2020-12-22 04:30:21,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 316 transitions. [2020-12-22 04:30:21,634 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 316 transitions. Word has length 11 [2020-12-22 04:30:21,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:30:21,639 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 316 transitions. [2020-12-22 04:30:21,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 04:30:21,639 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 316 transitions. [2020-12-22 04:30:21,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-22 04:30:21,640 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:30:21,641 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:30:21,641 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-22 04:30:21,641 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:30:21,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:30:21,642 INFO L82 PathProgramCache]: Analyzing trace with hash -2105123171, now seen corresponding path program 1 times [2020-12-22 04:30:21,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:30:21,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297935858] [2020-12-22 04:30:21,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:30:21,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:30:21,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:30:21,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297935858] [2020-12-22 04:30:21,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:30:21,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 04:30:21,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476960947] [2020-12-22 04:30:21,722 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 04:30:21,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:30:21,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 04:30:21,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 04:30:21,724 INFO L87 Difference]: Start difference. First operand 240 states and 316 transitions. Second operand 5 states. [2020-12-22 04:30:21,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:30:21,906 INFO L93 Difference]: Finished difference Result 380 states and 493 transitions. [2020-12-22 04:30:21,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 04:30:21,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-12-22 04:30:21,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:30:21,911 INFO L225 Difference]: With dead ends: 380 [2020-12-22 04:30:21,911 INFO L226 Difference]: Without dead ends: 372 [2020-12-22 04:30:21,912 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-22 04:30:21,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2020-12-22 04:30:21,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 200. [2020-12-22 04:30:21,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-12-22 04:30:21,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 258 transitions. [2020-12-22 04:30:21,931 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 258 transitions. Word has length 15 [2020-12-22 04:30:21,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:30:21,932 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 258 transitions. [2020-12-22 04:30:21,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 04:30:21,932 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 258 transitions. [2020-12-22 04:30:21,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-22 04:30:21,933 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:30:21,933 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:30:21,933 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-22 04:30:21,933 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:30:21,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:30:21,934 INFO L82 PathProgramCache]: Analyzing trace with hash 639895389, now seen corresponding path program 1 times [2020-12-22 04:30:21,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:30:21,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470766195] [2020-12-22 04:30:21,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:30:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:30:21,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:30:21,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470766195] [2020-12-22 04:30:21,969 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:30:21,969 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 04:30:21,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595352773] [2020-12-22 04:30:21,970 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 04:30:21,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:30:21,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 04:30:21,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 04:30:21,971 INFO L87 Difference]: Start difference. First operand 200 states and 258 transitions. Second operand 5 states. [2020-12-22 04:30:22,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:30:22,140 INFO L93 Difference]: Finished difference Result 302 states and 372 transitions. [2020-12-22 04:30:22,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 04:30:22,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-12-22 04:30:22,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:30:22,143 INFO L225 Difference]: With dead ends: 302 [2020-12-22 04:30:22,143 INFO L226 Difference]: Without dead ends: 300 [2020-12-22 04:30:22,144 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-22 04:30:22,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2020-12-22 04:30:22,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 246. [2020-12-22 04:30:22,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2020-12-22 04:30:22,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 312 transitions. [2020-12-22 04:30:22,166 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 312 transitions. Word has length 15 [2020-12-22 04:30:22,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:30:22,167 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 312 transitions. [2020-12-22 04:30:22,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 04:30:22,167 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 312 transitions. [2020-12-22 04:30:22,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-22 04:30:22,168 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:30:22,168 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:30:22,168 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-22 04:30:22,168 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:30:22,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:30:22,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1672864291, now seen corresponding path program 1 times [2020-12-22 04:30:22,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:30:22,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731392062] [2020-12-22 04:30:22,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:30:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:30:22,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:30:22,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731392062] [2020-12-22 04:30:22,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:30:22,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 04:30:22,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902280302] [2020-12-22 04:30:22,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 04:30:22,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:30:22,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 04:30:22,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-22 04:30:22,203 INFO L87 Difference]: Start difference. First operand 246 states and 312 transitions. Second operand 5 states. [2020-12-22 04:30:22,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:30:22,380 INFO L93 Difference]: Finished difference Result 734 states and 889 transitions. [2020-12-22 04:30:22,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 04:30:22,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-22 04:30:22,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:30:22,384 INFO L225 Difference]: With dead ends: 734 [2020-12-22 04:30:22,384 INFO L226 Difference]: Without dead ends: 556 [2020-12-22 04:30:22,385 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-22 04:30:22,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2020-12-22 04:30:22,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 246. [2020-12-22 04:30:22,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2020-12-22 04:30:22,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 310 transitions. [2020-12-22 04:30:22,414 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 310 transitions. Word has length 16 [2020-12-22 04:30:22,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:30:22,414 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 310 transitions. [2020-12-22 04:30:22,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 04:30:22,414 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 310 transitions. [2020-12-22 04:30:22,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-22 04:30:22,415 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:30:22,415 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:30:22,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-22 04:30:22,415 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:30:22,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:30:22,416 INFO L82 PathProgramCache]: Analyzing trace with hash 759304320, now seen corresponding path program 1 times [2020-12-22 04:30:22,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:30:22,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831767433] [2020-12-22 04:30:22,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:30:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:30:22,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:30:22,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831767433] [2020-12-22 04:30:22,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:30:22,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 04:30:22,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812094557] [2020-12-22 04:30:22,460 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 04:30:22,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:30:22,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 04:30:22,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-22 04:30:22,461 INFO L87 Difference]: Start difference. First operand 246 states and 310 transitions. Second operand 6 states. [2020-12-22 04:30:22,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:30:22,670 INFO L93 Difference]: Finished difference Result 380 states and 474 transitions. [2020-12-22 04:30:22,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 04:30:22,670 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-12-22 04:30:22,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:30:22,674 INFO L225 Difference]: With dead ends: 380 [2020-12-22 04:30:22,675 INFO L226 Difference]: Without dead ends: 378 [2020-12-22 04:30:22,680 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-12-22 04:30:22,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2020-12-22 04:30:22,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 308. [2020-12-22 04:30:22,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2020-12-22 04:30:22,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 392 transitions. [2020-12-22 04:30:22,727 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 392 transitions. Word has length 17 [2020-12-22 04:30:22,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:30:22,729 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 392 transitions. [2020-12-22 04:30:22,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 04:30:22,730 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 392 transitions. [2020-12-22 04:30:22,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-22 04:30:22,731 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:30:22,732 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] [2020-12-22 04:30:22,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-22 04:30:22,733 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:30:22,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:30:22,733 INFO L82 PathProgramCache]: Analyzing trace with hash -750791926, now seen corresponding path program 1 times [2020-12-22 04:30:22,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:30:22,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803560056] [2020-12-22 04:30:22,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:30:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:30:22,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:30:22,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803560056] [2020-12-22 04:30:22,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:30:22,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 04:30:22,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587971042] [2020-12-22 04:30:22,788 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 04:30:22,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:30:22,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 04:30:22,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-22 04:30:22,789 INFO L87 Difference]: Start difference. First operand 308 states and 392 transitions. Second operand 6 states. [2020-12-22 04:30:23,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:30:23,014 INFO L93 Difference]: Finished difference Result 410 states and 504 transitions. [2020-12-22 04:30:23,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 04:30:23,015 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-12-22 04:30:23,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:30:23,017 INFO L225 Difference]: With dead ends: 410 [2020-12-22 04:30:23,018 INFO L226 Difference]: Without dead ends: 406 [2020-12-22 04:30:23,018 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-12-22 04:30:23,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-12-22 04:30:23,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 216. [2020-12-22 04:30:23,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-12-22 04:30:23,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 266 transitions. [2020-12-22 04:30:23,045 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 266 transitions. Word has length 21 [2020-12-22 04:30:23,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:30:23,045 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 266 transitions. [2020-12-22 04:30:23,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 04:30:23,046 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 266 transitions. [2020-12-22 04:30:23,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-22 04:30:23,046 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:30:23,046 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:30:23,046 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-22 04:30:23,047 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:30:23,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:30:23,047 INFO L82 PathProgramCache]: Analyzing trace with hash -234606263, now seen corresponding path program 1 times [2020-12-22 04:30:23,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:30:23,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69766000] [2020-12-22 04:30:23,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:30:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:30:23,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:30:23,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69766000] [2020-12-22 04:30:23,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:30:23,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 04:30:23,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070165577] [2020-12-22 04:30:23,087 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 04:30:23,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:30:23,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 04:30:23,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-22 04:30:23,088 INFO L87 Difference]: Start difference. First operand 216 states and 266 transitions. Second operand 6 states. [2020-12-22 04:30:23,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:30:23,226 INFO L93 Difference]: Finished difference Result 217 states and 267 transitions. [2020-12-22 04:30:23,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 04:30:23,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-12-22 04:30:23,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:30:23,228 INFO L225 Difference]: With dead ends: 217 [2020-12-22 04:30:23,229 INFO L226 Difference]: Without dead ends: 209 [2020-12-22 04:30:23,229 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-12-22 04:30:23,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-12-22 04:30:23,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2020-12-22 04:30:23,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-12-22 04:30:23,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 248 transitions. [2020-12-22 04:30:23,253 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 248 transitions. Word has length 23 [2020-12-22 04:30:23,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:30:23,253 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 248 transitions. [2020-12-22 04:30:23,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 04:30:23,253 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 248 transitions. [2020-12-22 04:30:23,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-22 04:30:23,254 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:30:23,255 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:30:23,255 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-22 04:30:23,255 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:30:23,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:30:23,256 INFO L82 PathProgramCache]: Analyzing trace with hash -900992014, now seen corresponding path program 1 times [2020-12-22 04:30:23,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:30:23,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374950638] [2020-12-22 04:30:23,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:30:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:30:23,315 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:30:23,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374950638] [2020-12-22 04:30:23,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:30:23,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 04:30:23,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266615456] [2020-12-22 04:30:23,316 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 04:30:23,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:30:23,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 04:30:23,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-22 04:30:23,318 INFO L87 Difference]: Start difference. First operand 208 states and 248 transitions. Second operand 6 states. [2020-12-22 04:30:23,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:30:23,491 INFO L93 Difference]: Finished difference Result 250 states and 291 transitions. [2020-12-22 04:30:23,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-22 04:30:23,491 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2020-12-22 04:30:23,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:30:23,493 INFO L225 Difference]: With dead ends: 250 [2020-12-22 04:30:23,493 INFO L226 Difference]: Without dead ends: 248 [2020-12-22 04:30:23,494 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-12-22 04:30:23,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2020-12-22 04:30:23,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 110. [2020-12-22 04:30:23,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-12-22 04:30:23,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 128 transitions. [2020-12-22 04:30:23,513 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 128 transitions. Word has length 29 [2020-12-22 04:30:23,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:30:23,513 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 128 transitions. [2020-12-22 04:30:23,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 04:30:23,514 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2020-12-22 04:30:23,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-22 04:30:23,514 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:30:23,515 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:30:23,515 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-22 04:30:23,515 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:30:23,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:30:23,516 INFO L82 PathProgramCache]: Analyzing trace with hash 5957045, now seen corresponding path program 1 times [2020-12-22 04:30:23,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:30:23,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430993304] [2020-12-22 04:30:23,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:30:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:30:23,561 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:30:23,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430993304] [2020-12-22 04:30:23,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885946567] [2020-12-22 04:30:23,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:30:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:30:23,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-22 04:30:23,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 04:30:23,873 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:30:23,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-22 04:30:23,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2020-12-22 04:30:23,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804335374] [2020-12-22 04:30:23,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 04:30:23,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:30:23,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 04:30:23,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-12-22 04:30:23,875 INFO L87 Difference]: Start difference. First operand 110 states and 128 transitions. Second operand 6 states. [2020-12-22 04:30:24,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:30:24,092 INFO L93 Difference]: Finished difference Result 399 states and 463 transitions. [2020-12-22 04:30:24,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-22 04:30:24,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-12-22 04:30:24,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:30:24,095 INFO L225 Difference]: With dead ends: 399 [2020-12-22 04:30:24,095 INFO L226 Difference]: Without dead ends: 293 [2020-12-22 04:30:24,097 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-12-22 04:30:24,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2020-12-22 04:30:24,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 256. [2020-12-22 04:30:24,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-12-22 04:30:24,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 302 transitions. [2020-12-22 04:30:24,146 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 302 transitions. Word has length 31 [2020-12-22 04:30:24,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:30:24,147 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 302 transitions. [2020-12-22 04:30:24,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 04:30:24,147 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 302 transitions. [2020-12-22 04:30:24,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-22 04:30:24,148 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:30:24,148 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2020-12-22 04:30:24,363 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-12-22 04:30:24,364 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:30:24,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:30:24,365 INFO L82 PathProgramCache]: Analyzing trace with hash -971191967, now seen corresponding path program 1 times [2020-12-22 04:30:24,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:30:24,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010150892] [2020-12-22 04:30:24,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:30:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:30:24,445 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:30:24,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010150892] [2020-12-22 04:30:24,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252665442] [2020-12-22 04:30:24,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:30:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:30:24,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-22 04:30:24,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 04:30:24,586 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:30:24,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 04:30:24,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-12-22 04:30:24,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025806912] [2020-12-22 04:30:24,587 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-22 04:30:24,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:30:24,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-22 04:30:24,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-22 04:30:24,588 INFO L87 Difference]: Start difference. First operand 256 states and 302 transitions. Second operand 8 states. [2020-12-22 04:30:25,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:30:25,081 INFO L93 Difference]: Finished difference Result 411 states and 475 transitions. [2020-12-22 04:30:25,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-22 04:30:25,081 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-12-22 04:30:25,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:30:25,084 INFO L225 Difference]: With dead ends: 411 [2020-12-22 04:30:25,084 INFO L226 Difference]: Without dead ends: 409 [2020-12-22 04:30:25,085 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=317, Unknown=0, NotChecked=0, Total=462 [2020-12-22 04:30:25,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2020-12-22 04:30:25,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 334. [2020-12-22 04:30:25,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2020-12-22 04:30:25,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 392 transitions. [2020-12-22 04:30:25,138 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 392 transitions. Word has length 40 [2020-12-22 04:30:25,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:30:25,138 INFO L481 AbstractCegarLoop]: Abstraction has 334 states and 392 transitions. [2020-12-22 04:30:25,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-22 04:30:25,138 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 392 transitions. [2020-12-22 04:30:25,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-22 04:30:25,139 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:30:25,139 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2020-12-22 04:30:25,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-22 04:30:25,354 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:30:25,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:30:25,355 INFO L82 PathProgramCache]: Analyzing trace with hash -830643357, now seen corresponding path program 1 times [2020-12-22 04:30:25,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:30:25,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270776811] [2020-12-22 04:30:25,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:30:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:30:25,422 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:30:25,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270776811] [2020-12-22 04:30:25,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663345444] [2020-12-22 04:30:25,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:30:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:30:25,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-22 04:30:25,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 04:30:25,564 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:30:25,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 04:30:25,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-12-22 04:30:25,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600030295] [2020-12-22 04:30:25,565 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 04:30:25,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:30:25,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 04:30:25,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-22 04:30:25,566 INFO L87 Difference]: Start difference. First operand 334 states and 392 transitions. Second operand 7 states. [2020-12-22 04:30:25,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:30:25,932 INFO L93 Difference]: Finished difference Result 375 states and 432 transitions. [2020-12-22 04:30:25,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-22 04:30:25,932 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-12-22 04:30:25,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:30:25,934 INFO L225 Difference]: With dead ends: 375 [2020-12-22 04:30:25,934 INFO L226 Difference]: Without dead ends: 373 [2020-12-22 04:30:25,935 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-12-22 04:30:25,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2020-12-22 04:30:25,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 256. [2020-12-22 04:30:25,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-12-22 04:30:25,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 298 transitions. [2020-12-22 04:30:25,981 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 298 transitions. Word has length 40 [2020-12-22 04:30:25,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:30:25,981 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 298 transitions. [2020-12-22 04:30:25,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 04:30:25,981 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 298 transitions. [2020-12-22 04:30:25,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-22 04:30:25,982 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:30:25,982 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:30:26,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:30:26,196 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:30:26,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:30:26,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1307418236, now seen corresponding path program 1 times [2020-12-22 04:30:26,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:30:26,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726488361] [2020-12-22 04:30:26,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:30:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:30:26,264 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:30:26,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726488361] [2020-12-22 04:30:26,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639040453] [2020-12-22 04:30:26,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:30:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:30:26,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-22 04:30:26,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 04:30:26,570 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:30:26,574 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:30:26,581 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:30:26,584 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 04:30:26,590 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:30:26,592 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 04:30:26,595 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 04:30:26,615 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:30:26,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 04:30:26,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2020-12-22 04:30:26,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249323105] [2020-12-22 04:30:26,616 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-22 04:30:26,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:30:26,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-22 04:30:26,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-12-22 04:30:26,617 INFO L87 Difference]: Start difference. First operand 256 states and 298 transitions. Second operand 14 states. [2020-12-22 04:30:28,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:30:28,336 INFO L93 Difference]: Finished difference Result 447 states and 510 transitions. [2020-12-22 04:30:28,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-12-22 04:30:28,338 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2020-12-22 04:30:28,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:30:28,339 INFO L225 Difference]: With dead ends: 447 [2020-12-22 04:30:28,339 INFO L226 Difference]: Without dead ends: 281 [2020-12-22 04:30:28,341 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=719, Invalid=1831, Unknown=0, NotChecked=0, Total=2550 [2020-12-22 04:30:28,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-12-22 04:30:28,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 147. [2020-12-22 04:30:28,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-12-22 04:30:28,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 169 transitions. [2020-12-22 04:30:28,374 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 169 transitions. Word has length 42 [2020-12-22 04:30:28,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:30:28,374 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 169 transitions. [2020-12-22 04:30:28,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-22 04:30:28,374 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 169 transitions. [2020-12-22 04:30:28,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-22 04:30:28,376 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:30:28,376 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:30:28,591 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:30:28,592 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:30:28,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:30:28,592 INFO L82 PathProgramCache]: Analyzing trace with hash 34146378, now seen corresponding path program 1 times [2020-12-22 04:30:28,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:30:28,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83303301] [2020-12-22 04:30:28,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:30:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:30:28,645 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:30:28,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83303301] [2020-12-22 04:30:28,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298722310] [2020-12-22 04:30:28,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:30:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:30:28,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-22 04:30:28,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 04:30:28,779 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-22 04:30:28,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 04:30:28,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2020-12-22 04:30:28,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988860565] [2020-12-22 04:30:28,780 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-22 04:30:28,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:30:28,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-22 04:30:28,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-12-22 04:30:28,781 INFO L87 Difference]: Start difference. First operand 147 states and 169 transitions. Second operand 11 states. [2020-12-22 04:30:29,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:30:29,730 INFO L93 Difference]: Finished difference Result 358 states and 406 transitions. [2020-12-22 04:30:29,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-12-22 04:30:29,730 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2020-12-22 04:30:29,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:30:29,731 INFO L225 Difference]: With dead ends: 358 [2020-12-22 04:30:29,731 INFO L226 Difference]: Without dead ends: 0 [2020-12-22 04:30:29,732 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=328, Invalid=794, Unknown=0, NotChecked=0, Total=1122 [2020-12-22 04:30:29,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-22 04:30:29,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-22 04:30:29,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-22 04:30:29,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-22 04:30:29,733 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2020-12-22 04:30:29,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:30:29,733 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-22 04:30:29,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-22 04:30:29,733 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-22 04:30:29,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-22 04:30:29,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2020-12-22 04:30:29,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-22 04:30:30,155 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 112 [2020-12-22 04:30:30,280 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 94 [2020-12-22 04:30:30,798 WARN L197 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 192 [2020-12-22 04:30:30,985 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 111 [2020-12-22 04:30:31,404 WARN L197 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 179 [2020-12-22 04:30:31,614 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 123 [2020-12-22 04:30:32,030 WARN L197 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 170 [2020-12-22 04:30:32,304 WARN L197 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 170 [2020-12-22 04:30:32,494 WARN L197 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 124 [2020-12-22 04:30:32,871 WARN L197 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 195 [2020-12-22 04:30:33,109 WARN L197 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 172 [2020-12-22 04:30:33,481 WARN L197 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 25 [2020-12-22 04:30:33,886 WARN L197 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 44 [2020-12-22 04:30:34,845 WARN L197 SmtUtils]: Spent 949.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 38 [2020-12-22 04:30:35,029 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 26 [2020-12-22 04:30:35,316 WARN L197 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 24 [2020-12-22 04:30:36,388 WARN L197 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 175 DAG size of output: 46 [2020-12-22 04:30:36,774 WARN L197 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 25 [2020-12-22 04:30:37,222 WARN L197 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 44 [2020-12-22 04:30:38,081 WARN L197 SmtUtils]: Spent 856.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 38 [2020-12-22 04:30:38,850 WARN L197 SmtUtils]: Spent 766.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 36 [2020-12-22 04:30:39,237 WARN L197 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 28 [2020-12-22 04:30:39,432 WARN L197 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 26 [2020-12-22 04:30:40,541 WARN L197 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 187 DAG size of output: 45 [2020-12-22 04:30:41,310 WARN L197 SmtUtils]: Spent 766.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 43 [2020-12-22 04:30:41,782 WARN L197 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 42 [2020-12-22 04:30:41,787 INFO L185 CegarLoopUtils]: At program point L18-17(lines 17 22) the Hoare annotation is: (let ((.cse0 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse1 (<= 1 ULTIMATE.start_main_~l~0)) (.cse2 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse3 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse4 (<= (+ ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~i~0) 2) (+ (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~j~0))) (.cse5 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse6 (<= 1 ULTIMATE.start_main_~i~0))) (or (and (<= 1 ULTIMATE.start_main_~r~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ULTIMATE.start_main_~j~0) .cse6 (<= ULTIMATE.start_main_~l~0 1)) (let ((.cse7 (* 2 ULTIMATE.start_main_~l~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse7 ULTIMATE.start_main_~j~0) .cse5 .cse6 (<= .cse7 ULTIMATE.start_main_~r~0))))) [2020-12-22 04:30:41,787 INFO L189 CegarLoopUtils]: For program point L18-18(lines 18 20) no Hoare annotation was computed. [2020-12-22 04:30:41,788 INFO L185 CegarLoopUtils]: At program point L18-20(lines 17 22) the Hoare annotation is: (let ((.cse11 (* 2 ULTIMATE.start_main_~l~0))) (let ((.cse8 (<= .cse11 ULTIMATE.start_main_~r~0)) (.cse5 (<= 2 ULTIMATE.start_main_~j~0)) (.cse10 (<= 1 ULTIMATE.start_main_~i~0)) (.cse7 (<= ULTIMATE.start_main_~l~0 1)) (.cse0 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse1 (<= 1 ULTIMATE.start_main_~l~0)) (.cse3 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse2 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse9 (<= .cse11 ULTIMATE.start_main_~j~0)) (.cse4 (<= (+ ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~i~0) 2) (+ (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~j~0))) (.cse6 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse2 .cse9 .cse4 .cse6 .cse10 .cse8) (and (<= 1 ULTIMATE.start_main_~r~0) .cse0 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse10 .cse7) (and .cse0 .cse1 .cse3 .cse2 .cse9 .cse4 .cse6 (<= (+ ULTIMATE.start_main_~l~0 1) (div ULTIMATE.start_main_~r~0 2)))))) [2020-12-22 04:30:41,788 INFO L189 CegarLoopUtils]: For program point L18-21(lines 18 20) no Hoare annotation was computed. [2020-12-22 04:30:41,788 INFO L185 CegarLoopUtils]: At program point L18-23(lines 17 22) the Hoare annotation is: (let ((.cse1 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse0 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse2 (= 1 ULTIMATE.start___VERIFIER_assert_~cond))) (or (let ((.cse3 (* 2 ULTIMATE.start_main_~l~0))) (and (< 0 ULTIMATE.start_main_~l~0) .cse0 .cse1 .cse2 (<= .cse3 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~i~0) 2) (+ (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~j~0)) (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) (<= .cse3 ULTIMATE.start_main_~r~0))) (and (<= 1 ULTIMATE.start_main_~r~0) (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~j~0) (<= 1 ULTIMATE.start_main_~l~0) .cse1 .cse0 .cse2 (<= 2 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~l~0 1)))) [2020-12-22 04:30:41,788 INFO L189 CegarLoopUtils]: For program point L18-24(lines 18 20) no Hoare annotation was computed. [2020-12-22 04:30:41,789 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2020-12-22 04:30:41,789 INFO L185 CegarLoopUtils]: At program point L18-26(lines 17 22) the Hoare annotation is: (let ((.cse12 (* 2 ULTIMATE.start_main_~l~0))) (let ((.cse8 (<= ULTIMATE.start_main_~l~0 1)) (.cse0 (<= 1 ULTIMATE.start_main_~r~0)) (.cse1 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse2 (<= 1 ULTIMATE.start_main_~l~0)) (.cse4 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse3 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse11 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse5 (<= (+ ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~i~0) 2) (+ (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~j~0))) (.cse10 (<= .cse12 ULTIMATE.start_main_~j~0)) (.cse7 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse6 (<= 2 ULTIMATE.start_main_~j~0)) (.cse9 (<= .cse12 ULTIMATE.start_main_~r~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse7 .cse6 (<= (+ ULTIMATE.start_main_~l~0 1) (div ULTIMATE.start_main_~r~0 2)) .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse3 .cse11 .cse5 .cse10 .cse7 .cse6 .cse9)))) [2020-12-22 04:30:41,789 INFO L189 CegarLoopUtils]: For program point L18-27(lines 18 20) no Hoare annotation was computed. [2020-12-22 04:30:41,790 INFO L185 CegarLoopUtils]: At program point L18-29(lines 17 22) the Hoare annotation is: (let ((.cse0 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse1 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse2 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))) (or (and (<= 1 ULTIMATE.start_main_~r~0) .cse0 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~j~0) (<= 1 ULTIMATE.start_main_~l~0) .cse1 .cse2 (<= 2 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~l~0 1)) (let ((.cse3 (* 2 ULTIMATE.start_main_~l~0))) (and (< 0 ULTIMATE.start_main_~l~0) .cse0 .cse1 .cse2 (<= .cse3 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~i~0) 2) (+ (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~j~0)) (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) (<= .cse3 ULTIMATE.start_main_~r~0))))) [2020-12-22 04:30:41,790 INFO L189 CegarLoopUtils]: For program point L18-30(lines 18 20) no Hoare annotation was computed. [2020-12-22 04:30:41,790 INFO L189 CegarLoopUtils]: For program point L19(line 19) no Hoare annotation was computed. [2020-12-22 04:30:41,790 INFO L189 CegarLoopUtils]: For program point L19-1(line 19) no Hoare annotation was computed. [2020-12-22 04:30:41,790 INFO L185 CegarLoopUtils]: At program point L18-32(lines 17 22) the Hoare annotation is: (let ((.cse0 (* 2 ULTIMATE.start_main_~l~0))) (and (<= 2 ULTIMATE.start_main_~l~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= (+ ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~i~0) 2) (+ (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~j~0)) (<= .cse0 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) (<= .cse0 ULTIMATE.start_main_~r~0))) [2020-12-22 04:30:41,791 INFO L189 CegarLoopUtils]: For program point L19-2(line 19) no Hoare annotation was computed. [2020-12-22 04:30:41,791 INFO L189 CegarLoopUtils]: For program point L18-33(lines 18 20) no Hoare annotation was computed. [2020-12-22 04:30:41,791 INFO L189 CegarLoopUtils]: For program point L19-3(line 19) no Hoare annotation was computed. [2020-12-22 04:30:41,791 INFO L189 CegarLoopUtils]: For program point L19-4(line 19) no Hoare annotation was computed. [2020-12-22 04:30:41,791 INFO L185 CegarLoopUtils]: At program point L18-35(lines 17 22) the Hoare annotation is: (let ((.cse0 (* 2 ULTIMATE.start_main_~l~0))) (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 2 ULTIMATE.start_main_~l~0) (<= (+ ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~i~0) 2) (+ (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~j~0)) (<= .cse0 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) (<= .cse0 ULTIMATE.start_main_~r~0))) [2020-12-22 04:30:41,791 INFO L189 CegarLoopUtils]: For program point L19-5(line 19) no Hoare annotation was computed. [2020-12-22 04:30:41,791 INFO L189 CegarLoopUtils]: For program point L18-36(lines 18 20) no Hoare annotation was computed. [2020-12-22 04:30:41,791 INFO L189 CegarLoopUtils]: For program point L19-6(line 19) no Hoare annotation was computed. [2020-12-22 04:30:41,791 INFO L189 CegarLoopUtils]: For program point L19-7(line 19) no Hoare annotation was computed. [2020-12-22 04:30:41,791 INFO L185 CegarLoopUtils]: At program point L18-38(lines 17 22) the Hoare annotation is: (let ((.cse0 (* 2 ULTIMATE.start_main_~n~0))) (and (<= 1 ULTIMATE.start_main_~r~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 1 ULTIMATE.start_main_~l~0) (<= (+ ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~i~0) 2) (+ .cse0 ULTIMATE.start_main_~j~0)) (<= 2 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) (<= ULTIMATE.start_main_~l~0 1) (<= (+ ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~l~0)) .cse0))) [2020-12-22 04:30:41,792 INFO L189 CegarLoopUtils]: For program point L19-8(line 19) no Hoare annotation was computed. [2020-12-22 04:30:41,792 INFO L189 CegarLoopUtils]: For program point L18-39(lines 18 20) no Hoare annotation was computed. [2020-12-22 04:30:41,792 INFO L189 CegarLoopUtils]: For program point L19-9(line 19) no Hoare annotation was computed. [2020-12-22 04:30:41,792 INFO L189 CegarLoopUtils]: For program point L19-10(line 19) no Hoare annotation was computed. [2020-12-22 04:30:41,792 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2020-12-22 04:30:41,792 INFO L185 CegarLoopUtils]: At program point L18-41(lines 17 22) the Hoare annotation is: (let ((.cse0 (* 2 ULTIMATE.start_main_~n~0))) (and (<= 1 ULTIMATE.start_main_~r~0) (<= 1 ULTIMATE.start_main_~l~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= (+ ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~i~0) 2) (+ .cse0 ULTIMATE.start_main_~j~0)) (<= 2 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) (<= ULTIMATE.start_main_~l~0 1) (<= (+ ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~l~0)) .cse0))) [2020-12-22 04:30:41,792 INFO L189 CegarLoopUtils]: For program point L19-11(line 19) no Hoare annotation was computed. [2020-12-22 04:30:41,792 INFO L189 CegarLoopUtils]: For program point L19-12(line 19) no Hoare annotation was computed. [2020-12-22 04:30:41,792 INFO L189 CegarLoopUtils]: For program point L19-13(line 19) no Hoare annotation was computed. [2020-12-22 04:30:41,793 INFO L192 CegarLoopUtils]: At program point L69(lines 24 70) the Hoare annotation is: true [2020-12-22 04:30:41,793 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-22 04:30:41,793 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2020-12-22 04:30:41,793 INFO L185 CegarLoopUtils]: At program point L38-2(lines 38 58) the Hoare annotation is: (let ((.cse7 (* 2 ULTIMATE.start_main_~n~0)) (.cse6 (* 2 ULTIMATE.start_main_~l~0))) (let ((.cse1 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse2 (<= 2 ULTIMATE.start_main_~i~0)) (.cse9 (<= .cse6 ULTIMATE.start_main_~j~0)) (.cse0 (<= 1 ULTIMATE.start_main_~r~0)) (.cse8 (< 0 ULTIMATE.start_main_~l~0)) (.cse3 (<= (+ ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~i~0) 2) (+ .cse7 ULTIMATE.start_main_~j~0))) (.cse4 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse10 (<= 1 ULTIMATE.start_main_~i~0)) (.cse5 (<= ULTIMATE.start_main_~l~0 1))) (or (and .cse0 .cse1 (<= 1 ULTIMATE.start_main_~l~0) .cse2 .cse3 .cse4 .cse5 (<= 3 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~r~0 .cse6) .cse7)) (and .cse8 .cse9 .cse3 .cse4 .cse10 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~r~0)) (and .cse8 .cse1 .cse2 .cse9 .cse3 .cse4 (<= .cse6 ULTIMATE.start_main_~r~0)) (and .cse0 .cse8 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse3 .cse4 (<= 2 ULTIMATE.start_main_~j~0) .cse10 .cse5)))) [2020-12-22 04:30:41,793 INFO L189 CegarLoopUtils]: For program point L38-3(lines 35 68) no Hoare annotation was computed. [2020-12-22 04:30:41,793 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2020-12-22 04:30:41,793 INFO L189 CegarLoopUtils]: For program point L39(lines 39 46) no Hoare annotation was computed. [2020-12-22 04:30:41,794 INFO L189 CegarLoopUtils]: For program point L39-1(lines 39 46) no Hoare annotation was computed. [2020-12-22 04:30:41,794 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2020-12-22 04:30:41,794 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-22 04:30:41,794 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2020-12-22 04:30:41,794 INFO L189 CegarLoopUtils]: For program point L59-1(lines 24 70) no Hoare annotation was computed. [2020-12-22 04:30:41,794 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2020-12-22 04:30:41,794 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2020-12-22 04:30:41,794 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2020-12-22 04:30:41,794 INFO L189 CegarLoopUtils]: For program point L27(line 27) no Hoare annotation was computed. [2020-12-22 04:30:41,795 INFO L189 CegarLoopUtils]: For program point L44(lines 44 45) no Hoare annotation was computed. [2020-12-22 04:30:41,795 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2020-12-22 04:30:41,795 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-22 04:30:41,795 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2020-12-22 04:30:41,795 INFO L189 CegarLoopUtils]: For program point L30(lines 30 34) no Hoare annotation was computed. [2020-12-22 04:30:41,795 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2020-12-22 04:30:41,795 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-22 04:30:41,795 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2020-12-22 04:30:41,795 INFO L189 CegarLoopUtils]: For program point L49(lines 49 51) no Hoare annotation was computed. [2020-12-22 04:30:41,796 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2020-12-22 04:30:41,796 INFO L189 CegarLoopUtils]: For program point L18(lines 18 20) no Hoare annotation was computed. [2020-12-22 04:30:41,796 INFO L185 CegarLoopUtils]: At program point L18-2(lines 17 22) the Hoare annotation is: (let ((.cse6 (div ULTIMATE.start_main_~r~0 2)) (.cse0 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse1 (<= 1 ULTIMATE.start_main_~l~0)) (.cse3 (<= (* 2 ULTIMATE.start_main_~l~0) ULTIMATE.start_main_~j~0)) (.cse2 (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0)) (.cse4 (<= (+ ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~i~0) 2) (+ (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~j~0))) (.cse5 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse8 (<= 1 ULTIMATE.start_main_~i~0)) (.cse7 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~r~0))) (or (and .cse0 .cse1 (<= 2 ULTIMATE.start_main_~i~0) .cse2 .cse3 .cse4 .cse5 (<= (+ ULTIMATE.start_main_~l~0 1) .cse6) .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 (<= (+ (div (* ULTIMATE.start_main_~j~0 (- 1)) (- 2)) 1) .cse6)) (and .cse0 .cse1 .cse2 .cse4 .cse5 (<= 2 ULTIMATE.start_main_~j~0) .cse8 .cse7 (<= ULTIMATE.start_main_~l~0 1)) (and (< 0 ULTIMATE.start_main_~l~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse3 .cse2 .cse4 .cse5 .cse8 .cse7))) [2020-12-22 04:30:41,796 INFO L189 CegarLoopUtils]: For program point L18-3(lines 18 20) no Hoare annotation was computed. [2020-12-22 04:30:41,796 INFO L185 CegarLoopUtils]: At program point L18-5(lines 17 22) the Hoare annotation is: (and (< 0 ULTIMATE.start_main_~l~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (* 2 ULTIMATE.start_main_~l~0) ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0) (<= (+ ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~i~0) 2) (+ (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~j~0)) (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) (<= 1 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~r~0)) [2020-12-22 04:30:41,796 INFO L189 CegarLoopUtils]: For program point L18-6(lines 18 20) no Hoare annotation was computed. [2020-12-22 04:30:41,797 INFO L185 CegarLoopUtils]: At program point L18-8(lines 17 22) the Hoare annotation is: (let ((.cse6 (div ULTIMATE.start_main_~r~0 2)) (.cse0 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse1 (<= 1 ULTIMATE.start_main_~l~0)) (.cse3 (<= (* 2 ULTIMATE.start_main_~l~0) ULTIMATE.start_main_~j~0)) (.cse2 (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0)) (.cse4 (<= (+ ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~i~0) 2) (+ (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~j~0))) (.cse5 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse8 (<= 1 ULTIMATE.start_main_~i~0)) (.cse7 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~r~0))) (or (and .cse0 .cse1 (<= 2 ULTIMATE.start_main_~i~0) .cse2 .cse3 .cse4 .cse5 (<= (+ ULTIMATE.start_main_~l~0 1) .cse6) .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 (<= (+ (div (* ULTIMATE.start_main_~j~0 (- 1)) (- 2)) 1) .cse6)) (and .cse0 .cse1 .cse2 .cse4 .cse5 (<= 2 ULTIMATE.start_main_~j~0) .cse8 .cse7 (<= ULTIMATE.start_main_~l~0 1)) (and (< 0 ULTIMATE.start_main_~l~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse3 .cse2 .cse4 .cse5 .cse8 .cse7))) [2020-12-22 04:30:41,797 INFO L189 CegarLoopUtils]: For program point L18-9(lines 18 20) no Hoare annotation was computed. [2020-12-22 04:30:41,797 INFO L185 CegarLoopUtils]: At program point L18-11(lines 17 22) the Hoare annotation is: (and (< 0 ULTIMATE.start_main_~l~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (* 2 ULTIMATE.start_main_~l~0) ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0) (<= (+ ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~i~0) 2) (+ (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~j~0)) (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0) (<= 1 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~r~0)) [2020-12-22 04:30:41,797 INFO L189 CegarLoopUtils]: For program point L18-12(lines 18 20) no Hoare annotation was computed. [2020-12-22 04:30:41,797 INFO L185 CegarLoopUtils]: At program point L18-14(lines 17 22) the Hoare annotation is: (let ((.cse13 (* 2 ULTIMATE.start_main_~l~0))) (let ((.cse6 (<= .cse13 ULTIMATE.start_main_~j~0)) (.cse10 (<= .cse13 ULTIMATE.start_main_~r~0)) (.cse0 (<= 1 ULTIMATE.start_main_~r~0)) (.cse1 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse2 (<= 1 ULTIMATE.start_main_~l~0)) (.cse3 (<= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (.cse4 (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~n~0)) (.cse11 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse5 (<= (+ ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~i~0) 2) (+ (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~j~0))) (.cse8 (<= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~n~0)) (.cse7 (<= 2 ULTIMATE.start_main_~j~0)) (.cse9 (<= 1 ULTIMATE.start_main_~i~0)) (.cse12 (<= ULTIMATE.start_main_~l~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ ULTIMATE.start_main_~l~0 1) (div ULTIMATE.start_main_~r~0 2)) .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse7 .cse9 .cse12 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse8 .cse7 .cse9 .cse12)))) [2020-12-22 04:30:41,797 INFO L189 CegarLoopUtils]: For program point L18-15(lines 18 20) no Hoare annotation was computed. [2020-12-22 04:30:41,798 INFO L189 CegarLoopUtils]: For program point L35-1(lines 35 68) no Hoare annotation was computed. [2020-12-22 04:30:41,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 04:30:41 BoogieIcfgContainer [2020-12-22 04:30:41,871 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-22 04:30:41,873 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-22 04:30:41,873 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-22 04:30:41,874 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-22 04:30:41,874 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:30:18" (3/4) ... [2020-12-22 04:30:41,883 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-22 04:30:41,900 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2020-12-22 04:30:41,901 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-22 04:30:41,901 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-12-22 04:30:41,901 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-22 04:30:41,988 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-invgen/heapsort.i-witness.graphml [2020-12-22 04:30:41,988 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-22 04:30:41,989 INFO L168 Benchmark]: Toolchain (without parser) took 24344.63 ms. Allocated memory was 153.1 MB in the beginning and 429.9 MB in the end (delta: 276.8 MB). Free memory was 127.9 MB in the beginning and 368.6 MB in the end (delta: -240.7 MB). Peak memory consumption was 36.8 MB. Max. memory is 8.0 GB. [2020-12-22 04:30:41,990 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 153.1 MB. Free memory is still 124.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-22 04:30:41,990 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.34 ms. Allocated memory is still 153.1 MB. Free memory was 127.7 MB in the beginning and 117.3 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-12-22 04:30:41,991 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.31 ms. Allocated memory is still 153.1 MB. Free memory was 117.1 MB in the beginning and 115.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-22 04:30:41,991 INFO L168 Benchmark]: Boogie Preprocessor took 28.39 ms. Allocated memory is still 153.1 MB. Free memory was 115.4 MB in the beginning and 113.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-12-22 04:30:41,991 INFO L168 Benchmark]: RCFGBuilder took 840.22 ms. Allocated memory is still 153.1 MB. Free memory was 113.9 MB in the beginning and 129.9 MB in the end (delta: -16.0 MB). Peak memory consumption was 19.1 MB. Max. memory is 8.0 GB. [2020-12-22 04:30:41,992 INFO L168 Benchmark]: TraceAbstraction took 23020.34 ms. Allocated memory was 153.1 MB in the beginning and 429.9 MB in the end (delta: 276.8 MB). Free memory was 129.4 MB in the beginning and 373.3 MB in the end (delta: -243.9 MB). Peak memory consumption was 259.9 MB. Max. memory is 8.0 GB. [2020-12-22 04:30:41,992 INFO L168 Benchmark]: Witness Printer took 115.37 ms. Allocated memory is still 429.9 MB. Free memory was 373.3 MB in the beginning and 368.6 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2020-12-22 04:30:41,995 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 153.1 MB. Free memory is still 124.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 283.34 ms. Allocated memory is still 153.1 MB. Free memory was 127.7 MB in the beginning and 117.3 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 45.31 ms. Allocated memory is still 153.1 MB. Free memory was 117.1 MB in the beginning and 115.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 28.39 ms. Allocated memory is still 153.1 MB. Free memory was 115.4 MB in the beginning and 113.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 840.22 ms. Allocated memory is still 153.1 MB. Free memory was 113.9 MB in the beginning and 129.9 MB in the end (delta: -16.0 MB). Peak memory consumption was 19.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 23020.34 ms. Allocated memory was 153.1 MB in the beginning and 429.9 MB in the end (delta: 276.8 MB). Free memory was 129.4 MB in the beginning and 373.3 MB in the end (delta: -243.9 MB). Peak memory consumption was 259.9 MB. Max. memory is 8.0 GB. * Witness Printer took 115.37 ms. Allocated memory is still 429.9 MB. Free memory was 373.3 MB in the beginning and 368.6 MB in the end (delta: 4.7 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: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: 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 14 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((!(0 == cond) && 2 <= l) && r + 2 * i + 2 <= 2 * n + j) && 2 * l <= j) && r <= n) && 2 * l <= r - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((((((!(0 == cond) && 1 <= l) && 2 <= i) && j + 1 <= n) && 2 * l <= j) && r + 2 * i + 2 <= 2 * n + j) && r <= n) && l + 1 <= r / 2) && j <= r) || ((((((!(0 == cond) && 1 <= l) && 2 * l <= j) && r + 2 * i + 2 <= 2 * n + j) && r <= n) && 1 <= i) && j * -1 / -2 + 1 <= r / 2)) || ((((((((!(0 == cond) && 1 <= l) && j + 1 <= n) && r + 2 * i + 2 <= 2 * n + j) && r <= n) && 2 <= j) && 1 <= i) && j <= r) && l <= 1)) || (((((((0 < l && 1 == cond) && 2 * l <= j) && j + 1 <= n) && r + 2 * i + 2 <= 2 * n + j) && r <= n) && 1 <= i) && j <= r) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((((0 < l && j <= n) && i + 1 <= n) && 1 == cond) && 2 * l <= j) && r + 2 * i + 2 <= 2 * n + j) && r <= n) && 2 * l <= r) || (((((((1 <= r && r <= j) && 1 <= l) && i + 1 <= n) && j <= n) && 1 == cond) && 2 <= j) && l <= 1) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((0 < l && !(0 == cond)) && 2 * l <= j) && j + 1 <= n) && r + 2 * i + 2 <= 2 * n + j) && r <= n) && 1 <= i) && j <= r - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((2 <= l && 1 == cond) && r + 2 * i + 2 <= 2 * n + j) && 2 * l <= j) && r <= n) && 2 * l <= r - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((((((!(0 == cond) && 1 <= l) && i + 1 <= n) && j <= n) && r + 2 * i + 2 <= 2 * n + j) && 2 <= j) && r <= n) && l <= 1) && 2 * l <= r) || ((((((((!(0 == cond) && 1 <= l) && j <= n) && i + 1 <= n) && 2 * l <= j) && r + 2 * i + 2 <= 2 * n + j) && r <= n) && 1 <= i) && 2 * l <= r)) || (((((((((1 <= r && !(0 == cond)) && 1 <= l) && j <= n) && i + 1 <= n) && r + 2 * i + 2 <= 2 * n + j) && 2 <= j) && r <= n) && 1 <= i) && l <= 1)) || (((((((!(0 == cond) && 1 <= l) && j <= n) && i + 1 <= n) && 2 * l <= j) && r + 2 * i + 2 <= 2 * n + j) && r <= n) && l + 1 <= r / 2) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((1 <= r && 1 <= l) && 1 == cond) && r + 2 * i + 2 <= 2 * n + j) && 2 <= j) && r <= n) && l <= 1) && r + 2 * l <= 2 * n - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((((((!(0 == cond) && 1 <= l) && 2 <= i) && j + 1 <= n) && 2 * l <= j) && r + 2 * i + 2 <= 2 * n + j) && r <= n) && l + 1 <= r / 2) && j <= r) || ((((((!(0 == cond) && 1 <= l) && 2 * l <= j) && r + 2 * i + 2 <= 2 * n + j) && r <= n) && 1 <= i) && j * -1 / -2 + 1 <= r / 2)) || ((((((((!(0 == cond) && 1 <= l) && j + 1 <= n) && r + 2 * i + 2 <= 2 * n + j) && r <= n) && 2 <= j) && 1 <= i) && j <= r) && l <= 1)) || (((((((0 < l && 1 == cond) && 2 * l <= j) && j + 1 <= n) && r + 2 * i + 2 <= 2 * n + j) && r <= n) && 1 <= i) && j <= r) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((((1 <= r && !(0 == cond)) && r <= j) && 1 <= l) && i + 1 <= n) && j <= n) && 2 <= j) && l <= 1) || (((((((0 < l && !(0 == cond)) && i + 1 <= n) && j <= n) && 2 * l <= j) && r + 2 * i + 2 <= 2 * n + j) && r <= n) && 2 * l <= r) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((((((1 <= r && !(0 == cond)) && 1 <= l) && j <= n) && i + 1 <= n) && r + 2 * i + 2 <= 2 * n + j) && r <= n) && 2 <= j) && 1 <= i) && l <= 1) || ((((((((!(0 == cond) && 1 <= l) && j <= n) && i + 1 <= n) && r + 2 * i + 2 <= 2 * n + j) && 2 * l <= j) && r <= n) && 1 <= i) && 2 * l <= r) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((1 <= r && !(0 == cond)) && 1 <= l) && r + 2 * i + 2 <= 2 * n + j) && 2 <= j) && r <= n) && l <= 1) && r + 2 * l <= 2 * n - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((0 < l && !(0 == cond)) && 2 * l <= j) && j + 1 <= n) && r + 2 * i + 2 <= 2 * n + j) && r <= n) && 1 <= i) && j <= r - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((((((((1 <= r && !(0 == cond)) && 1 <= l) && i + 1 <= n) && j <= n) && r + 2 * i + 2 <= 2 * n + j) && 2 <= j) && r <= n) && l <= 1) && 2 * l <= r) || ((((((((((1 <= r && !(0 == cond)) && 1 <= l) && i + 1 <= n) && j <= n) && r + 2 * i + 2 <= 2 * n + j) && 2 * l <= j) && r <= n) && 2 <= j) && l + 1 <= r / 2) && 2 * l <= r)) || (((((((((1 <= r && !(0 == cond)) && 1 <= l) && i + 1 <= n) && j <= n) && 1 == cond) && r + 2 * i + 2 <= 2 * n + j) && 2 <= j) && r <= n) && l <= 1)) || ((((((((((1 <= r && !(0 == cond)) && 1 <= l) && j <= n) && i + 1 <= n) && 1 == cond) && r + 2 * i + 2 <= 2 * n + j) && 2 * l <= j) && r <= n) && 2 <= j) && 2 * l <= r) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((((((((((1 <= r && !(0 == cond)) && 1 <= l) && j <= n) && i + 1 <= n) && r + 2 * i + 2 <= 2 * n + j) && 2 * l <= j) && 2 <= j) && r <= n) && 1 <= i) && l + 1 <= r / 2) && 2 * l <= r) || (((((((((((1 <= r && !(0 == cond)) && 1 <= l) && j <= n) && i + 1 <= n) && 1 == cond) && r + 2 * i + 2 <= 2 * n + j) && 2 * l <= j) && 2 <= j) && r <= n) && 1 <= i) && 2 * l <= r)) || ((((((((((1 <= r && !(0 == cond)) && 1 <= l) && j <= n) && i + 1 <= n) && r + 2 * i + 2 <= 2 * n + j) && r <= n) && 2 <= j) && 1 <= i) && l <= 1) && 2 * l <= r)) || ((((((((((1 <= r && !(0 == cond)) && 1 <= l) && j <= n) && i + 1 <= n) && 1 == cond) && r + 2 * i + 2 <= 2 * n + j) && r <= n) && 2 <= j) && 1 <= i) && l <= 1) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((((((((((1 <= r && !(0 == cond)) && 1 <= l) && 2 <= i) && r + 2 * i + 2 <= 2 * n + j) && r <= n) && l <= 1) && 3 <= j) && r + 2 * l <= 2 * n) || (((((0 < l && 2 * l <= j) && r + 2 * i + 2 <= 2 * n + j) && r <= n) && 1 <= i) && j <= r)) || ((((((0 < l && !(0 == cond)) && 2 <= i) && 2 * l <= j) && r + 2 * i + 2 <= 2 * n + j) && r <= n) && 2 * l <= r)) || ((((((((1 <= r && 0 < l) && j <= n) && 1 == cond) && r + 2 * i + 2 <= 2 * n + j) && r <= n) && 2 <= j) && 1 <= i) && l <= 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 71 locations, 14 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 11.0s, OverallIterations: 21, TraceHistogramMax: 3, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1149 SDtfs, 2894 SDslu, 1751 SDs, 0 SdLazy, 2614 SolverSat, 1279 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 452 GetRequests, 234 SyntacticMatches, 6 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1099 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=334occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 1447 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 193 NumberOfFragments, 1504 HoareAnnotationTreeSize, 16 FomulaSimplifications, 84354112 FormulaSimplificationTreeSizeReduction, 3.2s HoareSimplificationTime, 16 FomulaSimplificationsInter, 2690758 FormulaSimplificationTreeSizeReductionInter, 8.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 623 NumberOfCodeBlocks, 623 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 597 ConstructedInterpolants, 0 QuantifiedInterpolants, 71316 SizeOfPredicates, 19 NumberOfNonLiveVariables, 692 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 26 InterpolantComputations, 17 PerfectInterpolantSequences, 65/142 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...