/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sumt5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 17:56:30,677 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 17:56:30,682 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 17:56:30,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 17:56:30,731 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 17:56:30,744 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 17:56:30,748 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 17:56:30,750 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 17:56:30,752 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 17:56:30,755 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 17:56:30,756 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 17:56:30,759 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 17:56:30,760 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 17:56:30,766 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 17:56:30,769 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 17:56:30,771 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 17:56:30,771 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 17:56:30,775 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 17:56:30,777 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 17:56:30,784 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 17:56:30,789 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 17:56:30,790 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 17:56:30,792 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 17:56:30,793 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 17:56:30,801 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 17:56:30,801 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 17:56:30,801 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 17:56:30,805 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 17:56:30,806 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 17:56:30,809 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 17:56:30,809 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 17:56:30,810 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 17:56:30,811 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 17:56:30,812 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 17:56:30,813 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 17:56:30,814 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 17:56:30,814 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 17:56:30,815 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 17:56:30,815 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 17:56:30,816 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 17:56:30,818 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 17:56:30,819 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 17:56:30,844 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 17:56:30,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 17:56:30,847 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 17:56:30,848 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 17:56:30,848 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 17:56:30,848 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 17:56:30,849 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 17:56:30,849 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 17:56:30,849 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 17:56:30,850 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 17:56:30,851 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 17:56:30,851 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 17:56:30,851 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 17:56:30,852 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 17:56:30,852 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 17:56:30,852 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 17:56:30,853 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 17:56:30,853 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 17:56:30,853 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 17:56:30,853 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 17:56:30,854 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 17:56:30,855 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 17:56:30,855 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 17:56:31,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 17:56:31,338 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 17:56:31,344 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 17:56:31,346 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 17:56:31,347 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 17:56:31,349 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt5.c [2020-09-04 17:56:31,463 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ae6f21e43/e30056f3fa2f49098df5b62c2c905481/FLAG790f2fe82 [2020-09-04 17:56:32,108 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 17:56:32,110 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/loops-crafted-1/sumt5.c [2020-09-04 17:56:32,121 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ae6f21e43/e30056f3fa2f49098df5b62c2c905481/FLAG790f2fe82 [2020-09-04 17:56:32,437 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/ae6f21e43/e30056f3fa2f49098df5b62c2c905481 [2020-09-04 17:56:32,454 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 17:56:32,457 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 17:56:32,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 17:56:32,459 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 17:56:32,464 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 17:56:32,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 05:56:32" (1/1) ... [2020-09-04 17:56:32,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fb2e3cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:56:32, skipping insertion in model container [2020-09-04 17:56:32,472 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 05:56:32" (1/1) ... [2020-09-04 17:56:32,483 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 17:56:32,511 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 17:56:32,750 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 17:56:32,757 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 17:56:32,786 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 17:56:32,807 INFO L208 MainTranslator]: Completed translation [2020-09-04 17:56:32,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:56:32 WrapperNode [2020-09-04 17:56:32,808 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 17:56:32,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 17:56:32,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 17:56:32,809 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 17:56:32,830 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:56:32" (1/1) ... [2020-09-04 17:56:32,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:56:32" (1/1) ... [2020-09-04 17:56:32,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:56:32" (1/1) ... [2020-09-04 17:56:32,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:56:32" (1/1) ... [2020-09-04 17:56:32,937 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:56:32" (1/1) ... [2020-09-04 17:56:32,954 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:56:32" (1/1) ... [2020-09-04 17:56:32,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:56:32" (1/1) ... [2020-09-04 17:56:32,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 17:56:32,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 17:56:32,961 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 17:56:32,961 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 17:56:32,963 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:56:32" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-04 17:56:33,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 17:56:33,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 17:56:33,039 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-09-04 17:56:33,039 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-09-04 17:56:33,039 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 17:56:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 17:56:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-04 17:56:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-09-04 17:56:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-09-04 17:56:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 17:56:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 17:56:33,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 17:56:33,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 17:56:33,374 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 17:56:33,375 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-04 17:56:33,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 05:56:33 BoogieIcfgContainer [2020-09-04 17:56:33,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 17:56:33,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 17:56:33,383 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 17:56:33,388 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 17:56:33,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 05:56:32" (1/3) ... [2020-09-04 17:56:33,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4bf93a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 05:56:33, skipping insertion in model container [2020-09-04 17:56:33,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:56:32" (2/3) ... [2020-09-04 17:56:33,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4bf93a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 05:56:33, skipping insertion in model container [2020-09-04 17:56:33,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 05:56:33" (3/3) ... [2020-09-04 17:56:33,393 INFO L109 eAbstractionObserver]: Analyzing ICFG sumt5.c [2020-09-04 17:56:33,409 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 17:56:33,432 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 17:56:33,488 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 17:56:33,523 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 17:56:33,523 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 17:56:33,523 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 17:56:33,523 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 17:56:33,524 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 17:56:33,524 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 17:56:33,524 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 17:56:33,524 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 17:56:33,546 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2020-09-04 17:56:33,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-04 17:56:33,562 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:56:33,564 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:56:33,565 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:56:33,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:56:33,574 INFO L82 PathProgramCache]: Analyzing trace with hash -687260303, now seen corresponding path program 1 times [2020-09-04 17:56:33,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:56:33,588 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1303841368] [2020-09-04 17:56:33,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:56:33,663 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:56:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:33,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:56:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:33,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:56:33,835 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1303841368] [2020-09-04 17:56:33,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:56:33,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 17:56:33,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144001614] [2020-09-04 17:56:33,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 17:56:33,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:56:33,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 17:56:33,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 17:56:33,878 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2020-09-04 17:56:33,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:56:33,973 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2020-09-04 17:56:33,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 17:56:33,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-09-04 17:56:33,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:56:33,991 INFO L225 Difference]: With dead ends: 52 [2020-09-04 17:56:33,992 INFO L226 Difference]: Without dead ends: 32 [2020-09-04 17:56:33,997 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 17:56:34,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-09-04 17:56:34,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-09-04 17:56:34,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-09-04 17:56:34,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2020-09-04 17:56:34,062 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 21 [2020-09-04 17:56:34,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:56:34,063 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-09-04 17:56:34,064 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 17:56:34,064 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-09-04 17:56:34,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-04 17:56:34,065 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:56:34,065 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:56:34,066 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 17:56:34,066 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:56:34,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:56:34,067 INFO L82 PathProgramCache]: Analyzing trace with hash -715889454, now seen corresponding path program 1 times [2020-09-04 17:56:34,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:56:34,068 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1188725481] [2020-09-04 17:56:34,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:56:34,071 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:56:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:34,753 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2020-09-04 17:56:34,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:56:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:34,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:56:34,913 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1188725481] [2020-09-04 17:56:34,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:56:34,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 17:56:34,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796864110] [2020-09-04 17:56:34,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 17:56:34,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:56:34,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 17:56:34,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-09-04 17:56:34,918 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 12 states. [2020-09-04 17:56:35,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:56:35,761 INFO L93 Difference]: Finished difference Result 91 states and 116 transitions. [2020-09-04 17:56:35,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 17:56:35,762 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-09-04 17:56:35,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:56:35,766 INFO L225 Difference]: With dead ends: 91 [2020-09-04 17:56:35,766 INFO L226 Difference]: Without dead ends: 72 [2020-09-04 17:56:35,769 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2020-09-04 17:56:35,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-09-04 17:56:35,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 34. [2020-09-04 17:56:35,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-09-04 17:56:35,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2020-09-04 17:56:35,788 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 21 [2020-09-04 17:56:35,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:56:35,788 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2020-09-04 17:56:35,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 17:56:35,789 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-09-04 17:56:35,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-04 17:56:35,790 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:56:35,790 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:56:35,790 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 17:56:35,791 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:56:35,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:56:35,791 INFO L82 PathProgramCache]: Analyzing trace with hash -805340680, now seen corresponding path program 1 times [2020-09-04 17:56:35,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:56:35,792 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1509398733] [2020-09-04 17:56:35,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:56:35,828 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:56:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:36,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:56:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:36,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:56:36,908 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1509398733] [2020-09-04 17:56:36,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:56:36,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-09-04 17:56:36,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150074376] [2020-09-04 17:56:36,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 17:56:36,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:56:36,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 17:56:36,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2020-09-04 17:56:36,911 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 18 states. [2020-09-04 17:56:38,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:56:38,360 INFO L93 Difference]: Finished difference Result 87 states and 110 transitions. [2020-09-04 17:56:38,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 17:56:38,363 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2020-09-04 17:56:38,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:56:38,365 INFO L225 Difference]: With dead ends: 87 [2020-09-04 17:56:38,365 INFO L226 Difference]: Without dead ends: 82 [2020-09-04 17:56:38,368 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=199, Invalid=671, Unknown=0, NotChecked=0, Total=870 [2020-09-04 17:56:38,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-09-04 17:56:38,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 37. [2020-09-04 17:56:38,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-09-04 17:56:38,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-09-04 17:56:38,394 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 25 [2020-09-04 17:56:38,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:56:38,395 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-09-04 17:56:38,396 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 17:56:38,396 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-09-04 17:56:38,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-09-04 17:56:38,399 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:56:38,399 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:56:38,399 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 17:56:38,399 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:56:38,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:56:38,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1490056162, now seen corresponding path program 2 times [2020-09-04 17:56:38,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:56:38,402 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [684484586] [2020-09-04 17:56:38,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:56:38,412 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:56:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:38,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:56:38,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:38,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:56:38,725 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [684484586] [2020-09-04 17:56:38,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:56:38,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 17:56:38,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945942672] [2020-09-04 17:56:38,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 17:56:38,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:56:38,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 17:56:38,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-09-04 17:56:38,728 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2020-09-04 17:56:39,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:56:39,065 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2020-09-04 17:56:39,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 17:56:39,066 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2020-09-04 17:56:39,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:56:39,067 INFO L225 Difference]: With dead ends: 62 [2020-09-04 17:56:39,067 INFO L226 Difference]: Without dead ends: 46 [2020-09-04 17:56:39,068 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-09-04 17:56:39,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-09-04 17:56:39,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2020-09-04 17:56:39,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-09-04 17:56:39,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2020-09-04 17:56:39,083 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 29 [2020-09-04 17:56:39,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:56:39,084 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2020-09-04 17:56:39,084 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 17:56:39,084 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-09-04 17:56:39,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-09-04 17:56:39,086 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:56:39,086 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:56:39,086 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 17:56:39,086 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:56:39,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:56:39,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1369450661, now seen corresponding path program 1 times [2020-09-04 17:56:39,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:56:39,087 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [488734954] [2020-09-04 17:56:39,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:56:39,093 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:56:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:39,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:56:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:39,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:56:39,177 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [488734954] [2020-09-04 17:56:39,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:56:39,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 17:56:39,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431758365] [2020-09-04 17:56:39,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 17:56:39,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:56:39,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 17:56:39,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 17:56:39,180 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 5 states. [2020-09-04 17:56:39,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:56:39,326 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2020-09-04 17:56:39,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 17:56:39,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-09-04 17:56:39,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:56:39,328 INFO L225 Difference]: With dead ends: 61 [2020-09-04 17:56:39,328 INFO L226 Difference]: Without dead ends: 45 [2020-09-04 17:56:39,329 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-09-04 17:56:39,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-09-04 17:56:39,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-09-04 17:56:39,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-09-04 17:56:39,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-09-04 17:56:39,344 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 30 [2020-09-04 17:56:39,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:56:39,345 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-09-04 17:56:39,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 17:56:39,345 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-09-04 17:56:39,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-09-04 17:56:39,346 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:56:39,346 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:56:39,346 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 17:56:39,347 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:56:39,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:56:39,348 INFO L82 PathProgramCache]: Analyzing trace with hash -895592636, now seen corresponding path program 1 times [2020-09-04 17:56:39,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:56:39,349 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1062508914] [2020-09-04 17:56:39,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:56:39,354 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:56:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:39,691 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 29 [2020-09-04 17:56:39,901 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 38 [2020-09-04 17:56:40,096 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 38 [2020-09-04 17:56:40,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:56:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:40,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:56:40,152 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1062508914] [2020-09-04 17:56:40,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:56:40,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 17:56:40,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352536708] [2020-09-04 17:56:40,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 17:56:40,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:56:40,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 17:56:40,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-09-04 17:56:40,155 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 10 states. [2020-09-04 17:56:40,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:56:40,671 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2020-09-04 17:56:40,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 17:56:40,672 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-09-04 17:56:40,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:56:40,673 INFO L225 Difference]: With dead ends: 59 [2020-09-04 17:56:40,673 INFO L226 Difference]: Without dead ends: 43 [2020-09-04 17:56:40,675 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2020-09-04 17:56:40,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-09-04 17:56:40,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2020-09-04 17:56:40,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-09-04 17:56:40,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2020-09-04 17:56:40,696 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 31 [2020-09-04 17:56:40,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:56:40,697 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2020-09-04 17:56:40,697 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 17:56:40,697 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2020-09-04 17:56:40,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-09-04 17:56:40,698 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:56:40,698 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:56:40,699 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 17:56:40,699 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:56:40,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:56:40,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1240166497, now seen corresponding path program 1 times [2020-09-04 17:56:40,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:56:40,700 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1385323412] [2020-09-04 17:56:40,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:56:40,706 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:56:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:41,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:56:41,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:41,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:56:41,821 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1385323412] [2020-09-04 17:56:41,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:56:41,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-09-04 17:56:41,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261241696] [2020-09-04 17:56:41,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-04 17:56:41,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:56:41,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-04 17:56:41,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2020-09-04 17:56:41,825 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 20 states. [2020-09-04 17:56:43,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:56:43,525 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2020-09-04 17:56:43,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 17:56:43,525 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 32 [2020-09-04 17:56:43,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:56:43,528 INFO L225 Difference]: With dead ends: 70 [2020-09-04 17:56:43,528 INFO L226 Difference]: Without dead ends: 65 [2020-09-04 17:56:43,529 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=221, Invalid=901, Unknown=0, NotChecked=0, Total=1122 [2020-09-04 17:56:43,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-09-04 17:56:43,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 44. [2020-09-04 17:56:43,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-09-04 17:56:43,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2020-09-04 17:56:43,553 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 32 [2020-09-04 17:56:43,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:56:43,555 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2020-09-04 17:56:43,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-04 17:56:43,555 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2020-09-04 17:56:43,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-09-04 17:56:43,565 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:56:43,565 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:56:43,566 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 17:56:43,566 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:56:43,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:56:43,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1007147513, now seen corresponding path program 2 times [2020-09-04 17:56:43,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:56:43,567 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [272150838] [2020-09-04 17:56:43,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:56:43,573 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:56:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:44,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:56:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:44,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:56:44,087 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [272150838] [2020-09-04 17:56:44,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:56:44,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 17:56:44,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975486508] [2020-09-04 17:56:44,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 17:56:44,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:56:44,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 17:56:44,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-09-04 17:56:44,090 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 12 states. [2020-09-04 17:56:44,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:56:44,780 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2020-09-04 17:56:44,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 17:56:44,781 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2020-09-04 17:56:44,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:56:44,783 INFO L225 Difference]: With dead ends: 69 [2020-09-04 17:56:44,783 INFO L226 Difference]: Without dead ends: 53 [2020-09-04 17:56:44,785 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2020-09-04 17:56:44,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-09-04 17:56:44,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2020-09-04 17:56:44,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-09-04 17:56:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2020-09-04 17:56:44,803 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 36 [2020-09-04 17:56:44,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:56:44,804 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2020-09-04 17:56:44,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 17:56:44,804 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2020-09-04 17:56:44,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-09-04 17:56:44,805 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:56:44,805 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:56:44,805 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 17:56:44,806 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:56:44,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:56:44,806 INFO L82 PathProgramCache]: Analyzing trace with hash 715815570, now seen corresponding path program 1 times [2020-09-04 17:56:44,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:56:44,807 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [170139774] [2020-09-04 17:56:44,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:56:44,820 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:56:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:44,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:56:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:44,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:56:44,931 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [170139774] [2020-09-04 17:56:44,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:56:44,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 17:56:44,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901390050] [2020-09-04 17:56:44,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 17:56:44,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:56:44,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 17:56:44,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 17:56:44,938 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2020-09-04 17:56:45,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:56:45,167 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2020-09-04 17:56:45,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 17:56:45,168 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2020-09-04 17:56:45,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:56:45,170 INFO L225 Difference]: With dead ends: 68 [2020-09-04 17:56:45,171 INFO L226 Difference]: Without dead ends: 52 [2020-09-04 17:56:45,172 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-09-04 17:56:45,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-09-04 17:56:45,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2020-09-04 17:56:45,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-09-04 17:56:45,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2020-09-04 17:56:45,208 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 37 [2020-09-04 17:56:45,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:56:45,212 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2020-09-04 17:56:45,213 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 17:56:45,213 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-09-04 17:56:45,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-09-04 17:56:45,213 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:56:45,214 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:56:45,214 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 17:56:45,214 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:56:45,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:56:45,215 INFO L82 PathProgramCache]: Analyzing trace with hash -676848915, now seen corresponding path program 1 times [2020-09-04 17:56:45,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:56:45,216 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1539058710] [2020-09-04 17:56:45,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:56:45,231 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:56:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:45,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:56:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:56:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:56:45,723 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1539058710] [2020-09-04 17:56:45,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:56:45,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 17:56:45,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482235655] [2020-09-04 17:56:45,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 17:56:45,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:56:45,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 17:56:45,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-09-04 17:56:45,725 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 10 states. [2020-09-04 17:57:04,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:57:04,525 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2020-09-04 17:57:04,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 17:57:04,526 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2020-09-04 17:57:04,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:57:04,527 INFO L225 Difference]: With dead ends: 67 [2020-09-04 17:57:04,527 INFO L226 Difference]: Without dead ends: 51 [2020-09-04 17:57:04,529 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2020-09-04 17:57:04,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-09-04 17:57:04,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2020-09-04 17:57:04,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-09-04 17:57:04,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2020-09-04 17:57:04,551 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 38 [2020-09-04 17:57:04,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:57:04,552 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2020-09-04 17:57:04,552 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 17:57:04,552 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2020-09-04 17:57:04,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-09-04 17:57:04,553 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:57:04,553 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:57:04,553 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 17:57:04,554 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:57:04,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:57:04,554 INFO L82 PathProgramCache]: Analyzing trace with hash 130279800, now seen corresponding path program 1 times [2020-09-04 17:57:04,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:57:04,555 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [918531094] [2020-09-04 17:57:04,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:57:04,562 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:57:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:57:05,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:57:05,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:57:05,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:57:05,965 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [918531094] [2020-09-04 17:57:05,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:57:05,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-09-04 17:57:05,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153994494] [2020-09-04 17:57:05,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-04 17:57:05,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:57:05,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-04 17:57:05,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2020-09-04 17:57:05,968 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 22 states. [2020-09-04 17:57:06,897 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2020-09-04 17:57:10,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:57:10,425 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2020-09-04 17:57:10,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-04 17:57:10,426 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 39 [2020-09-04 17:57:10,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:57:10,427 INFO L225 Difference]: With dead ends: 91 [2020-09-04 17:57:10,427 INFO L226 Difference]: Without dead ends: 72 [2020-09-04 17:57:10,429 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=244, Invalid=1162, Unknown=0, NotChecked=0, Total=1406 [2020-09-04 17:57:10,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-09-04 17:57:10,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 51. [2020-09-04 17:57:10,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-09-04 17:57:10,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2020-09-04 17:57:10,453 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 39 [2020-09-04 17:57:10,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:57:10,453 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2020-09-04 17:57:10,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-04 17:57:10,454 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2020-09-04 17:57:10,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-09-04 17:57:10,454 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:57:10,455 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:57:10,455 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 17:57:10,455 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:57:10,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:57:10,456 INFO L82 PathProgramCache]: Analyzing trace with hash -2144322658, now seen corresponding path program 2 times [2020-09-04 17:57:10,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:57:10,456 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1044509580] [2020-09-04 17:57:10,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:57:10,463 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:57:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:57:11,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:57:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:57:11,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:57:11,167 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1044509580] [2020-09-04 17:57:11,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:57:11,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 17:57:11,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795063957] [2020-09-04 17:57:11,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 17:57:11,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:57:11,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 17:57:11,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-09-04 17:57:11,169 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 13 states. [2020-09-04 17:57:12,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:57:12,123 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2020-09-04 17:57:12,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 17:57:12,124 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2020-09-04 17:57:12,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:57:12,125 INFO L225 Difference]: With dead ends: 76 [2020-09-04 17:57:12,126 INFO L226 Difference]: Without dead ends: 60 [2020-09-04 17:57:12,127 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2020-09-04 17:57:12,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-09-04 17:57:12,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2020-09-04 17:57:12,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-09-04 17:57:12,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2020-09-04 17:57:12,163 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 43 [2020-09-04 17:57:12,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:57:12,165 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2020-09-04 17:57:12,165 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 17:57:12,166 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2020-09-04 17:57:12,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-09-04 17:57:12,173 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:57:12,173 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:57:12,174 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 17:57:12,174 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:57:12,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:57:12,175 INFO L82 PathProgramCache]: Analyzing trace with hash -176875557, now seen corresponding path program 1 times [2020-09-04 17:57:12,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:57:12,175 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1947175886] [2020-09-04 17:57:12,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:57:12,187 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:57:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:57:12,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:57:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:57:12,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:57:12,329 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1947175886] [2020-09-04 17:57:12,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:57:12,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 17:57:12,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177291047] [2020-09-04 17:57:12,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 17:57:12,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:57:12,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 17:57:12,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 17:57:12,337 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 7 states. [2020-09-04 17:57:12,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:57:12,674 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2020-09-04 17:57:12,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 17:57:12,675 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2020-09-04 17:57:12,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:57:12,676 INFO L225 Difference]: With dead ends: 72 [2020-09-04 17:57:12,676 INFO L226 Difference]: Without dead ends: 56 [2020-09-04 17:57:12,677 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-09-04 17:57:12,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-09-04 17:57:12,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2020-09-04 17:57:12,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-09-04 17:57:12,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2020-09-04 17:57:12,701 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 44 [2020-09-04 17:57:12,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:57:12,702 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2020-09-04 17:57:12,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 17:57:12,702 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2020-09-04 17:57:12,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-09-04 17:57:12,703 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:57:12,703 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:57:12,704 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 17:57:12,704 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:57:12,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:57:12,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1714497220, now seen corresponding path program 1 times [2020-09-04 17:57:12,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:57:12,705 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1873096371] [2020-09-04 17:57:12,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:57:12,716 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:57:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:57:13,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:57:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:57:13,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:57:13,713 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1873096371] [2020-09-04 17:57:13,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:57:13,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-09-04 17:57:13,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629865183] [2020-09-04 17:57:13,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 17:57:13,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:57:13,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 17:57:13,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2020-09-04 17:57:13,715 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 19 states. [2020-09-04 17:57:15,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:57:15,108 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-09-04 17:57:15,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 17:57:15,109 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2020-09-04 17:57:15,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:57:15,110 INFO L225 Difference]: With dead ends: 55 [2020-09-04 17:57:15,110 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 17:57:15,114 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=189, Invalid=1001, Unknown=0, NotChecked=0, Total=1190 [2020-09-04 17:57:15,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 17:57:15,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 17:57:15,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 17:57:15,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 17:57:15,115 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2020-09-04 17:57:15,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:57:15,116 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 17:57:15,116 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 17:57:15,116 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 17:57:15,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 17:57:15,117 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 17:57:15,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 17:57:15,241 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 102 [2020-09-04 17:57:15,390 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 105 [2020-09-04 17:57:15,532 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 99 [2020-09-04 17:57:15,702 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 112 [2020-09-04 17:57:16,566 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 136 [2020-09-04 17:57:16,961 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 43 [2020-09-04 17:57:17,373 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 29 [2020-09-04 17:57:17,567 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2020-09-04 17:57:17,883 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 29 [2020-09-04 17:57:18,068 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2020-09-04 17:57:18,190 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 29 [2020-09-04 17:57:18,666 WARN L193 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 47 [2020-09-04 17:57:18,793 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 29 [2020-09-04 17:57:19,158 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 43 [2020-09-04 17:57:19,164 INFO L264 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2020-09-04 17:57:19,164 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~SIZE~0 |old(~SIZE~0)|) [2020-09-04 17:57:19,164 INFO L264 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2020-09-04 17:57:19,165 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 17:57:19,165 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2020-09-04 17:57:19,165 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 17:57:19,165 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 17:57:19,166 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-09-04 17:57:19,166 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-09-04 17:57:19,166 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-09-04 17:57:19,166 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-09-04 17:57:19,166 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-09-04 17:57:19,167 INFO L264 CegarLoopResult]: At program point L27(lines 27 30) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0))) (and (<= main_~l~0 .cse0) (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~l~0 2) (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~n~0 main_~v4~0)) (<= .cse0 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-09-04 17:57:19,167 INFO L264 CegarLoopResult]: At program point L27-2(lines 21 30) the Hoare annotation is: (let ((.cse1 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0)) (.cse5 (+ main_~l~0 1))) (let ((.cse3 (* 4294967296 (div main_~n~0 4294967296))) (.cse4 (<= .cse1 .cse5))) (or (not (<= ~SIZE~0 20000001)) (let ((.cse2 (+ main_~i~0 main_~j~0 main_~k~0)) (.cse0 (+ main_~i~0 main_~k~0))) (and (<= 0 .cse0) (<= 1 .cse1) (<= main_~i~0 0) (<= main_~l~0 .cse2) (<= 0 main_~i~0) (<= (+ .cse3 main_~l~0 2) (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0 main_~n~0)) (<= .cse2 main_~l~0) (<= main_~l~0 0) .cse4 (<= .cse0 0))) (not (<= 20000001 ~SIZE~0)) (and (<= (+ .cse3 main_~l~0 3) (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~n~0 main_~v4~0)) .cse4 (<= .cse5 .cse1))))) [2020-09-04 17:57:19,167 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 14 35) the Hoare annotation is: true [2020-09-04 17:57:19,167 INFO L264 CegarLoopResult]: At program point L23(lines 23 30) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0))) (and (<= main_~l~0 .cse0) (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~l~0 2) (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~n~0 main_~v4~0)) (<= .cse0 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-09-04 17:57:19,167 INFO L264 CegarLoopResult]: At program point L19-2(lines 19 32) the Hoare annotation is: (let ((.cse9 (+ main_~i~0 main_~k~0)) (.cse8 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0))) (let ((.cse3 (<= .cse8 main_~l~0)) (.cse0 (<= 0 .cse9)) (.cse2 (<= main_~l~0 .cse8)) (.cse4 (<= main_~i~0 0)) (.cse5 (<= 0 main_~i~0)) (.cse1 (+ main_~i~0 main_~j~0 main_~k~0)) (.cse6 (<= .cse9 0))) (or (and .cse0 (<= 0 .cse1) .cse2 .cse3 .cse4 (<= 1 main_~l~0) (<= .cse1 0) .cse5 .cse6 (<= (* 4294967295 main_~l~0) 4294967295)) (not (<= ~SIZE~0 20000001)) (and .cse2 (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~l~0 2) (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~n~0 main_~v4~0)) .cse3) (not (<= 20000001 ~SIZE~0)) (let ((.cse7 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0))) (and .cse0 .cse2 .cse4 (<= main_~l~0 .cse1) (<= 0 .cse7) (<= .cse8 0) .cse5 (<= .cse7 main_~l~0) (<= .cse1 main_~l~0) .cse6))))) [2020-09-04 17:57:19,167 INFO L264 CegarLoopResult]: At program point L19-3(lines 19 32) the Hoare annotation is: (let ((.cse2 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0))) (or (let ((.cse1 (+ main_~l~0 (* 4294967296 (div .cse2 4294967296)))) (.cse0 (* 4294967296 (div main_~l~0 4294967296)))) (and (<= main_~i~0 0) (<= (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0 .cse0) .cse1) (<= 0 main_~i~0) (< .cse1 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0 .cse0 1)))) (not (<= ~SIZE~0 20000001)) (and (<= main_~l~0 .cse2) (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~l~0 2) (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~n~0 main_~v4~0)) (<= .cse2 main_~l~0)) (not (<= 20000001 ~SIZE~0)))) [2020-09-04 17:57:19,168 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-09-04 17:57:19,168 INFO L264 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (and (<= main_~i~0 0) (<= 0 main_~i~0)) (not (<= 20000001 ~SIZE~0))) [2020-09-04 17:57:19,168 INFO L264 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse0 (+ main_~i~0 main_~k~0))) (and (<= 0 .cse0) (<= main_~i~0 0) (<= 0 main_~i~0) (<= .cse0 0))) (not (<= 20000001 ~SIZE~0))) [2020-09-04 17:57:19,168 INFO L264 CegarLoopResult]: At program point L15-3(line 15) the Hoare annotation is: (or (let ((.cse1 (+ main_~i~0 main_~j~0 main_~k~0)) (.cse0 (+ main_~i~0 main_~k~0))) (and (<= 0 .cse0) (<= 0 .cse1) (<= main_~i~0 0) (<= .cse1 0) (<= 0 main_~i~0) (<= .cse0 0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-09-04 17:57:19,168 INFO L264 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0))) (and (<= main_~l~0 .cse0) (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~l~0 2) (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~n~0 main_~v4~0)) (<= .cse0 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-09-04 17:57:19,168 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0))) (and (<= main_~l~0 .cse0) (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~l~0 2) (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~n~0 main_~v4~0)) (<= .cse0 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-09-04 17:57:19,169 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (or (let ((.cse1 (+ main_~i~0 main_~j~0 main_~k~0)) (.cse0 (+ main_~i~0 main_~k~0))) (and (<= 0 .cse0) (<= main_~i~0 0) (<= main_~l~0 .cse1) (<= 0 main_~i~0) (<= .cse1 main_~l~0) (<= main_~l~0 0) (<= .cse0 0) (<= 0 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-09-04 17:57:19,169 INFO L264 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (or (let ((.cse1 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0)) (.cse2 (+ main_~i~0 main_~j~0 main_~k~0)) (.cse0 (+ main_~i~0 main_~k~0))) (and (<= 0 .cse0) (<= main_~i~0 0) (<= 0 .cse1) (<= main_~l~0 .cse2) (<= 0 main_~i~0) (<= .cse1 main_~l~0) (<= .cse2 main_~l~0) (<= main_~l~0 0) (<= .cse0 0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-09-04 17:57:19,169 INFO L271 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-09-04 17:57:19,169 INFO L264 CegarLoopResult]: At program point L25(lines 25 30) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0))) (and (<= main_~l~0 .cse0) (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~l~0 2) (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~n~0 main_~v4~0)) (<= .cse0 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-09-04 17:57:19,169 INFO L264 CegarLoopResult]: At program point L21(lines 21 30) the Hoare annotation is: (let ((.cse4 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0))) (let ((.cse1 (<= main_~l~0 .cse4)) (.cse5 (* 4294967296 (div main_~n~0 4294967296)))) (or (let ((.cse3 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0)) (.cse2 (+ main_~i~0 main_~j~0 main_~k~0)) (.cse0 (+ main_~i~0 main_~k~0))) (and (<= 0 .cse0) .cse1 (<= main_~i~0 0) (<= main_~l~0 .cse2) (<= 0 .cse3) (<= .cse4 0) (<= 0 main_~i~0) (<= .cse3 main_~l~0) (<= (+ .cse5 main_~l~0 1) (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0 main_~n~0)) (<= .cse2 main_~l~0) (<= .cse0 0))) (not (<= ~SIZE~0 20000001)) (and .cse1 (<= (+ .cse5 main_~l~0 2) (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~n~0 main_~v4~0)) (<= .cse4 main_~l~0)) (not (<= 20000001 ~SIZE~0))))) [2020-09-04 17:57:19,169 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse1 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0)) (.cse3 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0)) (.cse2 (+ main_~i~0 main_~j~0 main_~k~0)) (.cse0 (+ main_~i~0 main_~k~0))) (and (<= 0 .cse0) (<= main_~l~0 .cse1) (<= main_~i~0 0) (<= main_~l~0 .cse2) (<= 0 .cse3) (<= .cse1 0) (<= 0 main_~i~0) (<= .cse3 main_~l~0) (<= .cse2 main_~l~0) (<= .cse0 0)))) [2020-09-04 17:57:19,170 INFO L264 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse1 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0)) (.cse3 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0)) (.cse2 (+ main_~i~0 main_~j~0 main_~k~0)) (.cse0 (+ main_~i~0 main_~k~0))) (and (<= 0 .cse0) (<= main_~l~0 .cse1) (<= main_~i~0 0) (<= main_~l~0 .cse2) (<= 0 .cse3) (<= .cse1 0) (<= 0 main_~i~0) (<= .cse3 main_~l~0) (<= .cse2 main_~l~0) (<= .cse0 0)))) [2020-09-04 17:57:19,170 INFO L264 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse1 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0)) (.cse3 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0)) (.cse2 (+ main_~i~0 main_~j~0 main_~k~0)) (.cse0 (+ main_~i~0 main_~k~0))) (and (<= 0 .cse0) (<= main_~l~0 .cse1) (<= main_~i~0 0) (<= main_~l~0 .cse2) (<= 0 .cse3) (<= .cse1 0) (<= 0 main_~i~0) (<= .cse3 main_~l~0) (<= .cse2 main_~l~0) (<= .cse0 0)))) [2020-09-04 17:57:19,170 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 14 35) the Hoare annotation is: true [2020-09-04 17:57:19,170 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0))) (and (<= main_~l~0 .cse0) (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~l~0 2) (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~n~0 main_~v4~0)) (<= .cse0 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-09-04 17:57:19,170 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 14 35) the Hoare annotation is: true [2020-09-04 17:57:19,171 INFO L264 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0))) (and (<= main_~l~0 .cse0) (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~l~0 2) (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~n~0 main_~v4~0)) (<= .cse0 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-09-04 17:57:19,171 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (let ((.cse4 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0))) (let ((.cse1 (<= main_~l~0 .cse4)) (.cse5 (* 4294967296 (div main_~n~0 4294967296)))) (or (let ((.cse3 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0)) (.cse2 (+ main_~i~0 main_~j~0 main_~k~0)) (.cse0 (+ main_~i~0 main_~k~0))) (and (<= 0 .cse0) .cse1 (<= main_~i~0 0) (<= main_~l~0 .cse2) (<= 0 .cse3) (<= .cse4 0) (<= 0 main_~i~0) (<= .cse3 main_~l~0) (<= (+ .cse5 main_~l~0 1) (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0 main_~n~0)) (<= .cse2 main_~l~0) (<= .cse0 0))) (not (<= ~SIZE~0 20000001)) (and .cse1 (<= (+ .cse5 main_~l~0 2) (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~n~0 main_~v4~0)) (<= .cse4 main_~l~0)) (not (<= 20000001 ~SIZE~0))))) [2020-09-04 17:57:19,171 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse1 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0)) (.cse3 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0)) (.cse2 (+ main_~i~0 main_~j~0 main_~k~0)) (.cse0 (+ main_~i~0 main_~k~0))) (and (<= 0 .cse0) (<= main_~l~0 .cse1) (<= main_~i~0 0) (<= main_~l~0 .cse2) (<= 0 .cse3) (<= .cse1 0) (<= 0 main_~i~0) (<= .cse3 main_~l~0) (<= .cse2 main_~l~0) (<= .cse0 0)))) [2020-09-04 17:57:19,171 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-09-04 17:57:19,171 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-09-04 17:57:19,171 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: true [2020-09-04 17:57:19,172 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-09-04 17:57:19,172 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-09-04 17:57:19,172 INFO L271 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: true [2020-09-04 17:57:19,172 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-09-04 17:57:19,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 05:57:19 BoogieIcfgContainer [2020-09-04 17:57:19,200 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 17:57:19,202 INFO L168 Benchmark]: Toolchain (without parser) took 46746.40 ms. Allocated memory was 138.4 MB in the beginning and 359.7 MB in the end (delta: 221.2 MB). Free memory was 101.9 MB in the beginning and 305.8 MB in the end (delta: -204.0 MB). Peak memory consumption was 230.6 MB. Max. memory is 7.1 GB. [2020-09-04 17:57:19,203 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-04 17:57:19,204 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.14 ms. Allocated memory is still 138.4 MB. Free memory was 101.7 MB in the beginning and 91.8 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-09-04 17:57:19,205 INFO L168 Benchmark]: Boogie Preprocessor took 151.71 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 91.8 MB in the beginning and 181.6 MB in the end (delta: -89.8 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-09-04 17:57:19,205 INFO L168 Benchmark]: RCFGBuilder took 420.48 ms. Allocated memory is still 202.9 MB. Free memory was 181.6 MB in the beginning and 166.1 MB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. [2020-09-04 17:57:19,206 INFO L168 Benchmark]: TraceAbstraction took 45816.99 ms. Allocated memory was 202.9 MB in the beginning and 359.7 MB in the end (delta: 156.8 MB). Free memory was 166.1 MB in the beginning and 305.8 MB in the end (delta: -139.8 MB). Peak memory consumption was 230.3 MB. Max. memory is 7.1 GB. [2020-09-04 17:57:19,210 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 350.14 ms. Allocated memory is still 138.4 MB. Free memory was 101.7 MB in the beginning and 91.8 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 151.71 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 91.8 MB in the beginning and 181.6 MB in the end (delta: -89.8 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 420.48 ms. Allocated memory is still 202.9 MB. Free memory was 181.6 MB in the beginning and 166.1 MB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 45816.99 ms. Allocated memory was 202.9 MB in the beginning and 359.7 MB in the end (delta: 156.8 MB). Free memory was 166.1 MB in the beginning and 305.8 MB in the end (delta: -139.8 MB). Peak memory consumption was 230.3 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: 19]: Loop Invariant Derived loop invariant: ((((((((((((0 <= i + k && 0 <= i + j + k) && l <= i + j + k + v3 + v4) && i + j + k + v3 + v4 <= l) && i <= 0) && 1 <= l) && i + j + k <= 0) && 0 <= i) && i + k <= 0) && 4294967295 * l <= 4294967295) || !(SIZE <= 20000001)) || ((l <= i + j + k + v3 + v4 && 4294967296 * (n / 4294967296) + l + 2 <= i + j + k + v3 + n + v4) && i + j + k + v3 + v4 <= l)) || !(20000001 <= SIZE)) || (((((((((0 <= i + k && l <= i + j + k + v3 + v4) && i <= 0) && l <= i + j + k) && 0 <= i + j + k + v3) && i + j + k + v3 + v4 <= 0) && 0 <= i) && i + j + k + v3 <= l) && i + j + k <= l) && i + k <= 0) - ProcedureContractResult [Line: 14]: 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, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 41.5s, OverallIterations: 14, TraceHistogramMax: 4, AutomataDifference: 32.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 351 SDtfs, 2168 SDslu, 467 SDs, 0 SdLazy, 3056 SolverSat, 309 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 23.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 13.1s 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: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 169 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 40 LocationsWithAnnotation, 130 PreInvPairs, 204 NumberOfFragments, 1393 HoareAnnotationTreeSize, 130 FomulaSimplifications, 3309793 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 40 FomulaSimplificationsInter, 3257 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...