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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench/egcd.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 12:25:15,781 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 12:25:15,783 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 12:25:15,795 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 12:25:15,795 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 12:25:15,796 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 12:25:15,797 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 12:25:15,799 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 12:25:15,801 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 12:25:15,801 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 12:25:15,802 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 12:25:15,803 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 12:25:15,804 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 12:25:15,805 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 12:25:15,805 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 12:25:15,807 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 12:25:15,807 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 12:25:15,808 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 12:25:15,810 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 12:25:15,812 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 12:25:15,813 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 12:25:15,814 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 12:25:15,815 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 12:25:15,816 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 12:25:15,818 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 12:25:15,818 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 12:25:15,819 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 12:25:15,819 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 12:25:15,820 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 12:25:15,821 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 12:25:15,821 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 12:25:15,822 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 12:25:15,822 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 12:25:15,823 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 12:25:15,824 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 12:25:15,824 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 12:25:15,825 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 12:25:15,825 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 12:25:15,826 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 12:25:15,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 12:25:15,827 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 12:25:15,828 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-05 12:25:15,852 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 12:25:15,854 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 12:25:15,855 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 12:25:15,856 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 12:25:15,856 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 12:25:15,856 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 12:25:15,857 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 12:25:15,857 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 12:25:15,857 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 12:25:15,857 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 12:25:15,858 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 12:25:15,858 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 12:25:15,858 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 12:25:15,858 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 12:25:15,858 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 12:25:15,858 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 12:25:15,859 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 12:25:15,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 12:25:15,860 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 12:25:15,860 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 12:25:15,861 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 12:25:15,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 12:25:15,861 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 12:25:15,861 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 12:25:15,862 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 12:25:15,862 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 12:25:15,862 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 12:25:15,862 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 12:25:15,862 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 12:25:15,911 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 12:25:15,922 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 12:25:15,926 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 12:25:15,927 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 12:25:15,927 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 12:25:15,928 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/egcd.c [2019-09-05 12:25:15,982 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcbd5680d/ae30976d2f3f4d5f83da4ac7c9fd1f07/FLAGe94fdbd57 [2019-09-05 12:25:16,402 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 12:25:16,403 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/egcd.c [2019-09-05 12:25:16,410 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcbd5680d/ae30976d2f3f4d5f83da4ac7c9fd1f07/FLAGe94fdbd57 [2019-09-05 12:25:16,800 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcbd5680d/ae30976d2f3f4d5f83da4ac7c9fd1f07 [2019-09-05 12:25:16,809 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 12:25:16,811 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 12:25:16,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 12:25:16,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 12:25:16,815 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 12:25:16,816 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:25:16" (1/1) ... [2019-09-05 12:25:16,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1514fdfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:25:16, skipping insertion in model container [2019-09-05 12:25:16,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:25:16" (1/1) ... [2019-09-05 12:25:16,826 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 12:25:16,844 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 12:25:17,036 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 12:25:17,040 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 12:25:17,062 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 12:25:17,076 INFO L192 MainTranslator]: Completed translation [2019-09-05 12:25:17,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:25:17 WrapperNode [2019-09-05 12:25:17,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 12:25:17,078 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 12:25:17,078 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 12:25:17,078 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 12:25:17,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:25:17" (1/1) ... [2019-09-05 12:25:17,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:25:17" (1/1) ... [2019-09-05 12:25:17,181 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:25:17" (1/1) ... [2019-09-05 12:25:17,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:25:17" (1/1) ... [2019-09-05 12:25:17,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:25:17" (1/1) ... [2019-09-05 12:25:17,190 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:25:17" (1/1) ... [2019-09-05 12:25:17,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:25:17" (1/1) ... [2019-09-05 12:25:17,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 12:25:17,194 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 12:25:17,194 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 12:25:17,194 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 12:25:17,195 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:25:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 12:25:17,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 12:25:17,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 12:25:17,242 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 12:25:17,243 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 12:25:17,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 12:25:17,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 12:25:17,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 12:25:17,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 12:25:17,244 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 12:25:17,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 12:25:17,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 12:25:17,431 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 12:25:17,431 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-05 12:25:17,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:25:17 BoogieIcfgContainer [2019-09-05 12:25:17,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 12:25:17,434 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 12:25:17,434 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 12:25:17,437 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 12:25:17,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 12:25:16" (1/3) ... [2019-09-05 12:25:17,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d424dcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:25:17, skipping insertion in model container [2019-09-05 12:25:17,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:25:17" (2/3) ... [2019-09-05 12:25:17,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d424dcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:25:17, skipping insertion in model container [2019-09-05 12:25:17,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:25:17" (3/3) ... [2019-09-05 12:25:17,440 INFO L109 eAbstractionObserver]: Analyzing ICFG egcd.c [2019-09-05 12:25:17,449 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 12:25:17,457 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 12:25:17,472 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 12:25:17,498 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 12:25:17,499 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 12:25:17,499 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 12:25:17,499 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 12:25:17,499 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 12:25:17,499 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 12:25:17,499 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 12:25:17,499 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 12:25:17,500 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 12:25:17,514 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-09-05 12:25:17,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 12:25:17,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:25:17,519 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:25:17,521 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:25:17,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:25:17,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1589353370, now seen corresponding path program 1 times [2019-09-05 12:25:17,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:25:17,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:25:17,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:25:17,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:25:17,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:25:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:25:17,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:25:17,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:25:17,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 12:25:17,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 12:25:17,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 12:25:17,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 12:25:17,656 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2019-09-05 12:25:17,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:25:17,686 INFO L93 Difference]: Finished difference Result 47 states and 74 transitions. [2019-09-05 12:25:17,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 12:25:17,687 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-05 12:25:17,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:25:17,695 INFO L225 Difference]: With dead ends: 47 [2019-09-05 12:25:17,695 INFO L226 Difference]: Without dead ends: 21 [2019-09-05 12:25:17,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 12:25:17,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-05 12:25:17,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-05 12:25:17,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-05 12:25:17,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-09-05 12:25:17,740 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 10 [2019-09-05 12:25:17,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:25:17,741 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-09-05 12:25:17,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 12:25:17,741 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2019-09-05 12:25:17,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 12:25:17,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:25:17,742 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:25:17,742 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:25:17,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:25:17,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1587685074, now seen corresponding path program 1 times [2019-09-05 12:25:17,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:25:17,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:25:17,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:25:17,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:25:17,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:25:17,753 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 12:25:17,754 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 12:25:17,754 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-05 12:25:17,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 12:25:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:25:17,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-05 12:25:17,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:25:17,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:25:17,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:25:17,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 12:25:17,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 12:25:17,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 12:25:17,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 12:25:17,980 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand 5 states. [2019-09-05 12:25:18,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:25:18,062 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2019-09-05 12:25:18,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 12:25:18,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-09-05 12:25:18,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:25:18,064 INFO L225 Difference]: With dead ends: 37 [2019-09-05 12:25:18,064 INFO L226 Difference]: Without dead ends: 35 [2019-09-05 12:25:18,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-05 12:25:18,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-05 12:25:18,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-09-05 12:25:18,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-05 12:25:18,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2019-09-05 12:25:18,081 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 10 [2019-09-05 12:25:18,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:25:18,082 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2019-09-05 12:25:18,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 12:25:18,082 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2019-09-05 12:25:18,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-05 12:25:18,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:25:18,083 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:25:18,084 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:25:18,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:25:18,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1592529048, now seen corresponding path program 1 times [2019-09-05 12:25:18,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:25:18,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:25:18,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:25:18,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:25:18,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:25:18,093 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 12:25:18,093 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 12:25:18,093 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-05 12:25:18,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:25:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:25:18,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 12:25:18,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:25:18,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:25:18,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:25:18,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 12:25:18,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 12:25:18,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 12:25:18,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 12:25:18,191 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 5 states. [2019-09-05 12:25:18,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:25:18,283 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2019-09-05 12:25:18,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 12:25:18,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-05 12:25:18,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:25:18,285 INFO L225 Difference]: With dead ends: 41 [2019-09-05 12:25:18,285 INFO L226 Difference]: Without dead ends: 39 [2019-09-05 12:25:18,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-05 12:25:18,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-05 12:25:18,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-09-05 12:25:18,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-05 12:25:18,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2019-09-05 12:25:18,297 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 15 [2019-09-05 12:25:18,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:25:18,297 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2019-09-05 12:25:18,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 12:25:18,298 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2019-09-05 12:25:18,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 12:25:18,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:25:18,299 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:25:18,299 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:25:18,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:25:18,299 INFO L82 PathProgramCache]: Analyzing trace with hash 2040988462, now seen corresponding path program 1 times [2019-09-05 12:25:18,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:25:18,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:25:18,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:25:18,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:25:18,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:25:18,307 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 12:25:18,307 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 12:25:18,307 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-05 12:25:18,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 12:25:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:25:18,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-05 12:25:18,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:25:18,419 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 12:25:18,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:25:18,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 12:25:18,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 12:25:18,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 12:25:18,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 12:25:18,428 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand 5 states. [2019-09-05 12:25:18,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:25:18,534 INFO L93 Difference]: Finished difference Result 63 states and 91 transitions. [2019-09-05 12:25:18,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 12:25:18,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-05 12:25:18,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:25:18,540 INFO L225 Difference]: With dead ends: 63 [2019-09-05 12:25:18,540 INFO L226 Difference]: Without dead ends: 59 [2019-09-05 12:25:18,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-05 12:25:18,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-05 12:25:18,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-09-05 12:25:18,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-05 12:25:18,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 84 transitions. [2019-09-05 12:25:18,560 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 84 transitions. Word has length 20 [2019-09-05 12:25:18,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:25:18,560 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 84 transitions. [2019-09-05 12:25:18,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 12:25:18,561 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 84 transitions. [2019-09-05 12:25:18,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-05 12:25:18,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:25:18,562 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:25:18,562 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:25:18,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:25:18,563 INFO L82 PathProgramCache]: Analyzing trace with hash 113727669, now seen corresponding path program 1 times [2019-09-05 12:25:18,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:25:18,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:25:18,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:25:18,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:25:18,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:25:18,578 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 12:25:18,578 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 12:25:18,581 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 12:25:18,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:25:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:25:18,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-05 12:25:18,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:25:18,642 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-05 12:25:18,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:25:18,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 12:25:18,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 12:25:18,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 12:25:18,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 12:25:18,647 INFO L87 Difference]: Start difference. First operand 59 states and 84 transitions. Second operand 5 states. [2019-09-05 12:25:18,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:25:18,736 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2019-09-05 12:25:18,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 12:25:18,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-09-05 12:25:18,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:25:18,738 INFO L225 Difference]: With dead ends: 65 [2019-09-05 12:25:18,739 INFO L226 Difference]: Without dead ends: 63 [2019-09-05 12:25:18,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-05 12:25:18,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-05 12:25:18,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-09-05 12:25:18,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-05 12:25:18,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2019-09-05 12:25:18,765 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 26 [2019-09-05 12:25:18,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:25:18,766 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2019-09-05 12:25:18,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 12:25:18,768 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2019-09-05 12:25:18,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-05 12:25:18,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:25:18,769 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:25:18,770 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:25:18,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:25:18,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1597054094, now seen corresponding path program 1 times [2019-09-05 12:25:18,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:25:18,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:25:18,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:25:18,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:25:18,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:25:18,786 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 12:25:18,787 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 12:25:18,787 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-05 12:25:18,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 12:25:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:25:18,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 12:25:18,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:25:18,857 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:25:18,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:25:18,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 12:25:18,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 12:25:18,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 12:25:18,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 12:25:18,863 INFO L87 Difference]: Start difference. First operand 63 states and 87 transitions. Second operand 5 states. [2019-09-05 12:25:18,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:25:18,920 INFO L93 Difference]: Finished difference Result 73 states and 95 transitions. [2019-09-05 12:25:18,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 12:25:18,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-09-05 12:25:18,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:25:18,922 INFO L225 Difference]: With dead ends: 73 [2019-09-05 12:25:18,922 INFO L226 Difference]: Without dead ends: 70 [2019-09-05 12:25:18,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-05 12:25:18,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-05 12:25:18,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2019-09-05 12:25:18,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-05 12:25:18,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 88 transitions. [2019-09-05 12:25:18,935 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 88 transitions. Word has length 28 [2019-09-05 12:25:18,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:25:18,935 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 88 transitions. [2019-09-05 12:25:18,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 12:25:18,935 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 88 transitions. [2019-09-05 12:25:18,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-05 12:25:18,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:25:18,937 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:25:18,937 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:25:18,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:25:18,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1857063759, now seen corresponding path program 1 times [2019-09-05 12:25:18,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:25:18,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:25:18,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:25:18,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:25:18,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:25:18,943 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 12:25:18,944 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 12:25:18,944 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 12:25:18,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:25:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:25:18,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 12:25:18,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:25:19,025 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-05 12:25:19,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:25:19,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-05 12:25:19,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 12:25:19,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 12:25:19,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-05 12:25:19,030 INFO L87 Difference]: Start difference. First operand 68 states and 88 transitions. Second operand 6 states. [2019-09-05 12:25:19,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:25:19,144 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2019-09-05 12:25:19,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 12:25:19,144 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-09-05 12:25:19,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:25:19,146 INFO L225 Difference]: With dead ends: 81 [2019-09-05 12:25:19,146 INFO L226 Difference]: Without dead ends: 77 [2019-09-05 12:25:19,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-05 12:25:19,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-05 12:25:19,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-09-05 12:25:19,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-05 12:25:19,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2019-09-05 12:25:19,158 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 31 [2019-09-05 12:25:19,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:25:19,158 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2019-09-05 12:25:19,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 12:25:19,158 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2019-09-05 12:25:19,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-05 12:25:19,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:25:19,160 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:25:19,160 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:25:19,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:25:19,161 INFO L82 PathProgramCache]: Analyzing trace with hash -493170476, now seen corresponding path program 2 times [2019-09-05 12:25:19,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:25:19,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:25:19,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:25:19,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:25:19,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:25:19,167 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 12:25:19,167 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 12:25:19,167 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-05 12:25:19,189 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 12:25:19,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:25:19,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:25:19,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-05 12:25:19,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:25:19,301 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-05 12:25:19,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-05 12:25:19,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-09-05 12:25:19,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 12:25:19,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 12:25:19,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-05 12:25:19,306 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand 6 states. [2019-09-05 12:25:19,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:25:19,416 INFO L93 Difference]: Finished difference Result 108 states and 136 transitions. [2019-09-05 12:25:19,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 12:25:19,416 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-09-05 12:25:19,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:25:19,418 INFO L225 Difference]: With dead ends: 108 [2019-09-05 12:25:19,418 INFO L226 Difference]: Without dead ends: 106 [2019-09-05 12:25:19,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-05 12:25:19,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-05 12:25:19,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2019-09-05 12:25:19,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-05 12:25:19,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 124 transitions. [2019-09-05 12:25:19,439 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 124 transitions. Word has length 33 [2019-09-05 12:25:19,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:25:19,439 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 124 transitions. [2019-09-05 12:25:19,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 12:25:19,440 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 124 transitions. [2019-09-05 12:25:19,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-05 12:25:19,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:25:19,442 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:25:19,443 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:25:19,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:25:19,443 INFO L82 PathProgramCache]: Analyzing trace with hash -558447568, now seen corresponding path program 1 times [2019-09-05 12:25:19,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:25:19,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:25:19,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:25:19,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:25:19,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:25:19,457 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 12:25:19,457 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 12:25:19,458 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 12:25:19,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:25:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:25:19,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-05 12:25:19,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:25:19,570 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Exception during sending of exit command (exit): Stream closed [2019-09-05 12:25:19,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-05 12:25:19,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-09-05 12:25:19,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 12:25:19,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 12:25:19,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-05 12:25:19,576 INFO L87 Difference]: Start difference. First operand 100 states and 124 transitions. Second operand 6 states. [2019-09-05 12:25:19,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:25:19,706 INFO L93 Difference]: Finished difference Result 125 states and 164 transitions. [2019-09-05 12:25:19,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 12:25:19,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-09-05 12:25:19,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:25:19,709 INFO L225 Difference]: With dead ends: 125 [2019-09-05 12:25:19,709 INFO L226 Difference]: Without dead ends: 119 [2019-09-05 12:25:19,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-05 12:25:19,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-09-05 12:25:19,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-09-05 12:25:19,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-05 12:25:19,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 153 transitions. [2019-09-05 12:25:19,741 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 153 transitions. Word has length 38 [2019-09-05 12:25:19,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:25:19,743 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 153 transitions. [2019-09-05 12:25:19,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 12:25:19,743 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 153 transitions. [2019-09-05 12:25:19,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-05 12:25:19,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:25:19,748 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:25:19,748 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:25:19,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:25:19,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1383929332, now seen corresponding path program 1 times [2019-09-05 12:25:19,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:25:19,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:25:19,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:25:19,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:25:19,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:25:19,760 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 12:25:19,761 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 12:25:19,761 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 12:25:19,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:25:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:25:19,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-05 12:25:19,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:25:19,871 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-05 12:25:19,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-05 12:25:19,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-05 12:25:19,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 12:25:19,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 12:25:19,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-05 12:25:19,878 INFO L87 Difference]: Start difference. First operand 119 states and 153 transitions. Second operand 7 states. [2019-09-05 12:25:20,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:25:20,015 INFO L93 Difference]: Finished difference Result 141 states and 182 transitions. [2019-09-05 12:25:20,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 12:25:20,016 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2019-09-05 12:25:20,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:25:20,018 INFO L225 Difference]: With dead ends: 141 [2019-09-05 12:25:20,018 INFO L226 Difference]: Without dead ends: 139 [2019-09-05 12:25:20,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-05 12:25:20,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-05 12:25:20,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2019-09-05 12:25:20,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-05 12:25:20,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 174 transitions. [2019-09-05 12:25:20,040 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 174 transitions. Word has length 46 [2019-09-05 12:25:20,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:25:20,040 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 174 transitions. [2019-09-05 12:25:20,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 12:25:20,041 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 174 transitions. [2019-09-05 12:25:20,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-05 12:25:20,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:25:20,049 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:25:20,049 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:25:20,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:25:20,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1192657524, now seen corresponding path program 2 times [2019-09-05 12:25:20,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:25:20,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:25:20,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:25:20,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:25:20,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:25:20,060 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 12:25:20,060 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 12:25:20,061 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 12:25:20,075 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:25:20,094 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:25:20,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:25:20,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-05 12:25:20,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:25:20,174 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-05 12:25:20,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-05 12:25:20,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-05 12:25:20,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 12:25:20,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 12:25:20,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-05 12:25:20,179 INFO L87 Difference]: Start difference. First operand 135 states and 174 transitions. Second operand 7 states. [2019-09-05 12:25:20,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:25:20,318 INFO L93 Difference]: Finished difference Result 154 states and 198 transitions. [2019-09-05 12:25:20,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 12:25:20,320 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2019-09-05 12:25:20,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:25:20,322 INFO L225 Difference]: With dead ends: 154 [2019-09-05 12:25:20,322 INFO L226 Difference]: Without dead ends: 151 [2019-09-05 12:25:20,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-05 12:25:20,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-09-05 12:25:20,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2019-09-05 12:25:20,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-05 12:25:20,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 189 transitions. [2019-09-05 12:25:20,347 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 189 transitions. Word has length 46 [2019-09-05 12:25:20,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:25:20,350 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 189 transitions. [2019-09-05 12:25:20,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 12:25:20,350 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 189 transitions. [2019-09-05 12:25:20,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-05 12:25:20,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:25:20,351 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:25:20,352 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:25:20,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:25:20,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1196309741, now seen corresponding path program 1 times [2019-09-05 12:25:20,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:25:20,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:25:20,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:25:20,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:25:20,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:25:20,370 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 12:25:20,370 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 12:25:20,370 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-05 12:25:20,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 12:25:20,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:25:20,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-05 12:25:20,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:25:20,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:25:20,529 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-05 12:25:20,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-05 12:25:20,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-05 12:25:20,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 12:25:20,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 12:25:20,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-05 12:25:20,535 INFO L87 Difference]: Start difference. First operand 148 states and 189 transitions. Second operand 9 states. [2019-09-05 12:25:20,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:25:20,680 INFO L93 Difference]: Finished difference Result 161 states and 202 transitions. [2019-09-05 12:25:20,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 12:25:20,681 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2019-09-05 12:25:20,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:25:20,682 INFO L225 Difference]: With dead ends: 161 [2019-09-05 12:25:20,683 INFO L226 Difference]: Without dead ends: 157 [2019-09-05 12:25:20,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-05 12:25:20,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-05 12:25:20,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-09-05 12:25:20,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-09-05 12:25:20,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 194 transitions. [2019-09-05 12:25:20,699 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 194 transitions. Word has length 49 [2019-09-05 12:25:20,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:25:20,700 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 194 transitions. [2019-09-05 12:25:20,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 12:25:20,700 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 194 transitions. [2019-09-05 12:25:20,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-05 12:25:20,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:25:20,701 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:25:20,701 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:25:20,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:25:20,702 INFO L82 PathProgramCache]: Analyzing trace with hash 336099856, now seen corresponding path program 3 times [2019-09-05 12:25:20,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:25:20,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:25:20,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:25:20,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:25:20,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:25:20,707 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 12:25:20,707 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 12:25:20,707 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 12:25:20,722 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:25:20,740 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-05 12:25:20,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:25:20,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-05 12:25:20,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:25:20,841 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-05 12:25:20,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-05 12:25:20,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-05 12:25:20,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 12:25:20,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 12:25:20,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-05 12:25:20,846 INFO L87 Difference]: Start difference. First operand 157 states and 194 transitions. Second operand 7 states. [2019-09-05 12:25:21,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:25:21,019 INFO L93 Difference]: Finished difference Result 187 states and 233 transitions. [2019-09-05 12:25:21,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 12:25:21,020 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-09-05 12:25:21,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:25:21,022 INFO L225 Difference]: With dead ends: 187 [2019-09-05 12:25:21,022 INFO L226 Difference]: Without dead ends: 185 [2019-09-05 12:25:21,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-05 12:25:21,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-05 12:25:21,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 181. [2019-09-05 12:25:21,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-05 12:25:21,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 224 transitions. [2019-09-05 12:25:21,044 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 224 transitions. Word has length 51 [2019-09-05 12:25:21,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:25:21,044 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 224 transitions. [2019-09-05 12:25:21,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 12:25:21,045 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 224 transitions. [2019-09-05 12:25:21,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-05 12:25:21,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:25:21,046 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:25:21,046 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:25:21,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:25:21,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1722303250, now seen corresponding path program 3 times [2019-09-05 12:25:21,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:25:21,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:25:21,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:25:21,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:25:21,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:25:21,057 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 12:25:21,057 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 12:25:21,058 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 12:25:21,080 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:25:21,100 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-05 12:25:21,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:25:21,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-05 12:25:21,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:25:21,198 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-05 12:25:21,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-05 12:25:21,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-05 12:25:21,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 12:25:21,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 12:25:21,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-05 12:25:21,206 INFO L87 Difference]: Start difference. First operand 181 states and 224 transitions. Second operand 7 states. [2019-09-05 12:25:21,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:25:21,366 INFO L93 Difference]: Finished difference Result 210 states and 258 transitions. [2019-09-05 12:25:21,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 12:25:21,367 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-09-05 12:25:21,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:25:21,370 INFO L225 Difference]: With dead ends: 210 [2019-09-05 12:25:21,370 INFO L226 Difference]: Without dead ends: 208 [2019-09-05 12:25:21,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-05 12:25:21,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-05 12:25:21,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 194. [2019-09-05 12:25:21,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-05 12:25:21,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 235 transitions. [2019-09-05 12:25:21,393 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 235 transitions. Word has length 51 [2019-09-05 12:25:21,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:25:21,395 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 235 transitions. [2019-09-05 12:25:21,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 12:25:21,395 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 235 transitions. [2019-09-05 12:25:21,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-05 12:25:21,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:25:21,396 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:25:21,396 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:25:21,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:25:21,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1389199476, now seen corresponding path program 4 times [2019-09-05 12:25:21,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:25:21,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:25:21,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:25:21,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:25:21,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:25:21,405 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 12:25:21,405 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 12:25:21,405 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-05 12:25:21,429 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 12:25:21,447 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:25:21,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:25:21,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-05 12:25:21,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:25:23,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:25:23,708 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 27 proven. 48 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-05 12:25:23,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-05 12:25:23,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-09-05 12:25:23,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 12:25:23,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 12:25:23,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=84, Unknown=1, NotChecked=0, Total=110 [2019-09-05 12:25:23,712 INFO L87 Difference]: Start difference. First operand 194 states and 235 transitions. Second operand 11 states. [2019-09-05 12:25:25,785 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-05 12:25:26,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:25:26,149 INFO L93 Difference]: Finished difference Result 198 states and 238 transitions. [2019-09-05 12:25:26,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 12:25:26,149 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-09-05 12:25:26,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:25:26,150 INFO L225 Difference]: With dead ends: 198 [2019-09-05 12:25:26,150 INFO L226 Difference]: Without dead ends: 0 [2019-09-05 12:25:26,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=43, Invalid=138, Unknown=1, NotChecked=0, Total=182 [2019-09-05 12:25:26,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-05 12:25:26,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-05 12:25:26,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-05 12:25:26,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-05 12:25:26,156 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2019-09-05 12:25:26,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:25:26,156 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-05 12:25:26,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 12:25:26,156 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-05 12:25:26,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-05 12:25:26,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-05 12:25:35,853 WARN L188 SmtUtils]: Spent 9.45 s on a formula simplification. DAG size of input: 80 DAG size of output: 48 [2019-09-05 12:25:40,781 WARN L188 SmtUtils]: Spent 4.92 s on a formula simplification. DAG size of input: 80 DAG size of output: 48 [2019-09-05 12:25:53,410 WARN L188 SmtUtils]: Spent 12.63 s on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-09-05 12:26:09,863 WARN L188 SmtUtils]: Spent 16.45 s on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-09-05 12:26:11,965 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-05 12:26:11,968 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-05 12:26:11,968 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-05 12:26:11,969 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-05 12:26:11,969 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-05 12:26:11,969 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-05 12:26:11,969 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-05 12:26:11,969 INFO L443 ceAbstractionStarter]: For program point L31(lines 28 45) no Hoare annotation was computed. [2019-09-05 12:26:11,970 INFO L439 ceAbstractionStarter]: At program point L29(line 29) the Hoare annotation is: (let ((.cse3 (+ main_~r~0 main_~s~0)) (.cse4 (+ main_~p~0 main_~q~0))) (and (exists ((main_~p~0 Int) (main_~r~0 Int)) (let ((.cse2 (+ (* 2 main_~p~0) main_~q~0)) (.cse1 (+ (* 2 main_~r~0) main_~s~0))) (and (let ((.cse0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (= (+ (+ (* (- 1) main_~b~0) (* .cse0 (- 1))) (+ (* main_~y~0 .cse1) (* main_~x~0 .cse2))) .cse0)) (= 1 (+ (* (+ main_~r~0 main_~s~0) .cse2) (- (* .cse1 (+ main_~p~0 main_~q~0)))))))) (= main_~a~0 (+ (+ (* main_~y~0 .cse3) (* main_~x~0 .cse4)) (* (- 1) main_~b~0))) (<= 1 main_~x~0) (= 1 (+ (- (* main_~q~0 .cse3)) (* main_~s~0 .cse4))))) [2019-09-05 12:26:11,970 INFO L439 ceAbstractionStarter]: At program point L29-1(line 29) the Hoare annotation is: (let ((.cse3 (+ main_~r~0 main_~s~0)) (.cse4 (+ main_~p~0 main_~q~0))) (and (exists ((main_~p~0 Int) (main_~r~0 Int)) (let ((.cse2 (+ (* 2 main_~p~0) main_~q~0)) (.cse1 (+ (* 2 main_~r~0) main_~s~0))) (and (let ((.cse0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (= (+ (+ (* (- 1) main_~b~0) (* .cse0 (- 1))) (+ (* main_~y~0 .cse1) (* main_~x~0 .cse2))) .cse0)) (= 1 (+ (* (+ main_~r~0 main_~s~0) .cse2) (- (* .cse1 (+ main_~p~0 main_~q~0)))))))) (= main_~a~0 (+ (+ (* main_~y~0 .cse3) (* main_~x~0 .cse4)) (* (- 1) main_~b~0))) (<= 1 main_~x~0) (= 1 (+ (- (* main_~q~0 .cse3)) (* main_~s~0 .cse4))))) [2019-09-05 12:26:11,970 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 13 52) no Hoare annotation was computed. [2019-09-05 12:26:11,970 INFO L443 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2019-09-05 12:26:11,971 INFO L439 ceAbstractionStarter]: At program point L48(line 48) the Hoare annotation is: (let ((.cse1 (= main_~p~0 1)) (.cse2 (= main_~b~0 main_~y~0)) (.cse5 (= main_~q~0 0)) (.cse0 (= main_~s~0 1)) (.cse3 (= main_~b~0 main_~a~0)) (.cse4 (<= 1 main_~x~0)) (.cse6 (+ main_~p~0 main_~q~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (= main_~r~0 0) .cse0 .cse1 .cse2 .cse4 .cse5 (= main_~a~0 main_~x~0)) (and .cse0 (= 1 .cse6) .cse3 (= (+ main_~q~0 1) 0) .cse4 (= main_~y~0 (+ main_~x~0 main_~b~0)) (= (+ main_~r~0 (* 2 main_~s~0)) 1)) (let ((.cse10 (+ main_~r~0 main_~s~0))) (and (exists ((main_~p~0 Int) (main_~r~0 Int)) (let ((.cse9 (+ (* 2 main_~p~0) main_~q~0)) (.cse8 (+ (* 2 main_~r~0) main_~s~0))) (and (let ((.cse7 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (= (+ (+ (* (- 1) main_~b~0) (* .cse7 (- 1))) (+ (* main_~y~0 .cse8) (* main_~x~0 .cse9))) .cse7)) (= 1 (+ (* (+ main_~r~0 main_~s~0) .cse9) (- (* .cse8 (+ main_~p~0 main_~q~0)))))))) .cse4 (= main_~a~0 (+ (+ (* main_~y~0 .cse10) (* main_~x~0 .cse6)) (* (- 1) main_~b~0))) (= main_~b~0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (= 1 (+ (- (* main_~q~0 .cse10)) (* main_~s~0 .cse6))))))) [2019-09-05 12:26:11,971 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 13 52) no Hoare annotation was computed. [2019-09-05 12:26:11,971 INFO L443 ceAbstractionStarter]: For program point L36(lines 36 44) no Hoare annotation was computed. [2019-09-05 12:26:11,971 INFO L439 ceAbstractionStarter]: At program point L36-2(lines 28 45) the Hoare annotation is: (let ((.cse3 (+ main_~r~0 main_~s~0)) (.cse4 (+ main_~p~0 main_~q~0))) (and (exists ((main_~p~0 Int) (main_~r~0 Int)) (let ((.cse2 (+ (* 2 main_~p~0) main_~q~0)) (.cse1 (+ (* 2 main_~r~0) main_~s~0))) (and (let ((.cse0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (= (+ (+ (* (- 1) main_~b~0) (* .cse0 (- 1))) (+ (* main_~y~0 .cse1) (* main_~x~0 .cse2))) .cse0)) (= 1 (+ (* (+ main_~r~0 main_~s~0) .cse2) (- (* .cse1 (+ main_~p~0 main_~q~0)))))))) (= main_~a~0 (+ (+ (* main_~y~0 .cse3) (* main_~x~0 .cse4)) (* (- 1) main_~b~0))) (<= 1 main_~x~0) (= 1 (+ (- (* main_~q~0 .cse3)) (* main_~s~0 .cse4))))) [2019-09-05 12:26:11,971 INFO L439 ceAbstractionStarter]: At program point L30(line 30) the Hoare annotation is: (let ((.cse3 (+ main_~r~0 main_~s~0)) (.cse4 (+ main_~p~0 main_~q~0))) (and (exists ((main_~p~0 Int) (main_~r~0 Int)) (let ((.cse2 (+ (* 2 main_~p~0) main_~q~0)) (.cse1 (+ (* 2 main_~r~0) main_~s~0))) (and (let ((.cse0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (= (+ (+ (* (- 1) main_~b~0) (* .cse0 (- 1))) (+ (* main_~y~0 .cse1) (* main_~x~0 .cse2))) .cse0)) (= 1 (+ (* (+ main_~r~0 main_~s~0) .cse2) (- (* .cse1 (+ main_~p~0 main_~q~0)))))))) (= main_~a~0 (+ (+ (* main_~y~0 .cse3) (* main_~x~0 .cse4)) (* (- 1) main_~b~0))) (<= 1 main_~x~0) (= 1 (+ (- (* main_~q~0 .cse3)) (* main_~s~0 .cse4))))) [2019-09-05 12:26:11,971 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 13 52) the Hoare annotation is: true [2019-09-05 12:26:11,972 INFO L439 ceAbstractionStarter]: At program point L28-2(lines 28 45) the Hoare annotation is: (let ((.cse3 (+ main_~r~0 main_~s~0)) (.cse4 (+ main_~p~0 main_~q~0))) (and (exists ((main_~p~0 Int) (main_~r~0 Int)) (let ((.cse2 (+ (* 2 main_~p~0) main_~q~0)) (.cse1 (+ (* 2 main_~r~0) main_~s~0))) (and (let ((.cse0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (= (+ (+ (* (- 1) main_~b~0) (* .cse0 (- 1))) (+ (* main_~y~0 .cse1) (* main_~x~0 .cse2))) .cse0)) (= 1 (+ (* (+ main_~r~0 main_~s~0) .cse2) (- (* .cse1 (+ main_~p~0 main_~q~0)))))))) (<= 1 main_~x~0) (= main_~a~0 (+ (+ (* main_~y~0 .cse3) (* main_~x~0 .cse4)) (* (- 1) main_~b~0))) (= main_~b~0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (= 1 (+ (- (* main_~q~0 .cse3)) (* main_~s~0 .cse4))))) [2019-09-05 12:26:11,972 INFO L439 ceAbstractionStarter]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 (= main_~s~0 1)) (.cse1 (<= 1 main_~x~0))) (or (and .cse0 (= main_~b~0 main_~y~0) .cse1 (= main_~q~0 0)) (and .cse0 (= main_~b~0 main_~a~0) (= (+ main_~q~0 1) 0) .cse1 (= main_~y~0 (+ main_~x~0 main_~b~0))) (let ((.cse5 (+ main_~r~0 main_~s~0)) (.cse6 (+ main_~p~0 main_~q~0))) (and (exists ((main_~p~0 Int) (main_~r~0 Int)) (let ((.cse4 (+ (* 2 main_~p~0) main_~q~0)) (.cse3 (+ (* 2 main_~r~0) main_~s~0))) (and (let ((.cse2 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (= (+ (+ (* (- 1) main_~b~0) (* .cse2 (- 1))) (+ (* main_~y~0 .cse3) (* main_~x~0 .cse4))) .cse2)) (= 1 (+ (* (+ main_~r~0 main_~s~0) .cse4) (- (* .cse3 (+ main_~p~0 main_~q~0)))))))) .cse1 (= main_~a~0 (+ (+ (* main_~y~0 .cse5) (* main_~x~0 .cse6)) (* (- 1) main_~b~0))) (= main_~b~0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (= 1 (+ (- (* main_~q~0 .cse5)) (* main_~s~0 .cse6))))))) [2019-09-05 12:26:11,972 INFO L439 ceAbstractionStarter]: At program point L47(line 47) the Hoare annotation is: (let ((.cse3 (+ main_~r~0 main_~s~0)) (.cse4 (+ main_~p~0 main_~q~0))) (and (exists ((main_~p~0 Int) (main_~r~0 Int)) (let ((.cse2 (+ (* 2 main_~p~0) main_~q~0)) (.cse1 (+ (* 2 main_~r~0) main_~s~0))) (and (let ((.cse0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (= (+ (+ (* (- 1) main_~b~0) (* .cse0 (- 1))) (+ (* main_~y~0 .cse1) (* main_~x~0 .cse2))) .cse0)) (= 1 (+ (* (+ main_~r~0 main_~s~0) .cse2) (- (* .cse1 (+ main_~p~0 main_~q~0)))))))) (<= 1 main_~x~0) (= main_~a~0 (+ (+ (* main_~y~0 .cse3) (* main_~x~0 .cse4)) (* (- 1) main_~b~0))) (= main_~b~0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (= 1 (+ (- (* main_~q~0 .cse3)) (* main_~s~0 .cse4))))) [2019-09-05 12:26:11,972 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 5 11) the Hoare annotation is: true [2019-09-05 12:26:11,972 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 5 11) no Hoare annotation was computed. [2019-09-05 12:26:11,972 INFO L443 ceAbstractionStarter]: For program point L7(lines 7 8) no Hoare annotation was computed. [2019-09-05 12:26:11,972 INFO L443 ceAbstractionStarter]: For program point L6(lines 6 9) no Hoare annotation was computed. [2019-09-05 12:26:11,973 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2019-09-05 12:26:11,973 INFO L443 ceAbstractionStarter]: For program point L6-2(lines 5 11) no Hoare annotation was computed. [2019-09-05 12:26:11,979 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-05 12:26:11,980 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-05 12:26:11,980 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-05 12:26:11,981 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-05 12:26:11,981 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-05 12:26:11,981 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-05 12:26:11,981 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-05 12:26:11,982 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-05 12:26:11,982 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-05 12:26:11,982 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-05 12:26:11,989 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-05 12:26:11,989 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-05 12:26:11,990 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-05 12:26:11,990 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-05 12:26:11,990 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-05 12:26:11,990 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-05 12:26:11,990 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-05 12:26:11,991 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-05 12:26:11,991 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-05 12:26:11,991 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-05 12:26:11,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.09 12:26:11 BoogieIcfgContainer [2019-09-05 12:26:11,994 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-05 12:26:11,995 INFO L168 Benchmark]: Toolchain (without parser) took 55184.50 ms. Allocated memory was 132.6 MB in the beginning and 304.6 MB in the end (delta: 172.0 MB). Free memory was 88.5 MB in the beginning and 168.8 MB in the end (delta: -80.2 MB). Peak memory consumption was 91.7 MB. Max. memory is 7.1 GB. [2019-09-05 12:26:11,996 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 132.6 MB. Free memory was 107.0 MB in the beginning and 106.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-05 12:26:11,997 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.61 ms. Allocated memory is still 132.6 MB. Free memory was 88.3 MB in the beginning and 78.5 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-09-05 12:26:11,998 INFO L168 Benchmark]: Boogie Preprocessor took 115.70 ms. Allocated memory was 132.6 MB in the beginning and 199.2 MB in the end (delta: 66.6 MB). Free memory was 78.5 MB in the beginning and 175.1 MB in the end (delta: -96.6 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2019-09-05 12:26:11,998 INFO L168 Benchmark]: RCFGBuilder took 239.19 ms. Allocated memory is still 199.2 MB. Free memory was 175.1 MB in the beginning and 162.5 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. [2019-09-05 12:26:11,999 INFO L168 Benchmark]: TraceAbstraction took 54559.97 ms. Allocated memory was 199.2 MB in the beginning and 304.6 MB in the end (delta: 105.4 MB). Free memory was 162.5 MB in the beginning and 168.8 MB in the end (delta: -6.3 MB). Peak memory consumption was 99.1 MB. Max. memory is 7.1 GB. [2019-09-05 12:26:12,003 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 132.6 MB. Free memory was 107.0 MB in the beginning and 106.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 265.61 ms. Allocated memory is still 132.6 MB. Free memory was 88.3 MB in the beginning and 78.5 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 115.70 ms. Allocated memory was 132.6 MB in the beginning and 199.2 MB in the end (delta: 66.6 MB). Free memory was 78.5 MB in the beginning and 175.1 MB in the end (delta: -96.6 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 239.19 ms. Allocated memory is still 199.2 MB. Free memory was 175.1 MB in the beginning and 162.5 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 54559.97 ms. Allocated memory was 199.2 MB in the beginning and 304.6 MB in the end (delta: 105.4 MB). Free memory was 162.5 MB in the beginning and 168.8 MB in the end (delta: -6.3 MB). Peak memory consumption was 99.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] * 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: 28]: Loop Invariant [2019-09-05 12:26:12,011 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-05 12:26:12,011 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-05 12:26:12,012 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-05 12:26:12,012 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-05 12:26:12,012 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-05 12:26:12,012 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-05 12:26:12,012 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-05 12:26:12,013 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-05 12:26:12,013 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-05 12:26:12,013 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-05 12:26:12,014 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-05 12:26:12,014 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-05 12:26:12,014 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-05 12:26:12,014 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-05 12:26:12,014 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-05 12:26:12,014 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-05 12:26:12,015 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-05 12:26:12,015 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-05 12:26:12,015 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-05 12:26:12,015 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] Derived loop invariant: (((\exists main_~p~0 : int, main_~r~0 : int :: -1 * b + (main_~p~0 * x + y * main_~r~0) * -1 + (y * (2 * main_~r~0 + s) + x * (2 * main_~p~0 + q)) == main_~p~0 * x + y * main_~r~0 && 1 == (main_~r~0 + s) * (2 * main_~p~0 + q) + -((2 * main_~r~0 + s) * (main_~p~0 + q))) && a == y * (r + s) + x * (p + q) + -1 * b) && 1 <= x) && 1 == -(q * (r + s)) + s * (p + q) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. SAFE Result, 54.4s OverallTime, 15 OverallIterations, 9 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 45.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 478 SDtfs, 119 SDslu, 1484 SDs, 0 SdLazy, 948 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 508 GetRequests, 425 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 36 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 82 PreInvPairs, 158 NumberOfFragments, 917 HoareAnnotationTreeSize, 82 FomulaSimplifications, 9106 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 13 FomulaSimplificationsInter, 461 FormulaSimplificationTreeSizeReductionInter, 45.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 510 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 495 ConstructedInterpolants, 4 QuantifiedInterpolants, 126896 SizeOfPredicates, 53 NumberOfNonLiveVariables, 1211 ConjunctsInSsa, 282 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 692/798 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...