/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-lit/cggmp2005b.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 02:32:06,911 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 02:32:06,914 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 02:32:06,935 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 02:32:06,936 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 02:32:06,938 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 02:32:06,940 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 02:32:06,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 02:32:06,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 02:32:06,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 02:32:06,959 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 02:32:06,960 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 02:32:06,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 02:32:06,961 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 02:32:06,963 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 02:32:06,964 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 02:32:06,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 02:32:06,966 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 02:32:06,967 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 02:32:06,970 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 02:32:06,971 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 02:32:06,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 02:32:06,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 02:32:06,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 02:32:06,977 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 02:32:06,977 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 02:32:06,978 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 02:32:06,979 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 02:32:06,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 02:32:06,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 02:32:06,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 02:32:06,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 02:32:06,982 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 02:32:06,983 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 02:32:06,984 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 02:32:06,984 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 02:32:06,985 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 02:32:06,985 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 02:32:06,986 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 02:32:06,987 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 02:32:06,988 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 02:32:06,989 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 02:32:06,998 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 02:32:06,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 02:32:07,000 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 02:32:07,001 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 02:32:07,001 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 02:32:07,001 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 02:32:07,001 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 02:32:07,002 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 02:32:07,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 02:32:07,002 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 02:32:07,002 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 02:32:07,002 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 02:32:07,003 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 02:32:07,003 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 02:32:07,003 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 02:32:07,003 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 02:32:07,003 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 02:32:07,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 02:32:07,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:32:07,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 02:32:07,004 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 02:32:07,004 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 02:32:07,005 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 02:32:07,323 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 02:32:07,338 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 02:32:07,342 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 02:32:07,344 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 02:32:07,344 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 02:32:07,345 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-11 02:32:07,415 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18be32814/68c48b3fef8c48eba24555f82049c619/FLAG0d2b9ca7b [2020-07-11 02:32:07,922 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 02:32:07,923 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005b.i [2020-07-11 02:32:07,930 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18be32814/68c48b3fef8c48eba24555f82049c619/FLAG0d2b9ca7b [2020-07-11 02:32:08,293 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18be32814/68c48b3fef8c48eba24555f82049c619 [2020-07-11 02:32:08,308 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 02:32:08,310 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 02:32:08,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 02:32:08,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 02:32:08,316 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 02:32:08,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:32:08" (1/1) ... [2020-07-11 02:32:08,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fe1dbf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:08, skipping insertion in model container [2020-07-11 02:32:08,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:32:08" (1/1) ... [2020-07-11 02:32:08,333 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 02:32:08,361 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 02:32:08,564 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:32:08,575 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 02:32:08,601 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:32:08,620 INFO L208 MainTranslator]: Completed translation [2020-07-11 02:32:08,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:08 WrapperNode [2020-07-11 02:32:08,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 02:32:08,622 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 02:32:08,622 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 02:32:08,623 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 02:32:08,636 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:08" (1/1) ... [2020-07-11 02:32:08,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:08" (1/1) ... [2020-07-11 02:32:08,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:08" (1/1) ... [2020-07-11 02:32:08,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:08" (1/1) ... [2020-07-11 02:32:08,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:08" (1/1) ... [2020-07-11 02:32:08,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:08" (1/1) ... [2020-07-11 02:32:08,657 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:08" (1/1) ... [2020-07-11 02:32:08,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 02:32:08,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 02:32:08,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 02:32:08,660 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 02:32:08,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:08" (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-11 02:32:08,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 02:32:08,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 02:32:08,827 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-11 02:32:08,827 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-11 02:32:08,828 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 02:32:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 02:32:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-11 02:32:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-11 02:32:08,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 02:32:08,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 02:32:08,829 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 02:32:08,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 02:32:08,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 02:32:09,148 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 02:32:09,148 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-11 02:32:09,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:32:09 BoogieIcfgContainer [2020-07-11 02:32:09,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 02:32:09,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 02:32:09,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 02:32:09,174 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 02:32:09,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 02:32:08" (1/3) ... [2020-07-11 02:32:09,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ec535d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:32:09, skipping insertion in model container [2020-07-11 02:32:09,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:32:08" (2/3) ... [2020-07-11 02:32:09,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ec535d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:32:09, skipping insertion in model container [2020-07-11 02:32:09,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:32:09" (3/3) ... [2020-07-11 02:32:09,186 INFO L109 eAbstractionObserver]: Analyzing ICFG cggmp2005b.i [2020-07-11 02:32:09,205 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 02:32:09,215 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 02:32:09,230 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 02:32:09,254 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 02:32:09,255 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 02:32:09,255 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 02:32:09,255 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 02:32:09,256 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 02:32:09,256 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 02:32:09,256 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 02:32:09,257 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 02:32:09,274 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-07-11 02:32:09,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-11 02:32:09,288 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:09,289 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:32:09,290 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:09,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:09,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1930258608, now seen corresponding path program 1 times [2020-07-11 02:32:09,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:09,308 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1259941412] [2020-07-11 02:32:09,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:09,453 INFO L280 TraceCheckUtils]: 0: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-11 02:32:09,454 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {32#true} {32#true} #74#return; {32#true} is VALID [2020-07-11 02:32:09,457 INFO L263 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2020-07-11 02:32:09,458 INFO L280 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-11 02:32:09,459 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #74#return; {32#true} is VALID [2020-07-11 02:32:09,460 INFO L263 TraceCheckUtils]: 3: Hoare triple {32#true} call #t~ret0 := main(); {32#true} is VALID [2020-07-11 02:32:09,460 INFO L280 TraceCheckUtils]: 4: Hoare triple {32#true} havoc ~i~0; {32#true} is VALID [2020-07-11 02:32:09,460 INFO L280 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~j~0; {32#true} is VALID [2020-07-11 02:32:09,461 INFO L280 TraceCheckUtils]: 6: Hoare triple {32#true} havoc ~k~0; {32#true} is VALID [2020-07-11 02:32:09,461 INFO L280 TraceCheckUtils]: 7: Hoare triple {32#true} ~i~0 := 0; {32#true} is VALID [2020-07-11 02:32:09,462 INFO L280 TraceCheckUtils]: 8: Hoare triple {32#true} ~k~0 := 9; {32#true} is VALID [2020-07-11 02:32:09,462 INFO L280 TraceCheckUtils]: 9: Hoare triple {32#true} ~j~0 := -100; {32#true} is VALID [2020-07-11 02:32:09,466 INFO L280 TraceCheckUtils]: 10: Hoare triple {32#true} assume !true; {33#false} is VALID [2020-07-11 02:32:09,466 INFO L263 TraceCheckUtils]: 11: Hoare triple {33#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {33#false} is VALID [2020-07-11 02:32:09,466 INFO L280 TraceCheckUtils]: 12: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2020-07-11 02:32:09,467 INFO L280 TraceCheckUtils]: 13: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2020-07-11 02:32:09,467 INFO L280 TraceCheckUtils]: 14: Hoare triple {33#false} assume !false; {33#false} is VALID [2020-07-11 02:32:09,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:32:09,470 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1259941412] [2020-07-11 02:32:09,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:32:09,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-11 02:32:09,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062978116] [2020-07-11 02:32:09,482 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2020-07-11 02:32:09,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:09,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-11 02:32:09,537 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:09,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-11 02:32:09,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:09,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-11 02:32:09,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-11 02:32:09,553 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2020-07-11 02:32:09,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:09,705 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2020-07-11 02:32:09,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-11 02:32:09,706 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2020-07-11 02:32:09,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:09,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-11 02:32:09,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 61 transitions. [2020-07-11 02:32:09,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-11 02:32:09,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 61 transitions. [2020-07-11 02:32:09,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 61 transitions. [2020-07-11 02:32:09,857 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:09,870 INFO L225 Difference]: With dead ends: 48 [2020-07-11 02:32:09,870 INFO L226 Difference]: Without dead ends: 22 [2020-07-11 02:32:09,875 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-11 02:32:09,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-11 02:32:09,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-11 02:32:09,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:09,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2020-07-11 02:32:09,938 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-11 02:32:09,938 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-11 02:32:09,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:09,943 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2020-07-11 02:32:09,944 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2020-07-11 02:32:09,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:09,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:09,945 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-11 02:32:09,945 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-11 02:32:09,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:09,949 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2020-07-11 02:32:09,950 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2020-07-11 02:32:09,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:09,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:09,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:09,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:09,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-11 02:32:09,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2020-07-11 02:32:09,956 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2020-07-11 02:32:09,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:09,957 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-07-11 02:32:09,957 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-11 02:32:09,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 24 transitions. [2020-07-11 02:32:09,996 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:09,997 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2020-07-11 02:32:09,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-11 02:32:09,998 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:09,998 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:32:09,999 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 02:32:09,999 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:09,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:10,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1900705936, now seen corresponding path program 1 times [2020-07-11 02:32:10,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:10,000 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1167857627] [2020-07-11 02:32:10,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:10,063 INFO L280 TraceCheckUtils]: 0: Hoare triple {222#true} assume true; {222#true} is VALID [2020-07-11 02:32:10,064 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {222#true} {222#true} #74#return; {222#true} is VALID [2020-07-11 02:32:10,064 INFO L263 TraceCheckUtils]: 0: Hoare triple {222#true} call ULTIMATE.init(); {222#true} is VALID [2020-07-11 02:32:10,064 INFO L280 TraceCheckUtils]: 1: Hoare triple {222#true} assume true; {222#true} is VALID [2020-07-11 02:32:10,065 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {222#true} {222#true} #74#return; {222#true} is VALID [2020-07-11 02:32:10,065 INFO L263 TraceCheckUtils]: 3: Hoare triple {222#true} call #t~ret0 := main(); {222#true} is VALID [2020-07-11 02:32:10,065 INFO L280 TraceCheckUtils]: 4: Hoare triple {222#true} havoc ~i~0; {222#true} is VALID [2020-07-11 02:32:10,066 INFO L280 TraceCheckUtils]: 5: Hoare triple {222#true} havoc ~j~0; {222#true} is VALID [2020-07-11 02:32:10,066 INFO L280 TraceCheckUtils]: 6: Hoare triple {222#true} havoc ~k~0; {222#true} is VALID [2020-07-11 02:32:10,068 INFO L280 TraceCheckUtils]: 7: Hoare triple {222#true} ~i~0 := 0; {226#(<= main_~i~0 0)} is VALID [2020-07-11 02:32:10,069 INFO L280 TraceCheckUtils]: 8: Hoare triple {226#(<= main_~i~0 0)} ~k~0 := 9; {226#(<= main_~i~0 0)} is VALID [2020-07-11 02:32:10,070 INFO L280 TraceCheckUtils]: 9: Hoare triple {226#(<= main_~i~0 0)} ~j~0 := -100; {226#(<= main_~i~0 0)} is VALID [2020-07-11 02:32:10,072 INFO L280 TraceCheckUtils]: 10: Hoare triple {226#(<= main_~i~0 0)} assume !(~i~0 <= 100); {223#false} is VALID [2020-07-11 02:32:10,072 INFO L263 TraceCheckUtils]: 11: Hoare triple {223#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {223#false} is VALID [2020-07-11 02:32:10,073 INFO L280 TraceCheckUtils]: 12: Hoare triple {223#false} ~cond := #in~cond; {223#false} is VALID [2020-07-11 02:32:10,073 INFO L280 TraceCheckUtils]: 13: Hoare triple {223#false} assume 0 == ~cond; {223#false} is VALID [2020-07-11 02:32:10,073 INFO L280 TraceCheckUtils]: 14: Hoare triple {223#false} assume !false; {223#false} is VALID [2020-07-11 02:32:10,075 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-11 02:32:10,076 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1167857627] [2020-07-11 02:32:10,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:32:10,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 02:32:10,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671377330] [2020-07-11 02:32:10,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-11 02:32:10,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:10,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 02:32:10,103 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:10,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 02:32:10,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:10,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 02:32:10,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 02:32:10,105 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2020-07-11 02:32:10,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:10,190 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-11 02:32:10,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 02:32:10,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-11 02:32:10,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:10,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 02:32:10,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2020-07-11 02:32:10,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 02:32:10,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2020-07-11 02:32:10,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 31 transitions. [2020-07-11 02:32:10,259 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:10,261 INFO L225 Difference]: With dead ends: 29 [2020-07-11 02:32:10,261 INFO L226 Difference]: Without dead ends: 24 [2020-07-11 02:32:10,263 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-11 02:32:10,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-11 02:32:10,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-07-11 02:32:10,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:10,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2020-07-11 02:32:10,284 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2020-07-11 02:32:10,285 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2020-07-11 02:32:10,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:10,288 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-11 02:32:10,288 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-11 02:32:10,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:10,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:10,289 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2020-07-11 02:32:10,290 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2020-07-11 02:32:10,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:10,292 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-11 02:32:10,293 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-11 02:32:10,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:10,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:10,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:10,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:10,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-11 02:32:10,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2020-07-11 02:32:10,297 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2020-07-11 02:32:10,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:10,297 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-07-11 02:32:10,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 02:32:10,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2020-07-11 02:32:10,331 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:10,331 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-11 02:32:10,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-11 02:32:10,332 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:10,333 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:32:10,333 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 02:32:10,333 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:10,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:10,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1024587775, now seen corresponding path program 1 times [2020-07-11 02:32:10,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:10,335 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2003081485] [2020-07-11 02:32:10,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:10,414 INFO L280 TraceCheckUtils]: 0: Hoare triple {381#true} assume true; {381#true} is VALID [2020-07-11 02:32:10,414 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {381#true} {381#true} #74#return; {381#true} is VALID [2020-07-11 02:32:10,415 INFO L263 TraceCheckUtils]: 0: Hoare triple {381#true} call ULTIMATE.init(); {381#true} is VALID [2020-07-11 02:32:10,415 INFO L280 TraceCheckUtils]: 1: Hoare triple {381#true} assume true; {381#true} is VALID [2020-07-11 02:32:10,416 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {381#true} {381#true} #74#return; {381#true} is VALID [2020-07-11 02:32:10,416 INFO L263 TraceCheckUtils]: 3: Hoare triple {381#true} call #t~ret0 := main(); {381#true} is VALID [2020-07-11 02:32:10,416 INFO L280 TraceCheckUtils]: 4: Hoare triple {381#true} havoc ~i~0; {381#true} is VALID [2020-07-11 02:32:10,417 INFO L280 TraceCheckUtils]: 5: Hoare triple {381#true} havoc ~j~0; {381#true} is VALID [2020-07-11 02:32:10,417 INFO L280 TraceCheckUtils]: 6: Hoare triple {381#true} havoc ~k~0; {381#true} is VALID [2020-07-11 02:32:10,417 INFO L280 TraceCheckUtils]: 7: Hoare triple {381#true} ~i~0 := 0; {381#true} is VALID [2020-07-11 02:32:10,418 INFO L280 TraceCheckUtils]: 8: Hoare triple {381#true} ~k~0 := 9; {381#true} is VALID [2020-07-11 02:32:10,420 INFO L280 TraceCheckUtils]: 9: Hoare triple {381#true} ~j~0 := -100; {385#(<= (+ main_~j~0 100) 0)} is VALID [2020-07-11 02:32:10,421 INFO L280 TraceCheckUtils]: 10: Hoare triple {385#(<= (+ main_~j~0 100) 0)} assume !!(~i~0 <= 100); {385#(<= (+ main_~j~0 100) 0)} is VALID [2020-07-11 02:32:10,422 INFO L280 TraceCheckUtils]: 11: Hoare triple {385#(<= (+ main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {385#(<= (+ main_~j~0 100) 0)} is VALID [2020-07-11 02:32:10,424 INFO L280 TraceCheckUtils]: 12: Hoare triple {385#(<= (+ main_~j~0 100) 0)} assume !(~j~0 < 20); {382#false} is VALID [2020-07-11 02:32:10,425 INFO L280 TraceCheckUtils]: 13: Hoare triple {382#false} ~k~0 := 4; {382#false} is VALID [2020-07-11 02:32:10,425 INFO L280 TraceCheckUtils]: 14: Hoare triple {382#false} assume !(~k~0 <= 3); {382#false} is VALID [2020-07-11 02:32:10,426 INFO L280 TraceCheckUtils]: 15: Hoare triple {382#false} assume !(~i~0 <= 100); {382#false} is VALID [2020-07-11 02:32:10,426 INFO L263 TraceCheckUtils]: 16: Hoare triple {382#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {382#false} is VALID [2020-07-11 02:32:10,431 INFO L280 TraceCheckUtils]: 17: Hoare triple {382#false} ~cond := #in~cond; {382#false} is VALID [2020-07-11 02:32:10,431 INFO L280 TraceCheckUtils]: 18: Hoare triple {382#false} assume 0 == ~cond; {382#false} is VALID [2020-07-11 02:32:10,431 INFO L280 TraceCheckUtils]: 19: Hoare triple {382#false} assume !false; {382#false} is VALID [2020-07-11 02:32:10,433 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-11 02:32:10,435 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2003081485] [2020-07-11 02:32:10,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:32:10,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 02:32:10,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594814119] [2020-07-11 02:32:10,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-11 02:32:10,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:10,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 02:32:10,466 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:10,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 02:32:10,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:10,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 02:32:10,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 02:32:10,468 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 3 states. [2020-07-11 02:32:10,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:10,563 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2020-07-11 02:32:10,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 02:32:10,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-11 02:32:10,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:10,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 02:32:10,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2020-07-11 02:32:10,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 02:32:10,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2020-07-11 02:32:10,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 43 transitions. [2020-07-11 02:32:10,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:10,631 INFO L225 Difference]: With dead ends: 38 [2020-07-11 02:32:10,631 INFO L226 Difference]: Without dead ends: 26 [2020-07-11 02:32:10,632 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-11 02:32:10,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-11 02:32:10,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-07-11 02:32:10,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:10,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2020-07-11 02:32:10,654 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2020-07-11 02:32:10,654 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2020-07-11 02:32:10,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:10,657 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-11 02:32:10,657 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-11 02:32:10,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:10,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:10,658 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2020-07-11 02:32:10,658 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2020-07-11 02:32:10,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:10,661 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-11 02:32:10,661 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-11 02:32:10,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:10,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:10,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:10,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:10,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-11 02:32:10,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2020-07-11 02:32:10,665 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 20 [2020-07-11 02:32:10,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:10,665 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-11 02:32:10,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 02:32:10,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2020-07-11 02:32:10,702 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:10,703 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-11 02:32:10,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-11 02:32:10,704 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:10,704 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:32:10,704 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 02:32:10,705 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:10,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:10,705 INFO L82 PathProgramCache]: Analyzing trace with hash 2065885280, now seen corresponding path program 1 times [2020-07-11 02:32:10,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:10,706 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [936719854] [2020-07-11 02:32:10,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:10,775 INFO L280 TraceCheckUtils]: 0: Hoare triple {566#true} assume true; {566#true} is VALID [2020-07-11 02:32:10,776 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {566#true} {566#true} #74#return; {566#true} is VALID [2020-07-11 02:32:10,777 INFO L263 TraceCheckUtils]: 0: Hoare triple {566#true} call ULTIMATE.init(); {566#true} is VALID [2020-07-11 02:32:10,777 INFO L280 TraceCheckUtils]: 1: Hoare triple {566#true} assume true; {566#true} is VALID [2020-07-11 02:32:10,777 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {566#true} {566#true} #74#return; {566#true} is VALID [2020-07-11 02:32:10,778 INFO L263 TraceCheckUtils]: 3: Hoare triple {566#true} call #t~ret0 := main(); {566#true} is VALID [2020-07-11 02:32:10,778 INFO L280 TraceCheckUtils]: 4: Hoare triple {566#true} havoc ~i~0; {566#true} is VALID [2020-07-11 02:32:10,778 INFO L280 TraceCheckUtils]: 5: Hoare triple {566#true} havoc ~j~0; {566#true} is VALID [2020-07-11 02:32:10,779 INFO L280 TraceCheckUtils]: 6: Hoare triple {566#true} havoc ~k~0; {566#true} is VALID [2020-07-11 02:32:10,782 INFO L280 TraceCheckUtils]: 7: Hoare triple {566#true} ~i~0 := 0; {570#(<= main_~i~0 0)} is VALID [2020-07-11 02:32:10,783 INFO L280 TraceCheckUtils]: 8: Hoare triple {570#(<= main_~i~0 0)} ~k~0 := 9; {570#(<= main_~i~0 0)} is VALID [2020-07-11 02:32:10,785 INFO L280 TraceCheckUtils]: 9: Hoare triple {570#(<= main_~i~0 0)} ~j~0 := -100; {570#(<= main_~i~0 0)} is VALID [2020-07-11 02:32:10,786 INFO L280 TraceCheckUtils]: 10: Hoare triple {570#(<= main_~i~0 0)} assume !!(~i~0 <= 100); {570#(<= main_~i~0 0)} is VALID [2020-07-11 02:32:10,788 INFO L280 TraceCheckUtils]: 11: Hoare triple {570#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {571#(<= main_~i~0 1)} is VALID [2020-07-11 02:32:10,789 INFO L280 TraceCheckUtils]: 12: Hoare triple {571#(<= main_~i~0 1)} assume !!(~j~0 < 20); {571#(<= main_~i~0 1)} is VALID [2020-07-11 02:32:10,790 INFO L280 TraceCheckUtils]: 13: Hoare triple {571#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {571#(<= main_~i~0 1)} is VALID [2020-07-11 02:32:10,792 INFO L280 TraceCheckUtils]: 14: Hoare triple {571#(<= main_~i~0 1)} assume !(~j~0 < 20); {571#(<= main_~i~0 1)} is VALID [2020-07-11 02:32:10,794 INFO L280 TraceCheckUtils]: 15: Hoare triple {571#(<= main_~i~0 1)} ~k~0 := 4; {571#(<= main_~i~0 1)} is VALID [2020-07-11 02:32:10,795 INFO L280 TraceCheckUtils]: 16: Hoare triple {571#(<= main_~i~0 1)} assume !(~k~0 <= 3); {571#(<= main_~i~0 1)} is VALID [2020-07-11 02:32:10,796 INFO L280 TraceCheckUtils]: 17: Hoare triple {571#(<= main_~i~0 1)} assume !(~i~0 <= 100); {567#false} is VALID [2020-07-11 02:32:10,797 INFO L263 TraceCheckUtils]: 18: Hoare triple {567#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {567#false} is VALID [2020-07-11 02:32:10,797 INFO L280 TraceCheckUtils]: 19: Hoare triple {567#false} ~cond := #in~cond; {567#false} is VALID [2020-07-11 02:32:10,797 INFO L280 TraceCheckUtils]: 20: Hoare triple {567#false} assume 0 == ~cond; {567#false} is VALID [2020-07-11 02:32:10,798 INFO L280 TraceCheckUtils]: 21: Hoare triple {567#false} assume !false; {567#false} is VALID [2020-07-11 02:32:10,800 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-11 02:32:10,800 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [936719854] [2020-07-11 02:32:10,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:32:10,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-07-11 02:32:10,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177891386] [2020-07-11 02:32:10,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-11 02:32:10,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:10,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-11 02:32:10,838 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-11 02:32:10,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-11 02:32:10,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:10,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-11 02:32:10,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-11 02:32:10,839 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 4 states. [2020-07-11 02:32:10,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:10,975 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2020-07-11 02:32:10,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-11 02:32:10,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-11 02:32:10,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:10,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 02:32:10,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2020-07-11 02:32:10,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 02:32:10,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2020-07-11 02:32:10,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 40 transitions. [2020-07-11 02:32:11,037 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:11,039 INFO L225 Difference]: With dead ends: 37 [2020-07-11 02:32:11,039 INFO L226 Difference]: Without dead ends: 32 [2020-07-11 02:32:11,040 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-11 02:32:11,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-11 02:32:11,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2020-07-11 02:32:11,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:11,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2020-07-11 02:32:11,084 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2020-07-11 02:32:11,085 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2020-07-11 02:32:11,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:11,088 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-11 02:32:11,088 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-11 02:32:11,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:11,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:11,090 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2020-07-11 02:32:11,090 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2020-07-11 02:32:11,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:11,093 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-11 02:32:11,093 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-11 02:32:11,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:11,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:11,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:11,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:11,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-11 02:32:11,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-07-11 02:32:11,097 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 22 [2020-07-11 02:32:11,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:11,098 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-07-11 02:32:11,098 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-11 02:32:11,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 35 transitions. [2020-07-11 02:32:11,157 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:11,158 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-11 02:32:11,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-11 02:32:11,159 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:11,159 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:32:11,160 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 02:32:11,160 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:11,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:11,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1729554991, now seen corresponding path program 2 times [2020-07-11 02:32:11,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:11,165 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1427261020] [2020-07-11 02:32:11,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:11,233 INFO L280 TraceCheckUtils]: 0: Hoare triple {774#true} assume true; {774#true} is VALID [2020-07-11 02:32:11,234 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {774#true} {774#true} #74#return; {774#true} is VALID [2020-07-11 02:32:11,234 INFO L263 TraceCheckUtils]: 0: Hoare triple {774#true} call ULTIMATE.init(); {774#true} is VALID [2020-07-11 02:32:11,235 INFO L280 TraceCheckUtils]: 1: Hoare triple {774#true} assume true; {774#true} is VALID [2020-07-11 02:32:11,235 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {774#true} {774#true} #74#return; {774#true} is VALID [2020-07-11 02:32:11,235 INFO L263 TraceCheckUtils]: 3: Hoare triple {774#true} call #t~ret0 := main(); {774#true} is VALID [2020-07-11 02:32:11,236 INFO L280 TraceCheckUtils]: 4: Hoare triple {774#true} havoc ~i~0; {774#true} is VALID [2020-07-11 02:32:11,236 INFO L280 TraceCheckUtils]: 5: Hoare triple {774#true} havoc ~j~0; {774#true} is VALID [2020-07-11 02:32:11,236 INFO L280 TraceCheckUtils]: 6: Hoare triple {774#true} havoc ~k~0; {774#true} is VALID [2020-07-11 02:32:11,237 INFO L280 TraceCheckUtils]: 7: Hoare triple {774#true} ~i~0 := 0; {774#true} is VALID [2020-07-11 02:32:11,237 INFO L280 TraceCheckUtils]: 8: Hoare triple {774#true} ~k~0 := 9; {774#true} is VALID [2020-07-11 02:32:11,238 INFO L280 TraceCheckUtils]: 9: Hoare triple {774#true} ~j~0 := -100; {778#(<= (+ main_~j~0 100) 0)} is VALID [2020-07-11 02:32:11,240 INFO L280 TraceCheckUtils]: 10: Hoare triple {778#(<= (+ main_~j~0 100) 0)} assume !!(~i~0 <= 100); {778#(<= (+ main_~j~0 100) 0)} is VALID [2020-07-11 02:32:11,240 INFO L280 TraceCheckUtils]: 11: Hoare triple {778#(<= (+ main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {778#(<= (+ main_~j~0 100) 0)} is VALID [2020-07-11 02:32:11,241 INFO L280 TraceCheckUtils]: 12: Hoare triple {778#(<= (+ main_~j~0 100) 0)} assume !!(~j~0 < 20); {778#(<= (+ main_~j~0 100) 0)} is VALID [2020-07-11 02:32:11,242 INFO L280 TraceCheckUtils]: 13: Hoare triple {778#(<= (+ main_~j~0 100) 0)} ~j~0 := ~i~0 + ~j~0; {779#(<= (+ main_~j~0 100) main_~i~0)} is VALID [2020-07-11 02:32:11,244 INFO L280 TraceCheckUtils]: 14: Hoare triple {779#(<= (+ main_~j~0 100) main_~i~0)} assume !(~j~0 < 20); {780#(<= 120 main_~i~0)} is VALID [2020-07-11 02:32:11,245 INFO L280 TraceCheckUtils]: 15: Hoare triple {780#(<= 120 main_~i~0)} ~k~0 := 4; {780#(<= 120 main_~i~0)} is VALID [2020-07-11 02:32:11,246 INFO L280 TraceCheckUtils]: 16: Hoare triple {780#(<= 120 main_~i~0)} assume !(~k~0 <= 3); {780#(<= 120 main_~i~0)} is VALID [2020-07-11 02:32:11,247 INFO L280 TraceCheckUtils]: 17: Hoare triple {780#(<= 120 main_~i~0)} assume !!(~i~0 <= 100); {775#false} is VALID [2020-07-11 02:32:11,247 INFO L280 TraceCheckUtils]: 18: Hoare triple {775#false} ~i~0 := 1 + ~i~0; {775#false} is VALID [2020-07-11 02:32:11,247 INFO L280 TraceCheckUtils]: 19: Hoare triple {775#false} assume !(~j~0 < 20); {775#false} is VALID [2020-07-11 02:32:11,248 INFO L280 TraceCheckUtils]: 20: Hoare triple {775#false} ~k~0 := 4; {775#false} is VALID [2020-07-11 02:32:11,248 INFO L280 TraceCheckUtils]: 21: Hoare triple {775#false} assume !(~k~0 <= 3); {775#false} is VALID [2020-07-11 02:32:11,248 INFO L280 TraceCheckUtils]: 22: Hoare triple {775#false} assume !(~i~0 <= 100); {775#false} is VALID [2020-07-11 02:32:11,249 INFO L263 TraceCheckUtils]: 23: Hoare triple {775#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {775#false} is VALID [2020-07-11 02:32:11,249 INFO L280 TraceCheckUtils]: 24: Hoare triple {775#false} ~cond := #in~cond; {775#false} is VALID [2020-07-11 02:32:11,249 INFO L280 TraceCheckUtils]: 25: Hoare triple {775#false} assume 0 == ~cond; {775#false} is VALID [2020-07-11 02:32:11,250 INFO L280 TraceCheckUtils]: 26: Hoare triple {775#false} assume !false; {775#false} is VALID [2020-07-11 02:32:11,252 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:32:11,252 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1427261020] [2020-07-11 02:32:11,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:32:11,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-11 02:32:11,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069227869] [2020-07-11 02:32:11,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-11 02:32:11,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:11,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 02:32:11,295 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:11,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 02:32:11,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:11,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 02:32:11,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 02:32:11,296 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 5 states. [2020-07-11 02:32:11,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:11,511 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-07-11 02:32:11,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-11 02:32:11,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-11 02:32:11,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:11,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:32:11,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2020-07-11 02:32:11,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:32:11,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2020-07-11 02:32:11,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2020-07-11 02:32:11,574 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-11 02:32:11,576 INFO L225 Difference]: With dead ends: 50 [2020-07-11 02:32:11,576 INFO L226 Difference]: Without dead ends: 34 [2020-07-11 02:32:11,577 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-11 02:32:11,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-11 02:32:11,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2020-07-11 02:32:11,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:11,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2020-07-11 02:32:11,606 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2020-07-11 02:32:11,607 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2020-07-11 02:32:11,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:11,609 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2020-07-11 02:32:11,609 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-07-11 02:32:11,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:11,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:11,610 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2020-07-11 02:32:11,610 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2020-07-11 02:32:11,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:11,613 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2020-07-11 02:32:11,613 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-07-11 02:32:11,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:11,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:11,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:11,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:11,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-11 02:32:11,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2020-07-11 02:32:11,616 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 27 [2020-07-11 02:32:11,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:11,617 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-07-11 02:32:11,617 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 02:32:11,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 37 transitions. [2020-07-11 02:32:11,657 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:11,658 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-11 02:32:11,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-11 02:32:11,659 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:11,659 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:32:11,659 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 02:32:11,659 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:11,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:11,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1385563474, now seen corresponding path program 3 times [2020-07-11 02:32:11,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:11,660 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [188924140] [2020-07-11 02:32:11,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:11,777 INFO L280 TraceCheckUtils]: 0: Hoare triple {1019#true} assume true; {1019#true} is VALID [2020-07-11 02:32:11,778 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1019#true} {1019#true} #74#return; {1019#true} is VALID [2020-07-11 02:32:11,778 INFO L263 TraceCheckUtils]: 0: Hoare triple {1019#true} call ULTIMATE.init(); {1019#true} is VALID [2020-07-11 02:32:11,779 INFO L280 TraceCheckUtils]: 1: Hoare triple {1019#true} assume true; {1019#true} is VALID [2020-07-11 02:32:11,779 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1019#true} {1019#true} #74#return; {1019#true} is VALID [2020-07-11 02:32:11,779 INFO L263 TraceCheckUtils]: 3: Hoare triple {1019#true} call #t~ret0 := main(); {1019#true} is VALID [2020-07-11 02:32:11,780 INFO L280 TraceCheckUtils]: 4: Hoare triple {1019#true} havoc ~i~0; {1019#true} is VALID [2020-07-11 02:32:11,780 INFO L280 TraceCheckUtils]: 5: Hoare triple {1019#true} havoc ~j~0; {1019#true} is VALID [2020-07-11 02:32:11,780 INFO L280 TraceCheckUtils]: 6: Hoare triple {1019#true} havoc ~k~0; {1019#true} is VALID [2020-07-11 02:32:11,781 INFO L280 TraceCheckUtils]: 7: Hoare triple {1019#true} ~i~0 := 0; {1023#(<= main_~i~0 0)} is VALID [2020-07-11 02:32:11,781 INFO L280 TraceCheckUtils]: 8: Hoare triple {1023#(<= main_~i~0 0)} ~k~0 := 9; {1023#(<= main_~i~0 0)} is VALID [2020-07-11 02:32:11,782 INFO L280 TraceCheckUtils]: 9: Hoare triple {1023#(<= main_~i~0 0)} ~j~0 := -100; {1024#(<= (+ (* 2 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-11 02:32:11,801 INFO L280 TraceCheckUtils]: 10: Hoare triple {1024#(<= (+ (* 2 main_~i~0) main_~j~0 100) 0)} assume !!(~i~0 <= 100); {1024#(<= (+ (* 2 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-11 02:32:11,803 INFO L280 TraceCheckUtils]: 11: Hoare triple {1024#(<= (+ (* 2 main_~i~0) main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {1025#(<= (+ (* 2 main_~i~0) main_~j~0 98) 0)} is VALID [2020-07-11 02:32:11,804 INFO L280 TraceCheckUtils]: 12: Hoare triple {1025#(<= (+ (* 2 main_~i~0) main_~j~0 98) 0)} assume !!(~j~0 < 20); {1025#(<= (+ (* 2 main_~i~0) main_~j~0 98) 0)} is VALID [2020-07-11 02:32:11,806 INFO L280 TraceCheckUtils]: 13: Hoare triple {1025#(<= (+ (* 2 main_~i~0) main_~j~0 98) 0)} ~j~0 := ~i~0 + ~j~0; {1026#(<= (+ main_~i~0 main_~j~0 98) 0)} is VALID [2020-07-11 02:32:11,807 INFO L280 TraceCheckUtils]: 14: Hoare triple {1026#(<= (+ main_~i~0 main_~j~0 98) 0)} assume !!(~j~0 < 20); {1026#(<= (+ main_~i~0 main_~j~0 98) 0)} is VALID [2020-07-11 02:32:11,808 INFO L280 TraceCheckUtils]: 15: Hoare triple {1026#(<= (+ main_~i~0 main_~j~0 98) 0)} ~j~0 := ~i~0 + ~j~0; {1027#(<= (+ main_~j~0 98) 0)} is VALID [2020-07-11 02:32:11,809 INFO L280 TraceCheckUtils]: 16: Hoare triple {1027#(<= (+ main_~j~0 98) 0)} assume !(~j~0 < 20); {1020#false} is VALID [2020-07-11 02:32:11,810 INFO L280 TraceCheckUtils]: 17: Hoare triple {1020#false} ~k~0 := 4; {1020#false} is VALID [2020-07-11 02:32:11,810 INFO L280 TraceCheckUtils]: 18: Hoare triple {1020#false} assume !(~k~0 <= 3); {1020#false} is VALID [2020-07-11 02:32:11,810 INFO L280 TraceCheckUtils]: 19: Hoare triple {1020#false} assume !!(~i~0 <= 100); {1020#false} is VALID [2020-07-11 02:32:11,810 INFO L280 TraceCheckUtils]: 20: Hoare triple {1020#false} ~i~0 := 1 + ~i~0; {1020#false} is VALID [2020-07-11 02:32:11,811 INFO L280 TraceCheckUtils]: 21: Hoare triple {1020#false} assume !(~j~0 < 20); {1020#false} is VALID [2020-07-11 02:32:11,811 INFO L280 TraceCheckUtils]: 22: Hoare triple {1020#false} ~k~0 := 4; {1020#false} is VALID [2020-07-11 02:32:11,814 INFO L280 TraceCheckUtils]: 23: Hoare triple {1020#false} assume !(~k~0 <= 3); {1020#false} is VALID [2020-07-11 02:32:11,815 INFO L280 TraceCheckUtils]: 24: Hoare triple {1020#false} assume !(~i~0 <= 100); {1020#false} is VALID [2020-07-11 02:32:11,815 INFO L263 TraceCheckUtils]: 25: Hoare triple {1020#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {1020#false} is VALID [2020-07-11 02:32:11,815 INFO L280 TraceCheckUtils]: 26: Hoare triple {1020#false} ~cond := #in~cond; {1020#false} is VALID [2020-07-11 02:32:11,816 INFO L280 TraceCheckUtils]: 27: Hoare triple {1020#false} assume 0 == ~cond; {1020#false} is VALID [2020-07-11 02:32:11,816 INFO L280 TraceCheckUtils]: 28: Hoare triple {1020#false} assume !false; {1020#false} is VALID [2020-07-11 02:32:11,821 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-11 02:32:11,821 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [188924140] [2020-07-11 02:32:11,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:32:11,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-11 02:32:11,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032608802] [2020-07-11 02:32:11,823 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2020-07-11 02:32:11,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:11,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 02:32:11,856 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:11,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 02:32:11,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:11,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 02:32:11,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-11 02:32:11,858 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2020-07-11 02:32:12,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:12,158 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2020-07-11 02:32:12,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-11 02:32:12,159 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2020-07-11 02:32:12,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:12,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:32:12,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2020-07-11 02:32:12,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:32:12,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2020-07-11 02:32:12,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2020-07-11 02:32:12,222 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:12,224 INFO L225 Difference]: With dead ends: 52 [2020-07-11 02:32:12,224 INFO L226 Difference]: Without dead ends: 36 [2020-07-11 02:32:12,226 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-07-11 02:32:12,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-11 02:32:12,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2020-07-11 02:32:12,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:12,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2020-07-11 02:32:12,265 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2020-07-11 02:32:12,265 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2020-07-11 02:32:12,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:12,268 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-11 02:32:12,268 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-07-11 02:32:12,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:12,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:12,268 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2020-07-11 02:32:12,269 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2020-07-11 02:32:12,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:12,271 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-11 02:32:12,271 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-07-11 02:32:12,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:12,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:12,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:12,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:12,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-11 02:32:12,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2020-07-11 02:32:12,274 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 29 [2020-07-11 02:32:12,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:12,275 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2020-07-11 02:32:12,275 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 02:32:12,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 39 transitions. [2020-07-11 02:32:12,324 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:12,325 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-11 02:32:12,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-11 02:32:12,326 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:12,326 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:32:12,326 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 02:32:12,327 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:12,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:12,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1422203027, now seen corresponding path program 4 times [2020-07-11 02:32:12,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:12,328 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [710677489] [2020-07-11 02:32:12,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:12,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:12,459 INFO L280 TraceCheckUtils]: 0: Hoare triple {1282#true} assume true; {1282#true} is VALID [2020-07-11 02:32:12,459 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1282#true} {1282#true} #74#return; {1282#true} is VALID [2020-07-11 02:32:12,460 INFO L263 TraceCheckUtils]: 0: Hoare triple {1282#true} call ULTIMATE.init(); {1282#true} is VALID [2020-07-11 02:32:12,460 INFO L280 TraceCheckUtils]: 1: Hoare triple {1282#true} assume true; {1282#true} is VALID [2020-07-11 02:32:12,460 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1282#true} {1282#true} #74#return; {1282#true} is VALID [2020-07-11 02:32:12,461 INFO L263 TraceCheckUtils]: 3: Hoare triple {1282#true} call #t~ret0 := main(); {1282#true} is VALID [2020-07-11 02:32:12,461 INFO L280 TraceCheckUtils]: 4: Hoare triple {1282#true} havoc ~i~0; {1282#true} is VALID [2020-07-11 02:32:12,461 INFO L280 TraceCheckUtils]: 5: Hoare triple {1282#true} havoc ~j~0; {1282#true} is VALID [2020-07-11 02:32:12,461 INFO L280 TraceCheckUtils]: 6: Hoare triple {1282#true} havoc ~k~0; {1282#true} is VALID [2020-07-11 02:32:12,462 INFO L280 TraceCheckUtils]: 7: Hoare triple {1282#true} ~i~0 := 0; {1286#(<= main_~i~0 0)} is VALID [2020-07-11 02:32:12,463 INFO L280 TraceCheckUtils]: 8: Hoare triple {1286#(<= main_~i~0 0)} ~k~0 := 9; {1286#(<= main_~i~0 0)} is VALID [2020-07-11 02:32:12,464 INFO L280 TraceCheckUtils]: 9: Hoare triple {1286#(<= main_~i~0 0)} ~j~0 := -100; {1287#(<= (+ (* 3 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-11 02:32:12,465 INFO L280 TraceCheckUtils]: 10: Hoare triple {1287#(<= (+ (* 3 main_~i~0) main_~j~0 100) 0)} assume !!(~i~0 <= 100); {1287#(<= (+ (* 3 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-11 02:32:12,466 INFO L280 TraceCheckUtils]: 11: Hoare triple {1287#(<= (+ (* 3 main_~i~0) main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {1288#(<= (+ (* 3 main_~i~0) main_~j~0 97) 0)} is VALID [2020-07-11 02:32:12,467 INFO L280 TraceCheckUtils]: 12: Hoare triple {1288#(<= (+ (* 3 main_~i~0) main_~j~0 97) 0)} assume !!(~j~0 < 20); {1288#(<= (+ (* 3 main_~i~0) main_~j~0 97) 0)} is VALID [2020-07-11 02:32:12,468 INFO L280 TraceCheckUtils]: 13: Hoare triple {1288#(<= (+ (* 3 main_~i~0) main_~j~0 97) 0)} ~j~0 := ~i~0 + ~j~0; {1289#(<= (+ (* 2 main_~i~0) main_~j~0 97) 0)} is VALID [2020-07-11 02:32:12,469 INFO L280 TraceCheckUtils]: 14: Hoare triple {1289#(<= (+ (* 2 main_~i~0) main_~j~0 97) 0)} assume !!(~j~0 < 20); {1289#(<= (+ (* 2 main_~i~0) main_~j~0 97) 0)} is VALID [2020-07-11 02:32:12,470 INFO L280 TraceCheckUtils]: 15: Hoare triple {1289#(<= (+ (* 2 main_~i~0) main_~j~0 97) 0)} ~j~0 := ~i~0 + ~j~0; {1290#(<= (+ main_~i~0 main_~j~0 97) 0)} is VALID [2020-07-11 02:32:12,471 INFO L280 TraceCheckUtils]: 16: Hoare triple {1290#(<= (+ main_~i~0 main_~j~0 97) 0)} assume !!(~j~0 < 20); {1290#(<= (+ main_~i~0 main_~j~0 97) 0)} is VALID [2020-07-11 02:32:12,472 INFO L280 TraceCheckUtils]: 17: Hoare triple {1290#(<= (+ main_~i~0 main_~j~0 97) 0)} ~j~0 := ~i~0 + ~j~0; {1291#(<= (+ main_~j~0 97) 0)} is VALID [2020-07-11 02:32:12,473 INFO L280 TraceCheckUtils]: 18: Hoare triple {1291#(<= (+ main_~j~0 97) 0)} assume !(~j~0 < 20); {1283#false} is VALID [2020-07-11 02:32:12,474 INFO L280 TraceCheckUtils]: 19: Hoare triple {1283#false} ~k~0 := 4; {1283#false} is VALID [2020-07-11 02:32:12,474 INFO L280 TraceCheckUtils]: 20: Hoare triple {1283#false} assume !(~k~0 <= 3); {1283#false} is VALID [2020-07-11 02:32:12,474 INFO L280 TraceCheckUtils]: 21: Hoare triple {1283#false} assume !!(~i~0 <= 100); {1283#false} is VALID [2020-07-11 02:32:12,475 INFO L280 TraceCheckUtils]: 22: Hoare triple {1283#false} ~i~0 := 1 + ~i~0; {1283#false} is VALID [2020-07-11 02:32:12,475 INFO L280 TraceCheckUtils]: 23: Hoare triple {1283#false} assume !(~j~0 < 20); {1283#false} is VALID [2020-07-11 02:32:12,475 INFO L280 TraceCheckUtils]: 24: Hoare triple {1283#false} ~k~0 := 4; {1283#false} is VALID [2020-07-11 02:32:12,475 INFO L280 TraceCheckUtils]: 25: Hoare triple {1283#false} assume !(~k~0 <= 3); {1283#false} is VALID [2020-07-11 02:32:12,475 INFO L280 TraceCheckUtils]: 26: Hoare triple {1283#false} assume !(~i~0 <= 100); {1283#false} is VALID [2020-07-11 02:32:12,476 INFO L263 TraceCheckUtils]: 27: Hoare triple {1283#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {1283#false} is VALID [2020-07-11 02:32:12,476 INFO L280 TraceCheckUtils]: 28: Hoare triple {1283#false} ~cond := #in~cond; {1283#false} is VALID [2020-07-11 02:32:12,476 INFO L280 TraceCheckUtils]: 29: Hoare triple {1283#false} assume 0 == ~cond; {1283#false} is VALID [2020-07-11 02:32:12,476 INFO L280 TraceCheckUtils]: 30: Hoare triple {1283#false} assume !false; {1283#false} is VALID [2020-07-11 02:32:12,478 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-11 02:32:12,479 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [710677489] [2020-07-11 02:32:12,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:32:12,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-11 02:32:12,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218718052] [2020-07-11 02:32:12,480 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2020-07-11 02:32:12,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:12,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 02:32:12,514 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:12,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 02:32:12,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:12,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 02:32:12,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-11 02:32:12,515 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 8 states. [2020-07-11 02:32:12,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:12,905 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2020-07-11 02:32:12,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-11 02:32:12,906 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2020-07-11 02:32:12,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:12,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 02:32:12,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2020-07-11 02:32:12,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 02:32:12,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2020-07-11 02:32:12,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2020-07-11 02:32:12,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:12,964 INFO L225 Difference]: With dead ends: 54 [2020-07-11 02:32:12,964 INFO L226 Difference]: Without dead ends: 38 [2020-07-11 02:32:12,965 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-07-11 02:32:12,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-11 02:32:13,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2020-07-11 02:32:13,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:13,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 37 states. [2020-07-11 02:32:13,014 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 37 states. [2020-07-11 02:32:13,014 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 37 states. [2020-07-11 02:32:13,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:13,016 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-11 02:32:13,016 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-11 02:32:13,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:13,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:13,017 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 38 states. [2020-07-11 02:32:13,018 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 38 states. [2020-07-11 02:32:13,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:13,020 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-11 02:32:13,020 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-11 02:32:13,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:13,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:13,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:13,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:13,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-11 02:32:13,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-07-11 02:32:13,023 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 31 [2020-07-11 02:32:13,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:13,024 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-07-11 02:32:13,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 02:32:13,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 41 transitions. [2020-07-11 02:32:13,071 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:13,071 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-07-11 02:32:13,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-11 02:32:13,072 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:13,072 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:32:13,073 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-11 02:32:13,073 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:13,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:13,073 INFO L82 PathProgramCache]: Analyzing trace with hash 2021892204, now seen corresponding path program 5 times [2020-07-11 02:32:13,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:13,074 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [721480238] [2020-07-11 02:32:13,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:13,236 INFO L280 TraceCheckUtils]: 0: Hoare triple {1560#true} assume true; {1560#true} is VALID [2020-07-11 02:32:13,236 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1560#true} {1560#true} #74#return; {1560#true} is VALID [2020-07-11 02:32:13,237 INFO L263 TraceCheckUtils]: 0: Hoare triple {1560#true} call ULTIMATE.init(); {1560#true} is VALID [2020-07-11 02:32:13,237 INFO L280 TraceCheckUtils]: 1: Hoare triple {1560#true} assume true; {1560#true} is VALID [2020-07-11 02:32:13,237 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1560#true} {1560#true} #74#return; {1560#true} is VALID [2020-07-11 02:32:13,237 INFO L263 TraceCheckUtils]: 3: Hoare triple {1560#true} call #t~ret0 := main(); {1560#true} is VALID [2020-07-11 02:32:13,238 INFO L280 TraceCheckUtils]: 4: Hoare triple {1560#true} havoc ~i~0; {1560#true} is VALID [2020-07-11 02:32:13,238 INFO L280 TraceCheckUtils]: 5: Hoare triple {1560#true} havoc ~j~0; {1560#true} is VALID [2020-07-11 02:32:13,238 INFO L280 TraceCheckUtils]: 6: Hoare triple {1560#true} havoc ~k~0; {1560#true} is VALID [2020-07-11 02:32:13,239 INFO L280 TraceCheckUtils]: 7: Hoare triple {1560#true} ~i~0 := 0; {1564#(<= main_~i~0 0)} is VALID [2020-07-11 02:32:13,240 INFO L280 TraceCheckUtils]: 8: Hoare triple {1564#(<= main_~i~0 0)} ~k~0 := 9; {1564#(<= main_~i~0 0)} is VALID [2020-07-11 02:32:13,241 INFO L280 TraceCheckUtils]: 9: Hoare triple {1564#(<= main_~i~0 0)} ~j~0 := -100; {1565#(<= (+ (* 4 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-11 02:32:13,242 INFO L280 TraceCheckUtils]: 10: Hoare triple {1565#(<= (+ (* 4 main_~i~0) main_~j~0 100) 0)} assume !!(~i~0 <= 100); {1565#(<= (+ (* 4 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-11 02:32:13,243 INFO L280 TraceCheckUtils]: 11: Hoare triple {1565#(<= (+ (* 4 main_~i~0) main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {1566#(<= (+ (* 4 main_~i~0) main_~j~0 96) 0)} is VALID [2020-07-11 02:32:13,244 INFO L280 TraceCheckUtils]: 12: Hoare triple {1566#(<= (+ (* 4 main_~i~0) main_~j~0 96) 0)} assume !!(~j~0 < 20); {1566#(<= (+ (* 4 main_~i~0) main_~j~0 96) 0)} is VALID [2020-07-11 02:32:13,245 INFO L280 TraceCheckUtils]: 13: Hoare triple {1566#(<= (+ (* 4 main_~i~0) main_~j~0 96) 0)} ~j~0 := ~i~0 + ~j~0; {1567#(<= (+ (* 3 main_~i~0) main_~j~0 96) 0)} is VALID [2020-07-11 02:32:13,246 INFO L280 TraceCheckUtils]: 14: Hoare triple {1567#(<= (+ (* 3 main_~i~0) main_~j~0 96) 0)} assume !!(~j~0 < 20); {1567#(<= (+ (* 3 main_~i~0) main_~j~0 96) 0)} is VALID [2020-07-11 02:32:13,246 INFO L280 TraceCheckUtils]: 15: Hoare triple {1567#(<= (+ (* 3 main_~i~0) main_~j~0 96) 0)} ~j~0 := ~i~0 + ~j~0; {1568#(<= (+ (* 2 main_~i~0) main_~j~0 96) 0)} is VALID [2020-07-11 02:32:13,247 INFO L280 TraceCheckUtils]: 16: Hoare triple {1568#(<= (+ (* 2 main_~i~0) main_~j~0 96) 0)} assume !!(~j~0 < 20); {1568#(<= (+ (* 2 main_~i~0) main_~j~0 96) 0)} is VALID [2020-07-11 02:32:13,249 INFO L280 TraceCheckUtils]: 17: Hoare triple {1568#(<= (+ (* 2 main_~i~0) main_~j~0 96) 0)} ~j~0 := ~i~0 + ~j~0; {1569#(<= (+ main_~i~0 main_~j~0 96) 0)} is VALID [2020-07-11 02:32:13,250 INFO L280 TraceCheckUtils]: 18: Hoare triple {1569#(<= (+ main_~i~0 main_~j~0 96) 0)} assume !!(~j~0 < 20); {1569#(<= (+ main_~i~0 main_~j~0 96) 0)} is VALID [2020-07-11 02:32:13,251 INFO L280 TraceCheckUtils]: 19: Hoare triple {1569#(<= (+ main_~i~0 main_~j~0 96) 0)} ~j~0 := ~i~0 + ~j~0; {1570#(<= (+ main_~j~0 96) 0)} is VALID [2020-07-11 02:32:13,252 INFO L280 TraceCheckUtils]: 20: Hoare triple {1570#(<= (+ main_~j~0 96) 0)} assume !(~j~0 < 20); {1561#false} is VALID [2020-07-11 02:32:13,252 INFO L280 TraceCheckUtils]: 21: Hoare triple {1561#false} ~k~0 := 4; {1561#false} is VALID [2020-07-11 02:32:13,252 INFO L280 TraceCheckUtils]: 22: Hoare triple {1561#false} assume !(~k~0 <= 3); {1561#false} is VALID [2020-07-11 02:32:13,252 INFO L280 TraceCheckUtils]: 23: Hoare triple {1561#false} assume !!(~i~0 <= 100); {1561#false} is VALID [2020-07-11 02:32:13,253 INFO L280 TraceCheckUtils]: 24: Hoare triple {1561#false} ~i~0 := 1 + ~i~0; {1561#false} is VALID [2020-07-11 02:32:13,253 INFO L280 TraceCheckUtils]: 25: Hoare triple {1561#false} assume !(~j~0 < 20); {1561#false} is VALID [2020-07-11 02:32:13,253 INFO L280 TraceCheckUtils]: 26: Hoare triple {1561#false} ~k~0 := 4; {1561#false} is VALID [2020-07-11 02:32:13,253 INFO L280 TraceCheckUtils]: 27: Hoare triple {1561#false} assume !(~k~0 <= 3); {1561#false} is VALID [2020-07-11 02:32:13,253 INFO L280 TraceCheckUtils]: 28: Hoare triple {1561#false} assume !(~i~0 <= 100); {1561#false} is VALID [2020-07-11 02:32:13,254 INFO L263 TraceCheckUtils]: 29: Hoare triple {1561#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {1561#false} is VALID [2020-07-11 02:32:13,254 INFO L280 TraceCheckUtils]: 30: Hoare triple {1561#false} ~cond := #in~cond; {1561#false} is VALID [2020-07-11 02:32:13,254 INFO L280 TraceCheckUtils]: 31: Hoare triple {1561#false} assume 0 == ~cond; {1561#false} is VALID [2020-07-11 02:32:13,254 INFO L280 TraceCheckUtils]: 32: Hoare triple {1561#false} assume !false; {1561#false} is VALID [2020-07-11 02:32:13,256 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-11 02:32:13,257 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [721480238] [2020-07-11 02:32:13,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:32:13,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-11 02:32:13,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591952181] [2020-07-11 02:32:13,258 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2020-07-11 02:32:13,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:13,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-11 02:32:13,294 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:13,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-11 02:32:13,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:13,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-11 02:32:13,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-11 02:32:13,296 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 9 states. [2020-07-11 02:32:13,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:13,734 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2020-07-11 02:32:13,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-11 02:32:13,735 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2020-07-11 02:32:13,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:13,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 02:32:13,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2020-07-11 02:32:13,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 02:32:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2020-07-11 02:32:13,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 51 transitions. [2020-07-11 02:32:13,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:13,803 INFO L225 Difference]: With dead ends: 56 [2020-07-11 02:32:13,804 INFO L226 Difference]: Without dead ends: 40 [2020-07-11 02:32:13,804 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-07-11 02:32:13,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-11 02:32:13,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2020-07-11 02:32:13,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:13,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2020-07-11 02:32:13,871 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2020-07-11 02:32:13,871 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2020-07-11 02:32:13,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:13,874 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-11 02:32:13,874 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-11 02:32:13,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:13,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:13,875 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2020-07-11 02:32:13,875 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2020-07-11 02:32:13,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:13,879 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-11 02:32:13,879 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-11 02:32:13,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:13,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:13,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:13,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:13,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-11 02:32:13,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-07-11 02:32:13,883 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 33 [2020-07-11 02:32:13,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:13,883 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-07-11 02:32:13,883 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-11 02:32:13,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 43 transitions. [2020-07-11 02:32:13,938 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:13,938 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-11 02:32:13,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-11 02:32:13,939 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:13,939 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:32:13,939 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-11 02:32:13,939 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:13,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:13,940 INFO L82 PathProgramCache]: Analyzing trace with hash 377623979, now seen corresponding path program 6 times [2020-07-11 02:32:13,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:13,940 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [718597671] [2020-07-11 02:32:13,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:14,077 INFO L280 TraceCheckUtils]: 0: Hoare triple {1853#true} assume true; {1853#true} is VALID [2020-07-11 02:32:14,077 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1853#true} {1853#true} #74#return; {1853#true} is VALID [2020-07-11 02:32:14,077 INFO L263 TraceCheckUtils]: 0: Hoare triple {1853#true} call ULTIMATE.init(); {1853#true} is VALID [2020-07-11 02:32:14,078 INFO L280 TraceCheckUtils]: 1: Hoare triple {1853#true} assume true; {1853#true} is VALID [2020-07-11 02:32:14,078 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1853#true} {1853#true} #74#return; {1853#true} is VALID [2020-07-11 02:32:14,078 INFO L263 TraceCheckUtils]: 3: Hoare triple {1853#true} call #t~ret0 := main(); {1853#true} is VALID [2020-07-11 02:32:14,078 INFO L280 TraceCheckUtils]: 4: Hoare triple {1853#true} havoc ~i~0; {1853#true} is VALID [2020-07-11 02:32:14,078 INFO L280 TraceCheckUtils]: 5: Hoare triple {1853#true} havoc ~j~0; {1853#true} is VALID [2020-07-11 02:32:14,079 INFO L280 TraceCheckUtils]: 6: Hoare triple {1853#true} havoc ~k~0; {1853#true} is VALID [2020-07-11 02:32:14,079 INFO L280 TraceCheckUtils]: 7: Hoare triple {1853#true} ~i~0 := 0; {1857#(<= main_~i~0 0)} is VALID [2020-07-11 02:32:14,080 INFO L280 TraceCheckUtils]: 8: Hoare triple {1857#(<= main_~i~0 0)} ~k~0 := 9; {1857#(<= main_~i~0 0)} is VALID [2020-07-11 02:32:14,081 INFO L280 TraceCheckUtils]: 9: Hoare triple {1857#(<= main_~i~0 0)} ~j~0 := -100; {1858#(<= (+ (* 5 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-11 02:32:14,081 INFO L280 TraceCheckUtils]: 10: Hoare triple {1858#(<= (+ (* 5 main_~i~0) main_~j~0 100) 0)} assume !!(~i~0 <= 100); {1858#(<= (+ (* 5 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-11 02:32:14,082 INFO L280 TraceCheckUtils]: 11: Hoare triple {1858#(<= (+ (* 5 main_~i~0) main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {1859#(<= (+ (* 5 main_~i~0) main_~j~0 95) 0)} is VALID [2020-07-11 02:32:14,083 INFO L280 TraceCheckUtils]: 12: Hoare triple {1859#(<= (+ (* 5 main_~i~0) main_~j~0 95) 0)} assume !!(~j~0 < 20); {1859#(<= (+ (* 5 main_~i~0) main_~j~0 95) 0)} is VALID [2020-07-11 02:32:14,084 INFO L280 TraceCheckUtils]: 13: Hoare triple {1859#(<= (+ (* 5 main_~i~0) main_~j~0 95) 0)} ~j~0 := ~i~0 + ~j~0; {1860#(<= (+ (* 4 main_~i~0) main_~j~0 95) 0)} is VALID [2020-07-11 02:32:14,084 INFO L280 TraceCheckUtils]: 14: Hoare triple {1860#(<= (+ (* 4 main_~i~0) main_~j~0 95) 0)} assume !!(~j~0 < 20); {1860#(<= (+ (* 4 main_~i~0) main_~j~0 95) 0)} is VALID [2020-07-11 02:32:14,085 INFO L280 TraceCheckUtils]: 15: Hoare triple {1860#(<= (+ (* 4 main_~i~0) main_~j~0 95) 0)} ~j~0 := ~i~0 + ~j~0; {1861#(<= (+ (* 3 main_~i~0) main_~j~0 95) 0)} is VALID [2020-07-11 02:32:14,085 INFO L280 TraceCheckUtils]: 16: Hoare triple {1861#(<= (+ (* 3 main_~i~0) main_~j~0 95) 0)} assume !!(~j~0 < 20); {1861#(<= (+ (* 3 main_~i~0) main_~j~0 95) 0)} is VALID [2020-07-11 02:32:14,086 INFO L280 TraceCheckUtils]: 17: Hoare triple {1861#(<= (+ (* 3 main_~i~0) main_~j~0 95) 0)} ~j~0 := ~i~0 + ~j~0; {1862#(<= (+ (* 2 main_~i~0) main_~j~0 95) 0)} is VALID [2020-07-11 02:32:14,087 INFO L280 TraceCheckUtils]: 18: Hoare triple {1862#(<= (+ (* 2 main_~i~0) main_~j~0 95) 0)} assume !!(~j~0 < 20); {1862#(<= (+ (* 2 main_~i~0) main_~j~0 95) 0)} is VALID [2020-07-11 02:32:14,088 INFO L280 TraceCheckUtils]: 19: Hoare triple {1862#(<= (+ (* 2 main_~i~0) main_~j~0 95) 0)} ~j~0 := ~i~0 + ~j~0; {1863#(<= (+ main_~i~0 main_~j~0 95) 0)} is VALID [2020-07-11 02:32:14,088 INFO L280 TraceCheckUtils]: 20: Hoare triple {1863#(<= (+ main_~i~0 main_~j~0 95) 0)} assume !!(~j~0 < 20); {1863#(<= (+ main_~i~0 main_~j~0 95) 0)} is VALID [2020-07-11 02:32:14,090 INFO L280 TraceCheckUtils]: 21: Hoare triple {1863#(<= (+ main_~i~0 main_~j~0 95) 0)} ~j~0 := ~i~0 + ~j~0; {1864#(<= (+ main_~j~0 95) 0)} is VALID [2020-07-11 02:32:14,091 INFO L280 TraceCheckUtils]: 22: Hoare triple {1864#(<= (+ main_~j~0 95) 0)} assume !(~j~0 < 20); {1854#false} is VALID [2020-07-11 02:32:14,091 INFO L280 TraceCheckUtils]: 23: Hoare triple {1854#false} ~k~0 := 4; {1854#false} is VALID [2020-07-11 02:32:14,092 INFO L280 TraceCheckUtils]: 24: Hoare triple {1854#false} assume !(~k~0 <= 3); {1854#false} is VALID [2020-07-11 02:32:14,092 INFO L280 TraceCheckUtils]: 25: Hoare triple {1854#false} assume !!(~i~0 <= 100); {1854#false} is VALID [2020-07-11 02:32:14,092 INFO L280 TraceCheckUtils]: 26: Hoare triple {1854#false} ~i~0 := 1 + ~i~0; {1854#false} is VALID [2020-07-11 02:32:14,092 INFO L280 TraceCheckUtils]: 27: Hoare triple {1854#false} assume !(~j~0 < 20); {1854#false} is VALID [2020-07-11 02:32:14,092 INFO L280 TraceCheckUtils]: 28: Hoare triple {1854#false} ~k~0 := 4; {1854#false} is VALID [2020-07-11 02:32:14,092 INFO L280 TraceCheckUtils]: 29: Hoare triple {1854#false} assume !(~k~0 <= 3); {1854#false} is VALID [2020-07-11 02:32:14,093 INFO L280 TraceCheckUtils]: 30: Hoare triple {1854#false} assume !(~i~0 <= 100); {1854#false} is VALID [2020-07-11 02:32:14,093 INFO L263 TraceCheckUtils]: 31: Hoare triple {1854#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {1854#false} is VALID [2020-07-11 02:32:14,093 INFO L280 TraceCheckUtils]: 32: Hoare triple {1854#false} ~cond := #in~cond; {1854#false} is VALID [2020-07-11 02:32:14,093 INFO L280 TraceCheckUtils]: 33: Hoare triple {1854#false} assume 0 == ~cond; {1854#false} is VALID [2020-07-11 02:32:14,094 INFO L280 TraceCheckUtils]: 34: Hoare triple {1854#false} assume !false; {1854#false} is VALID [2020-07-11 02:32:14,096 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-11 02:32:14,097 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [718597671] [2020-07-11 02:32:14,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:32:14,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-11 02:32:14,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890293526] [2020-07-11 02:32:14,098 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2020-07-11 02:32:14,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:14,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-11 02:32:14,137 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:14,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-11 02:32:14,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:14,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-11 02:32:14,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-11 02:32:14,139 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 10 states. [2020-07-11 02:32:14,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:14,671 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2020-07-11 02:32:14,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-11 02:32:14,671 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2020-07-11 02:32:14,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:14,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 02:32:14,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2020-07-11 02:32:14,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 02:32:14,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2020-07-11 02:32:14,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 53 transitions. [2020-07-11 02:32:14,736 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:14,738 INFO L225 Difference]: With dead ends: 58 [2020-07-11 02:32:14,738 INFO L226 Difference]: Without dead ends: 42 [2020-07-11 02:32:14,741 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2020-07-11 02:32:14,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-11 02:32:14,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2020-07-11 02:32:14,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:14,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2020-07-11 02:32:14,814 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2020-07-11 02:32:14,814 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2020-07-11 02:32:14,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:14,817 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2020-07-11 02:32:14,818 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-07-11 02:32:14,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:14,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:14,818 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2020-07-11 02:32:14,818 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2020-07-11 02:32:14,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:14,821 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2020-07-11 02:32:14,821 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-07-11 02:32:14,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:14,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:14,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:14,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:14,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-11 02:32:14,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2020-07-11 02:32:14,832 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 35 [2020-07-11 02:32:14,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:14,832 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2020-07-11 02:32:14,832 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-11 02:32:14,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 45 transitions. [2020-07-11 02:32:14,891 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:14,892 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2020-07-11 02:32:14,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-11 02:32:14,892 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:14,893 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:32:14,893 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-11 02:32:14,893 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:14,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:14,894 INFO L82 PathProgramCache]: Analyzing trace with hash 783824682, now seen corresponding path program 7 times [2020-07-11 02:32:14,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:14,896 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1224648672] [2020-07-11 02:32:14,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:15,072 INFO L280 TraceCheckUtils]: 0: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-11 02:32:15,073 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2161#true} {2161#true} #74#return; {2161#true} is VALID [2020-07-11 02:32:15,073 INFO L263 TraceCheckUtils]: 0: Hoare triple {2161#true} call ULTIMATE.init(); {2161#true} is VALID [2020-07-11 02:32:15,074 INFO L280 TraceCheckUtils]: 1: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-11 02:32:15,074 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2161#true} {2161#true} #74#return; {2161#true} is VALID [2020-07-11 02:32:15,075 INFO L263 TraceCheckUtils]: 3: Hoare triple {2161#true} call #t~ret0 := main(); {2161#true} is VALID [2020-07-11 02:32:15,075 INFO L280 TraceCheckUtils]: 4: Hoare triple {2161#true} havoc ~i~0; {2161#true} is VALID [2020-07-11 02:32:15,075 INFO L280 TraceCheckUtils]: 5: Hoare triple {2161#true} havoc ~j~0; {2161#true} is VALID [2020-07-11 02:32:15,075 INFO L280 TraceCheckUtils]: 6: Hoare triple {2161#true} havoc ~k~0; {2161#true} is VALID [2020-07-11 02:32:15,077 INFO L280 TraceCheckUtils]: 7: Hoare triple {2161#true} ~i~0 := 0; {2165#(<= main_~i~0 0)} is VALID [2020-07-11 02:32:15,081 INFO L280 TraceCheckUtils]: 8: Hoare triple {2165#(<= main_~i~0 0)} ~k~0 := 9; {2165#(<= main_~i~0 0)} is VALID [2020-07-11 02:32:15,083 INFO L280 TraceCheckUtils]: 9: Hoare triple {2165#(<= main_~i~0 0)} ~j~0 := -100; {2166#(<= (+ (* 6 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-11 02:32:15,083 INFO L280 TraceCheckUtils]: 10: Hoare triple {2166#(<= (+ (* 6 main_~i~0) main_~j~0 100) 0)} assume !!(~i~0 <= 100); {2166#(<= (+ (* 6 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-11 02:32:15,085 INFO L280 TraceCheckUtils]: 11: Hoare triple {2166#(<= (+ (* 6 main_~i~0) main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {2167#(<= (+ (* 6 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-11 02:32:15,086 INFO L280 TraceCheckUtils]: 12: Hoare triple {2167#(<= (+ (* 6 main_~i~0) main_~j~0 94) 0)} assume !!(~j~0 < 20); {2167#(<= (+ (* 6 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-11 02:32:15,089 INFO L280 TraceCheckUtils]: 13: Hoare triple {2167#(<= (+ (* 6 main_~i~0) main_~j~0 94) 0)} ~j~0 := ~i~0 + ~j~0; {2168#(<= (+ (* 5 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-11 02:32:15,093 INFO L280 TraceCheckUtils]: 14: Hoare triple {2168#(<= (+ (* 5 main_~i~0) main_~j~0 94) 0)} assume !!(~j~0 < 20); {2168#(<= (+ (* 5 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-11 02:32:15,093 INFO L280 TraceCheckUtils]: 15: Hoare triple {2168#(<= (+ (* 5 main_~i~0) main_~j~0 94) 0)} ~j~0 := ~i~0 + ~j~0; {2169#(<= (+ (* 4 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-11 02:32:15,094 INFO L280 TraceCheckUtils]: 16: Hoare triple {2169#(<= (+ (* 4 main_~i~0) main_~j~0 94) 0)} assume !!(~j~0 < 20); {2169#(<= (+ (* 4 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-11 02:32:15,095 INFO L280 TraceCheckUtils]: 17: Hoare triple {2169#(<= (+ (* 4 main_~i~0) main_~j~0 94) 0)} ~j~0 := ~i~0 + ~j~0; {2170#(<= (+ (* 3 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-11 02:32:15,096 INFO L280 TraceCheckUtils]: 18: Hoare triple {2170#(<= (+ (* 3 main_~i~0) main_~j~0 94) 0)} assume !!(~j~0 < 20); {2170#(<= (+ (* 3 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-11 02:32:15,096 INFO L280 TraceCheckUtils]: 19: Hoare triple {2170#(<= (+ (* 3 main_~i~0) main_~j~0 94) 0)} ~j~0 := ~i~0 + ~j~0; {2171#(<= (+ (* 2 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-11 02:32:15,097 INFO L280 TraceCheckUtils]: 20: Hoare triple {2171#(<= (+ (* 2 main_~i~0) main_~j~0 94) 0)} assume !!(~j~0 < 20); {2171#(<= (+ (* 2 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-11 02:32:15,098 INFO L280 TraceCheckUtils]: 21: Hoare triple {2171#(<= (+ (* 2 main_~i~0) main_~j~0 94) 0)} ~j~0 := ~i~0 + ~j~0; {2172#(<= (+ main_~i~0 main_~j~0 94) 0)} is VALID [2020-07-11 02:32:15,098 INFO L280 TraceCheckUtils]: 22: Hoare triple {2172#(<= (+ main_~i~0 main_~j~0 94) 0)} assume !!(~j~0 < 20); {2172#(<= (+ main_~i~0 main_~j~0 94) 0)} is VALID [2020-07-11 02:32:15,099 INFO L280 TraceCheckUtils]: 23: Hoare triple {2172#(<= (+ main_~i~0 main_~j~0 94) 0)} ~j~0 := ~i~0 + ~j~0; {2173#(<= (+ main_~j~0 94) 0)} is VALID [2020-07-11 02:32:15,100 INFO L280 TraceCheckUtils]: 24: Hoare triple {2173#(<= (+ main_~j~0 94) 0)} assume !(~j~0 < 20); {2162#false} is VALID [2020-07-11 02:32:15,100 INFO L280 TraceCheckUtils]: 25: Hoare triple {2162#false} ~k~0 := 4; {2162#false} is VALID [2020-07-11 02:32:15,100 INFO L280 TraceCheckUtils]: 26: Hoare triple {2162#false} assume !(~k~0 <= 3); {2162#false} is VALID [2020-07-11 02:32:15,100 INFO L280 TraceCheckUtils]: 27: Hoare triple {2162#false} assume !!(~i~0 <= 100); {2162#false} is VALID [2020-07-11 02:32:15,101 INFO L280 TraceCheckUtils]: 28: Hoare triple {2162#false} ~i~0 := 1 + ~i~0; {2162#false} is VALID [2020-07-11 02:32:15,101 INFO L280 TraceCheckUtils]: 29: Hoare triple {2162#false} assume !(~j~0 < 20); {2162#false} is VALID [2020-07-11 02:32:15,101 INFO L280 TraceCheckUtils]: 30: Hoare triple {2162#false} ~k~0 := 4; {2162#false} is VALID [2020-07-11 02:32:15,101 INFO L280 TraceCheckUtils]: 31: Hoare triple {2162#false} assume !(~k~0 <= 3); {2162#false} is VALID [2020-07-11 02:32:15,101 INFO L280 TraceCheckUtils]: 32: Hoare triple {2162#false} assume !(~i~0 <= 100); {2162#false} is VALID [2020-07-11 02:32:15,102 INFO L263 TraceCheckUtils]: 33: Hoare triple {2162#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {2162#false} is VALID [2020-07-11 02:32:15,102 INFO L280 TraceCheckUtils]: 34: Hoare triple {2162#false} ~cond := #in~cond; {2162#false} is VALID [2020-07-11 02:32:15,102 INFO L280 TraceCheckUtils]: 35: Hoare triple {2162#false} assume 0 == ~cond; {2162#false} is VALID [2020-07-11 02:32:15,102 INFO L280 TraceCheckUtils]: 36: Hoare triple {2162#false} assume !false; {2162#false} is VALID [2020-07-11 02:32:15,104 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 10 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-11 02:32:15,105 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1224648672] [2020-07-11 02:32:15,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:32:15,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-11 02:32:15,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065581625] [2020-07-11 02:32:15,106 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-07-11 02:32:15,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:15,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-11 02:32:15,147 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:15,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-11 02:32:15,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:15,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-11 02:32:15,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-07-11 02:32:15,148 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 11 states. [2020-07-11 02:32:15,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:15,707 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2020-07-11 02:32:15,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-11 02:32:15,707 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-07-11 02:32:15,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:15,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 02:32:15,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2020-07-11 02:32:15,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 02:32:15,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2020-07-11 02:32:15,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 55 transitions. [2020-07-11 02:32:15,789 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:15,790 INFO L225 Difference]: With dead ends: 60 [2020-07-11 02:32:15,790 INFO L226 Difference]: Without dead ends: 44 [2020-07-11 02:32:15,791 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2020-07-11 02:32:15,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-11 02:32:15,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2020-07-11 02:32:15,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:15,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 43 states. [2020-07-11 02:32:15,901 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 43 states. [2020-07-11 02:32:15,901 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 43 states. [2020-07-11 02:32:15,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:15,903 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-07-11 02:32:15,903 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2020-07-11 02:32:15,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:15,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:15,904 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 44 states. [2020-07-11 02:32:15,904 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 44 states. [2020-07-11 02:32:15,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:15,907 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-07-11 02:32:15,907 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2020-07-11 02:32:15,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:15,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:15,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:15,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:15,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-11 02:32:15,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2020-07-11 02:32:15,910 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 37 [2020-07-11 02:32:15,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:15,910 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2020-07-11 02:32:15,910 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-11 02:32:15,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 47 transitions. [2020-07-11 02:32:15,980 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:15,981 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2020-07-11 02:32:15,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-11 02:32:15,981 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:15,982 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:32:15,982 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-11 02:32:15,982 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:15,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:15,983 INFO L82 PathProgramCache]: Analyzing trace with hash 300676329, now seen corresponding path program 8 times [2020-07-11 02:32:15,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:15,983 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1086284551] [2020-07-11 02:32:15,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:16,253 INFO L280 TraceCheckUtils]: 0: Hoare triple {2484#true} assume true; {2484#true} is VALID [2020-07-11 02:32:16,253 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2484#true} {2484#true} #74#return; {2484#true} is VALID [2020-07-11 02:32:16,253 INFO L263 TraceCheckUtils]: 0: Hoare triple {2484#true} call ULTIMATE.init(); {2484#true} is VALID [2020-07-11 02:32:16,254 INFO L280 TraceCheckUtils]: 1: Hoare triple {2484#true} assume true; {2484#true} is VALID [2020-07-11 02:32:16,254 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2484#true} {2484#true} #74#return; {2484#true} is VALID [2020-07-11 02:32:16,254 INFO L263 TraceCheckUtils]: 3: Hoare triple {2484#true} call #t~ret0 := main(); {2484#true} is VALID [2020-07-11 02:32:16,255 INFO L280 TraceCheckUtils]: 4: Hoare triple {2484#true} havoc ~i~0; {2484#true} is VALID [2020-07-11 02:32:16,255 INFO L280 TraceCheckUtils]: 5: Hoare triple {2484#true} havoc ~j~0; {2484#true} is VALID [2020-07-11 02:32:16,255 INFO L280 TraceCheckUtils]: 6: Hoare triple {2484#true} havoc ~k~0; {2484#true} is VALID [2020-07-11 02:32:16,257 INFO L280 TraceCheckUtils]: 7: Hoare triple {2484#true} ~i~0 := 0; {2488#(<= main_~i~0 0)} is VALID [2020-07-11 02:32:16,257 INFO L280 TraceCheckUtils]: 8: Hoare triple {2488#(<= main_~i~0 0)} ~k~0 := 9; {2488#(<= main_~i~0 0)} is VALID [2020-07-11 02:32:16,258 INFO L280 TraceCheckUtils]: 9: Hoare triple {2488#(<= main_~i~0 0)} ~j~0 := -100; {2489#(<= (+ (* 7 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-11 02:32:16,260 INFO L280 TraceCheckUtils]: 10: Hoare triple {2489#(<= (+ (* 7 main_~i~0) main_~j~0 100) 0)} assume !!(~i~0 <= 100); {2489#(<= (+ (* 7 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-11 02:32:16,261 INFO L280 TraceCheckUtils]: 11: Hoare triple {2489#(<= (+ (* 7 main_~i~0) main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {2490#(<= (+ (* 7 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-11 02:32:16,262 INFO L280 TraceCheckUtils]: 12: Hoare triple {2490#(<= (+ (* 7 main_~i~0) main_~j~0 93) 0)} assume !!(~j~0 < 20); {2490#(<= (+ (* 7 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-11 02:32:16,264 INFO L280 TraceCheckUtils]: 13: Hoare triple {2490#(<= (+ (* 7 main_~i~0) main_~j~0 93) 0)} ~j~0 := ~i~0 + ~j~0; {2491#(<= (+ (* 6 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-11 02:32:16,265 INFO L280 TraceCheckUtils]: 14: Hoare triple {2491#(<= (+ (* 6 main_~i~0) main_~j~0 93) 0)} assume !!(~j~0 < 20); {2491#(<= (+ (* 6 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-11 02:32:16,267 INFO L280 TraceCheckUtils]: 15: Hoare triple {2491#(<= (+ (* 6 main_~i~0) main_~j~0 93) 0)} ~j~0 := ~i~0 + ~j~0; {2492#(<= (+ (* 5 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-11 02:32:16,268 INFO L280 TraceCheckUtils]: 16: Hoare triple {2492#(<= (+ (* 5 main_~i~0) main_~j~0 93) 0)} assume !!(~j~0 < 20); {2492#(<= (+ (* 5 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-11 02:32:16,270 INFO L280 TraceCheckUtils]: 17: Hoare triple {2492#(<= (+ (* 5 main_~i~0) main_~j~0 93) 0)} ~j~0 := ~i~0 + ~j~0; {2493#(<= (+ (* 4 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-11 02:32:16,271 INFO L280 TraceCheckUtils]: 18: Hoare triple {2493#(<= (+ (* 4 main_~i~0) main_~j~0 93) 0)} assume !!(~j~0 < 20); {2493#(<= (+ (* 4 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-11 02:32:16,272 INFO L280 TraceCheckUtils]: 19: Hoare triple {2493#(<= (+ (* 4 main_~i~0) main_~j~0 93) 0)} ~j~0 := ~i~0 + ~j~0; {2494#(<= (+ (* 3 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-11 02:32:16,274 INFO L280 TraceCheckUtils]: 20: Hoare triple {2494#(<= (+ (* 3 main_~i~0) main_~j~0 93) 0)} assume !!(~j~0 < 20); {2494#(<= (+ (* 3 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-11 02:32:16,275 INFO L280 TraceCheckUtils]: 21: Hoare triple {2494#(<= (+ (* 3 main_~i~0) main_~j~0 93) 0)} ~j~0 := ~i~0 + ~j~0; {2495#(<= (+ (* 2 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-11 02:32:16,276 INFO L280 TraceCheckUtils]: 22: Hoare triple {2495#(<= (+ (* 2 main_~i~0) main_~j~0 93) 0)} assume !!(~j~0 < 20); {2495#(<= (+ (* 2 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-11 02:32:16,277 INFO L280 TraceCheckUtils]: 23: Hoare triple {2495#(<= (+ (* 2 main_~i~0) main_~j~0 93) 0)} ~j~0 := ~i~0 + ~j~0; {2496#(<= (+ main_~i~0 main_~j~0 93) 0)} is VALID [2020-07-11 02:32:16,278 INFO L280 TraceCheckUtils]: 24: Hoare triple {2496#(<= (+ main_~i~0 main_~j~0 93) 0)} assume !!(~j~0 < 20); {2496#(<= (+ main_~i~0 main_~j~0 93) 0)} is VALID [2020-07-11 02:32:16,280 INFO L280 TraceCheckUtils]: 25: Hoare triple {2496#(<= (+ main_~i~0 main_~j~0 93) 0)} ~j~0 := ~i~0 + ~j~0; {2497#(<= (+ main_~j~0 93) 0)} is VALID [2020-07-11 02:32:16,281 INFO L280 TraceCheckUtils]: 26: Hoare triple {2497#(<= (+ main_~j~0 93) 0)} assume !(~j~0 < 20); {2485#false} is VALID [2020-07-11 02:32:16,281 INFO L280 TraceCheckUtils]: 27: Hoare triple {2485#false} ~k~0 := 4; {2485#false} is VALID [2020-07-11 02:32:16,282 INFO L280 TraceCheckUtils]: 28: Hoare triple {2485#false} assume !(~k~0 <= 3); {2485#false} is VALID [2020-07-11 02:32:16,282 INFO L280 TraceCheckUtils]: 29: Hoare triple {2485#false} assume !!(~i~0 <= 100); {2485#false} is VALID [2020-07-11 02:32:16,282 INFO L280 TraceCheckUtils]: 30: Hoare triple {2485#false} ~i~0 := 1 + ~i~0; {2485#false} is VALID [2020-07-11 02:32:16,282 INFO L280 TraceCheckUtils]: 31: Hoare triple {2485#false} assume !(~j~0 < 20); {2485#false} is VALID [2020-07-11 02:32:16,282 INFO L280 TraceCheckUtils]: 32: Hoare triple {2485#false} ~k~0 := 4; {2485#false} is VALID [2020-07-11 02:32:16,283 INFO L280 TraceCheckUtils]: 33: Hoare triple {2485#false} assume !(~k~0 <= 3); {2485#false} is VALID [2020-07-11 02:32:16,283 INFO L280 TraceCheckUtils]: 34: Hoare triple {2485#false} assume !(~i~0 <= 100); {2485#false} is VALID [2020-07-11 02:32:16,283 INFO L263 TraceCheckUtils]: 35: Hoare triple {2485#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {2485#false} is VALID [2020-07-11 02:32:16,283 INFO L280 TraceCheckUtils]: 36: Hoare triple {2485#false} ~cond := #in~cond; {2485#false} is VALID [2020-07-11 02:32:16,284 INFO L280 TraceCheckUtils]: 37: Hoare triple {2485#false} assume 0 == ~cond; {2485#false} is VALID [2020-07-11 02:32:16,284 INFO L280 TraceCheckUtils]: 38: Hoare triple {2485#false} assume !false; {2485#false} is VALID [2020-07-11 02:32:16,288 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 11 proven. 49 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-11 02:32:16,288 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1086284551] [2020-07-11 02:32:16,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:32:16,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-11 02:32:16,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293201316] [2020-07-11 02:32:16,290 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2020-07-11 02:32:16,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:16,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-11 02:32:16,337 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:16,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-11 02:32:16,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:16,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-11 02:32:16,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-07-11 02:32:16,338 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 12 states. [2020-07-11 02:32:17,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:17,043 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2020-07-11 02:32:17,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-11 02:32:17,044 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2020-07-11 02:32:17,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:17,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-11 02:32:17,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2020-07-11 02:32:17,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-11 02:32:17,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2020-07-11 02:32:17,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 57 transitions. [2020-07-11 02:32:17,123 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:17,125 INFO L225 Difference]: With dead ends: 62 [2020-07-11 02:32:17,125 INFO L226 Difference]: Without dead ends: 46 [2020-07-11 02:32:17,126 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2020-07-11 02:32:17,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-11 02:32:17,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2020-07-11 02:32:17,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:17,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 45 states. [2020-07-11 02:32:17,241 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 45 states. [2020-07-11 02:32:17,242 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 45 states. [2020-07-11 02:32:17,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:17,246 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2020-07-11 02:32:17,246 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-07-11 02:32:17,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:17,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:17,246 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 46 states. [2020-07-11 02:32:17,247 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 46 states. [2020-07-11 02:32:17,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:17,248 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2020-07-11 02:32:17,249 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-07-11 02:32:17,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:17,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:17,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:17,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-11 02:32:17,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2020-07-11 02:32:17,251 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 39 [2020-07-11 02:32:17,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:17,252 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2020-07-11 02:32:17,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-11 02:32:17,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 49 transitions. [2020-07-11 02:32:17,337 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:17,338 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2020-07-11 02:32:17,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-11 02:32:17,338 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:17,339 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:32:17,339 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-11 02:32:17,339 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:17,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:17,340 INFO L82 PathProgramCache]: Analyzing trace with hash -148422936, now seen corresponding path program 9 times [2020-07-11 02:32:17,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:17,341 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [477107651] [2020-07-11 02:32:17,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:17,617 INFO L280 TraceCheckUtils]: 0: Hoare triple {2822#true} assume true; {2822#true} is VALID [2020-07-11 02:32:17,618 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2822#true} {2822#true} #74#return; {2822#true} is VALID [2020-07-11 02:32:17,618 INFO L263 TraceCheckUtils]: 0: Hoare triple {2822#true} call ULTIMATE.init(); {2822#true} is VALID [2020-07-11 02:32:17,618 INFO L280 TraceCheckUtils]: 1: Hoare triple {2822#true} assume true; {2822#true} is VALID [2020-07-11 02:32:17,618 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2822#true} {2822#true} #74#return; {2822#true} is VALID [2020-07-11 02:32:17,618 INFO L263 TraceCheckUtils]: 3: Hoare triple {2822#true} call #t~ret0 := main(); {2822#true} is VALID [2020-07-11 02:32:17,619 INFO L280 TraceCheckUtils]: 4: Hoare triple {2822#true} havoc ~i~0; {2822#true} is VALID [2020-07-11 02:32:17,619 INFO L280 TraceCheckUtils]: 5: Hoare triple {2822#true} havoc ~j~0; {2822#true} is VALID [2020-07-11 02:32:17,619 INFO L280 TraceCheckUtils]: 6: Hoare triple {2822#true} havoc ~k~0; {2822#true} is VALID [2020-07-11 02:32:17,620 INFO L280 TraceCheckUtils]: 7: Hoare triple {2822#true} ~i~0 := 0; {2826#(<= main_~i~0 0)} is VALID [2020-07-11 02:32:17,620 INFO L280 TraceCheckUtils]: 8: Hoare triple {2826#(<= main_~i~0 0)} ~k~0 := 9; {2826#(<= main_~i~0 0)} is VALID [2020-07-11 02:32:17,621 INFO L280 TraceCheckUtils]: 9: Hoare triple {2826#(<= main_~i~0 0)} ~j~0 := -100; {2827#(<= (+ (* 8 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-11 02:32:17,621 INFO L280 TraceCheckUtils]: 10: Hoare triple {2827#(<= (+ (* 8 main_~i~0) main_~j~0 100) 0)} assume !!(~i~0 <= 100); {2827#(<= (+ (* 8 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-11 02:32:17,622 INFO L280 TraceCheckUtils]: 11: Hoare triple {2827#(<= (+ (* 8 main_~i~0) main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {2828#(<= (+ (* 8 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-11 02:32:17,623 INFO L280 TraceCheckUtils]: 12: Hoare triple {2828#(<= (+ (* 8 main_~i~0) main_~j~0 92) 0)} assume !!(~j~0 < 20); {2828#(<= (+ (* 8 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-11 02:32:17,624 INFO L280 TraceCheckUtils]: 13: Hoare triple {2828#(<= (+ (* 8 main_~i~0) main_~j~0 92) 0)} ~j~0 := ~i~0 + ~j~0; {2829#(<= (+ (* 7 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-11 02:32:17,624 INFO L280 TraceCheckUtils]: 14: Hoare triple {2829#(<= (+ (* 7 main_~i~0) main_~j~0 92) 0)} assume !!(~j~0 < 20); {2829#(<= (+ (* 7 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-11 02:32:17,625 INFO L280 TraceCheckUtils]: 15: Hoare triple {2829#(<= (+ (* 7 main_~i~0) main_~j~0 92) 0)} ~j~0 := ~i~0 + ~j~0; {2830#(<= (+ (* 6 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-11 02:32:17,625 INFO L280 TraceCheckUtils]: 16: Hoare triple {2830#(<= (+ (* 6 main_~i~0) main_~j~0 92) 0)} assume !!(~j~0 < 20); {2830#(<= (+ (* 6 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-11 02:32:17,626 INFO L280 TraceCheckUtils]: 17: Hoare triple {2830#(<= (+ (* 6 main_~i~0) main_~j~0 92) 0)} ~j~0 := ~i~0 + ~j~0; {2831#(<= (+ (* 5 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-11 02:32:17,627 INFO L280 TraceCheckUtils]: 18: Hoare triple {2831#(<= (+ (* 5 main_~i~0) main_~j~0 92) 0)} assume !!(~j~0 < 20); {2831#(<= (+ (* 5 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-11 02:32:17,627 INFO L280 TraceCheckUtils]: 19: Hoare triple {2831#(<= (+ (* 5 main_~i~0) main_~j~0 92) 0)} ~j~0 := ~i~0 + ~j~0; {2832#(<= (+ (* 4 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-11 02:32:17,628 INFO L280 TraceCheckUtils]: 20: Hoare triple {2832#(<= (+ (* 4 main_~i~0) main_~j~0 92) 0)} assume !!(~j~0 < 20); {2832#(<= (+ (* 4 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-11 02:32:17,629 INFO L280 TraceCheckUtils]: 21: Hoare triple {2832#(<= (+ (* 4 main_~i~0) main_~j~0 92) 0)} ~j~0 := ~i~0 + ~j~0; {2833#(<= (+ (* 3 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-11 02:32:17,630 INFO L280 TraceCheckUtils]: 22: Hoare triple {2833#(<= (+ (* 3 main_~i~0) main_~j~0 92) 0)} assume !!(~j~0 < 20); {2833#(<= (+ (* 3 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-11 02:32:17,631 INFO L280 TraceCheckUtils]: 23: Hoare triple {2833#(<= (+ (* 3 main_~i~0) main_~j~0 92) 0)} ~j~0 := ~i~0 + ~j~0; {2834#(<= (+ (* 2 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-11 02:32:17,632 INFO L280 TraceCheckUtils]: 24: Hoare triple {2834#(<= (+ (* 2 main_~i~0) main_~j~0 92) 0)} assume !!(~j~0 < 20); {2834#(<= (+ (* 2 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-11 02:32:17,633 INFO L280 TraceCheckUtils]: 25: Hoare triple {2834#(<= (+ (* 2 main_~i~0) main_~j~0 92) 0)} ~j~0 := ~i~0 + ~j~0; {2835#(<= (+ main_~i~0 main_~j~0 92) 0)} is VALID [2020-07-11 02:32:17,633 INFO L280 TraceCheckUtils]: 26: Hoare triple {2835#(<= (+ main_~i~0 main_~j~0 92) 0)} assume !!(~j~0 < 20); {2835#(<= (+ main_~i~0 main_~j~0 92) 0)} is VALID [2020-07-11 02:32:17,634 INFO L280 TraceCheckUtils]: 27: Hoare triple {2835#(<= (+ main_~i~0 main_~j~0 92) 0)} ~j~0 := ~i~0 + ~j~0; {2836#(<= (+ main_~j~0 92) 0)} is VALID [2020-07-11 02:32:17,635 INFO L280 TraceCheckUtils]: 28: Hoare triple {2836#(<= (+ main_~j~0 92) 0)} assume !(~j~0 < 20); {2823#false} is VALID [2020-07-11 02:32:17,635 INFO L280 TraceCheckUtils]: 29: Hoare triple {2823#false} ~k~0 := 4; {2823#false} is VALID [2020-07-11 02:32:17,635 INFO L280 TraceCheckUtils]: 30: Hoare triple {2823#false} assume !(~k~0 <= 3); {2823#false} is VALID [2020-07-11 02:32:17,635 INFO L280 TraceCheckUtils]: 31: Hoare triple {2823#false} assume !!(~i~0 <= 100); {2823#false} is VALID [2020-07-11 02:32:17,635 INFO L280 TraceCheckUtils]: 32: Hoare triple {2823#false} ~i~0 := 1 + ~i~0; {2823#false} is VALID [2020-07-11 02:32:17,636 INFO L280 TraceCheckUtils]: 33: Hoare triple {2823#false} assume !(~j~0 < 20); {2823#false} is VALID [2020-07-11 02:32:17,636 INFO L280 TraceCheckUtils]: 34: Hoare triple {2823#false} ~k~0 := 4; {2823#false} is VALID [2020-07-11 02:32:17,636 INFO L280 TraceCheckUtils]: 35: Hoare triple {2823#false} assume !(~k~0 <= 3); {2823#false} is VALID [2020-07-11 02:32:17,636 INFO L280 TraceCheckUtils]: 36: Hoare triple {2823#false} assume !(~i~0 <= 100); {2823#false} is VALID [2020-07-11 02:32:17,636 INFO L263 TraceCheckUtils]: 37: Hoare triple {2823#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {2823#false} is VALID [2020-07-11 02:32:17,636 INFO L280 TraceCheckUtils]: 38: Hoare triple {2823#false} ~cond := #in~cond; {2823#false} is VALID [2020-07-11 02:32:17,637 INFO L280 TraceCheckUtils]: 39: Hoare triple {2823#false} assume 0 == ~cond; {2823#false} is VALID [2020-07-11 02:32:17,637 INFO L280 TraceCheckUtils]: 40: Hoare triple {2823#false} assume !false; {2823#false} is VALID [2020-07-11 02:32:17,639 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 12 proven. 64 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-11 02:32:17,639 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [477107651] [2020-07-11 02:32:17,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:32:17,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-11 02:32:17,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633785489] [2020-07-11 02:32:17,640 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2020-07-11 02:32:17,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:17,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-11 02:32:17,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:17,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-11 02:32:17,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:17,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-11 02:32:17,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2020-07-11 02:32:17,690 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 13 states. [2020-07-11 02:32:18,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:18,468 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2020-07-11 02:32:18,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-11 02:32:18,469 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2020-07-11 02:32:18,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:18,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 02:32:18,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2020-07-11 02:32:18,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 02:32:18,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2020-07-11 02:32:18,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 59 transitions. [2020-07-11 02:32:18,551 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:18,552 INFO L225 Difference]: With dead ends: 64 [2020-07-11 02:32:18,552 INFO L226 Difference]: Without dead ends: 48 [2020-07-11 02:32:18,553 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2020-07-11 02:32:18,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-11 02:32:18,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2020-07-11 02:32:18,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:18,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2020-07-11 02:32:18,686 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2020-07-11 02:32:18,686 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2020-07-11 02:32:18,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:18,688 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2020-07-11 02:32:18,688 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-11 02:32:18,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:18,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:18,689 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2020-07-11 02:32:18,689 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2020-07-11 02:32:18,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:18,690 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2020-07-11 02:32:18,691 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-11 02:32:18,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:18,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:18,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:18,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:18,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-11 02:32:18,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2020-07-11 02:32:18,692 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 41 [2020-07-11 02:32:18,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:18,693 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2020-07-11 02:32:18,693 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-11 02:32:18,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2020-07-11 02:32:18,778 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:18,778 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2020-07-11 02:32:18,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-11 02:32:18,779 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:18,780 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:32:18,780 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-11 02:32:18,780 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:18,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:18,781 INFO L82 PathProgramCache]: Analyzing trace with hash 2058880295, now seen corresponding path program 10 times [2020-07-11 02:32:18,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:18,781 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1227067560] [2020-07-11 02:32:18,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:18,853 INFO L280 TraceCheckUtils]: 0: Hoare triple {3175#true} assume true; {3175#true} is VALID [2020-07-11 02:32:18,854 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3175#true} {3175#true} #74#return; {3175#true} is VALID [2020-07-11 02:32:18,854 INFO L263 TraceCheckUtils]: 0: Hoare triple {3175#true} call ULTIMATE.init(); {3175#true} is VALID [2020-07-11 02:32:18,854 INFO L280 TraceCheckUtils]: 1: Hoare triple {3175#true} assume true; {3175#true} is VALID [2020-07-11 02:32:18,854 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3175#true} {3175#true} #74#return; {3175#true} is VALID [2020-07-11 02:32:18,855 INFO L263 TraceCheckUtils]: 3: Hoare triple {3175#true} call #t~ret0 := main(); {3175#true} is VALID [2020-07-11 02:32:18,855 INFO L280 TraceCheckUtils]: 4: Hoare triple {3175#true} havoc ~i~0; {3175#true} is VALID [2020-07-11 02:32:18,855 INFO L280 TraceCheckUtils]: 5: Hoare triple {3175#true} havoc ~j~0; {3175#true} is VALID [2020-07-11 02:32:18,855 INFO L280 TraceCheckUtils]: 6: Hoare triple {3175#true} havoc ~k~0; {3175#true} is VALID [2020-07-11 02:32:18,856 INFO L280 TraceCheckUtils]: 7: Hoare triple {3175#true} ~i~0 := 0; {3179#(<= main_~i~0 0)} is VALID [2020-07-11 02:32:18,857 INFO L280 TraceCheckUtils]: 8: Hoare triple {3179#(<= main_~i~0 0)} ~k~0 := 9; {3179#(<= main_~i~0 0)} is VALID [2020-07-11 02:32:18,858 INFO L280 TraceCheckUtils]: 9: Hoare triple {3179#(<= main_~i~0 0)} ~j~0 := -100; {3179#(<= main_~i~0 0)} is VALID [2020-07-11 02:32:18,859 INFO L280 TraceCheckUtils]: 10: Hoare triple {3179#(<= main_~i~0 0)} assume !!(~i~0 <= 100); {3179#(<= main_~i~0 0)} is VALID [2020-07-11 02:32:18,861 INFO L280 TraceCheckUtils]: 11: Hoare triple {3179#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {3180#(<= main_~i~0 1)} is VALID [2020-07-11 02:32:18,864 INFO L280 TraceCheckUtils]: 12: Hoare triple {3180#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3180#(<= main_~i~0 1)} is VALID [2020-07-11 02:32:18,868 INFO L280 TraceCheckUtils]: 13: Hoare triple {3180#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3180#(<= main_~i~0 1)} is VALID [2020-07-11 02:32:18,870 INFO L280 TraceCheckUtils]: 14: Hoare triple {3180#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3180#(<= main_~i~0 1)} is VALID [2020-07-11 02:32:18,871 INFO L280 TraceCheckUtils]: 15: Hoare triple {3180#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3180#(<= main_~i~0 1)} is VALID [2020-07-11 02:32:18,871 INFO L280 TraceCheckUtils]: 16: Hoare triple {3180#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3180#(<= main_~i~0 1)} is VALID [2020-07-11 02:32:18,872 INFO L280 TraceCheckUtils]: 17: Hoare triple {3180#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3180#(<= main_~i~0 1)} is VALID [2020-07-11 02:32:18,872 INFO L280 TraceCheckUtils]: 18: Hoare triple {3180#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3180#(<= main_~i~0 1)} is VALID [2020-07-11 02:32:18,873 INFO L280 TraceCheckUtils]: 19: Hoare triple {3180#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3180#(<= main_~i~0 1)} is VALID [2020-07-11 02:32:18,873 INFO L280 TraceCheckUtils]: 20: Hoare triple {3180#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3180#(<= main_~i~0 1)} is VALID [2020-07-11 02:32:18,874 INFO L280 TraceCheckUtils]: 21: Hoare triple {3180#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3180#(<= main_~i~0 1)} is VALID [2020-07-11 02:32:18,874 INFO L280 TraceCheckUtils]: 22: Hoare triple {3180#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3180#(<= main_~i~0 1)} is VALID [2020-07-11 02:32:18,875 INFO L280 TraceCheckUtils]: 23: Hoare triple {3180#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3180#(<= main_~i~0 1)} is VALID [2020-07-11 02:32:18,875 INFO L280 TraceCheckUtils]: 24: Hoare triple {3180#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3180#(<= main_~i~0 1)} is VALID [2020-07-11 02:32:18,875 INFO L280 TraceCheckUtils]: 25: Hoare triple {3180#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3180#(<= main_~i~0 1)} is VALID [2020-07-11 02:32:18,876 INFO L280 TraceCheckUtils]: 26: Hoare triple {3180#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3180#(<= main_~i~0 1)} is VALID [2020-07-11 02:32:18,876 INFO L280 TraceCheckUtils]: 27: Hoare triple {3180#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3180#(<= main_~i~0 1)} is VALID [2020-07-11 02:32:18,877 INFO L280 TraceCheckUtils]: 28: Hoare triple {3180#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3180#(<= main_~i~0 1)} is VALID [2020-07-11 02:32:18,877 INFO L280 TraceCheckUtils]: 29: Hoare triple {3180#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3180#(<= main_~i~0 1)} is VALID [2020-07-11 02:32:18,878 INFO L280 TraceCheckUtils]: 30: Hoare triple {3180#(<= main_~i~0 1)} assume !(~j~0 < 20); {3180#(<= main_~i~0 1)} is VALID [2020-07-11 02:32:18,878 INFO L280 TraceCheckUtils]: 31: Hoare triple {3180#(<= main_~i~0 1)} ~k~0 := 4; {3180#(<= main_~i~0 1)} is VALID [2020-07-11 02:32:18,879 INFO L280 TraceCheckUtils]: 32: Hoare triple {3180#(<= main_~i~0 1)} assume !(~k~0 <= 3); {3180#(<= main_~i~0 1)} is VALID [2020-07-11 02:32:18,879 INFO L280 TraceCheckUtils]: 33: Hoare triple {3180#(<= main_~i~0 1)} assume !!(~i~0 <= 100); {3180#(<= main_~i~0 1)} is VALID [2020-07-11 02:32:18,880 INFO L280 TraceCheckUtils]: 34: Hoare triple {3180#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {3181#(<= main_~i~0 2)} is VALID [2020-07-11 02:32:18,880 INFO L280 TraceCheckUtils]: 35: Hoare triple {3181#(<= main_~i~0 2)} assume !(~j~0 < 20); {3181#(<= main_~i~0 2)} is VALID [2020-07-11 02:32:18,880 INFO L280 TraceCheckUtils]: 36: Hoare triple {3181#(<= main_~i~0 2)} ~k~0 := 4; {3181#(<= main_~i~0 2)} is VALID [2020-07-11 02:32:18,881 INFO L280 TraceCheckUtils]: 37: Hoare triple {3181#(<= main_~i~0 2)} assume !(~k~0 <= 3); {3181#(<= main_~i~0 2)} is VALID [2020-07-11 02:32:18,881 INFO L280 TraceCheckUtils]: 38: Hoare triple {3181#(<= main_~i~0 2)} assume !(~i~0 <= 100); {3176#false} is VALID [2020-07-11 02:32:18,882 INFO L263 TraceCheckUtils]: 39: Hoare triple {3176#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {3176#false} is VALID [2020-07-11 02:32:18,882 INFO L280 TraceCheckUtils]: 40: Hoare triple {3176#false} ~cond := #in~cond; {3176#false} is VALID [2020-07-11 02:32:18,882 INFO L280 TraceCheckUtils]: 41: Hoare triple {3176#false} assume 0 == ~cond; {3176#false} is VALID [2020-07-11 02:32:18,882 INFO L280 TraceCheckUtils]: 42: Hoare triple {3176#false} assume !false; {3176#false} is VALID [2020-07-11 02:32:18,884 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2020-07-11 02:32:18,884 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1227067560] [2020-07-11 02:32:18,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:32:18,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-11 02:32:18,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397433149] [2020-07-11 02:32:18,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2020-07-11 02:32:18,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:18,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 02:32:18,914 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:18,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 02:32:18,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:18,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 02:32:18,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-11 02:32:18,916 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2020-07-11 02:32:19,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:19,160 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2020-07-11 02:32:19,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-11 02:32:19,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2020-07-11 02:32:19,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:19,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:32:19,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2020-07-11 02:32:19,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:32:19,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2020-07-11 02:32:19,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2020-07-11 02:32:19,222 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:19,224 INFO L225 Difference]: With dead ends: 60 [2020-07-11 02:32:19,224 INFO L226 Difference]: Without dead ends: 55 [2020-07-11 02:32:19,225 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-11 02:32:19,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-11 02:32:19,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2020-07-11 02:32:19,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:19,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 54 states. [2020-07-11 02:32:19,348 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 54 states. [2020-07-11 02:32:19,348 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 54 states. [2020-07-11 02:32:19,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:19,350 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2020-07-11 02:32:19,350 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2020-07-11 02:32:19,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:19,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:19,351 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 55 states. [2020-07-11 02:32:19,351 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 55 states. [2020-07-11 02:32:19,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:19,353 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2020-07-11 02:32:19,353 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2020-07-11 02:32:19,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:19,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:19,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:19,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:19,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-11 02:32:19,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2020-07-11 02:32:19,356 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 43 [2020-07-11 02:32:19,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:19,356 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2020-07-11 02:32:19,356 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 02:32:19,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 60 transitions. [2020-07-11 02:32:19,455 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:19,456 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2020-07-11 02:32:19,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-11 02:32:19,457 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:32:19,457 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:32:19,458 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-11 02:32:19,458 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:32:19,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:32:19,459 INFO L82 PathProgramCache]: Analyzing trace with hash -135810616, now seen corresponding path program 11 times [2020-07-11 02:32:19,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:32:19,460 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1140351273] [2020-07-11 02:32:19,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:32:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:32:19,538 INFO L280 TraceCheckUtils]: 0: Hoare triple {3522#true} assume true; {3522#true} is VALID [2020-07-11 02:32:19,539 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3522#true} {3522#true} #74#return; {3522#true} is VALID [2020-07-11 02:32:19,539 INFO L263 TraceCheckUtils]: 0: Hoare triple {3522#true} call ULTIMATE.init(); {3522#true} is VALID [2020-07-11 02:32:19,539 INFO L280 TraceCheckUtils]: 1: Hoare triple {3522#true} assume true; {3522#true} is VALID [2020-07-11 02:32:19,540 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3522#true} {3522#true} #74#return; {3522#true} is VALID [2020-07-11 02:32:19,540 INFO L263 TraceCheckUtils]: 3: Hoare triple {3522#true} call #t~ret0 := main(); {3522#true} is VALID [2020-07-11 02:32:19,540 INFO L280 TraceCheckUtils]: 4: Hoare triple {3522#true} havoc ~i~0; {3522#true} is VALID [2020-07-11 02:32:19,540 INFO L280 TraceCheckUtils]: 5: Hoare triple {3522#true} havoc ~j~0; {3522#true} is VALID [2020-07-11 02:32:19,540 INFO L280 TraceCheckUtils]: 6: Hoare triple {3522#true} havoc ~k~0; {3522#true} is VALID [2020-07-11 02:32:19,540 INFO L280 TraceCheckUtils]: 7: Hoare triple {3522#true} ~i~0 := 0; {3522#true} is VALID [2020-07-11 02:32:19,541 INFO L280 TraceCheckUtils]: 8: Hoare triple {3522#true} ~k~0 := 9; {3522#true} is VALID [2020-07-11 02:32:19,541 INFO L280 TraceCheckUtils]: 9: Hoare triple {3522#true} ~j~0 := -100; {3522#true} is VALID [2020-07-11 02:32:19,541 INFO L280 TraceCheckUtils]: 10: Hoare triple {3522#true} assume !!(~i~0 <= 100); {3522#true} is VALID [2020-07-11 02:32:19,541 INFO L280 TraceCheckUtils]: 11: Hoare triple {3522#true} ~i~0 := 1 + ~i~0; {3522#true} is VALID [2020-07-11 02:32:19,541 INFO L280 TraceCheckUtils]: 12: Hoare triple {3522#true} assume !!(~j~0 < 20); {3522#true} is VALID [2020-07-11 02:32:19,542 INFO L280 TraceCheckUtils]: 13: Hoare triple {3522#true} ~j~0 := ~i~0 + ~j~0; {3522#true} is VALID [2020-07-11 02:32:19,542 INFO L280 TraceCheckUtils]: 14: Hoare triple {3522#true} assume !!(~j~0 < 20); {3522#true} is VALID [2020-07-11 02:32:19,542 INFO L280 TraceCheckUtils]: 15: Hoare triple {3522#true} ~j~0 := ~i~0 + ~j~0; {3522#true} is VALID [2020-07-11 02:32:19,542 INFO L280 TraceCheckUtils]: 16: Hoare triple {3522#true} assume !!(~j~0 < 20); {3522#true} is VALID [2020-07-11 02:32:19,542 INFO L280 TraceCheckUtils]: 17: Hoare triple {3522#true} ~j~0 := ~i~0 + ~j~0; {3522#true} is VALID [2020-07-11 02:32:19,543 INFO L280 TraceCheckUtils]: 18: Hoare triple {3522#true} assume !!(~j~0 < 20); {3522#true} is VALID [2020-07-11 02:32:19,543 INFO L280 TraceCheckUtils]: 19: Hoare triple {3522#true} ~j~0 := ~i~0 + ~j~0; {3522#true} is VALID [2020-07-11 02:32:19,543 INFO L280 TraceCheckUtils]: 20: Hoare triple {3522#true} assume !!(~j~0 < 20); {3522#true} is VALID [2020-07-11 02:32:19,543 INFO L280 TraceCheckUtils]: 21: Hoare triple {3522#true} ~j~0 := ~i~0 + ~j~0; {3522#true} is VALID [2020-07-11 02:32:19,543 INFO L280 TraceCheckUtils]: 22: Hoare triple {3522#true} assume !!(~j~0 < 20); {3522#true} is VALID [2020-07-11 02:32:19,544 INFO L280 TraceCheckUtils]: 23: Hoare triple {3522#true} ~j~0 := ~i~0 + ~j~0; {3522#true} is VALID [2020-07-11 02:32:19,544 INFO L280 TraceCheckUtils]: 24: Hoare triple {3522#true} assume !!(~j~0 < 20); {3522#true} is VALID [2020-07-11 02:32:19,544 INFO L280 TraceCheckUtils]: 25: Hoare triple {3522#true} ~j~0 := ~i~0 + ~j~0; {3522#true} is VALID [2020-07-11 02:32:19,544 INFO L280 TraceCheckUtils]: 26: Hoare triple {3522#true} assume !!(~j~0 < 20); {3522#true} is VALID [2020-07-11 02:32:19,544 INFO L280 TraceCheckUtils]: 27: Hoare triple {3522#true} ~j~0 := ~i~0 + ~j~0; {3522#true} is VALID [2020-07-11 02:32:19,545 INFO L280 TraceCheckUtils]: 28: Hoare triple {3522#true} assume !!(~j~0 < 20); {3522#true} is VALID [2020-07-11 02:32:19,545 INFO L280 TraceCheckUtils]: 29: Hoare triple {3522#true} ~j~0 := ~i~0 + ~j~0; {3522#true} is VALID [2020-07-11 02:32:19,545 INFO L280 TraceCheckUtils]: 30: Hoare triple {3522#true} assume !(~j~0 < 20); {3522#true} is VALID [2020-07-11 02:32:19,545 INFO L280 TraceCheckUtils]: 31: Hoare triple {3522#true} ~k~0 := 4; {3522#true} is VALID [2020-07-11 02:32:19,546 INFO L280 TraceCheckUtils]: 32: Hoare triple {3522#true} assume !(~k~0 <= 3); {3522#true} is VALID [2020-07-11 02:32:19,546 INFO L280 TraceCheckUtils]: 33: Hoare triple {3522#true} assume !!(~i~0 <= 100); {3522#true} is VALID [2020-07-11 02:32:19,546 INFO L280 TraceCheckUtils]: 34: Hoare triple {3522#true} ~i~0 := 1 + ~i~0; {3522#true} is VALID [2020-07-11 02:32:19,546 INFO L280 TraceCheckUtils]: 35: Hoare triple {3522#true} assume !(~j~0 < 20); {3522#true} is VALID [2020-07-11 02:32:19,546 INFO L280 TraceCheckUtils]: 36: Hoare triple {3522#true} ~k~0 := 4; {3522#true} is VALID [2020-07-11 02:32:19,547 INFO L280 TraceCheckUtils]: 37: Hoare triple {3522#true} assume !(~k~0 <= 3); {3522#true} is VALID [2020-07-11 02:32:19,547 INFO L280 TraceCheckUtils]: 38: Hoare triple {3522#true} assume !!(~i~0 <= 100); {3522#true} is VALID [2020-07-11 02:32:19,547 INFO L280 TraceCheckUtils]: 39: Hoare triple {3522#true} ~i~0 := 1 + ~i~0; {3522#true} is VALID [2020-07-11 02:32:19,547 INFO L280 TraceCheckUtils]: 40: Hoare triple {3522#true} assume !(~j~0 < 20); {3522#true} is VALID [2020-07-11 02:32:19,548 INFO L280 TraceCheckUtils]: 41: Hoare triple {3522#true} ~k~0 := 4; {3526#(= 4 main_~k~0)} is VALID [2020-07-11 02:32:19,549 INFO L280 TraceCheckUtils]: 42: Hoare triple {3526#(= 4 main_~k~0)} assume !(~k~0 <= 3); {3526#(= 4 main_~k~0)} is VALID [2020-07-11 02:32:19,549 INFO L280 TraceCheckUtils]: 43: Hoare triple {3526#(= 4 main_~k~0)} assume !(~i~0 <= 100); {3526#(= 4 main_~k~0)} is VALID [2020-07-11 02:32:19,550 INFO L263 TraceCheckUtils]: 44: Hoare triple {3526#(= 4 main_~k~0)} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {3527#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:32:19,551 INFO L280 TraceCheckUtils]: 45: Hoare triple {3527#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {3528#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:32:19,556 INFO L280 TraceCheckUtils]: 46: Hoare triple {3528#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3523#false} is VALID [2020-07-11 02:32:19,556 INFO L280 TraceCheckUtils]: 47: Hoare triple {3523#false} assume !false; {3523#false} is VALID [2020-07-11 02:32:19,558 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2020-07-11 02:32:19,558 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1140351273] [2020-07-11 02:32:19,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:32:19,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 02:32:19,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43869431] [2020-07-11 02:32:19,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2020-07-11 02:32:19,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:32:19,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 02:32:19,591 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:19,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 02:32:19,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:32:19,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 02:32:19,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 02:32:19,592 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 5 states. [2020-07-11 02:32:19,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:19,798 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2020-07-11 02:32:19,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-11 02:32:19,798 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2020-07-11 02:32:19,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:32:19,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:32:19,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2020-07-11 02:32:19,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:32:19,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2020-07-11 02:32:19,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2020-07-11 02:32:19,844 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:19,845 INFO L225 Difference]: With dead ends: 71 [2020-07-11 02:32:19,845 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 02:32:19,846 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-11 02:32:19,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 02:32:19,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 02:32:19,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:32:19,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:19,847 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:19,848 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:19,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:19,848 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:32:19,848 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:32:19,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:19,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:19,849 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:19,849 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:32:19,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:32:19,849 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:32:19,849 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:32:19,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:19,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:32:19,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:32:19,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:32:19,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 02:32:19,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 02:32:19,850 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2020-07-11 02:32:19,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:32:19,850 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 02:32:19,850 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 02:32:19,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 02:32:19,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:32:19,851 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:32:19,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:32:19,851 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-11 02:32:19,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 02:32:20,317 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:32:20,317 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:32:20,317 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:32:20,317 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 02:32:20,318 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 02:32:20,318 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:32:20,318 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:32:20,318 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:32:20,318 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-11 02:32:20,318 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-11 02:32:20,318 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:32:20,319 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: false [2020-07-11 02:32:20,319 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 30) the Hoare annotation is: true [2020-07-11 02:32:20,319 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (or (= 4 main_~k~0) (<= main_~i~0 1)) [2020-07-11 02:32:20,319 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (or (and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0)) (= 4 main_~k~0)) [2020-07-11 02:32:20,319 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (<= main_~i~0 0) [2020-07-11 02:32:20,320 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-11 02:32:20,320 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 30) the Hoare annotation is: true [2020-07-11 02:32:20,320 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 30) the Hoare annotation is: true [2020-07-11 02:32:20,320 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-07-11 02:32:20,320 INFO L264 CegarLoopResult]: At program point L24-2(lines 24 26) the Hoare annotation is: (= 4 main_~k~0) [2020-07-11 02:32:20,320 INFO L264 CegarLoopResult]: At program point L24-3(lines 18 27) the Hoare annotation is: (or (and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0)) (= 4 main_~k~0)) [2020-07-11 02:32:20,321 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-11 02:32:20,321 INFO L264 CegarLoopResult]: At program point L20-3(lines 20 22) the Hoare annotation is: (or (= 4 main_~k~0) (<= main_~i~0 1)) [2020-07-11 02:32:20,321 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (<= main_~i~0 0) [2020-07-11 02:32:20,321 INFO L264 CegarLoopResult]: At program point L18-2(lines 18 27) the Hoare annotation is: (= 4 main_~k~0) [2020-07-11 02:32:20,321 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-11 02:32:20,321 INFO L271 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-07-11 02:32:20,322 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-11 02:32:20,322 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: true [2020-07-11 02:32:20,322 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 02:32:20,322 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-11 02:32:20,322 INFO L271 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: true [2020-07-11 02:32:20,323 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 02:32:20,331 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-11 02:32:20,339 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:32:20,339 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:32:20,340 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-11 02:32:20,340 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-11 02:32:20,352 INFO L163 areAnnotationChecker]: CFG has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 02:32:20,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 02:32:20 BoogieIcfgContainer [2020-07-11 02:32:20,387 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 02:32:20,394 INFO L168 Benchmark]: Toolchain (without parser) took 12082.49 ms. Allocated memory was 144.7 MB in the beginning and 319.8 MB in the end (delta: 175.1 MB). Free memory was 103.6 MB in the beginning and 99.5 MB in the end (delta: 4.0 MB). Peak memory consumption was 179.1 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:20,394 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 144.7 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-11 02:32:20,395 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.97 ms. Allocated memory is still 144.7 MB. Free memory was 103.3 MB in the beginning and 93.5 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:20,396 INFO L168 Benchmark]: Boogie Preprocessor took 36.70 ms. Allocated memory is still 144.7 MB. Free memory was 93.5 MB in the beginning and 91.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:20,405 INFO L168 Benchmark]: RCFGBuilder took 501.28 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 91.9 MB in the beginning and 164.9 MB in the end (delta: -73.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:20,407 INFO L168 Benchmark]: TraceAbstraction took 11225.60 ms. Allocated memory was 202.9 MB in the beginning and 319.8 MB in the end (delta: 116.9 MB). Free memory was 164.3 MB in the beginning and 99.5 MB in the end (delta: 64.7 MB). Peak memory consumption was 181.7 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:20,414 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.45 ms. Allocated memory is still 144.7 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 309.97 ms. Allocated memory is still 144.7 MB. Free memory was 103.3 MB in the beginning and 93.5 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.70 ms. Allocated memory is still 144.7 MB. Free memory was 93.5 MB in the beginning and 91.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 501.28 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 91.9 MB in the beginning and 164.9 MB in the end (delta: -73.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11225.60 ms. Allocated memory was 202.9 MB in the beginning and 319.8 MB in the end (delta: 116.9 MB). Free memory was 164.3 MB in the beginning and 99.5 MB in the end (delta: 64.7 MB). Peak memory consumption was 181.7 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: (i <= 0 && j + 100 <= 0) || 4 == k - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 10.6s, OverallIterations: 14, TraceHistogramMax: 9, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 302 SDtfs, 133 SDslu, 1052 SDs, 0 SdLazy, 556 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 12 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 113 PreInvPairs, 187 NumberOfFragments, 90 HoareAnnotationTreeSize, 113 FomulaSimplifications, 5866 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 29 FomulaSimplificationsInter, 223 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 435 NumberOfCodeBlocks, 435 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 421 ConstructedInterpolants, 0 QuantifiedInterpolants, 40351 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 291/513 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...