/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-lit/cggmp2005b.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:47:22,372 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:47:22,377 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:47:22,400 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:47:22,401 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:47:22,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:47:22,406 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:47:22,418 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:47:22,422 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:47:22,425 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:47:22,428 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:47:22,432 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:47:22,432 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:47:22,434 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:47:22,436 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:47:22,438 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:47:22,440 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:47:22,441 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:47:22,443 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:47:22,449 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:47:22,455 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:47:22,459 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:47:22,461 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:47:22,461 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:47:22,465 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:47:22,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:47:22,466 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:47:22,470 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:47:22,471 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:47:22,474 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:47:22,475 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:47:22,476 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:47:22,478 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:47:22,480 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:47:22,481 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:47:22,481 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:47:22,482 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:47:22,483 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:47:22,483 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:47:22,484 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:47:22,486 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:47:22,487 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-08 12:47:22,520 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:47:22,520 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:47:22,521 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:47:22,522 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:47:22,522 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:47:22,522 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:47:22,522 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:47:22,523 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:47:22,523 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:47:22,523 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:47:22,523 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:47:22,523 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:47:22,523 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:47:22,524 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:47:22,524 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:47:22,524 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:47:22,524 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:47:22,524 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:47:22,525 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:47:22,525 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:47:22,525 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:47:22,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:47:22,526 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:47:22,526 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:47:22,526 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:47:22,526 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:47:22,527 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:47:22,527 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:47:22,527 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:47:22,527 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:47:22,864 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:47:22,878 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:47:22,881 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:47:22,883 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:47:22,884 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:47:22,885 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/cggmp2005b.i [2020-07-08 12:47:22,965 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39b7276a7/96312367aa6b4ddea0a1b17f0424c70d/FLAGad4b1324f [2020-07-08 12:47:23,544 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:47:23,545 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005b.i [2020-07-08 12:47:23,553 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39b7276a7/96312367aa6b4ddea0a1b17f0424c70d/FLAGad4b1324f [2020-07-08 12:47:23,875 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39b7276a7/96312367aa6b4ddea0a1b17f0424c70d [2020-07-08 12:47:23,888 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:47:23,891 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:47:23,893 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:47:23,893 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:47:23,897 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:47:23,900 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:47:23" (1/1) ... [2020-07-08 12:47:23,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5161119d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:23, skipping insertion in model container [2020-07-08 12:47:23,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:47:23" (1/1) ... [2020-07-08 12:47:23,915 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:47:23,937 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:47:24,206 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:47:24,215 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:47:24,236 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:47:24,257 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:47:24,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:24 WrapperNode [2020-07-08 12:47:24,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:47:24,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:47:24,259 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:47:24,259 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:47:24,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:24" (1/1) ... [2020-07-08 12:47:24,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:24" (1/1) ... [2020-07-08 12:47:24,285 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:24" (1/1) ... [2020-07-08 12:47:24,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:24" (1/1) ... [2020-07-08 12:47:24,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:24" (1/1) ... [2020-07-08 12:47:24,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:24" (1/1) ... [2020-07-08 12:47:24,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:24" (1/1) ... [2020-07-08 12:47:24,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:47:24,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:47:24,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:47:24,313 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:47:24,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:47:24,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:47:24,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:47:24,496 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 12:47:24,496 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 12:47:24,497 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:47:24,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:47:24,497 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 12:47:24,497 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 12:47:24,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 12:47:24,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:47:24,498 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:47:24,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:47:24,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:47:24,815 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:47:24,816 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-08 12:47:24,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:47:24 BoogieIcfgContainer [2020-07-08 12:47:24,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:47:24,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:47:24,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:47:24,832 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:47:24,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:47:23" (1/3) ... [2020-07-08 12:47:24,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34122b80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:47:24, skipping insertion in model container [2020-07-08 12:47:24,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:47:24" (2/3) ... [2020-07-08 12:47:24,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34122b80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:47:24, skipping insertion in model container [2020-07-08 12:47:24,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:47:24" (3/3) ... [2020-07-08 12:47:24,842 INFO L109 eAbstractionObserver]: Analyzing ICFG cggmp2005b.i [2020-07-08 12:47:24,864 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:47:24,879 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:47:24,904 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:47:24,938 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:47:24,938 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:47:24,938 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:47:24,938 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:47:24,939 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:47:24,939 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:47:24,939 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:47:24,939 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:47:24,964 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-07-08 12:47:24,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-08 12:47:24,976 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:24,978 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:47:24,979 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:24,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:24,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1039733575, now seen corresponding path program 1 times [2020-07-08 12:47:25,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:25,008 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123212545] [2020-07-08 12:47:25,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:25,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:25,167 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-08 12:47:25,168 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {24#true} {24#true} #65#return; {24#true} is VALID [2020-07-08 12:47:25,170 INFO L263 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2020-07-08 12:47:25,170 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-08 12:47:25,171 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #65#return; {24#true} is VALID [2020-07-08 12:47:25,171 INFO L263 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret0 := main(); {24#true} is VALID [2020-07-08 12:47:25,171 INFO L280 TraceCheckUtils]: 4: Hoare triple {24#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {24#true} is VALID [2020-07-08 12:47:25,177 INFO L280 TraceCheckUtils]: 5: Hoare triple {24#true} assume !true; {25#false} is VALID [2020-07-08 12:47:25,178 INFO L263 TraceCheckUtils]: 6: Hoare triple {25#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {25#false} is VALID [2020-07-08 12:47:25,178 INFO L280 TraceCheckUtils]: 7: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2020-07-08 12:47:25,178 INFO L280 TraceCheckUtils]: 8: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2020-07-08 12:47:25,179 INFO L280 TraceCheckUtils]: 9: Hoare triple {25#false} assume !false; {25#false} is VALID [2020-07-08 12:47:25,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:47:25,182 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123212545] [2020-07-08 12:47:25,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:47:25,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-08 12:47:25,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68411977] [2020-07-08 12:47:25,192 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-08 12:47:25,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:25,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-08 12:47:25,247 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:25,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-08 12:47:25,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:25,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-08 12:47:25,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 12:47:25,271 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2020-07-08 12:47:25,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:25,391 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2020-07-08 12:47:25,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-08 12:47:25,392 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-08 12:47:25,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:25,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 12:47:25,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2020-07-08 12:47:25,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 12:47:25,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2020-07-08 12:47:25,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 50 transitions. [2020-07-08 12:47:25,528 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:25,542 INFO L225 Difference]: With dead ends: 37 [2020-07-08 12:47:25,542 INFO L226 Difference]: Without dead ends: 14 [2020-07-08 12:47:25,548 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 12:47:25,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-08 12:47:25,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-08 12:47:25,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:25,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2020-07-08 12:47:25,603 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-08 12:47:25,604 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-08 12:47:25,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:25,608 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2020-07-08 12:47:25,609 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2020-07-08 12:47:25,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:25,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:25,610 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-08 12:47:25,610 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-08 12:47:25,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:25,614 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2020-07-08 12:47:25,614 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2020-07-08 12:47:25,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:25,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:25,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:25,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:25,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 12:47:25,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2020-07-08 12:47:25,621 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 10 [2020-07-08 12:47:25,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:25,622 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-07-08 12:47:25,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-08 12:47:25,622 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2020-07-08 12:47:25,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-08 12:47:25,623 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:25,623 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:47:25,624 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:47:25,624 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:25,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:25,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1066515684, now seen corresponding path program 1 times [2020-07-08 12:47:25,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:25,626 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136257958] [2020-07-08 12:47:25,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:25,702 INFO L280 TraceCheckUtils]: 0: Hoare triple {132#true} assume true; {132#true} is VALID [2020-07-08 12:47:25,703 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {132#true} {132#true} #65#return; {132#true} is VALID [2020-07-08 12:47:25,703 INFO L263 TraceCheckUtils]: 0: Hoare triple {132#true} call ULTIMATE.init(); {132#true} is VALID [2020-07-08 12:47:25,704 INFO L280 TraceCheckUtils]: 1: Hoare triple {132#true} assume true; {132#true} is VALID [2020-07-08 12:47:25,704 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {132#true} {132#true} #65#return; {132#true} is VALID [2020-07-08 12:47:25,704 INFO L263 TraceCheckUtils]: 3: Hoare triple {132#true} call #t~ret0 := main(); {132#true} is VALID [2020-07-08 12:47:25,706 INFO L280 TraceCheckUtils]: 4: Hoare triple {132#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {136#(<= main_~i~0 0)} is VALID [2020-07-08 12:47:25,708 INFO L280 TraceCheckUtils]: 5: Hoare triple {136#(<= main_~i~0 0)} assume !(~i~0 <= 100); {133#false} is VALID [2020-07-08 12:47:25,709 INFO L263 TraceCheckUtils]: 6: Hoare triple {133#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {133#false} is VALID [2020-07-08 12:47:25,709 INFO L280 TraceCheckUtils]: 7: Hoare triple {133#false} ~cond := #in~cond; {133#false} is VALID [2020-07-08 12:47:25,710 INFO L280 TraceCheckUtils]: 8: Hoare triple {133#false} assume 0 == ~cond; {133#false} is VALID [2020-07-08 12:47:25,710 INFO L280 TraceCheckUtils]: 9: Hoare triple {133#false} assume !false; {133#false} is VALID [2020-07-08 12:47:25,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:47:25,712 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136257958] [2020-07-08 12:47:25,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:47:25,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:47:25,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137820842] [2020-07-08 12:47:25,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-08 12:47:25,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:25,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:47:25,735 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:25,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:47:25,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:25,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:47:25,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:47:25,737 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 3 states. [2020-07-08 12:47:25,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:25,804 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2020-07-08 12:47:25,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:47:25,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-08 12:47:25,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:25,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:47:25,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2020-07-08 12:47:25,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:47:25,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2020-07-08 12:47:25,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 22 transitions. [2020-07-08 12:47:25,854 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:25,856 INFO L225 Difference]: With dead ends: 20 [2020-07-08 12:47:25,856 INFO L226 Difference]: Without dead ends: 15 [2020-07-08 12:47:25,858 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:47:25,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-08 12:47:25,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-08 12:47:25,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:25,876 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2020-07-08 12:47:25,877 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-08 12:47:25,877 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-08 12:47:25,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:25,880 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-07-08 12:47:25,880 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2020-07-08 12:47:25,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:25,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:25,881 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-08 12:47:25,882 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-08 12:47:25,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:25,884 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-07-08 12:47:25,885 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2020-07-08 12:47:25,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:25,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:25,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:25,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:25,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 12:47:25,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2020-07-08 12:47:25,889 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 10 [2020-07-08 12:47:25,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:25,890 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-07-08 12:47:25,890 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:47:25,890 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2020-07-08 12:47:25,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-08 12:47:25,891 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:25,891 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:47:25,891 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:47:25,892 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:25,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:25,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1875131310, now seen corresponding path program 1 times [2020-07-08 12:47:25,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:25,893 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327987284] [2020-07-08 12:47:25,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:25,944 INFO L280 TraceCheckUtils]: 0: Hoare triple {226#true} assume true; {226#true} is VALID [2020-07-08 12:47:25,947 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {226#true} {226#true} #65#return; {226#true} is VALID [2020-07-08 12:47:25,948 INFO L263 TraceCheckUtils]: 0: Hoare triple {226#true} call ULTIMATE.init(); {226#true} is VALID [2020-07-08 12:47:25,948 INFO L280 TraceCheckUtils]: 1: Hoare triple {226#true} assume true; {226#true} is VALID [2020-07-08 12:47:25,948 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {226#true} {226#true} #65#return; {226#true} is VALID [2020-07-08 12:47:25,949 INFO L263 TraceCheckUtils]: 3: Hoare triple {226#true} call #t~ret0 := main(); {226#true} is VALID [2020-07-08 12:47:25,951 INFO L280 TraceCheckUtils]: 4: Hoare triple {226#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {230#(<= (+ main_~j~0 100) 0)} is VALID [2020-07-08 12:47:25,953 INFO L280 TraceCheckUtils]: 5: Hoare triple {230#(<= (+ main_~j~0 100) 0)} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {230#(<= (+ main_~j~0 100) 0)} is VALID [2020-07-08 12:47:25,954 INFO L280 TraceCheckUtils]: 6: Hoare triple {230#(<= (+ main_~j~0 100) 0)} assume !(~j~0 < 20); {227#false} is VALID [2020-07-08 12:47:25,955 INFO L280 TraceCheckUtils]: 7: Hoare triple {227#false} ~k~0 := 4; {227#false} is VALID [2020-07-08 12:47:25,955 INFO L280 TraceCheckUtils]: 8: Hoare triple {227#false} assume !(~k~0 <= 3); {227#false} is VALID [2020-07-08 12:47:25,955 INFO L280 TraceCheckUtils]: 9: Hoare triple {227#false} assume !(~i~0 <= 100); {227#false} is VALID [2020-07-08 12:47:25,956 INFO L263 TraceCheckUtils]: 10: Hoare triple {227#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {227#false} is VALID [2020-07-08 12:47:25,956 INFO L280 TraceCheckUtils]: 11: Hoare triple {227#false} ~cond := #in~cond; {227#false} is VALID [2020-07-08 12:47:25,957 INFO L280 TraceCheckUtils]: 12: Hoare triple {227#false} assume 0 == ~cond; {227#false} is VALID [2020-07-08 12:47:25,957 INFO L280 TraceCheckUtils]: 13: Hoare triple {227#false} assume !false; {227#false} is VALID [2020-07-08 12:47:25,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:47:25,959 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327987284] [2020-07-08 12:47:25,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:47:25,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:47:25,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704814959] [2020-07-08 12:47:25,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-07-08 12:47:25,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:25,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:47:25,989 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:25,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:47:25,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:25,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:47:25,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:47:25,991 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 3 states. [2020-07-08 12:47:26,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:26,055 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2020-07-08 12:47:26,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:47:26,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-07-08 12:47:26,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:26,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:47:26,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2020-07-08 12:47:26,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:47:26,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2020-07-08 12:47:26,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 30 transitions. [2020-07-08 12:47:26,132 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:26,133 INFO L225 Difference]: With dead ends: 25 [2020-07-08 12:47:26,134 INFO L226 Difference]: Without dead ends: 16 [2020-07-08 12:47:26,135 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:47:26,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-08 12:47:26,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-08 12:47:26,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:26,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-08 12:47:26,151 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-08 12:47:26,151 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-08 12:47:26,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:26,154 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-07-08 12:47:26,154 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-08 12:47:26,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:26,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:26,155 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-08 12:47:26,155 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-08 12:47:26,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:26,158 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-07-08 12:47:26,158 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-08 12:47:26,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:26,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:26,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:26,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:26,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-08 12:47:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2020-07-08 12:47:26,161 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 14 [2020-07-08 12:47:26,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:26,161 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-07-08 12:47:26,162 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:47:26,162 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-08 12:47:26,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-08 12:47:26,163 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:26,163 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:47:26,163 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 12:47:26,163 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:26,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:26,164 INFO L82 PathProgramCache]: Analyzing trace with hash -224898986, now seen corresponding path program 1 times [2020-07-08 12:47:26,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:26,165 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837529395] [2020-07-08 12:47:26,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:26,241 INFO L280 TraceCheckUtils]: 0: Hoare triple {333#true} assume true; {333#true} is VALID [2020-07-08 12:47:26,242 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {333#true} {333#true} #65#return; {333#true} is VALID [2020-07-08 12:47:26,242 INFO L263 TraceCheckUtils]: 0: Hoare triple {333#true} call ULTIMATE.init(); {333#true} is VALID [2020-07-08 12:47:26,243 INFO L280 TraceCheckUtils]: 1: Hoare triple {333#true} assume true; {333#true} is VALID [2020-07-08 12:47:26,243 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {333#true} {333#true} #65#return; {333#true} is VALID [2020-07-08 12:47:26,243 INFO L263 TraceCheckUtils]: 3: Hoare triple {333#true} call #t~ret0 := main(); {333#true} is VALID [2020-07-08 12:47:26,244 INFO L280 TraceCheckUtils]: 4: Hoare triple {333#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {337#(<= (+ main_~i~0 main_~j~0 100) 0)} is VALID [2020-07-08 12:47:26,246 INFO L280 TraceCheckUtils]: 5: Hoare triple {337#(<= (+ main_~i~0 main_~j~0 100) 0)} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {338#(<= (+ main_~i~0 main_~j~0 99) 0)} is VALID [2020-07-08 12:47:26,249 INFO L280 TraceCheckUtils]: 6: Hoare triple {338#(<= (+ main_~i~0 main_~j~0 99) 0)} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {339#(<= (+ main_~j~0 99) 0)} is VALID [2020-07-08 12:47:26,250 INFO L280 TraceCheckUtils]: 7: Hoare triple {339#(<= (+ main_~j~0 99) 0)} assume !(~j~0 < 20); {334#false} is VALID [2020-07-08 12:47:26,250 INFO L280 TraceCheckUtils]: 8: Hoare triple {334#false} ~k~0 := 4; {334#false} is VALID [2020-07-08 12:47:26,251 INFO L280 TraceCheckUtils]: 9: Hoare triple {334#false} assume !(~k~0 <= 3); {334#false} is VALID [2020-07-08 12:47:26,251 INFO L280 TraceCheckUtils]: 10: Hoare triple {334#false} assume !(~i~0 <= 100); {334#false} is VALID [2020-07-08 12:47:26,251 INFO L263 TraceCheckUtils]: 11: Hoare triple {334#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {334#false} is VALID [2020-07-08 12:47:26,252 INFO L280 TraceCheckUtils]: 12: Hoare triple {334#false} ~cond := #in~cond; {334#false} is VALID [2020-07-08 12:47:26,252 INFO L280 TraceCheckUtils]: 13: Hoare triple {334#false} assume 0 == ~cond; {334#false} is VALID [2020-07-08 12:47:26,252 INFO L280 TraceCheckUtils]: 14: Hoare triple {334#false} assume !false; {334#false} is VALID [2020-07-08 12:47:26,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:47:26,254 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837529395] [2020-07-08 12:47:26,255 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638285460] [2020-07-08 12:47:26,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:47:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:26,301 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-08 12:47:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:26,326 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:47:26,469 INFO L263 TraceCheckUtils]: 0: Hoare triple {333#true} call ULTIMATE.init(); {333#true} is VALID [2020-07-08 12:47:26,469 INFO L280 TraceCheckUtils]: 1: Hoare triple {333#true} assume true; {333#true} is VALID [2020-07-08 12:47:26,470 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {333#true} {333#true} #65#return; {333#true} is VALID [2020-07-08 12:47:26,470 INFO L263 TraceCheckUtils]: 3: Hoare triple {333#true} call #t~ret0 := main(); {333#true} is VALID [2020-07-08 12:47:26,471 INFO L280 TraceCheckUtils]: 4: Hoare triple {333#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {355#(<= main_~i~0 0)} is VALID [2020-07-08 12:47:26,473 INFO L280 TraceCheckUtils]: 5: Hoare triple {355#(<= main_~i~0 0)} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {359#(<= main_~i~0 1)} is VALID [2020-07-08 12:47:26,474 INFO L280 TraceCheckUtils]: 6: Hoare triple {359#(<= main_~i~0 1)} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {359#(<= main_~i~0 1)} is VALID [2020-07-08 12:47:26,474 INFO L280 TraceCheckUtils]: 7: Hoare triple {359#(<= main_~i~0 1)} assume !(~j~0 < 20); {359#(<= main_~i~0 1)} is VALID [2020-07-08 12:47:26,476 INFO L280 TraceCheckUtils]: 8: Hoare triple {359#(<= main_~i~0 1)} ~k~0 := 4; {359#(<= main_~i~0 1)} is VALID [2020-07-08 12:47:26,477 INFO L280 TraceCheckUtils]: 9: Hoare triple {359#(<= main_~i~0 1)} assume !(~k~0 <= 3); {359#(<= main_~i~0 1)} is VALID [2020-07-08 12:47:26,479 INFO L280 TraceCheckUtils]: 10: Hoare triple {359#(<= main_~i~0 1)} assume !(~i~0 <= 100); {334#false} is VALID [2020-07-08 12:47:26,480 INFO L263 TraceCheckUtils]: 11: Hoare triple {334#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {334#false} is VALID [2020-07-08 12:47:26,480 INFO L280 TraceCheckUtils]: 12: Hoare triple {334#false} ~cond := #in~cond; {334#false} is VALID [2020-07-08 12:47:26,480 INFO L280 TraceCheckUtils]: 13: Hoare triple {334#false} assume 0 == ~cond; {334#false} is VALID [2020-07-08 12:47:26,481 INFO L280 TraceCheckUtils]: 14: Hoare triple {334#false} assume !false; {334#false} is VALID [2020-07-08 12:47:26,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-08 12:47:26,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:47:26,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2020-07-08 12:47:26,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287063241] [2020-07-08 12:47:26,483 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-07-08 12:47:26,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:26,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 12:47:26,521 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:26,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 12:47:26,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:26,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 12:47:26,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:47:26,523 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 7 states. [2020-07-08 12:47:26,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:26,772 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2020-07-08 12:47:26,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:47:26,773 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-07-08 12:47:26,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:26,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:47:26,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2020-07-08 12:47:26,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:47:26,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2020-07-08 12:47:26,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 38 transitions. [2020-07-08 12:47:26,841 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:26,844 INFO L225 Difference]: With dead ends: 30 [2020-07-08 12:47:26,845 INFO L226 Difference]: Without dead ends: 21 [2020-07-08 12:47:26,847 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-08 12:47:26,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-08 12:47:26,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-08 12:47:26,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:26,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2020-07-08 12:47:26,884 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-08 12:47:26,884 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-08 12:47:26,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:26,886 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2020-07-08 12:47:26,887 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-08 12:47:26,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:26,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:26,888 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-08 12:47:26,888 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-08 12:47:26,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:26,891 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2020-07-08 12:47:26,891 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-08 12:47:26,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:26,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:26,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:26,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:26,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-08 12:47:26,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-08 12:47:26,895 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 15 [2020-07-08 12:47:26,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:26,895 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-08 12:47:26,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 12:47:26,896 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-08 12:47:26,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-08 12:47:26,897 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:26,897 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:47:27,110 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:47:27,111 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:27,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:27,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1734889408, now seen corresponding path program 2 times [2020-07-08 12:47:27,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:27,113 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853568424] [2020-07-08 12:47:27,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:27,234 INFO L280 TraceCheckUtils]: 0: Hoare triple {520#true} assume true; {520#true} is VALID [2020-07-08 12:47:27,235 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {520#true} {520#true} #65#return; {520#true} is VALID [2020-07-08 12:47:27,236 INFO L263 TraceCheckUtils]: 0: Hoare triple {520#true} call ULTIMATE.init(); {520#true} is VALID [2020-07-08 12:47:27,237 INFO L280 TraceCheckUtils]: 1: Hoare triple {520#true} assume true; {520#true} is VALID [2020-07-08 12:47:27,237 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {520#true} {520#true} #65#return; {520#true} is VALID [2020-07-08 12:47:27,241 INFO L263 TraceCheckUtils]: 3: Hoare triple {520#true} call #t~ret0 := main(); {520#true} is VALID [2020-07-08 12:47:27,248 INFO L280 TraceCheckUtils]: 4: Hoare triple {520#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {524#(<= (+ (* 2 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-08 12:47:27,249 INFO L280 TraceCheckUtils]: 5: Hoare triple {524#(<= (+ (* 2 main_~i~0) main_~j~0 100) 0)} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {525#(<= (+ (* 2 main_~i~0) main_~j~0 98) 0)} is VALID [2020-07-08 12:47:27,251 INFO L280 TraceCheckUtils]: 6: Hoare triple {525#(<= (+ (* 2 main_~i~0) main_~j~0 98) 0)} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {526#(<= (+ main_~i~0 main_~j~0 98) 0)} is VALID [2020-07-08 12:47:27,252 INFO L280 TraceCheckUtils]: 7: Hoare triple {526#(<= (+ main_~i~0 main_~j~0 98) 0)} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {527#(<= (+ main_~j~0 98) 0)} is VALID [2020-07-08 12:47:27,254 INFO L280 TraceCheckUtils]: 8: Hoare triple {527#(<= (+ main_~j~0 98) 0)} assume !(~j~0 < 20); {521#false} is VALID [2020-07-08 12:47:27,254 INFO L280 TraceCheckUtils]: 9: Hoare triple {521#false} ~k~0 := 4; {521#false} is VALID [2020-07-08 12:47:27,254 INFO L280 TraceCheckUtils]: 10: Hoare triple {521#false} assume !(~k~0 <= 3); {521#false} is VALID [2020-07-08 12:47:27,255 INFO L280 TraceCheckUtils]: 11: Hoare triple {521#false} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {521#false} is VALID [2020-07-08 12:47:27,255 INFO L280 TraceCheckUtils]: 12: Hoare triple {521#false} assume !(~j~0 < 20); {521#false} is VALID [2020-07-08 12:47:27,256 INFO L280 TraceCheckUtils]: 13: Hoare triple {521#false} ~k~0 := 4; {521#false} is VALID [2020-07-08 12:47:27,256 INFO L280 TraceCheckUtils]: 14: Hoare triple {521#false} assume !(~k~0 <= 3); {521#false} is VALID [2020-07-08 12:47:27,256 INFO L280 TraceCheckUtils]: 15: Hoare triple {521#false} assume !(~i~0 <= 100); {521#false} is VALID [2020-07-08 12:47:27,257 INFO L263 TraceCheckUtils]: 16: Hoare triple {521#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {521#false} is VALID [2020-07-08 12:47:27,257 INFO L280 TraceCheckUtils]: 17: Hoare triple {521#false} ~cond := #in~cond; {521#false} is VALID [2020-07-08 12:47:27,257 INFO L280 TraceCheckUtils]: 18: Hoare triple {521#false} assume 0 == ~cond; {521#false} is VALID [2020-07-08 12:47:27,258 INFO L280 TraceCheckUtils]: 19: Hoare triple {521#false} assume !false; {521#false} is VALID [2020-07-08 12:47:27,260 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-08 12:47:27,263 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853568424] [2020-07-08 12:47:27,263 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200135738] [2020-07-08 12:47:27,263 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:47:27,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:47:27,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:47:27,304 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-08 12:47:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:27,315 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:47:27,480 INFO L263 TraceCheckUtils]: 0: Hoare triple {520#true} call ULTIMATE.init(); {520#true} is VALID [2020-07-08 12:47:27,480 INFO L280 TraceCheckUtils]: 1: Hoare triple {520#true} assume true; {520#true} is VALID [2020-07-08 12:47:27,480 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {520#true} {520#true} #65#return; {520#true} is VALID [2020-07-08 12:47:27,481 INFO L263 TraceCheckUtils]: 3: Hoare triple {520#true} call #t~ret0 := main(); {520#true} is VALID [2020-07-08 12:47:27,483 INFO L280 TraceCheckUtils]: 4: Hoare triple {520#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {543#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID [2020-07-08 12:47:27,484 INFO L280 TraceCheckUtils]: 5: Hoare triple {543#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {547#(and (<= (+ main_~j~0 100) 0) (<= main_~i~0 1))} is VALID [2020-07-08 12:47:27,486 INFO L280 TraceCheckUtils]: 6: Hoare triple {547#(and (<= (+ main_~j~0 100) 0) (<= main_~i~0 1))} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {551#(and (<= (+ main_~j~0 100) main_~i~0) (<= main_~i~0 1))} is VALID [2020-07-08 12:47:27,488 INFO L280 TraceCheckUtils]: 7: Hoare triple {551#(and (<= (+ main_~j~0 100) main_~i~0) (<= main_~i~0 1))} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {527#(<= (+ main_~j~0 98) 0)} is VALID [2020-07-08 12:47:27,489 INFO L280 TraceCheckUtils]: 8: Hoare triple {527#(<= (+ main_~j~0 98) 0)} assume !(~j~0 < 20); {521#false} is VALID [2020-07-08 12:47:27,490 INFO L280 TraceCheckUtils]: 9: Hoare triple {521#false} ~k~0 := 4; {521#false} is VALID [2020-07-08 12:47:27,491 INFO L280 TraceCheckUtils]: 10: Hoare triple {521#false} assume !(~k~0 <= 3); {521#false} is VALID [2020-07-08 12:47:27,491 INFO L280 TraceCheckUtils]: 11: Hoare triple {521#false} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {521#false} is VALID [2020-07-08 12:47:27,491 INFO L280 TraceCheckUtils]: 12: Hoare triple {521#false} assume !(~j~0 < 20); {521#false} is VALID [2020-07-08 12:47:27,492 INFO L280 TraceCheckUtils]: 13: Hoare triple {521#false} ~k~0 := 4; {521#false} is VALID [2020-07-08 12:47:27,492 INFO L280 TraceCheckUtils]: 14: Hoare triple {521#false} assume !(~k~0 <= 3); {521#false} is VALID [2020-07-08 12:47:27,492 INFO L280 TraceCheckUtils]: 15: Hoare triple {521#false} assume !(~i~0 <= 100); {521#false} is VALID [2020-07-08 12:47:27,493 INFO L263 TraceCheckUtils]: 16: Hoare triple {521#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {521#false} is VALID [2020-07-08 12:47:27,493 INFO L280 TraceCheckUtils]: 17: Hoare triple {521#false} ~cond := #in~cond; {521#false} is VALID [2020-07-08 12:47:27,494 INFO L280 TraceCheckUtils]: 18: Hoare triple {521#false} assume 0 == ~cond; {521#false} is VALID [2020-07-08 12:47:27,494 INFO L280 TraceCheckUtils]: 19: Hoare triple {521#false} assume !false; {521#false} is VALID [2020-07-08 12:47:27,495 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-08 12:47:27,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:47:27,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-07-08 12:47:27,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071829272] [2020-07-08 12:47:27,497 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-07-08 12:47:27,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:27,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 12:47:27,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:27,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 12:47:27,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:27,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 12:47:27,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-07-08 12:47:27,528 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 9 states. [2020-07-08 12:47:27,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:27,815 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2020-07-08 12:47:27,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:47:27,815 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-07-08 12:47:27,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:27,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 12:47:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2020-07-08 12:47:27,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 12:47:27,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2020-07-08 12:47:27,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2020-07-08 12:47:27,865 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:27,866 INFO L225 Difference]: With dead ends: 34 [2020-07-08 12:47:27,867 INFO L226 Difference]: Without dead ends: 22 [2020-07-08 12:47:27,868 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-07-08 12:47:27,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-08 12:47:27,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-08 12:47:27,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:27,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2020-07-08 12:47:27,897 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-08 12:47:27,897 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-08 12:47:27,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:27,899 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-07-08 12:47:27,899 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-07-08 12:47:27,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:27,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:27,900 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-08 12:47:27,900 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-08 12:47:27,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:27,902 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-07-08 12:47:27,902 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-07-08 12:47:27,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:27,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:27,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:27,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:27,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-08 12:47:27,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2020-07-08 12:47:27,905 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 20 [2020-07-08 12:47:27,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:27,906 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-07-08 12:47:27,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 12:47:27,906 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-07-08 12:47:27,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-08 12:47:27,907 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:47:27,907 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:47:28,121 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:47:28,122 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:47:28,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:47:28,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1612949224, now seen corresponding path program 3 times [2020-07-08 12:47:28,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:47:28,124 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617983999] [2020-07-08 12:47:28,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:47:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:28,214 INFO L280 TraceCheckUtils]: 0: Hoare triple {733#true} assume true; {733#true} is VALID [2020-07-08 12:47:28,214 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {733#true} {733#true} #65#return; {733#true} is VALID [2020-07-08 12:47:28,214 INFO L263 TraceCheckUtils]: 0: Hoare triple {733#true} call ULTIMATE.init(); {733#true} is VALID [2020-07-08 12:47:28,215 INFO L280 TraceCheckUtils]: 1: Hoare triple {733#true} assume true; {733#true} is VALID [2020-07-08 12:47:28,215 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {733#true} {733#true} #65#return; {733#true} is VALID [2020-07-08 12:47:28,215 INFO L263 TraceCheckUtils]: 3: Hoare triple {733#true} call #t~ret0 := main(); {733#true} is VALID [2020-07-08 12:47:28,216 INFO L280 TraceCheckUtils]: 4: Hoare triple {733#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {737#(<= (+ (* 3 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-08 12:47:28,217 INFO L280 TraceCheckUtils]: 5: Hoare triple {737#(<= (+ (* 3 main_~i~0) main_~j~0 100) 0)} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {738#(<= (+ (* 3 main_~i~0) main_~j~0 97) 0)} is VALID [2020-07-08 12:47:28,219 INFO L280 TraceCheckUtils]: 6: Hoare triple {738#(<= (+ (* 3 main_~i~0) main_~j~0 97) 0)} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {739#(<= (+ (* 2 main_~i~0) main_~j~0 97) 0)} is VALID [2020-07-08 12:47:28,220 INFO L280 TraceCheckUtils]: 7: Hoare triple {739#(<= (+ (* 2 main_~i~0) main_~j~0 97) 0)} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {740#(<= (+ main_~i~0 main_~j~0 97) 0)} is VALID [2020-07-08 12:47:28,222 INFO L280 TraceCheckUtils]: 8: Hoare triple {740#(<= (+ main_~i~0 main_~j~0 97) 0)} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {741#(<= (+ main_~j~0 97) 0)} is VALID [2020-07-08 12:47:28,223 INFO L280 TraceCheckUtils]: 9: Hoare triple {741#(<= (+ main_~j~0 97) 0)} assume !(~j~0 < 20); {734#false} is VALID [2020-07-08 12:47:28,223 INFO L280 TraceCheckUtils]: 10: Hoare triple {734#false} ~k~0 := 4; {734#false} is VALID [2020-07-08 12:47:28,223 INFO L280 TraceCheckUtils]: 11: Hoare triple {734#false} assume !(~k~0 <= 3); {734#false} is VALID [2020-07-08 12:47:28,224 INFO L280 TraceCheckUtils]: 12: Hoare triple {734#false} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {734#false} is VALID [2020-07-08 12:47:28,224 INFO L280 TraceCheckUtils]: 13: Hoare triple {734#false} assume !(~j~0 < 20); {734#false} is VALID [2020-07-08 12:47:28,224 INFO L280 TraceCheckUtils]: 14: Hoare triple {734#false} ~k~0 := 4; {734#false} is VALID [2020-07-08 12:47:28,225 INFO L280 TraceCheckUtils]: 15: Hoare triple {734#false} assume !(~k~0 <= 3); {734#false} is VALID [2020-07-08 12:47:28,225 INFO L280 TraceCheckUtils]: 16: Hoare triple {734#false} assume !(~i~0 <= 100); {734#false} is VALID [2020-07-08 12:47:28,225 INFO L263 TraceCheckUtils]: 17: Hoare triple {734#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {734#false} is VALID [2020-07-08 12:47:28,226 INFO L280 TraceCheckUtils]: 18: Hoare triple {734#false} ~cond := #in~cond; {734#false} is VALID [2020-07-08 12:47:28,226 INFO L280 TraceCheckUtils]: 19: Hoare triple {734#false} assume 0 == ~cond; {734#false} is VALID [2020-07-08 12:47:28,226 INFO L280 TraceCheckUtils]: 20: Hoare triple {734#false} assume !false; {734#false} is VALID [2020-07-08 12:47:28,228 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-08 12:47:28,228 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617983999] [2020-07-08 12:47:28,228 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521914934] [2020-07-08 12:47:28,229 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:47:28,263 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-08 12:47:28,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:47:28,264 INFO L264 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-08 12:47:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:47:28,276 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:47:28,358 INFO L263 TraceCheckUtils]: 0: Hoare triple {733#true} call ULTIMATE.init(); {733#true} is VALID [2020-07-08 12:47:28,358 INFO L280 TraceCheckUtils]: 1: Hoare triple {733#true} assume true; {733#true} is VALID [2020-07-08 12:47:28,358 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {733#true} {733#true} #65#return; {733#true} is VALID [2020-07-08 12:47:28,359 INFO L263 TraceCheckUtils]: 3: Hoare triple {733#true} call #t~ret0 := main(); {733#true} is VALID [2020-07-08 12:47:28,359 INFO L280 TraceCheckUtils]: 4: Hoare triple {733#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {733#true} is VALID [2020-07-08 12:47:28,359 INFO L280 TraceCheckUtils]: 5: Hoare triple {733#true} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {733#true} is VALID [2020-07-08 12:47:28,360 INFO L280 TraceCheckUtils]: 6: Hoare triple {733#true} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {733#true} is VALID [2020-07-08 12:47:28,360 INFO L280 TraceCheckUtils]: 7: Hoare triple {733#true} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {733#true} is VALID [2020-07-08 12:47:28,361 INFO L280 TraceCheckUtils]: 8: Hoare triple {733#true} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {733#true} is VALID [2020-07-08 12:47:28,361 INFO L280 TraceCheckUtils]: 9: Hoare triple {733#true} assume !(~j~0 < 20); {733#true} is VALID [2020-07-08 12:47:28,361 INFO L280 TraceCheckUtils]: 10: Hoare triple {733#true} ~k~0 := 4; {733#true} is VALID [2020-07-08 12:47:28,361 INFO L280 TraceCheckUtils]: 11: Hoare triple {733#true} assume !(~k~0 <= 3); {733#true} is VALID [2020-07-08 12:47:28,362 INFO L280 TraceCheckUtils]: 12: Hoare triple {733#true} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {733#true} is VALID [2020-07-08 12:47:28,362 INFO L280 TraceCheckUtils]: 13: Hoare triple {733#true} assume !(~j~0 < 20); {733#true} is VALID [2020-07-08 12:47:28,364 INFO L280 TraceCheckUtils]: 14: Hoare triple {733#true} ~k~0 := 4; {787#(= 4 main_~k~0)} is VALID [2020-07-08 12:47:28,364 INFO L280 TraceCheckUtils]: 15: Hoare triple {787#(= 4 main_~k~0)} assume !(~k~0 <= 3); {787#(= 4 main_~k~0)} is VALID [2020-07-08 12:47:28,365 INFO L280 TraceCheckUtils]: 16: Hoare triple {787#(= 4 main_~k~0)} assume !(~i~0 <= 100); {787#(= 4 main_~k~0)} is VALID [2020-07-08 12:47:28,366 INFO L263 TraceCheckUtils]: 17: Hoare triple {787#(= 4 main_~k~0)} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {797#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-08 12:47:28,367 INFO L280 TraceCheckUtils]: 18: Hoare triple {797#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {801#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:47:28,367 INFO L280 TraceCheckUtils]: 19: Hoare triple {801#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {734#false} is VALID [2020-07-08 12:47:28,368 INFO L280 TraceCheckUtils]: 20: Hoare triple {734#false} assume !false; {734#false} is VALID [2020-07-08 12:47:28,368 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-08 12:47:28,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:47:28,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2020-07-08 12:47:28,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631246392] [2020-07-08 12:47:28,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-07-08 12:47:28,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:47:28,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:47:28,393 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:28,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:47:28,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:47:28,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:47:28,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-08 12:47:28,395 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 5 states. [2020-07-08 12:47:28,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:28,505 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2020-07-08 12:47:28,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 12:47:28,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-07-08 12:47:28,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:47:28,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:47:28,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2020-07-08 12:47:28,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:47:28,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2020-07-08 12:47:28,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2020-07-08 12:47:28,550 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:47:28,550 INFO L225 Difference]: With dead ends: 31 [2020-07-08 12:47:28,550 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 12:47:28,551 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-07-08 12:47:28,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 12:47:28,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 12:47:28,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:47:28,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 12:47:28,551 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:47:28,552 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:47:28,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:28,552 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:47:28,552 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:47:28,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:28,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:28,552 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:47:28,552 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:47:28,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:47:28,553 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:47:28,553 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:47:28,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:28,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:47:28,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:47:28,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:47:28,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 12:47:28,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 12:47:28,554 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2020-07-08 12:47:28,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:47:28,555 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 12:47:28,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:47:28,555 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:47:28,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:47:28,763 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:47:28,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 12:47:28,858 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 12:47:28,858 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:47:28,858 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:47:28,858 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 12:47:28,858 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 12:47:28,859 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:47:28,859 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-08 12:47:28,859 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-08 12:47:28,859 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-07-08 12:47:28,859 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-08 12:47:28,859 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 30) no Hoare annotation was computed. [2020-07-08 12:47:28,859 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 30) no Hoare annotation was computed. [2020-07-08 12:47:28,859 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 30) the Hoare annotation is: true [2020-07-08 12:47:28,860 INFO L268 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2020-07-08 12:47:28,860 INFO L264 CegarLoopResult]: At program point L24-2(lines 24 26) the Hoare annotation is: (= 4 main_~k~0) [2020-07-08 12:47:28,860 INFO L264 CegarLoopResult]: At program point L24-3(lines 18 27) the Hoare annotation is: (or (= 4 main_~k~0) (and (<= main_~i~0 0) (<= (+ main_~j~0 100) main_~i~0))) [2020-07-08 12:47:28,860 INFO L264 CegarLoopResult]: At program point L20-2(lines 20 22) the Hoare annotation is: (or (= 4 main_~k~0) (<= main_~i~0 1)) [2020-07-08 12:47:28,860 INFO L268 CegarLoopResult]: For program point L20-3(lines 20 22) no Hoare annotation was computed. [2020-07-08 12:47:28,860 INFO L264 CegarLoopResult]: At program point L18-2(lines 18 27) the Hoare annotation is: (= 4 main_~k~0) [2020-07-08 12:47:28,860 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-08 12:47:28,860 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-07-08 12:47:28,860 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-08 12:47:28,860 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-08 12:47:28,861 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-07-08 12:47:28,861 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-08 12:47:28,865 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:47:28,865 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 12:47:28,866 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-08 12:47:28,866 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:47:28,866 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:47:28,866 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 12:47:28,866 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 12:47:28,871 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-08 12:47:28,871 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-08 12:47:28,871 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:47:28,871 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-08 12:47:28,871 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-08 12:47:28,872 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-08 12:47:28,872 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-08 12:47:28,872 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-08 12:47:28,872 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-08 12:47:28,872 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-08 12:47:28,872 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-08 12:47:28,872 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-08 12:47:28,873 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:47:28,873 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:47:28,879 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:47:28,879 INFO L163 areAnnotationChecker]: CFG has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 12:47:28,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:47:28 BoogieIcfgContainer [2020-07-08 12:47:28,891 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:47:28,895 INFO L168 Benchmark]: Toolchain (without parser) took 5003.75 ms. Allocated memory was 137.4 MB in the beginning and 250.1 MB in the end (delta: 112.7 MB). Free memory was 102.8 MB in the beginning and 117.9 MB in the end (delta: -15.2 MB). Peak memory consumption was 97.6 MB. Max. memory is 7.1 GB. [2020-07-08 12:47:28,896 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 12:47:28,896 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.38 ms. Allocated memory is still 137.4 MB. Free memory was 102.3 MB in the beginning and 92.8 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-08 12:47:28,897 INFO L168 Benchmark]: Boogie Preprocessor took 53.07 ms. Allocated memory is still 137.4 MB. Free memory was 92.8 MB in the beginning and 91.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2020-07-08 12:47:28,898 INFO L168 Benchmark]: RCFGBuilder took 513.19 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 91.2 MB in the beginning and 163.9 MB in the end (delta: -72.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2020-07-08 12:47:28,899 INFO L168 Benchmark]: TraceAbstraction took 4064.67 ms. Allocated memory was 200.8 MB in the beginning and 250.1 MB in the end (delta: 49.3 MB). Free memory was 163.2 MB in the beginning and 117.9 MB in the end (delta: 45.3 MB). Peak memory consumption was 94.6 MB. Max. memory is 7.1 GB. [2020-07-08 12:47:28,903 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 365.38 ms. Allocated memory is still 137.4 MB. Free memory was 102.3 MB in the beginning and 92.8 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.07 ms. Allocated memory is still 137.4 MB. Free memory was 92.8 MB in the beginning and 91.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 513.19 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 91.2 MB in the beginning and 163.9 MB in the end (delta: -72.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4064.67 ms. Allocated memory was 200.8 MB in the beginning and 250.1 MB in the end (delta: 49.3 MB). Free memory was 163.2 MB in the beginning and 117.9 MB in the end (delta: 45.3 MB). Peak memory consumption was 94.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 4 == k - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 4 == k || i <= 1 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 4 == k || (i <= 0 && j + 100 <= i) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.8s, OverallIterations: 6, TraceHistogramMax: 3, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 96 SDtfs, 5 SDslu, 188 SDs, 0 SdLazy, 56 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 15 PreInvPairs, 26 NumberOfFragments, 31 HoareAnnotationTreeSize, 15 FomulaSimplifications, 63 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 16 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 146 NumberOfCodeBlocks, 139 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 4500 SizeOfPredicates, 5 NumberOfNonLiveVariables, 115 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 43/57 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...