/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/ldv-regression/rule60_list2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 16:12:01,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 16:12:01,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 16:12:02,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 16:12:02,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 16:12:02,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 16:12:02,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 16:12:02,036 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 16:12:02,038 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 16:12:02,039 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 16:12:02,041 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 16:12:02,042 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 16:12:02,043 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 16:12:02,044 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 16:12:02,046 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 16:12:02,047 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 16:12:02,048 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 16:12:02,050 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 16:12:02,052 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 16:12:02,064 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 16:12:02,066 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 16:12:02,068 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 16:12:02,070 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 16:12:02,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 16:12:02,074 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 16:12:02,075 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 16:12:02,075 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 16:12:02,077 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 16:12:02,077 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 16:12:02,079 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 16:12:02,079 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 16:12:02,080 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 16:12:02,081 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 16:12:02,083 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 16:12:02,084 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 16:12:02,084 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 16:12:02,085 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 16:12:02,086 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 16:12:02,086 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 16:12:02,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 16:12:02,089 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 16:12:02,092 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:12:02,126 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 16:12:02,127 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 16:12:02,130 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 16:12:02,130 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 16:12:02,131 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 16:12:02,131 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 16:12:02,131 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 16:12:02,132 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 16:12:02,134 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 16:12:02,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 16:12:02,135 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 16:12:02,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 16:12:02,136 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 16:12:02,136 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 16:12:02,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 16:12:02,137 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 16:12:02,137 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 16:12:02,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 16:12:02,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 16:12:02,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 16:12:02,140 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 16:12:02,140 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 16:12:02,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 16:12:02,141 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 16:12:02,141 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 16:12:02,141 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:12:02,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 16:12:02,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 16:12:02,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 16:12:02,673 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 16:12:02,674 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 16:12:02,675 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/rule60_list2.i [2021-01-06 16:12:02,763 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/44fcfe39a/bddd2e8c3d034fb4ac8130e4503b2ab9/FLAGf1fe73f0f [2021-01-06 16:12:03,560 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 16:12:03,560 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule60_list2.i [2021-01-06 16:12:03,577 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/44fcfe39a/bddd2e8c3d034fb4ac8130e4503b2ab9/FLAGf1fe73f0f [2021-01-06 16:12:03,855 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/44fcfe39a/bddd2e8c3d034fb4ac8130e4503b2ab9 [2021-01-06 16:12:03,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 16:12:03,861 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 16:12:03,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 16:12:03,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 16:12:03,871 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 16:12:03,872 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:12:03" (1/1) ... [2021-01-06 16:12:03,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bab379f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:12:03, skipping insertion in model container [2021-01-06 16:12:03,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:12:03" (1/1) ... [2021-01-06 16:12:03,886 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 16:12:03,952 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 16:12:04,185 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/ldv-regression/rule60_list2.i[292,305] left hand side expression in assignment: lhs: VariableLHS[~elem~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~elem~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~dev1~0,] left hand side expression in assignment: lhs: VariableLHS[~dev2~0,] [2021-01-06 16:12:04,330 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:12:04,340 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 16:12:04,353 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/ldv-regression/rule60_list2.i[292,305] left hand side expression in assignment: lhs: VariableLHS[~elem~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~elem~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~dev1~0,] left hand side expression in assignment: lhs: VariableLHS[~dev2~0,] [2021-01-06 16:12:04,407 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:12:04,473 INFO L208 MainTranslator]: Completed translation [2021-01-06 16:12:04,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:12:04 WrapperNode [2021-01-06 16:12:04,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 16:12:04,476 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 16:12:04,476 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 16:12:04,476 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 16:12:04,484 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:12:04" (1/1) ... [2021-01-06 16:12:04,500 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:12:04" (1/1) ... [2021-01-06 16:12:04,524 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 16:12:04,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 16:12:04,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 16:12:04,525 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 16:12:04,534 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:12:04" (1/1) ... [2021-01-06 16:12:04,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:12:04" (1/1) ... [2021-01-06 16:12:04,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:12:04" (1/1) ... [2021-01-06 16:12:04,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:12:04" (1/1) ... [2021-01-06 16:12:04,544 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:12:04" (1/1) ... [2021-01-06 16:12:04,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:12:04" (1/1) ... [2021-01-06 16:12:04,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:12:04" (1/1) ... [2021-01-06 16:12:04,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 16:12:04,553 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 16:12:04,553 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 16:12:04,553 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 16:12:04,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:12:04" (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:12:04,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 16:12:04,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-06 16:12:04,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 16:12:04,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 16:12:04,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 16:12:05,023 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 16:12:05,023 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2021-01-06 16:12:05,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:12:05 BoogieIcfgContainer [2021-01-06 16:12:05,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 16:12:05,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 16:12:05,028 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 16:12:05,032 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 16:12:05,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 04:12:03" (1/3) ... [2021-01-06 16:12:05,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3827f91b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:12:05, skipping insertion in model container [2021-01-06 16:12:05,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:12:04" (2/3) ... [2021-01-06 16:12:05,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3827f91b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:12:05, skipping insertion in model container [2021-01-06 16:12:05,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:12:05" (3/3) ... [2021-01-06 16:12:05,036 INFO L111 eAbstractionObserver]: Analyzing ICFG rule60_list2.i [2021-01-06 16:12:05,045 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 16:12:05,051 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2021-01-06 16:12:05,080 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-01-06 16:12:05,136 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 16:12:05,139 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 16:12:05,139 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 16:12:05,139 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 16:12:05,140 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 16:12:05,140 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 16:12:05,140 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 16:12:05,140 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 16:12:05,174 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2021-01-06 16:12:05,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-01-06 16:12:05,180 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:12:05,193 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-01-06 16:12:05,194 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:12:05,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:12:05,212 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2021-01-06 16:12:05,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:12:05,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908593714] [2021-01-06 16:12:05,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:12:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:12:05,558 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:12:05,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908593714] [2021-01-06 16:12:05,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:12:05,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 16:12:05,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871629447] [2021-01-06 16:12:05,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 16:12:05,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:12:05,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 16:12:05,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 16:12:05,592 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2021-01-06 16:12:05,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:12:05,653 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2021-01-06 16:12:05,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 16:12:05,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2021-01-06 16:12:05,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:12:05,670 INFO L225 Difference]: With dead ends: 73 [2021-01-06 16:12:05,670 INFO L226 Difference]: Without dead ends: 30 [2021-01-06 16:12:05,677 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:12:05,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-01-06 16:12:05,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-01-06 16:12:05,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2021-01-06 16:12:05,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2021-01-06 16:12:05,731 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 4 [2021-01-06 16:12:05,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:12:05,732 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2021-01-06 16:12:05,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 16:12:05,732 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2021-01-06 16:12:05,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-01-06 16:12:05,733 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:12:05,734 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:12:05,735 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 16:12:05,735 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:12:05,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:12:05,741 INFO L82 PathProgramCache]: Analyzing trace with hash 170685048, now seen corresponding path program 1 times [2021-01-06 16:12:05,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:12:05,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207550145] [2021-01-06 16:12:05,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:12:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:12:05,926 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:12:05,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207550145] [2021-01-06 16:12:05,927 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:12:05,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:12:05,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157897308] [2021-01-06 16:12:05,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:12:05,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:12:05,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:12:05,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:12:05,931 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2021-01-06 16:12:06,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:12:06,016 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2021-01-06 16:12:06,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:12:06,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2021-01-06 16:12:06,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:12:06,017 INFO L225 Difference]: With dead ends: 52 [2021-01-06 16:12:06,018 INFO L226 Difference]: Without dead ends: 32 [2021-01-06 16:12:06,019 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 16:12:06,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-01-06 16:12:06,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2021-01-06 16:12:06,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2021-01-06 16:12:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2021-01-06 16:12:06,025 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 15 [2021-01-06 16:12:06,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:12:06,026 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2021-01-06 16:12:06,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:12:06,026 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2021-01-06 16:12:06,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-01-06 16:12:06,027 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:12:06,027 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:12:06,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 16:12:06,028 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:12:06,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:12:06,028 INFO L82 PathProgramCache]: Analyzing trace with hash 227943350, now seen corresponding path program 1 times [2021-01-06 16:12:06,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:12:06,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675480103] [2021-01-06 16:12:06,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:12:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:12:06,110 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:12:06,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675480103] [2021-01-06 16:12:06,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:12:06,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:12:06,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489848170] [2021-01-06 16:12:06,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:12:06,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:12:06,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:12:06,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:12:06,119 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states. [2021-01-06 16:12:06,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:12:06,163 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2021-01-06 16:12:06,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:12:06,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2021-01-06 16:12:06,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:12:06,164 INFO L225 Difference]: With dead ends: 55 [2021-01-06 16:12:06,165 INFO L226 Difference]: Without dead ends: 30 [2021-01-06 16:12:06,165 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:12:06,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-01-06 16:12:06,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-01-06 16:12:06,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2021-01-06 16:12:06,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2021-01-06 16:12:06,171 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 15 [2021-01-06 16:12:06,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:12:06,172 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2021-01-06 16:12:06,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:12:06,172 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2021-01-06 16:12:06,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-01-06 16:12:06,173 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:12:06,173 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:12:06,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 16:12:06,173 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:12:06,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:12:06,174 INFO L82 PathProgramCache]: Analyzing trace with hash 929007928, now seen corresponding path program 1 times [2021-01-06 16:12:06,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:12:06,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072845456] [2021-01-06 16:12:06,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:12:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:12:06,406 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:12:06,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072845456] [2021-01-06 16:12:06,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:12:06,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 16:12:06,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205102988] [2021-01-06 16:12:06,409 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 16:12:06,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:12:06,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 16:12:06,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-01-06 16:12:06,413 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 9 states. [2021-01-06 16:12:06,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:12:06,638 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2021-01-06 16:12:06,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 16:12:06,638 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2021-01-06 16:12:06,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:12:06,639 INFO L225 Difference]: With dead ends: 42 [2021-01-06 16:12:06,640 INFO L226 Difference]: Without dead ends: 34 [2021-01-06 16:12:06,640 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-01-06 16:12:06,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-01-06 16:12:06,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2021-01-06 16:12:06,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2021-01-06 16:12:06,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2021-01-06 16:12:06,647 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 15 [2021-01-06 16:12:06,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:12:06,647 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2021-01-06 16:12:06,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 16:12:06,648 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2021-01-06 16:12:06,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-01-06 16:12:06,648 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:12:06,649 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:12:06,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 16:12:06,649 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:12:06,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:12:06,650 INFO L82 PathProgramCache]: Analyzing trace with hash -93151004, now seen corresponding path program 1 times [2021-01-06 16:12:06,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:12:06,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713590530] [2021-01-06 16:12:06,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:12:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:12:06,785 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:12:06,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713590530] [2021-01-06 16:12:06,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:12:06,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-06 16:12:06,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372080566] [2021-01-06 16:12:06,786 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 16:12:06,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:12:06,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 16:12:06,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-01-06 16:12:06,788 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 12 states. [2021-01-06 16:12:07,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:12:07,102 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2021-01-06 16:12:07,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 16:12:07,102 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2021-01-06 16:12:07,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:12:07,103 INFO L225 Difference]: With dead ends: 38 [2021-01-06 16:12:07,103 INFO L226 Difference]: Without dead ends: 36 [2021-01-06 16:12:07,104 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-01-06 16:12:07,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-01-06 16:12:07,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2021-01-06 16:12:07,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2021-01-06 16:12:07,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2021-01-06 16:12:07,109 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 19 [2021-01-06 16:12:07,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:12:07,109 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2021-01-06 16:12:07,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 16:12:07,110 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2021-01-06 16:12:07,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-01-06 16:12:07,110 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:12:07,110 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:12:07,111 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 16:12:07,111 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:12:07,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:12:07,112 INFO L82 PathProgramCache]: Analyzing trace with hash -93091422, now seen corresponding path program 1 times [2021-01-06 16:12:07,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:12:07,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474845640] [2021-01-06 16:12:07,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:12:07,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:12:07,214 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:12:07,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474845640] [2021-01-06 16:12:07,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:12:07,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 16:12:07,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681089414] [2021-01-06 16:12:07,215 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 16:12:07,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:12:07,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 16:12:07,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-01-06 16:12:07,217 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 8 states. [2021-01-06 16:12:07,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:12:07,379 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2021-01-06 16:12:07,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 16:12:07,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2021-01-06 16:12:07,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:12:07,381 INFO L225 Difference]: With dead ends: 32 [2021-01-06 16:12:07,381 INFO L226 Difference]: Without dead ends: 30 [2021-01-06 16:12:07,381 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-01-06 16:12:07,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-01-06 16:12:07,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-01-06 16:12:07,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2021-01-06 16:12:07,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2021-01-06 16:12:07,386 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 19 [2021-01-06 16:12:07,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:12:07,386 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2021-01-06 16:12:07,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 16:12:07,387 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2021-01-06 16:12:07,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-06 16:12:07,387 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:12:07,388 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:12:07,388 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 16:12:07,388 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:12:07,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:12:07,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1793070580, now seen corresponding path program 1 times [2021-01-06 16:12:07,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:12:07,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297997558] [2021-01-06 16:12:07,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:12:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:12:07,454 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:12:07,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297997558] [2021-01-06 16:12:07,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:12:07,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 16:12:07,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744431892] [2021-01-06 16:12:07,455 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:12:07,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:12:07,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:12:07,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:12:07,456 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 5 states. [2021-01-06 16:12:07,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:12:07,538 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2021-01-06 16:12:07,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 16:12:07,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2021-01-06 16:12:07,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:12:07,539 INFO L225 Difference]: With dead ends: 37 [2021-01-06 16:12:07,540 INFO L226 Difference]: Without dead ends: 33 [2021-01-06 16:12:07,541 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-06 16:12:07,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-01-06 16:12:07,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2021-01-06 16:12:07,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2021-01-06 16:12:07,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2021-01-06 16:12:07,550 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 25 [2021-01-06 16:12:07,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:12:07,551 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2021-01-06 16:12:07,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:12:07,551 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2021-01-06 16:12:07,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-06 16:12:07,552 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:12:07,552 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:12:07,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 16:12:07,553 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:12:07,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:12:07,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1793130162, now seen corresponding path program 1 times [2021-01-06 16:12:07,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:12:07,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009826631] [2021-01-06 16:12:07,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:12:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:12:07,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:12:07,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009826631] [2021-01-06 16:12:07,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:12:07,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-06 16:12:07,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401668773] [2021-01-06 16:12:07,665 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 16:12:07,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:12:07,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 16:12:07,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-01-06 16:12:07,667 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 12 states. [2021-01-06 16:12:07,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:12:07,913 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2021-01-06 16:12:07,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 16:12:07,913 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2021-01-06 16:12:07,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:12:07,914 INFO L225 Difference]: With dead ends: 36 [2021-01-06 16:12:07,914 INFO L226 Difference]: Without dead ends: 26 [2021-01-06 16:12:07,915 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-01-06 16:12:07,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-01-06 16:12:07,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-01-06 16:12:07,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2021-01-06 16:12:07,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 25 transitions. [2021-01-06 16:12:07,919 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 25 transitions. Word has length 25 [2021-01-06 16:12:07,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:12:07,919 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 25 transitions. [2021-01-06 16:12:07,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 16:12:07,919 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2021-01-06 16:12:07,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-06 16:12:07,920 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:12:07,920 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:12:07,920 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 16:12:07,921 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:12:07,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:12:07,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1850388464, now seen corresponding path program 1 times [2021-01-06 16:12:07,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:12:07,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810678958] [2021-01-06 16:12:07,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:12:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:12:08,187 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:12:08,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810678958] [2021-01-06 16:12:08,188 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:12:08,188 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 16:12:08,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337201599] [2021-01-06 16:12:08,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 16:12:08,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:12:08,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 16:12:08,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-01-06 16:12:08,190 INFO L87 Difference]: Start difference. First operand 26 states and 25 transitions. Second operand 11 states. [2021-01-06 16:12:08,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:12:08,586 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2021-01-06 16:12:08,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 16:12:08,586 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2021-01-06 16:12:08,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:12:08,586 INFO L225 Difference]: With dead ends: 26 [2021-01-06 16:12:08,587 INFO L226 Difference]: Without dead ends: 0 [2021-01-06 16:12:08,587 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2021-01-06 16:12:08,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-06 16:12:08,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-06 16:12:08,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-06 16:12:08,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-06 16:12:08,588 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2021-01-06 16:12:08,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:12:08,589 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-06 16:12:08,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 16:12:08,589 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-06 16:12:08,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-06 16:12:08,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 16:12:08,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-01-06 16:12:08,776 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2021-01-06 16:12:09,008 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2021-01-06 16:12:09,011 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-01-06 16:12:09,012 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-01-06 16:12:09,012 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-01-06 16:12:09,012 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-01-06 16:12:09,012 INFO L189 CegarLoopUtils]: For program point L540(lines 540 543) no Hoare annotation was computed. [2021-01-06 16:12:09,012 INFO L189 CegarLoopUtils]: For program point L524(lines 524 525) no Hoare annotation was computed. [2021-01-06 16:12:09,012 INFO L189 CegarLoopUtils]: For program point L524-1(lines 524 525) no Hoare annotation was computed. [2021-01-06 16:12:09,012 INFO L189 CegarLoopUtils]: For program point L549(lines 549 554) no Hoare annotation was computed. [2021-01-06 16:12:09,013 INFO L189 CegarLoopUtils]: For program point L4(lines 1 556) no Hoare annotation was computed. [2021-01-06 16:12:09,013 INFO L189 CegarLoopUtils]: For program point L549-1(lines 549 554) no Hoare annotation was computed. [2021-01-06 16:12:09,013 INFO L189 CegarLoopUtils]: For program point L4-1(lines 1 556) no Hoare annotation was computed. [2021-01-06 16:12:09,013 INFO L189 CegarLoopUtils]: For program point L4-2(lines 1 556) no Hoare annotation was computed. [2021-01-06 16:12:09,013 INFO L189 CegarLoopUtils]: For program point L4-3(lines 1 556) no Hoare annotation was computed. [2021-01-06 16:12:09,013 INFO L189 CegarLoopUtils]: For program point L4-4(lines 1 556) no Hoare annotation was computed. [2021-01-06 16:12:09,013 INFO L189 CegarLoopUtils]: For program point L541(lines 541 542) no Hoare annotation was computed. [2021-01-06 16:12:09,014 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-01-06 16:12:09,014 INFO L185 CegarLoopUtils]: At program point L526(lines 520 527) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___getMemory_~size 16))) (or (and .cse0 (= |ULTIMATE.start___getMemory_#res.offset| 0) (= |ULTIMATE.start___getMemory_#res.base| 0)) (and .cse0 (<= 1 |ULTIMATE.start___getMemory_#res.offset|) (<= ~guard_malloc_counter~0.base 0) (<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset 0) (<= |ULTIMATE.start___getMemory_#res.base| 0) (<= 0 ~guard_malloc_counter~0.base) (<= 0 |ULTIMATE.start___getMemory_#res.base|)))) [2021-01-06 16:12:09,014 INFO L185 CegarLoopUtils]: At program point L526-1(lines 520 527) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___getMemory_~size 16)) (.cse1 (= ULTIMATE.start_main_~dev1~0.offset 0))) (or (and .cse0 (<= ~guard_malloc_counter~0.base 0) (<= (+ ULTIMATE.start_main_~dev1~0.offset 1) |ULTIMATE.start___getMemory_#res.offset|) (<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset 0) (not .cse1) (<= 2 |ULTIMATE.start___getMemory_#res.offset|) (<= |ULTIMATE.start___getMemory_#res.base| 0) (<= 0 ~guard_malloc_counter~0.base) (<= 0 |ULTIMATE.start___getMemory_#res.base|)) (and .cse0 (= |ULTIMATE.start___getMemory_#res.offset| 0) (= |ULTIMATE.start___getMemory_#res.base| 0)) (and .cse0 .cse1 (= ULTIMATE.start_main_~dev1~0.base 0)))) [2021-01-06 16:12:09,015 INFO L189 CegarLoopUtils]: For program point L6(line 6) no Hoare annotation was computed. [2021-01-06 16:12:09,015 INFO L189 CegarLoopUtils]: For program point L6-1(line 6) no Hoare annotation was computed. [2021-01-06 16:12:09,015 INFO L189 CegarLoopUtils]: For program point L6-2(line 6) no Hoare annotation was computed. [2021-01-06 16:12:09,015 INFO L189 CegarLoopUtils]: For program point L6-3(line 6) no Hoare annotation was computed. [2021-01-06 16:12:09,015 INFO L189 CegarLoopUtils]: For program point L6-4(line 6) no Hoare annotation was computed. [2021-01-06 16:12:09,015 INFO L189 CegarLoopUtils]: For program point L535(lines 535 539) no Hoare annotation was computed. [2021-01-06 16:12:09,015 INFO L189 CegarLoopUtils]: For program point L535-1(lines 535 539) no Hoare annotation was computed. [2021-01-06 16:12:09,015 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2021-01-06 16:12:09,016 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-01-06 16:12:09,016 INFO L189 CegarLoopUtils]: For program point L536(line 536) no Hoare annotation was computed. [2021-01-06 16:12:09,016 INFO L189 CegarLoopUtils]: For program point L536-2(line 536) no Hoare annotation was computed. [2021-01-06 16:12:09,016 INFO L189 CegarLoopUtils]: For program point L536-4(line 536) no Hoare annotation was computed. [2021-01-06 16:12:09,016 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-01-06 16:12:09,016 INFO L189 CegarLoopUtils]: For program point L537(lines 537 538) no Hoare annotation was computed. [2021-01-06 16:12:09,016 INFO L189 CegarLoopUtils]: For program point L537-2(lines 537 538) no Hoare annotation was computed. [2021-01-06 16:12:09,016 INFO L189 CegarLoopUtils]: For program point L537-4(lines 537 538) no Hoare annotation was computed. [2021-01-06 16:12:09,017 INFO L185 CegarLoopUtils]: At program point L529(lines 528 530) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___getMemory_~size 16))) (or (and (= 0 |ULTIMATE.start_my_malloc_#res.offset|) .cse0 (= |ULTIMATE.start___getMemory_#res.offset| 0) (= |ULTIMATE.start___getMemory_#res.base| 0) (= |ULTIMATE.start_my_malloc_#res.base| 0)) (and (<= 0 |ULTIMATE.start_my_malloc_#res.base|) .cse0 (<= 1 |ULTIMATE.start_my_malloc_#res.offset|) (<= 1 |ULTIMATE.start___getMemory_#res.offset|) (<= |ULTIMATE.start_my_malloc_#res.offset| ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.base 0) (<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.offset 0) (<= |ULTIMATE.start_my_malloc_#res.base| 0) (<= |ULTIMATE.start___getMemory_#res.base| 0) (<= 0 ~guard_malloc_counter~0.base) (<= 0 |ULTIMATE.start___getMemory_#res.base|)))) [2021-01-06 16:12:09,017 INFO L185 CegarLoopUtils]: At program point L529-1(lines 528 530) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_main_~dev1~0.offset 0)) (.cse0 (= ULTIMATE.start___getMemory_~size 16))) (or (let ((.cse1 (+ ULTIMATE.start_main_~dev1~0.offset 1))) (and (<= 0 |ULTIMATE.start_my_malloc_#res.base|) .cse0 (<= ~guard_malloc_counter~0.base 0) (<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset) (<= |ULTIMATE.start_my_malloc_#res.base| 0) (<= 0 |ULTIMATE.start___getMemory_#res.base|) (<= 2 |ULTIMATE.start_my_malloc_#res.offset|) (<= |ULTIMATE.start_my_malloc_#res.offset| ~guard_malloc_counter~0.offset) (<= .cse1 |ULTIMATE.start___getMemory_#res.offset|) (= ~elem~0.offset 0) (not .cse2) (<= 2 |ULTIMATE.start___getMemory_#res.offset|) (<= |ULTIMATE.start___getMemory_#res.base| 0) (<= 0 ~guard_malloc_counter~0.base) (<= .cse1 |ULTIMATE.start_my_malloc_#res.offset|))) (and .cse0 .cse2 (= ULTIMATE.start_main_~dev1~0.base 0)) (and .cse0 (= 0 |ULTIMATE.start_my_malloc_#res.offset|) (= |ULTIMATE.start___getMemory_#res.offset| 0) (= |ULTIMATE.start___getMemory_#res.base| 0) (= |ULTIMATE.start_my_malloc_#res.base| 0)))) [2021-01-06 16:12:09,017 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2021-01-06 16:12:09,017 INFO L185 CegarLoopUtils]: At program point L555(lines 545 556) the Hoare annotation is: (= ULTIMATE.start___getMemory_~size 16) [2021-01-06 16:12:09,018 INFO L189 CegarLoopUtils]: For program point L522(line 522) no Hoare annotation was computed. [2021-01-06 16:12:09,018 INFO L189 CegarLoopUtils]: For program point L522-2(line 522) no Hoare annotation was computed. [2021-01-06 16:12:09,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 04:12:09 BoogieIcfgContainer [2021-01-06 16:12:09,046 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 16:12:09,047 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 16:12:09,047 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 16:12:09,047 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 16:12:09,048 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:12:05" (3/4) ... [2021-01-06 16:12:09,051 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-06 16:12:09,065 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2021-01-06 16:12:09,066 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-01-06 16:12:09,066 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 16:12:09,066 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 16:12:09,096 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((size == 16 && \result == 0) && \result == 0) || (((((((size == 16 && 1 <= \result) && guard_malloc_counter <= 0) && \result <= guard_malloc_counter) && elem == 0) && \result <= 0) && 0 <= guard_malloc_counter) && 0 <= \result) [2021-01-06 16:12:09,097 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == \result && size == 16) && \result == 0) && \result == 0) && \result == 0) || (((((((((((0 <= \result && size == 16) && 1 <= \result) && 1 <= \result) && \result <= guard_malloc_counter) && guard_malloc_counter <= 0) && \result <= guard_malloc_counter) && elem == 0) && \result <= 0) && \result <= 0) && 0 <= guard_malloc_counter) && 0 <= \result) [2021-01-06 16:12:09,097 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((size == 16 && guard_malloc_counter <= 0) && dev1 + 1 <= \result) && \result <= guard_malloc_counter) && elem == 0) && !(dev1 == 0)) && 2 <= \result) && \result <= 0) && 0 <= guard_malloc_counter) && 0 <= \result) || ((size == 16 && \result == 0) && \result == 0)) || ((size == 16 && dev1 == 0) && dev1 == 0) [2021-01-06 16:12:09,098 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((0 <= \result && size == 16) && guard_malloc_counter <= 0) && \result <= guard_malloc_counter) && \result <= 0) && 0 <= \result) && 2 <= \result) && \result <= guard_malloc_counter) && dev1 + 1 <= \result) && elem == 0) && !(dev1 == 0)) && 2 <= \result) && \result <= 0) && 0 <= guard_malloc_counter) && dev1 + 1 <= \result) || ((size == 16 && dev1 == 0) && dev1 == 0)) || ((((size == 16 && 0 == \result) && \result == 0) && \result == 0) && \result == 0) [2021-01-06 16:12:09,130 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/rule60_list2.i-witness.graphml [2021-01-06 16:12:09,131 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 16:12:09,135 INFO L168 Benchmark]: Toolchain (without parser) took 5271.34 ms. Allocated memory was 155.2 MB in the beginning and 186.6 MB in the end (delta: 31.5 MB). Free memory was 129.6 MB in the beginning and 125.6 MB in the end (delta: 4.1 MB). Peak memory consumption was 37.0 MB. Max. memory is 8.0 GB. [2021-01-06 16:12:09,136 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 155.2 MB. Free memory is still 127.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 16:12:09,136 INFO L168 Benchmark]: CACSL2BoogieTranslator took 609.44 ms. Allocated memory is still 155.2 MB. Free memory was 129.5 MB in the beginning and 107.4 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. [2021-01-06 16:12:09,137 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.70 ms. Allocated memory is still 155.2 MB. Free memory was 107.2 MB in the beginning and 105.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 16:12:09,138 INFO L168 Benchmark]: Boogie Preprocessor took 26.98 ms. Allocated memory is still 155.2 MB. Free memory was 105.2 MB in the beginning and 103.9 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:12:09,140 INFO L168 Benchmark]: RCFGBuilder took 473.08 ms. Allocated memory is still 155.2 MB. Free memory was 103.8 MB in the beginning and 117.9 MB in the end (delta: -14.0 MB). Peak memory consumption was 5.4 MB. Max. memory is 8.0 GB. [2021-01-06 16:12:09,141 INFO L168 Benchmark]: TraceAbstraction took 4018.48 ms. Allocated memory was 155.2 MB in the beginning and 186.6 MB in the end (delta: 31.5 MB). Free memory was 117.3 MB in the beginning and 129.8 MB in the end (delta: -12.4 MB). Peak memory consumption was 85.6 MB. Max. memory is 8.0 GB. [2021-01-06 16:12:09,141 INFO L168 Benchmark]: Witness Printer took 84.18 ms. Allocated memory is still 186.6 MB. Free memory was 129.8 MB in the beginning and 125.6 MB in the end (delta: 4.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. [2021-01-06 16:12:09,148 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.19 ms. Allocated memory is still 155.2 MB. Free memory is still 127.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 609.44 ms. Allocated memory is still 155.2 MB. Free memory was 129.5 MB in the beginning and 107.4 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 48.70 ms. Allocated memory is still 155.2 MB. Free memory was 107.2 MB in the beginning and 105.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 26.98 ms. Allocated memory is still 155.2 MB. Free memory was 105.2 MB in the beginning and 103.9 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 473.08 ms. Allocated memory is still 155.2 MB. Free memory was 103.8 MB in the beginning and 117.9 MB in the end (delta: -14.0 MB). Peak memory consumption was 5.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 4018.48 ms. Allocated memory was 155.2 MB in the beginning and 186.6 MB in the end (delta: 31.5 MB). Free memory was 117.3 MB in the beginning and 129.8 MB in the end (delta: -12.4 MB). Peak memory consumption was 85.6 MB. Max. memory is 8.0 GB. * Witness Printer took 84.18 ms. Allocated memory is still 186.6 MB. Free memory was 129.8 MB in the beginning and 125.6 MB in the end (delta: 4.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 6]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 6]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 6]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 6]: 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 5 specifications checked. All of them hold - InvariantResult [Line: 520]: Loop Invariant Derived loop invariant: ((size == 16 && \result == 0) && \result == 0) || (((((((size == 16 && 1 <= \result) && guard_malloc_counter <= 0) && \result <= guard_malloc_counter) && elem == 0) && \result <= 0) && 0 <= guard_malloc_counter) && 0 <= \result) - InvariantResult [Line: 520]: Loop Invariant Derived loop invariant: ((((((((((size == 16 && guard_malloc_counter <= 0) && dev1 + 1 <= \result) && \result <= guard_malloc_counter) && elem == 0) && !(dev1 == 0)) && 2 <= \result) && \result <= 0) && 0 <= guard_malloc_counter) && 0 <= \result) || ((size == 16 && \result == 0) && \result == 0)) || ((size == 16 && dev1 == 0) && dev1 == 0) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((((0 == \result && size == 16) && \result == 0) && \result == 0) && \result == 0) || (((((((((((0 <= \result && size == 16) && 1 <= \result) && 1 <= \result) && \result <= guard_malloc_counter) && guard_malloc_counter <= 0) && \result <= guard_malloc_counter) && elem == 0) && \result <= 0) && \result <= 0) && 0 <= guard_malloc_counter) && 0 <= \result) - InvariantResult [Line: 545]: Loop Invariant Derived loop invariant: size == 16 - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= \result && size == 16) && guard_malloc_counter <= 0) && \result <= guard_malloc_counter) && \result <= 0) && 0 <= \result) && 2 <= \result) && \result <= guard_malloc_counter) && dev1 + 1 <= \result) && elem == 0) && !(dev1 == 0)) && 2 <= \result) && \result <= 0) && 0 <= guard_malloc_counter) && dev1 + 1 <= \result) || ((size == 16 && dev1 == 0) && dev1 == 0)) || ((((size == 16 && 0 == \result) && \result == 0) && \result == 0) && \result == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 40 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.4s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 208 SDtfs, 518 SDslu, 431 SDs, 0 SdLazy, 567 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 11 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 16 NumberOfFragments, 226 HoareAnnotationTreeSize, 5 FomulaSimplifications, 56 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 27 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 153 ConstructedInterpolants, 0 QuantifiedInterpolants, 15293 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...