/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-bitabs-178dd20 [2021-01-06 16:49:32,296 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 16:49:32,298 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 16:49:32,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 16:49:32,335 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 16:49:32,336 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 16:49:32,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 16:49:32,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 16:49:32,342 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 16:49:32,343 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 16:49:32,344 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 16:49:32,346 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 16:49:32,346 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 16:49:32,347 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 16:49:32,348 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 16:49:32,350 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 16:49:32,351 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 16:49:32,367 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 16:49:32,370 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 16:49:32,373 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 16:49:32,378 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 16:49:32,379 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 16:49:32,381 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 16:49:32,382 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 16:49:32,385 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 16:49:32,385 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 16:49:32,386 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 16:49:32,387 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 16:49:32,387 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 16:49:32,388 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 16:49:32,389 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 16:49:32,390 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 16:49:32,390 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 16:49:32,391 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 16:49:32,393 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 16:49:32,393 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 16:49:32,394 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 16:49:32,394 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 16:49:32,394 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 16:49:32,396 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 16:49:32,396 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 16:49:32,399 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 16:49:32,426 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 16:49:32,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 16:49:32,428 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 16:49:32,428 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 16:49:32,429 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 16:49:32,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 16:49:32,429 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 16:49:32,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 16:49:32,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 16:49:32,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 16:49:32,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 16:49:32,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 16:49:32,431 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 16:49:32,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 16:49:32,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 16:49:32,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 16:49:32,431 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 16:49:32,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 16:49:32,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 16:49:32,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 16:49:32,432 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 16:49:32,432 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 16:49:32,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 16:49:32,433 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 16:49:32,433 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 16:49:32,433 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 16:49:32,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 16:49:32,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 16:49:32,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 16:49:32,847 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 16:49:32,848 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 16:49:32,849 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/heapsort.i [2021-01-06 16:49:32,938 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7a99fb766/ddce6d35a39848f7b7e17ee4be89ac00/FLAG5306cd8c0 [2021-01-06 16:49:33,626 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 16:49:33,627 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i [2021-01-06 16:49:33,634 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7a99fb766/ddce6d35a39848f7b7e17ee4be89ac00/FLAG5306cd8c0 [2021-01-06 16:49:33,963 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7a99fb766/ddce6d35a39848f7b7e17ee4be89ac00 [2021-01-06 16:49:33,967 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 16:49:33,969 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 16:49:33,973 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 16:49:33,973 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 16:49:33,976 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 16:49:33,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:49:33" (1/1) ... [2021-01-06 16:49:33,980 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5af8d1db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:49:33, skipping insertion in model container [2021-01-06 16:49:33,980 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:49:33" (1/1) ... [2021-01-06 16:49:33,989 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 16:49:34,010 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 16:49:34,182 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: lhs: VariableLHS[~r~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~j~0,] left hand side expression in assignment: lhs: VariableLHS[~j~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~j~0,] [2021-01-06 16:49:34,216 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:49:34,234 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 16:49:34,251 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: lhs: VariableLHS[~r~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~j~0,] left hand side expression in assignment: lhs: VariableLHS[~j~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~j~0,] [2021-01-06 16:49:34,285 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:49:34,308 INFO L208 MainTranslator]: Completed translation [2021-01-06 16:49:34,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:49:34 WrapperNode [2021-01-06 16:49:34,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 16:49:34,311 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 16:49:34,311 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 16:49:34,311 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 16:49:34,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:49:34" (1/1) ... [2021-01-06 16:49:34,333 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:49:34" (1/1) ... [2021-01-06 16:49:34,361 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 16:49:34,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 16:49:34,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 16:49:34,362 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 16:49:34,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:49:34" (1/1) ... [2021-01-06 16:49:34,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:49:34" (1/1) ... [2021-01-06 16:49:34,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:49:34" (1/1) ... [2021-01-06 16:49:34,376 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:49:34" (1/1) ... [2021-01-06 16:49:34,382 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:49:34" (1/1) ... [2021-01-06 16:49:34,388 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:49:34" (1/1) ... [2021-01-06 16:49:34,390 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:49:34" (1/1) ... [2021-01-06 16:49:34,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 16:49:34,394 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 16:49:34,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 16:49:34,394 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 16:49:34,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:49:34" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 16:49:34,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 16:49:34,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 16:49:34,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 16:49:34,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 16:49:35,171 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 16:49:35,171 INFO L299 CfgBuilder]: Removed 34 assume(true) statements. [2021-01-06 16:49:35,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:49:35 BoogieIcfgContainer [2021-01-06 16:49:35,174 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 16:49:35,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 16:49:35,177 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 16:49:35,180 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 16:49:35,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 04:49:33" (1/3) ... [2021-01-06 16:49:35,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731c02d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:49:35, skipping insertion in model container [2021-01-06 16:49:35,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:49:34" (2/3) ... [2021-01-06 16:49:35,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731c02d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:49:35, skipping insertion in model container [2021-01-06 16:49:35,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:49:35" (3/3) ... [2021-01-06 16:49:35,188 INFO L111 eAbstractionObserver]: Analyzing ICFG heapsort.i [2021-01-06 16:49:35,194 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 16:49:35,199 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2021-01-06 16:49:35,218 INFO L253 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2021-01-06 16:49:35,262 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 16:49:35,262 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 16:49:35,262 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 16:49:35,263 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 16:49:35,263 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 16:49:35,263 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 16:49:35,263 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 16:49:35,263 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 16:49:35,285 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2021-01-06 16:49:35,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-01-06 16:49:35,290 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:49:35,291 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:49:35,292 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]=== [2021-01-06 16:49:35,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:49:35,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1222313301, now seen corresponding path program 1 times [2021-01-06 16:49:35,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:49:35,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180408751] [2021-01-06 16:49:35,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:49:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:49:35,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:49:35,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180408751] [2021-01-06 16:49:35,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:49:35,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 16:49:35,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880543856] [2021-01-06 16:49:35,466 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 16:49:35,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:49:35,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 16:49:35,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 16:49:35,483 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 2 states. [2021-01-06 16:49:35,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:49:35,509 INFO L93 Difference]: Finished difference Result 138 states and 182 transitions. [2021-01-06 16:49:35,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 16:49:35,510 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2021-01-06 16:49:35,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:49:35,521 INFO L225 Difference]: With dead ends: 138 [2021-01-06 16:49:35,522 INFO L226 Difference]: Without dead ends: 67 [2021-01-06 16:49:35,525 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 [2021-01-06 16:49:35,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-01-06 16:49:35,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-01-06 16:49:35,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2021-01-06 16:49:35,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2021-01-06 16:49:35,568 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 9 [2021-01-06 16:49:35,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:49:35,568 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2021-01-06 16:49:35,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 16:49:35,569 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2021-01-06 16:49:35,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-01-06 16:49:35,569 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:49:35,570 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:49:35,570 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 16:49:35,570 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]=== [2021-01-06 16:49:35,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:49:35,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1218380889, now seen corresponding path program 1 times [2021-01-06 16:49:35,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:49:35,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879276811] [2021-01-06 16:49:35,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:49:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:49:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:49:35,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879276811] [2021-01-06 16:49:35,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:49:35,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 16:49:35,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454420525] [2021-01-06 16:49:35,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 16:49:35,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:49:35,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 16:49:35,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 16:49:35,639 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 3 states. [2021-01-06 16:49:35,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:49:35,756 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2021-01-06 16:49:35,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 16:49:35,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2021-01-06 16:49:35,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:49:35,759 INFO L225 Difference]: With dead ends: 72 [2021-01-06 16:49:35,760 INFO L226 Difference]: Without dead ends: 70 [2021-01-06 16:49:35,761 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 [2021-01-06 16:49:35,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-01-06 16:49:35,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2021-01-06 16:49:35,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2021-01-06 16:49:35,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2021-01-06 16:49:35,771 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 9 [2021-01-06 16:49:35,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:49:35,771 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2021-01-06 16:49:35,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 16:49:35,772 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2021-01-06 16:49:35,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-01-06 16:49:35,772 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:49:35,772 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:49:35,773 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 16:49:35,773 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]=== [2021-01-06 16:49:35,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:49:35,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1218404721, now seen corresponding path program 1 times [2021-01-06 16:49:35,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:49:35,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118389900] [2021-01-06 16:49:35,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:49:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:49:35,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:49:35,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118389900] [2021-01-06 16:49:35,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:49:35,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 16:49:35,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993336375] [2021-01-06 16:49:35,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 16:49:35,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:49:35,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 16:49:35,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 16:49:35,843 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 4 states. [2021-01-06 16:49:36,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:49:36,011 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2021-01-06 16:49:36,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:49:36,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2021-01-06 16:49:36,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:49:36,013 INFO L225 Difference]: With dead ends: 72 [2021-01-06 16:49:36,013 INFO L226 Difference]: Without dead ends: 70 [2021-01-06 16:49:36,014 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 [2021-01-06 16:49:36,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-01-06 16:49:36,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2021-01-06 16:49:36,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2021-01-06 16:49:36,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2021-01-06 16:49:36,025 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 9 [2021-01-06 16:49:36,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:49:36,026 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2021-01-06 16:49:36,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 16:49:36,026 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2021-01-06 16:49:36,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-01-06 16:49:36,027 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:49:36,027 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:49:36,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 16:49:36,028 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]=== [2021-01-06 16:49:36,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:49:36,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1218310388, now seen corresponding path program 1 times [2021-01-06 16:49:36,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:49:36,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296680183] [2021-01-06 16:49:36,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:49:36,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:49:36,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:49:36,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296680183] [2021-01-06 16:49:36,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:49:36,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:49:36,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683866624] [2021-01-06 16:49:36,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:49:36,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:49:36,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:49:36,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:49:36,110 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 5 states. [2021-01-06 16:49:36,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:49:36,529 INFO L93 Difference]: Finished difference Result 128 states and 142 transitions. [2021-01-06 16:49:36,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 16:49:36,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2021-01-06 16:49:36,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:49:36,556 INFO L225 Difference]: With dead ends: 128 [2021-01-06 16:49:36,556 INFO L226 Difference]: Without dead ends: 120 [2021-01-06 16:49:36,557 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 [2021-01-06 16:49:36,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-01-06 16:49:36,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 94. [2021-01-06 16:49:36,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2021-01-06 16:49:36,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2021-01-06 16:49:36,587 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 9 [2021-01-06 16:49:36,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:49:36,587 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2021-01-06 16:49:36,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:49:36,587 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2021-01-06 16:49:36,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-06 16:49:36,588 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:49:36,588 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:49:36,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 16:49:36,589 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]=== [2021-01-06 16:49:36,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:49:36,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1661877060, now seen corresponding path program 1 times [2021-01-06 16:49:36,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:49:36,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820531127] [2021-01-06 16:49:36,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:49:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:49:36,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:49:36,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820531127] [2021-01-06 16:49:36,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:49:36,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 16:49:36,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287068889] [2021-01-06 16:49:36,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 16:49:36,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:49:36,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 16:49:36,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:49:36,660 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand 6 states. [2021-01-06 16:49:36,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:49:36,951 INFO L93 Difference]: Finished difference Result 156 states and 185 transitions. [2021-01-06 16:49:36,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 16:49:36,952 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2021-01-06 16:49:36,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:49:36,958 INFO L225 Difference]: With dead ends: 156 [2021-01-06 16:49:36,958 INFO L226 Difference]: Without dead ends: 154 [2021-01-06 16:49:36,960 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 [2021-01-06 16:49:36,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-01-06 16:49:36,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 128. [2021-01-06 16:49:36,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2021-01-06 16:49:37,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2021-01-06 16:49:37,006 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 158 transitions. Word has length 11 [2021-01-06 16:49:37,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:49:37,006 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 158 transitions. [2021-01-06 16:49:37,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 16:49:37,007 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2021-01-06 16:49:37,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-06 16:49:37,008 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:49:37,008 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:49:37,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 16:49:37,009 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]=== [2021-01-06 16:49:37,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:49:37,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1638973740, now seen corresponding path program 1 times [2021-01-06 16:49:37,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:49:37,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237247850] [2021-01-06 16:49:37,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:49:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:49:37,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:49:37,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237247850] [2021-01-06 16:49:37,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:49:37,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 16:49:37,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654846602] [2021-01-06 16:49:37,059 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 16:49:37,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:49:37,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 16:49:37,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 16:49:37,061 INFO L87 Difference]: Start difference. First operand 128 states and 158 transitions. Second operand 4 states. [2021-01-06 16:49:37,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:49:37,161 INFO L93 Difference]: Finished difference Result 138 states and 174 transitions. [2021-01-06 16:49:37,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 16:49:37,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2021-01-06 16:49:37,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:49:37,163 INFO L225 Difference]: With dead ends: 138 [2021-01-06 16:49:37,163 INFO L226 Difference]: Without dead ends: 136 [2021-01-06 16:49:37,164 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 [2021-01-06 16:49:37,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-01-06 16:49:37,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 126. [2021-01-06 16:49:37,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2021-01-06 16:49:37,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 154 transitions. [2021-01-06 16:49:37,179 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 154 transitions. Word has length 11 [2021-01-06 16:49:37,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:49:37,180 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 154 transitions. [2021-01-06 16:49:37,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 16:49:37,180 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 154 transitions. [2021-01-06 16:49:37,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-06 16:49:37,181 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:49:37,181 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:49:37,181 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 16:49:37,181 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]=== [2021-01-06 16:49:37,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:49:37,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1729632713, now seen corresponding path program 1 times [2021-01-06 16:49:37,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:49:37,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891964905] [2021-01-06 16:49:37,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:49:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:49:37,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:49:37,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891964905] [2021-01-06 16:49:37,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:49:37,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 16:49:37,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35031776] [2021-01-06 16:49:37,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 16:49:37,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:49:37,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 16:49:37,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:49:37,250 INFO L87 Difference]: Start difference. First operand 126 states and 154 transitions. Second operand 6 states. [2021-01-06 16:49:37,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:49:37,564 INFO L93 Difference]: Finished difference Result 235 states and 279 transitions. [2021-01-06 16:49:37,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 16:49:37,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2021-01-06 16:49:37,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:49:37,567 INFO L225 Difference]: With dead ends: 235 [2021-01-06 16:49:37,567 INFO L226 Difference]: Without dead ends: 229 [2021-01-06 16:49:37,568 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 [2021-01-06 16:49:37,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-01-06 16:49:37,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 174. [2021-01-06 16:49:37,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2021-01-06 16:49:37,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 220 transitions. [2021-01-06 16:49:37,590 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 220 transitions. Word has length 11 [2021-01-06 16:49:37,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:49:37,590 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 220 transitions. [2021-01-06 16:49:37,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 16:49:37,590 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 220 transitions. [2021-01-06 16:49:37,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-06 16:49:37,591 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:49:37,591 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:49:37,591 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 16:49:37,592 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]=== [2021-01-06 16:49:37,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:49:37,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1823743610, now seen corresponding path program 1 times [2021-01-06 16:49:37,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:49:37,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460604507] [2021-01-06 16:49:37,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:49:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:49:37,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:49:37,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460604507] [2021-01-06 16:49:37,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:49:37,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 16:49:37,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366146670] [2021-01-06 16:49:37,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 16:49:37,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:49:37,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 16:49:37,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 16:49:37,637 INFO L87 Difference]: Start difference. First operand 174 states and 220 transitions. Second operand 3 states. [2021-01-06 16:49:37,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:49:37,685 INFO L93 Difference]: Finished difference Result 375 states and 471 transitions. [2021-01-06 16:49:37,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 16:49:37,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2021-01-06 16:49:37,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:49:37,688 INFO L225 Difference]: With dead ends: 375 [2021-01-06 16:49:37,689 INFO L226 Difference]: Without dead ends: 291 [2021-01-06 16:49:37,690 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 16:49:37,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-01-06 16:49:37,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 271. [2021-01-06 16:49:37,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2021-01-06 16:49:37,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 358 transitions. [2021-01-06 16:49:37,718 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 358 transitions. Word has length 11 [2021-01-06 16:49:37,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:49:37,719 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 358 transitions. [2021-01-06 16:49:37,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 16:49:37,719 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 358 transitions. [2021-01-06 16:49:37,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-06 16:49:37,723 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:49:37,723 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:49:37,723 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 16:49:37,723 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]=== [2021-01-06 16:49:37,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:49:37,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1755987957, now seen corresponding path program 1 times [2021-01-06 16:49:37,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:49:37,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259638402] [2021-01-06 16:49:37,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:49:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:49:37,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:49:37,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259638402] [2021-01-06 16:49:37,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:49:37,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 16:49:37,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918340432] [2021-01-06 16:49:37,802 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 16:49:37,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:49:37,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 16:49:37,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 16:49:37,806 INFO L87 Difference]: Start difference. First operand 271 states and 358 transitions. Second operand 4 states. [2021-01-06 16:49:37,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:49:37,869 INFO L93 Difference]: Finished difference Result 284 states and 365 transitions. [2021-01-06 16:49:37,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 16:49:37,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2021-01-06 16:49:37,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:49:37,872 INFO L225 Difference]: With dead ends: 284 [2021-01-06 16:49:37,872 INFO L226 Difference]: Without dead ends: 240 [2021-01-06 16:49:37,873 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 [2021-01-06 16:49:37,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-01-06 16:49:37,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2021-01-06 16:49:37,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2021-01-06 16:49:37,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 316 transitions. [2021-01-06 16:49:37,894 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 316 transitions. Word has length 11 [2021-01-06 16:49:37,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:49:37,894 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 316 transitions. [2021-01-06 16:49:37,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 16:49:37,894 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 316 transitions. [2021-01-06 16:49:37,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-01-06 16:49:37,895 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:49:37,895 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:49:37,895 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 16:49:37,896 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]=== [2021-01-06 16:49:37,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:49:37,896 INFO L82 PathProgramCache]: Analyzing trace with hash -2105123171, now seen corresponding path program 1 times [2021-01-06 16:49:37,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:49:37,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194177292] [2021-01-06 16:49:37,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:49:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:49:37,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:49:37,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194177292] [2021-01-06 16:49:37,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:49:37,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:49:37,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892037733] [2021-01-06 16:49:37,961 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:49:37,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:49:37,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:49:37,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:49:37,964 INFO L87 Difference]: Start difference. First operand 240 states and 316 transitions. Second operand 5 states. [2021-01-06 16:49:38,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:49:38,145 INFO L93 Difference]: Finished difference Result 380 states and 493 transitions. [2021-01-06 16:49:38,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 16:49:38,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2021-01-06 16:49:38,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:49:38,159 INFO L225 Difference]: With dead ends: 380 [2021-01-06 16:49:38,159 INFO L226 Difference]: Without dead ends: 372 [2021-01-06 16:49:38,161 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 [2021-01-06 16:49:38,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-01-06 16:49:38,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 200. [2021-01-06 16:49:38,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2021-01-06 16:49:38,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 258 transitions. [2021-01-06 16:49:38,185 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 258 transitions. Word has length 15 [2021-01-06 16:49:38,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:49:38,185 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 258 transitions. [2021-01-06 16:49:38,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:49:38,185 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 258 transitions. [2021-01-06 16:49:38,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-01-06 16:49:38,188 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:49:38,188 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:49:38,188 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 16:49:38,189 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]=== [2021-01-06 16:49:38,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:49:38,189 INFO L82 PathProgramCache]: Analyzing trace with hash 639895389, now seen corresponding path program 1 times [2021-01-06 16:49:38,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:49:38,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109297287] [2021-01-06 16:49:38,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:49:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:49:38,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:49:38,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109297287] [2021-01-06 16:49:38,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:49:38,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:49:38,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906765198] [2021-01-06 16:49:38,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:49:38,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:49:38,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:49:38,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:49:38,257 INFO L87 Difference]: Start difference. First operand 200 states and 258 transitions. Second operand 5 states. [2021-01-06 16:49:38,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:49:38,413 INFO L93 Difference]: Finished difference Result 302 states and 372 transitions. [2021-01-06 16:49:38,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 16:49:38,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2021-01-06 16:49:38,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:49:38,415 INFO L225 Difference]: With dead ends: 302 [2021-01-06 16:49:38,416 INFO L226 Difference]: Without dead ends: 300 [2021-01-06 16:49:38,416 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 [2021-01-06 16:49:38,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-01-06 16:49:38,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 246. [2021-01-06 16:49:38,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2021-01-06 16:49:38,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 312 transitions. [2021-01-06 16:49:38,439 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 312 transitions. Word has length 15 [2021-01-06 16:49:38,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:49:38,439 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 312 transitions. [2021-01-06 16:49:38,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:49:38,439 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 312 transitions. [2021-01-06 16:49:38,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-06 16:49:38,440 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:49:38,440 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:49:38,440 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 16:49:38,441 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]=== [2021-01-06 16:49:38,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:49:38,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1672864291, now seen corresponding path program 1 times [2021-01-06 16:49:38,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:49:38,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347107662] [2021-01-06 16:49:38,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:49:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:49:38,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:49:38,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347107662] [2021-01-06 16:49:38,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:49:38,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:49:38,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912462157] [2021-01-06 16:49:38,495 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:49:38,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:49:38,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:49:38,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:49:38,496 INFO L87 Difference]: Start difference. First operand 246 states and 312 transitions. Second operand 5 states. [2021-01-06 16:49:38,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:49:38,678 INFO L93 Difference]: Finished difference Result 734 states and 889 transitions. [2021-01-06 16:49:38,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 16:49:38,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2021-01-06 16:49:38,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:49:38,681 INFO L225 Difference]: With dead ends: 734 [2021-01-06 16:49:38,681 INFO L226 Difference]: Without dead ends: 556 [2021-01-06 16:49:38,685 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 [2021-01-06 16:49:38,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2021-01-06 16:49:38,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 246. [2021-01-06 16:49:38,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2021-01-06 16:49:38,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 310 transitions. [2021-01-06 16:49:38,717 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 310 transitions. Word has length 16 [2021-01-06 16:49:38,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:49:38,717 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 310 transitions. [2021-01-06 16:49:38,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:49:38,717 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 310 transitions. [2021-01-06 16:49:38,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-01-06 16:49:38,718 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:49:38,718 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:49:38,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 16:49:38,718 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]=== [2021-01-06 16:49:38,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:49:38,719 INFO L82 PathProgramCache]: Analyzing trace with hash 759304320, now seen corresponding path program 1 times [2021-01-06 16:49:38,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:49:38,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970397315] [2021-01-06 16:49:38,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:49:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:49:38,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:49:38,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970397315] [2021-01-06 16:49:38,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:49:38,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 16:49:38,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253217697] [2021-01-06 16:49:38,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 16:49:38,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:49:38,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 16:49:38,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:49:38,800 INFO L87 Difference]: Start difference. First operand 246 states and 310 transitions. Second operand 6 states. [2021-01-06 16:49:39,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:49:39,011 INFO L93 Difference]: Finished difference Result 380 states and 474 transitions. [2021-01-06 16:49:39,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 16:49:39,012 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2021-01-06 16:49:39,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:49:39,014 INFO L225 Difference]: With dead ends: 380 [2021-01-06 16:49:39,015 INFO L226 Difference]: Without dead ends: 378 [2021-01-06 16:49:39,015 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 [2021-01-06 16:49:39,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2021-01-06 16:49:39,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 308. [2021-01-06 16:49:39,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2021-01-06 16:49:39,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 392 transitions. [2021-01-06 16:49:39,047 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 392 transitions. Word has length 17 [2021-01-06 16:49:39,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:49:39,048 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 392 transitions. [2021-01-06 16:49:39,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 16:49:39,048 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 392 transitions. [2021-01-06 16:49:39,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-06 16:49:39,048 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:49:39,049 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:49:39,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 16:49:39,049 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]=== [2021-01-06 16:49:39,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:49:39,050 INFO L82 PathProgramCache]: Analyzing trace with hash -750791926, now seen corresponding path program 1 times [2021-01-06 16:49:39,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:49:39,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107921348] [2021-01-06 16:49:39,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:49:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:49:39,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:49:39,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107921348] [2021-01-06 16:49:39,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:49:39,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 16:49:39,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133911903] [2021-01-06 16:49:39,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 16:49:39,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:49:39,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 16:49:39,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:49:39,111 INFO L87 Difference]: Start difference. First operand 308 states and 392 transitions. Second operand 6 states. [2021-01-06 16:49:39,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:49:39,343 INFO L93 Difference]: Finished difference Result 410 states and 504 transitions. [2021-01-06 16:49:39,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 16:49:39,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2021-01-06 16:49:39,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:49:39,346 INFO L225 Difference]: With dead ends: 410 [2021-01-06 16:49:39,346 INFO L226 Difference]: Without dead ends: 406 [2021-01-06 16:49:39,348 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 [2021-01-06 16:49:39,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-01-06 16:49:39,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 216. [2021-01-06 16:49:39,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2021-01-06 16:49:39,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 266 transitions. [2021-01-06 16:49:39,376 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 266 transitions. Word has length 21 [2021-01-06 16:49:39,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:49:39,377 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 266 transitions. [2021-01-06 16:49:39,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 16:49:39,377 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 266 transitions. [2021-01-06 16:49:39,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-06 16:49:39,378 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:49:39,378 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] [2021-01-06 16:49:39,378 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 16:49:39,379 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]=== [2021-01-06 16:49:39,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:49:39,379 INFO L82 PathProgramCache]: Analyzing trace with hash -234606263, now seen corresponding path program 1 times [2021-01-06 16:49:39,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:49:39,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528918907] [2021-01-06 16:49:39,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:49:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:49:39,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:49:39,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528918907] [2021-01-06 16:49:39,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:49:39,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 16:49:39,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30444769] [2021-01-06 16:49:39,449 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 16:49:39,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:49:39,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 16:49:39,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:49:39,451 INFO L87 Difference]: Start difference. First operand 216 states and 266 transitions. Second operand 6 states. [2021-01-06 16:49:39,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:49:39,610 INFO L93 Difference]: Finished difference Result 217 states and 267 transitions. [2021-01-06 16:49:39,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 16:49:39,611 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2021-01-06 16:49:39,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:49:39,613 INFO L225 Difference]: With dead ends: 217 [2021-01-06 16:49:39,613 INFO L226 Difference]: Without dead ends: 209 [2021-01-06 16:49:39,615 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 [2021-01-06 16:49:39,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-01-06 16:49:39,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2021-01-06 16:49:39,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2021-01-06 16:49:39,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 248 transitions. [2021-01-06 16:49:39,641 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 248 transitions. Word has length 23 [2021-01-06 16:49:39,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:49:39,641 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 248 transitions. [2021-01-06 16:49:39,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 16:49:39,641 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 248 transitions. [2021-01-06 16:49:39,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-01-06 16:49:39,642 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:49:39,642 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] [2021-01-06 16:49:39,643 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 16:49:39,643 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]=== [2021-01-06 16:49:39,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:49:39,643 INFO L82 PathProgramCache]: Analyzing trace with hash -900992014, now seen corresponding path program 1 times [2021-01-06 16:49:39,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:49:39,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191238665] [2021-01-06 16:49:39,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:49:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:49:39,711 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:49:39,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191238665] [2021-01-06 16:49:39,714 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:49:39,714 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 16:49:39,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681527143] [2021-01-06 16:49:39,715 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 16:49:39,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:49:39,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 16:49:39,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:49:39,716 INFO L87 Difference]: Start difference. First operand 208 states and 248 transitions. Second operand 6 states. [2021-01-06 16:49:39,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:49:39,882 INFO L93 Difference]: Finished difference Result 250 states and 291 transitions. [2021-01-06 16:49:39,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 16:49:39,883 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2021-01-06 16:49:39,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:49:39,886 INFO L225 Difference]: With dead ends: 250 [2021-01-06 16:49:39,887 INFO L226 Difference]: Without dead ends: 248 [2021-01-06 16:49:39,887 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 [2021-01-06 16:49:39,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-01-06 16:49:39,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 110. [2021-01-06 16:49:39,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2021-01-06 16:49:39,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 128 transitions. [2021-01-06 16:49:39,904 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 128 transitions. Word has length 29 [2021-01-06 16:49:39,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:49:39,904 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 128 transitions. [2021-01-06 16:49:39,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 16:49:39,905 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2021-01-06 16:49:39,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-06 16:49:39,908 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:49:39,909 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] [2021-01-06 16:49:39,909 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 16:49:39,909 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]=== [2021-01-06 16:49:39,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:49:39,911 INFO L82 PathProgramCache]: Analyzing trace with hash 5957045, now seen corresponding path program 1 times [2021-01-06 16:49:39,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:49:39,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309004592] [2021-01-06 16:49:39,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:49:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:49:39,993 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:49:39,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309004592] [2021-01-06 16:49:39,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064556411] [2021-01-06 16:49:39,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 16:49:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:49:40,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-06 16:49:40,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:49:40,323 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:49:40,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 16:49:40,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2021-01-06 16:49:40,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64697022] [2021-01-06 16:49:40,324 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 16:49:40,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:49:40,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 16:49:40,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-01-06 16:49:40,325 INFO L87 Difference]: Start difference. First operand 110 states and 128 transitions. Second operand 6 states. [2021-01-06 16:49:40,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:49:40,608 INFO L93 Difference]: Finished difference Result 399 states and 463 transitions. [2021-01-06 16:49:40,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 16:49:40,608 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2021-01-06 16:49:40,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:49:40,611 INFO L225 Difference]: With dead ends: 399 [2021-01-06 16:49:40,611 INFO L226 Difference]: Without dead ends: 293 [2021-01-06 16:49:40,612 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 [2021-01-06 16:49:40,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-01-06 16:49:40,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 256. [2021-01-06 16:49:40,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2021-01-06 16:49:40,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 302 transitions. [2021-01-06 16:49:40,687 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 302 transitions. Word has length 31 [2021-01-06 16:49:40,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:49:40,687 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 302 transitions. [2021-01-06 16:49:40,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 16:49:40,687 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 302 transitions. [2021-01-06 16:49:40,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-06 16:49:40,688 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:49:40,688 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] [2021-01-06 16:49:40,902 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-06 16:49:40,903 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]=== [2021-01-06 16:49:40,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:49:40,904 INFO L82 PathProgramCache]: Analyzing trace with hash -971191967, now seen corresponding path program 1 times [2021-01-06 16:49:40,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:49:40,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952839506] [2021-01-06 16:49:40,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:49:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:49:40,964 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:49:40,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952839506] [2021-01-06 16:49:40,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791484367] [2021-01-06 16:49:40,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 16:49:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:49:41,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjunts are in the unsatisfiable core [2021-01-06 16:49:41,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:49:41,100 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:49:41,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:49:41,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-01-06 16:49:41,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300519169] [2021-01-06 16:49:41,101 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 16:49:41,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:49:41,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 16:49:41,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-01-06 16:49:41,102 INFO L87 Difference]: Start difference. First operand 256 states and 302 transitions. Second operand 8 states. [2021-01-06 16:49:41,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:49:41,631 INFO L93 Difference]: Finished difference Result 411 states and 475 transitions. [2021-01-06 16:49:41,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-06 16:49:41,632 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2021-01-06 16:49:41,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:49:41,635 INFO L225 Difference]: With dead ends: 411 [2021-01-06 16:49:41,635 INFO L226 Difference]: Without dead ends: 409 [2021-01-06 16:49:41,636 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 [2021-01-06 16:49:41,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2021-01-06 16:49:41,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 334. [2021-01-06 16:49:41,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2021-01-06 16:49:41,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 392 transitions. [2021-01-06 16:49:41,692 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 392 transitions. Word has length 40 [2021-01-06 16:49:41,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:49:41,693 INFO L481 AbstractCegarLoop]: Abstraction has 334 states and 392 transitions. [2021-01-06 16:49:41,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 16:49:41,693 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 392 transitions. [2021-01-06 16:49:41,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-06 16:49:41,694 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:49:41,694 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] [2021-01-06 16:49:41,909 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-01-06 16:49:41,910 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]=== [2021-01-06 16:49:41,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:49:41,911 INFO L82 PathProgramCache]: Analyzing trace with hash -830643357, now seen corresponding path program 1 times [2021-01-06 16:49:41,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:49:41,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247739389] [2021-01-06 16:49:41,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:49:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:49:41,960 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:49:41,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247739389] [2021-01-06 16:49:41,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166413223] [2021-01-06 16:49:41,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 16:49:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:49:42,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2021-01-06 16:49:42,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:49:42,101 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:49:42,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:49:42,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-01-06 16:49:42,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248011403] [2021-01-06 16:49:42,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 16:49:42,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:49:42,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 16:49:42,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-06 16:49:42,104 INFO L87 Difference]: Start difference. First operand 334 states and 392 transitions. Second operand 7 states. [2021-01-06 16:49:42,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:49:42,494 INFO L93 Difference]: Finished difference Result 375 states and 432 transitions. [2021-01-06 16:49:42,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 16:49:42,495 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2021-01-06 16:49:42,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:49:42,497 INFO L225 Difference]: With dead ends: 375 [2021-01-06 16:49:42,497 INFO L226 Difference]: Without dead ends: 373 [2021-01-06 16:49:42,498 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 [2021-01-06 16:49:42,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-01-06 16:49:42,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 256. [2021-01-06 16:49:42,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2021-01-06 16:49:42,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 298 transitions. [2021-01-06 16:49:42,541 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 298 transitions. Word has length 40 [2021-01-06 16:49:42,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:49:42,542 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 298 transitions. [2021-01-06 16:49:42,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 16:49:42,542 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 298 transitions. [2021-01-06 16:49:42,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-06 16:49:42,543 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:49:42,543 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] [2021-01-06 16:49:42,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:49:42,757 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]=== [2021-01-06 16:49:42,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:49:42,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1307418236, now seen corresponding path program 1 times [2021-01-06 16:49:42,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:49:42,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634592376] [2021-01-06 16:49:42,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:49:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:49:42,828 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:49:42,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634592376] [2021-01-06 16:49:42,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310756370] [2021-01-06 16:49:42,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 16:49:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:49:42,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 14 conjunts are in the unsatisfiable core [2021-01-06 16:49:42,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:49:43,269 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:49:43,276 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:49:43,287 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:49:43,291 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 16:49:43,297 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:49:43,301 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 16:49:43,304 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:49:43,338 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:49:43,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:49:43,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2021-01-06 16:49:43,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215827863] [2021-01-06 16:49:43,339 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 16:49:43,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:49:43,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 16:49:43,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-01-06 16:49:43,340 INFO L87 Difference]: Start difference. First operand 256 states and 298 transitions. Second operand 14 states. [2021-01-06 16:49:45,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:49:45,408 INFO L93 Difference]: Finished difference Result 447 states and 510 transitions. [2021-01-06 16:49:45,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-01-06 16:49:45,411 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2021-01-06 16:49:45,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:49:45,413 INFO L225 Difference]: With dead ends: 447 [2021-01-06 16:49:45,413 INFO L226 Difference]: Without dead ends: 281 [2021-01-06 16:49:45,415 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=719, Invalid=1831, Unknown=0, NotChecked=0, Total=2550 [2021-01-06 16:49:45,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-01-06 16:49:45,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 147. [2021-01-06 16:49:45,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2021-01-06 16:49:45,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 169 transitions. [2021-01-06 16:49:45,448 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 169 transitions. Word has length 42 [2021-01-06 16:49:45,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:49:45,448 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 169 transitions. [2021-01-06 16:49:45,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 16:49:45,449 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 169 transitions. [2021-01-06 16:49:45,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-06 16:49:45,449 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:49:45,449 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] [2021-01-06 16:49:45,663 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:49:45,663 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]=== [2021-01-06 16:49:45,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:49:45,665 INFO L82 PathProgramCache]: Analyzing trace with hash 34146378, now seen corresponding path program 1 times [2021-01-06 16:49:45,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:49:45,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442532612] [2021-01-06 16:49:45,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:49:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:49:45,729 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:49:45,730 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442532612] [2021-01-06 16:49:45,730 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355054051] [2021-01-06 16:49:45,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 16:49:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:49:45,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 16:49:45,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:49:45,885 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 16:49:45,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:49:45,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2021-01-06 16:49:45,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350051326] [2021-01-06 16:49:45,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 16:49:45,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:49:45,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 16:49:45,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-01-06 16:49:45,888 INFO L87 Difference]: Start difference. First operand 147 states and 169 transitions. Second operand 11 states. [2021-01-06 16:49:46,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:49:46,951 INFO L93 Difference]: Finished difference Result 358 states and 406 transitions. [2021-01-06 16:49:46,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-01-06 16:49:46,952 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2021-01-06 16:49:46,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:49:46,953 INFO L225 Difference]: With dead ends: 358 [2021-01-06 16:49:46,953 INFO L226 Difference]: Without dead ends: 0 [2021-01-06 16:49:46,954 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=328, Invalid=794, Unknown=0, NotChecked=0, Total=1122 [2021-01-06 16:49:46,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-06 16:49:46,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-06 16:49:46,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-06 16:49:46,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-06 16:49:46,955 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2021-01-06 16:49:46,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:49:46,955 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-06 16:49:46,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 16:49:46,955 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-06 16:49:46,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-06 16:49:47,168 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-01-06 16:49:47,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-01-06 16:49:47,331 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 112 [2021-01-06 16:49:47,924 WARN L197 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 192 [2021-01-06 16:49:48,127 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 111 [2021-01-06 16:49:48,578 WARN L197 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 179 [2021-01-06 16:49:48,803 WARN L197 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 123 [2021-01-06 16:49:49,201 WARN L197 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 170 [2021-01-06 16:49:49,458 WARN L197 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 170 [2021-01-06 16:49:49,611 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 124 [2021-01-06 16:49:49,993 WARN L197 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 195 [2021-01-06 16:49:50,207 WARN L197 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 172 [2021-01-06 16:49:50,603 WARN L197 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 25 [2021-01-06 16:49:51,118 WARN L197 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 44 [2021-01-06 16:49:52,149 WARN L197 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 184 DAG size of output: 38 [2021-01-06 16:49:52,375 WARN L197 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 26 [2021-01-06 16:49:52,692 WARN L197 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 24 [2021-01-06 16:49:53,841 WARN L197 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 175 DAG size of output: 46 [2021-01-06 16:49:54,272 WARN L197 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 25 [2021-01-06 16:49:54,806 WARN L197 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 44 [2021-01-06 16:49:55,778 WARN L197 SmtUtils]: Spent 969.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 38 [2021-01-06 16:49:56,643 WARN L197 SmtUtils]: Spent 862.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 36 [2021-01-06 16:49:57,067 WARN L197 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 28 [2021-01-06 16:49:57,293 WARN L197 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 26 [2021-01-06 16:49:58,521 WARN L197 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 187 DAG size of output: 45 [2021-01-06 16:49:59,402 WARN L197 SmtUtils]: Spent 876.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 43 [2021-01-06 16:49:59,968 WARN L197 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 42 [2021-01-06 16:49:59,972 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))))) [2021-01-06 16:49:59,973 INFO L189 CegarLoopUtils]: For program point L18-18(lines 18 20) no Hoare annotation was computed. [2021-01-06 16:49:59,973 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)))))) [2021-01-06 16:49:59,973 INFO L189 CegarLoopUtils]: For program point L18-21(lines 18 20) no Hoare annotation was computed. [2021-01-06 16:49:59,973 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)))) [2021-01-06 16:49:59,973 INFO L189 CegarLoopUtils]: For program point L18-24(lines 18 20) no Hoare annotation was computed. [2021-01-06 16:49:59,974 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-01-06 16:49:59,974 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)))) [2021-01-06 16:49:59,974 INFO L189 CegarLoopUtils]: For program point L18-27(lines 18 20) no Hoare annotation was computed. [2021-01-06 16:49:59,975 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))))) [2021-01-06 16:49:59,975 INFO L189 CegarLoopUtils]: For program point L18-30(lines 18 20) no Hoare annotation was computed. [2021-01-06 16:49:59,975 INFO L189 CegarLoopUtils]: For program point L19(line 19) no Hoare annotation was computed. [2021-01-06 16:49:59,975 INFO L189 CegarLoopUtils]: For program point L19-1(line 19) no Hoare annotation was computed. [2021-01-06 16:49:59,975 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))) [2021-01-06 16:49:59,975 INFO L189 CegarLoopUtils]: For program point L19-2(line 19) no Hoare annotation was computed. [2021-01-06 16:49:59,975 INFO L189 CegarLoopUtils]: For program point L18-33(lines 18 20) no Hoare annotation was computed. [2021-01-06 16:49:59,975 INFO L189 CegarLoopUtils]: For program point L19-3(line 19) no Hoare annotation was computed. [2021-01-06 16:49:59,976 INFO L189 CegarLoopUtils]: For program point L19-4(line 19) no Hoare annotation was computed. [2021-01-06 16:49:59,976 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))) [2021-01-06 16:49:59,976 INFO L189 CegarLoopUtils]: For program point L19-5(line 19) no Hoare annotation was computed. [2021-01-06 16:49:59,976 INFO L189 CegarLoopUtils]: For program point L18-36(lines 18 20) no Hoare annotation was computed. [2021-01-06 16:49:59,976 INFO L189 CegarLoopUtils]: For program point L19-6(line 19) no Hoare annotation was computed. [2021-01-06 16:49:59,976 INFO L189 CegarLoopUtils]: For program point L19-7(line 19) no Hoare annotation was computed. [2021-01-06 16:49:59,976 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))) [2021-01-06 16:49:59,976 INFO L189 CegarLoopUtils]: For program point L19-8(line 19) no Hoare annotation was computed. [2021-01-06 16:49:59,976 INFO L189 CegarLoopUtils]: For program point L18-39(lines 18 20) no Hoare annotation was computed. [2021-01-06 16:49:59,976 INFO L189 CegarLoopUtils]: For program point L19-9(line 19) no Hoare annotation was computed. [2021-01-06 16:49:59,977 INFO L189 CegarLoopUtils]: For program point L19-10(line 19) no Hoare annotation was computed. [2021-01-06 16:49:59,977 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-01-06 16:49:59,977 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))) [2021-01-06 16:49:59,977 INFO L189 CegarLoopUtils]: For program point L19-11(line 19) no Hoare annotation was computed. [2021-01-06 16:49:59,977 INFO L189 CegarLoopUtils]: For program point L19-12(line 19) no Hoare annotation was computed. [2021-01-06 16:49:59,977 INFO L189 CegarLoopUtils]: For program point L19-13(line 19) no Hoare annotation was computed. [2021-01-06 16:49:59,977 INFO L192 CegarLoopUtils]: At program point L69(lines 24 70) the Hoare annotation is: true [2021-01-06 16:49:59,977 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-01-06 16:49:59,977 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-01-06 16:49:59,978 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)))) [2021-01-06 16:49:59,978 INFO L189 CegarLoopUtils]: For program point L38-3(lines 35 68) no Hoare annotation was computed. [2021-01-06 16:49:59,978 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-01-06 16:49:59,978 INFO L189 CegarLoopUtils]: For program point L39(lines 39 46) no Hoare annotation was computed. [2021-01-06 16:49:59,978 INFO L189 CegarLoopUtils]: For program point L39-1(lines 39 46) no Hoare annotation was computed. [2021-01-06 16:49:59,978 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-01-06 16:49:59,978 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-01-06 16:49:59,979 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-01-06 16:49:59,979 INFO L189 CegarLoopUtils]: For program point L59-1(lines 24 70) no Hoare annotation was computed. [2021-01-06 16:49:59,979 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-01-06 16:49:59,979 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-01-06 16:49:59,979 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-01-06 16:49:59,979 INFO L189 CegarLoopUtils]: For program point L27(line 27) no Hoare annotation was computed. [2021-01-06 16:49:59,979 INFO L189 CegarLoopUtils]: For program point L44(lines 44 45) no Hoare annotation was computed. [2021-01-06 16:49:59,979 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-01-06 16:49:59,979 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-01-06 16:49:59,980 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-01-06 16:49:59,980 INFO L189 CegarLoopUtils]: For program point L30(lines 30 34) no Hoare annotation was computed. [2021-01-06 16:49:59,980 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-01-06 16:49:59,980 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2021-01-06 16:49:59,980 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-01-06 16:49:59,980 INFO L189 CegarLoopUtils]: For program point L49(lines 49 51) no Hoare annotation was computed. [2021-01-06 16:49:59,980 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-01-06 16:49:59,980 INFO L189 CegarLoopUtils]: For program point L18(lines 18 20) no Hoare annotation was computed. [2021-01-06 16:49:59,981 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))) [2021-01-06 16:49:59,981 INFO L189 CegarLoopUtils]: For program point L18-3(lines 18 20) no Hoare annotation was computed. [2021-01-06 16:49:59,981 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)) [2021-01-06 16:49:59,981 INFO L189 CegarLoopUtils]: For program point L18-6(lines 18 20) no Hoare annotation was computed. [2021-01-06 16:49:59,981 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))) [2021-01-06 16:49:59,981 INFO L189 CegarLoopUtils]: For program point L18-9(lines 18 20) no Hoare annotation was computed. [2021-01-06 16:49:59,982 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)) [2021-01-06 16:49:59,982 INFO L189 CegarLoopUtils]: For program point L18-12(lines 18 20) no Hoare annotation was computed. [2021-01-06 16:49:59,982 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)))) [2021-01-06 16:49:59,982 INFO L189 CegarLoopUtils]: For program point L18-15(lines 18 20) no Hoare annotation was computed. [2021-01-06 16:49:59,982 INFO L189 CegarLoopUtils]: For program point L35-1(lines 35 68) no Hoare annotation was computed. [2021-01-06 16:50:00,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 04:50:00 BoogieIcfgContainer [2021-01-06 16:50:00,027 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 16:50:00,028 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 16:50:00,028 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 16:50:00,028 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 16:50:00,028 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:49:35" (3/4) ... [2021-01-06 16:50:00,031 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-06 16:50:00,045 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2021-01-06 16:50:00,045 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-01-06 16:50:00,046 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-01-06 16:50:00,046 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 16:50:00,111 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-invgen/heapsort.i-witness.graphml [2021-01-06 16:50:00,111 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 16:50:00,112 INFO L168 Benchmark]: Toolchain (without parser) took 26143.51 ms. Allocated memory was 163.6 MB in the beginning and 343.9 MB in the end (delta: 180.4 MB). Free memory was 138.7 MB in the beginning and 132.3 MB in the end (delta: 6.4 MB). Peak memory consumption was 187.6 MB. Max. memory is 8.0 GB. [2021-01-06 16:50:00,112 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 163.6 MB. Free memory is still 136.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 16:50:00,113 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.56 ms. Allocated memory is still 163.6 MB. Free memory was 138.5 MB in the beginning and 128.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2021-01-06 16:50:00,114 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.05 ms. Allocated memory is still 163.6 MB. Free memory was 128.2 MB in the beginning and 126.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 16:50:00,114 INFO L168 Benchmark]: Boogie Preprocessor took 31.62 ms. Allocated memory is still 163.6 MB. Free memory was 126.4 MB in the beginning and 125.1 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-01-06 16:50:00,115 INFO L168 Benchmark]: RCFGBuilder took 779.61 ms. Allocated memory is still 163.6 MB. Free memory was 125.1 MB in the beginning and 136.7 MB in the end (delta: -11.5 MB). Peak memory consumption was 14.9 MB. Max. memory is 8.0 GB. [2021-01-06 16:50:00,115 INFO L168 Benchmark]: TraceAbstraction took 24851.31 ms. Allocated memory was 163.6 MB in the beginning and 343.9 MB in the end (delta: 180.4 MB). Free memory was 136.2 MB in the beginning and 137.0 MB in the end (delta: -817.8 kB). Peak memory consumption was 204.4 MB. Max. memory is 8.0 GB. [2021-01-06 16:50:00,116 INFO L168 Benchmark]: Witness Printer took 83.55 ms. Allocated memory is still 343.9 MB. Free memory was 137.0 MB in the beginning and 132.3 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2021-01-06 16:50:00,118 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.18 ms. Allocated memory is still 163.6 MB. Free memory is still 136.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 337.56 ms. Allocated memory is still 163.6 MB. Free memory was 138.5 MB in the beginning and 128.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 50.05 ms. Allocated memory is still 163.6 MB. Free memory was 128.2 MB in the beginning and 126.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 31.62 ms. Allocated memory is still 163.6 MB. Free memory was 126.4 MB in the beginning and 125.1 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 779.61 ms. Allocated memory is still 163.6 MB. Free memory was 125.1 MB in the beginning and 136.7 MB in the end (delta: -11.5 MB). Peak memory consumption was 14.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 24851.31 ms. Allocated memory was 163.6 MB in the beginning and 343.9 MB in the end (delta: 180.4 MB). Free memory was 136.2 MB in the beginning and 137.0 MB in the end (delta: -817.8 kB). Peak memory consumption was 204.4 MB. Max. memory is 8.0 GB. * Witness Printer took 83.55 ms. Allocated memory is still 343.9 MB. Free memory was 137.0 MB in the beginning and 132.3 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.9s, OverallIterations: 21, TraceHistogramMax: 3, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1149 SDtfs, 2894 SDslu, 1751 SDs, 0 SdLazy, 2614 SolverSat, 1279 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 452 GetRequests, 234 SyntacticMatches, 6 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1099 ImplicationChecksByTransitivity, 2.8s 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.1s HoareSimplificationTime, 16 FomulaSimplificationsInter, 2690758 FormulaSimplificationTreeSizeReductionInter, 9.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s 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...